[{"data":1,"prerenderedAt":9759},["ShallowReactive",2],{"lesson:\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":3,"course-wordcounts":3979,"ref-card-index":4891,"nav:reinforcement-learning":9574,"tikz:f016226a828f47752b7828ed616e2cf0f4c98fff647a15bc0fdf3e34a49eaa27":9755,"tikz:3a7d1a746fc9956d67f957fcdd9f166c83479e940da91de8dc849661f36f91dc":9756,"tikz:e9b66689b13e54647b5d8176ec377b57623645da68739c96321b89e55ecfe47c":9757,"tikz:f2491c716a034c8086b0670852bb9d4296527e5abd86ff9fda664c00f94c5548":9758},{"id":4,"title":5,"blurb":6,"body":7,"brief":3946,"category":3947,"description":3948,"draft":3949,"extension":3950,"meta":3951,"module":3955,"navigation":3956,"path":3957,"practice":3958,"rawbody":3959,"readingTime":3960,"seo":3965,"sources":3966,"status":3973,"stem":3974,"summary":3975,"topics":3976,"__hash__":3978},"course\u002F07.reinforcement-learning\u002F05.modern-deep-rl\u002F12.imitation-and-inverse-rl-part-2.md","Imitation as Adversarial Matching: GAIL and AIRL","",{"type":8,"value":9,"toc":3938},"minimark",[10,89,92,97,109,614,618,941,1128,1857,2310,2313,2321,2325,2366,2402,2408,3148,3420,3423,3427,3430,3576,3579,3583,3586,3610,3685,3688,3706,3709],[11,12,13,14,19,20,88],"p",{},"This builds on\n",[15,16,18],"a",{"href":17},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl","Imitation Learning: Cloning, DAgger, and Inverse RL",",\nwhich built behavioral cloning (and its ",[21,22,25],"span",{"className":23},[24],"katex",[21,26,30],{"className":27,"ariaHidden":29},[28],"katex-html","true",[21,31,34,39,84],{"className":32},[33],"base",[21,35],{"className":36,"style":38},[37],"strut","height:0.8141em;",[21,40,43,49],{"className":41},[42],"mord",[21,44,48],{"className":45,"style":47},[42,46],"mathnormal","margin-right:0.1389em;","T",[21,50,53],{"className":51},[52],"msupsub",[21,54,57],{"className":55},[56],"vlist-t",[21,58,61],{"className":59},[60],"vlist-r",[21,62,65],{"className":63,"style":38},[64],"vlist",[21,66,68,73],{"style":67},"top:-3.063em;margin-right:0.05em;",[21,69],{"className":70,"style":72},[71],"pstrut","height:2.7em;",[21,74,80],{"className":75},[76,77,78,79],"sizing","reset-size6","size3","mtight",[21,81,83],{"className":82},[42,79],"2",[21,85,87],{"className":86},[42,46],"ϵ"," compounding error), DAgger (which\nqueries an interactive expert on the learner's own states), and inverse RL (which\nrecovers the reward the expert optimizes, resolving the ill-posedness with the\nmaximum-entropy principle at the cost of a forward-RL solve in the inner loop).",[11,90,91],{},"That inner solve is the opening this lesson exploits. If recovering a reward only ever\nserves to re-run RL and reproduce the expert, the reward can be dissolved entirely —\nmatch the behavior directly, as an adversarial game — and then, if a portable reward is\nstill wanted, read one back out of that game.",[93,94,96],"h2",{"id":95},"gail-imitation-as-a-gan","GAIL: imitation as a GAN",[11,98,99,100,104,105,108],{},"Maximum-entropy IRL suggests a suspicion that Ho and Ermon made precise: if the\nwhole point of recovering a reward is to run RL and reproduce the expert's behavior,\nmaybe you can ",[101,102,103],"strong",{},"skip the reward"," and match the behavior directly. Their reframing\nstarts from the object that actually characterizes a policy's long-run behavior, the\n",[101,106,107],{},"occupancy measure",".",[110,111,113],"callout",{"type":112},"definition",[11,114,115,118,119,137,138,462,463,108],{},[101,116,117],{},"Definition (Occupancy measure)."," For a policy ",[21,120,122],{"className":121},[24],[21,123,125],{"className":124,"ariaHidden":29},[28],[21,126,128,132],{"className":127},[33],[21,129],{"className":130,"style":131},[37],"height:0.4306em;",[21,133,136],{"className":134,"style":135},[42,46],"margin-right:0.0359em;","π",", the discounted\ndistribution of state-action pairs it visits,\n",[21,139,141],{"className":140},[24],[21,142,144,237,262,432,450],{"className":143,"ariaHidden":29},[28],[21,145,147,151,198,203,207,212,217,220,225,229,234],{"className":146},[33],[21,148],{"className":149,"style":150},[37],"height:1em;vertical-align:-0.25em;",[21,152,154,158],{"className":153},[42],[21,155,157],{"className":156},[42,46],"ρ",[21,159,161],{"className":160},[52],[21,162,165,189],{"className":163},[56,164],"vlist-t2",[21,166,168,184],{"className":167},[60],[21,169,172],{"className":170,"style":171},[64],"height:0.1514em;",[21,173,175,178],{"style":174},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[21,176],{"className":177,"style":72},[71],[21,179,181],{"className":180},[76,77,78,79],[21,182,136],{"className":183,"style":135},[42,46,79],[21,185,188],{"className":186},[187],"vlist-s","​",[21,190,192],{"className":191},[60],[21,193,196],{"className":194,"style":195},[64],"height:0.15em;",[21,197],{},[21,199,202],{"className":200},[201],"mopen","(",[21,204,206],{"className":205},[42,46],"s",[21,208,211],{"className":209},[210],"mpunct",",",[21,213],{"className":214,"style":216},[215],"mspace","margin-right:0.1667em;",[21,218,15],{"className":219},[42,46],[21,221,224],{"className":222},[223],"mclose",")",[21,226],{"className":227,"style":228},[215],"margin-right:0.2778em;",[21,230,233],{"className":231},[232],"mrel","=",[21,235],{"className":236,"style":228},[215],[21,238,240,243,246,249,252,255,259],{"className":239},[33],[21,241],{"className":242,"style":150},[37],[21,244,136],{"className":245,"style":135},[42,46],[21,247,202],{"className":248},[201],[21,250,15],{"className":251},[42,46],[21,253],{"className":254,"style":228},[215],[21,256,258],{"className":257},[232],"∣",[21,260],{"className":261,"style":228},[215],[21,263,265,269,272,275,278,330,333,365,368,371,379,382,423,426,429],{"className":264},[33],[21,266],{"className":267,"style":268},[37],"height:1.0933em;vertical-align:-0.2997em;",[21,270,206],{"className":271},[42,46],[21,273,224],{"className":274},[223],[21,276],{"className":277,"style":216},[215],[21,279,282,289],{"className":280},[281],"mop",[21,283,288],{"className":284,"style":287},[281,285,286],"op-symbol","small-op","position:relative;top:0em;","∑",[21,290,292],{"className":291},[52],[21,293,295,321],{"className":294},[56,164],[21,296,298,318],{"className":297},[60],[21,299,302],{"className":300,"style":301},[64],"height:0.1308em;",[21,303,305,308],{"style":304},"top:-2.4003em;margin-left:0em;margin-right:0.05em;",[21,306],{"className":307,"style":72},[71],[21,309,311],{"className":310},[76,77,78,79],[21,312,314],{"className":313},[42,79],[21,315,317],{"className":316},[42,46,79],"t",[21,319,188],{"className":320},[187],[21,322,324],{"className":323},[60],[21,325,328],{"className":326,"style":327},[64],"height:0.2997em;",[21,329],{},[21,331],{"className":332,"style":216},[215],[21,334,336,341],{"className":335},[42],[21,337,340],{"className":338,"style":339},[42,46],"margin-right:0.0556em;","γ",[21,342,344],{"className":343},[52],[21,345,347],{"className":346},[56],[21,348,350],{"className":349},[60],[21,351,354],{"className":352,"style":353},[64],"height:0.7936em;",[21,355,356,359],{"style":67},[21,357],{"className":358,"style":72},[71],[21,360,362],{"className":361},[76,77,78,79],[21,363,317],{"className":364},[42,46,79],[21,366],{"className":367,"style":216},[215],[21,369],{"className":370,"style":216},[215],[21,372,374],{"className":373},[281],[21,375,378],{"className":376},[42,377],"mathrm","Pr",[21,380,202],{"className":381},[201],[21,383,385,388],{"className":384},[42],[21,386,206],{"className":387},[42,46],[21,389,391],{"className":390},[52],[21,392,394,415],{"className":393},[56,164],[21,395,397,412],{"className":396},[60],[21,398,401],{"className":399,"style":400},[64],"height:0.2806em;",[21,402,403,406],{"style":174},[21,404],{"className":405,"style":72},[71],[21,407,409],{"className":408},[76,77,78,79],[21,410,317],{"className":411},[42,46,79],[21,413,188],{"className":414},[187],[21,416,418],{"className":417},[60],[21,419,421],{"className":420,"style":195},[64],[21,422],{},[21,424],{"className":425,"style":228},[215],[21,427,233],{"className":428},[232],[21,430],{"className":431,"style":228},[215],[21,433,435,438,441,444,447],{"className":434},[33],[21,436],{"className":437,"style":150},[37],[21,439,206],{"className":440},[42,46],[21,442],{"className":443,"style":228},[215],[21,445,258],{"className":446},[232],[21,448],{"className":449,"style":228},[215],[21,451,453,456,459],{"className":452},[33],[21,454],{"className":455,"style":150},[37],[21,457,136],{"className":458,"style":135},[42,46],[21,460,224],{"className":461},[223],". Two\npolicies are identical if and only if their occupancy measures are identical, so\nmatching occupancy measures amounts to imitation. Expected reward is linear in\nthe occupancy measure, ",[21,464,466],{"className":465},[24],[21,467,469],{"className":468,"ariaHidden":29},[28],[21,470,472,476,527,530,570,573,576,579,582,585,588,591,596,599,602,605,608,611],{"className":471},[33],[21,473],{"className":474,"style":475},[37],"height:1.1858em;vertical-align:-0.4358em;",[21,477,479,482],{"className":478},[281],[21,480,288],{"className":481,"style":287},[281,285,286],[21,483,485],{"className":484},[52],[21,486,488,518],{"className":487},[56,164],[21,489,491,515],{"className":490},[60],[21,492,495],{"className":493,"style":494},[64],"height:0.0017em;",[21,496,497,500],{"style":304},[21,498],{"className":499,"style":72},[71],[21,501,503],{"className":502},[76,77,78,79],[21,504,506,509,512],{"className":505},[42,79],[21,507,206],{"className":508},[42,46,79],[21,510,211],{"className":511},[210,79],[21,513,15],{"className":514},[42,46,79],[21,516,188],{"className":517},[187],[21,519,521],{"className":520},[60],[21,522,525],{"className":523,"style":524},[64],"height:0.4358em;",[21,526],{},[21,528],{"className":529,"style":216},[215],[21,531,533,536],{"className":532},[42],[21,534,157],{"className":535},[42,46],[21,537,539],{"className":538},[52],[21,540,542,562],{"className":541},[56,164],[21,543,545,559],{"className":544},[60],[21,546,548],{"className":547,"style":171},[64],[21,549,550,553],{"style":174},[21,551],{"className":552,"style":72},[71],[21,554,556],{"className":555},[76,77,78,79],[21,557,136],{"className":558,"style":135},[42,46,79],[21,560,188],{"className":561},[187],[21,563,565],{"className":564},[60],[21,566,568],{"className":567,"style":195},[64],[21,569],{},[21,571,202],{"className":572},[201],[21,574,206],{"className":575},[42,46],[21,577,211],{"className":578},[210],[21,580],{"className":581,"style":216},[215],[21,583,15],{"className":584},[42,46],[21,586,224],{"className":587},[223],[21,589],{"className":590,"style":216},[215],[21,592,595],{"className":593,"style":594},[42,46],"margin-right:0.0278em;","r",[21,597,202],{"className":598},[201],[21,600,206],{"className":601},[42,46],[21,603,211],{"className":604},[210],[21,606],{"className":607,"style":216},[215],[21,609,15],{"className":610},[42,46],[21,612,224],{"className":613},[223],[615,616],"tikz-figure",{"hash":617},"f016226a828f47752b7828ed616e2cf0f4c98fff647a15bc0fdf3e34a49eaa27",[11,619,620,621,674,675,777,778,926,927,930,931],{},"Ho and Ermon show that running RL on the reward IRL recovers is\nequivalent to finding a policy whose occupancy measure ",[21,622,624],{"className":623},[24],[21,625,627],{"className":626,"ariaHidden":29},[28],[21,628,630,634],{"className":629},[33],[21,631],{"className":632,"style":633},[37],"height:0.625em;vertical-align:-0.1944em;",[21,635,637,640],{"className":636},[42],[21,638,157],{"className":639},[42,46],[21,641,643],{"className":642},[52],[21,644,646,666],{"className":645},[56,164],[21,647,649,663],{"className":648},[60],[21,650,652],{"className":651,"style":171},[64],[21,653,654,657],{"style":174},[21,655],{"className":656,"style":72},[71],[21,658,660],{"className":659},[76,77,78,79],[21,661,136],{"className":662,"style":135},[42,46,79],[21,664,188],{"className":665},[187],[21,667,669],{"className":668},[60],[21,670,672],{"className":671,"style":195},[64],[21,673],{}," is close\nto the expert's ",[21,676,678],{"className":677},[24],[21,679,681],{"className":680,"ariaHidden":29},[28],[21,682,684,688],{"className":683},[33],[21,685],{"className":686,"style":687},[37],"height:0.6809em;vertical-align:-0.2503em;",[21,689,691,694],{"className":690},[42],[21,692,157],{"className":693},[42,46],[21,695,697],{"className":696},[52],[21,698,700,768],{"className":699},[56,164],[21,701,703,765],{"className":702},[60],[21,704,706],{"className":705,"style":171},[64],[21,707,708,711],{"style":174},[21,709],{"className":710,"style":72},[71],[21,712,714],{"className":713},[76,77,78,79],[21,715,717],{"className":716},[42,79],[21,718,720,723],{"className":719},[42,79],[21,721,136],{"className":722,"style":135},[42,46,79],[21,724,726],{"className":725},[52],[21,727,729,756],{"className":728},[56,164],[21,730,732,753],{"className":731},[60],[21,733,736],{"className":734,"style":735},[64],"height:0.3448em;",[21,737,739,743],{"style":738},"top:-2.3567em;margin-left:-0.0359em;margin-right:0.0714em;",[21,740],{"className":741,"style":742},[71],"height:2.5em;",[21,744,748],{"className":745},[76,746,747,79],"reset-size3","size1",[21,749,752],{"className":750,"style":751},[42,46,79],"margin-right:0.0576em;","E",[21,754,188],{"className":755},[187],[21,757,759],{"className":758},[60],[21,760,763],{"className":761,"style":762},[64],"height:0.1433em;",[21,764],{},[21,766,188],{"className":767},[187],[21,769,771],{"className":770},[60],[21,772,775],{"className":773,"style":774},[64],"height:0.2503em;",[21,776],{}," under a particular divergence. The reward is an\nintermediary that can be dissolved: ",[101,779,780,781,833,834],{},"directly minimize a divergence between\n",[21,782,784],{"className":783},[24],[21,785,787],{"className":786,"ariaHidden":29},[28],[21,788,790,793],{"className":789},[33],[21,791],{"className":792,"style":633},[37],[21,794,796,799],{"className":795},[42],[21,797,157],{"className":798},[42,46],[21,800,802],{"className":801},[52],[21,803,805,825],{"className":804},[56,164],[21,806,808,822],{"className":807},[60],[21,809,811],{"className":810,"style":171},[64],[21,812,813,816],{"style":174},[21,814],{"className":815,"style":72},[71],[21,817,819],{"className":818},[76,77,78,79],[21,820,136],{"className":821,"style":135},[42,46,79],[21,823,188],{"className":824},[187],[21,826,828],{"className":827},[60],[21,829,831],{"className":830,"style":195},[64],[21,832],{}," and ",[21,835,837],{"className":836},[24],[21,838,840],{"className":839,"ariaHidden":29},[28],[21,841,843,846],{"className":842},[33],[21,844],{"className":845,"style":687},[37],[21,847,849,852],{"className":848},[42],[21,850,157],{"className":851},[42,46],[21,853,855],{"className":854},[52],[21,856,858,918],{"className":857},[56,164],[21,859,861,915],{"className":860},[60],[21,862,864],{"className":863,"style":171},[64],[21,865,866,869],{"style":174},[21,867],{"className":868,"style":72},[71],[21,870,872],{"className":871},[76,77,78,79],[21,873,875],{"className":874},[42,79],[21,876,878,881],{"className":877},[42,79],[21,879,136],{"className":880,"style":135},[42,46,79],[21,882,884],{"className":883},[52],[21,885,887,907],{"className":886},[56,164],[21,888,890,904],{"className":889},[60],[21,891,893],{"className":892,"style":735},[64],[21,894,895,898],{"style":738},[21,896],{"className":897,"style":742},[71],[21,899,901],{"className":900},[76,746,747,79],[21,902,752],{"className":903,"style":751},[42,46,79],[21,905,188],{"className":906},[187],[21,908,910],{"className":909},[60],[21,911,913],{"className":912,"style":762},[64],[21,914],{},[21,916,188],{"className":917},[187],[21,919,921],{"className":920},[60],[21,922,924],{"className":923,"style":774},[64],[21,925],{}," and you imitate without ever naming a reward. And\nwhen the divergence is the Jensen-Shannon divergence, minimizing it becomes the\nobjective a ",[101,928,929],{},"generative adversarial network"," optimizes.",[932,933,934],"sup",{},[15,935,940],{"href":936,"ariaDescribedBy":937,"dataFootnoteRef":6,"id":939},"#user-content-fn-gail",[938],"footnote-label","user-content-fnref-gail","1",[11,942,943,944,947,948,951,1062,1063,1066,1067,1122,1123,1127],{},"This yields ",[101,945,946],{},"Generative Adversarial Imitation Learning"," (GAIL). A ",[101,949,950],{},"discriminator",[21,952,954],{"className":953},[24],[21,955,957,1037],{"className":956,"ariaHidden":29},[28],[21,958,960,964,1009,1012,1015,1018,1021,1024,1027,1030,1034],{"className":959},[33],[21,961],{"className":962,"style":963},[37],"height:1.0361em;vertical-align:-0.2861em;",[21,965,967,971],{"className":966},[42],[21,968,970],{"className":969,"style":594},[42,46],"D",[21,972,974],{"className":973},[52],[21,975,977,1000],{"className":976},[56,164],[21,978,980,997],{"className":979},[60],[21,981,984],{"className":982,"style":983},[64],"height:0.3361em;",[21,985,987,990],{"style":986},"top:-2.55em;margin-left:-0.0278em;margin-right:0.05em;",[21,988],{"className":989,"style":72},[71],[21,991,993],{"className":992},[76,77,78,79],[21,994,996],{"className":995,"style":135},[42,46,79],"ψ",[21,998,188],{"className":999},[187],[21,1001,1003],{"className":1002},[60],[21,1004,1007],{"className":1005,"style":1006},[64],"height:0.2861em;",[21,1008],{},[21,1010,202],{"className":1011},[201],[21,1013,206],{"className":1014},[42,46],[21,1016,211],{"className":1017},[210],[21,1019],{"className":1020,"style":216},[215],[21,1022,15],{"className":1023},[42,46],[21,1025,224],{"className":1026},[223],[21,1028],{"className":1029,"style":228},[215],[21,1031,1033],{"className":1032},[232],"→",[21,1035],{"className":1036,"style":228},[215],[21,1038,1040,1043,1046,1050,1053,1056,1059],{"className":1039},[33],[21,1041],{"className":1042,"style":150},[37],[21,1044,202],{"className":1045},[201],[21,1047,1049],{"className":1048},[42],"0",[21,1051,211],{"className":1052},[210],[21,1054],{"className":1055,"style":216},[215],[21,1057,940],{"className":1058},[42],[21,1060,224],{"className":1061},[223]," is trained to tell expert state-action pairs from the\nlearner's, outputting the probability that a pair came from the expert. The\n",[101,1064,1065],{},"policy"," ",[21,1068,1070],{"className":1069},[24],[21,1071,1073],{"className":1072,"ariaHidden":29},[28],[21,1074,1076,1080],{"className":1075},[33],[21,1077],{"className":1078,"style":1079},[37],"height:0.5806em;vertical-align:-0.15em;",[21,1081,1083,1086],{"className":1082},[42],[21,1084,136],{"className":1085,"style":135},[42,46],[21,1087,1089],{"className":1088},[52],[21,1090,1092,1114],{"className":1091},[56,164],[21,1093,1095,1111],{"className":1094},[60],[21,1096,1098],{"className":1097,"style":983},[64],[21,1099,1101,1104],{"style":1100},"top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;",[21,1102],{"className":1103,"style":72},[71],[21,1105,1107],{"className":1106},[76,77,78,79],[21,1108,1110],{"className":1109,"style":594},[42,46,79],"θ",[21,1112,188],{"className":1113},[187],[21,1115,1117],{"className":1116},[60],[21,1118,1120],{"className":1119,"style":195},[64],[21,1121],{}," plays the role of the GAN's generator: it is trained to\nproduce state-action pairs the discriminator ",[1124,1125,1126],"em",{},"cannot"," distinguish from the expert's.\nThe two optimize the adversarial objective",[21,1129,1132],{"className":1130},[1131],"katex-display",[21,1133,1135],{"className":1134},[24],[21,1136,1138,1518,1698,1790],{"className":1137,"ariaHidden":29},[28],[21,1139,1141,1145,1202,1206,1209,1261,1264,1267,1412,1416,1424,1432,1435,1475,1478,1481,1484,1487,1490,1493,1500,1503,1507,1512,1515],{"className":1140},[33],[21,1142],{"className":1143,"style":1144},[37],"height:1.7382em;vertical-align:-0.8882em;",[21,1146,1149],{"className":1147},[281,1148],"op-limits",[21,1150,1152,1193],{"className":1151},[56,164],[21,1153,1155,1190],{"className":1154},[60],[21,1156,1159,1175],{"className":1157,"style":1158},[64],"height:0.6679em;",[21,1160,1162,1166],{"style":1161},"top:-2.3479em;margin-left:0em;",[21,1163],{"className":1164,"style":1165},[71],"height:3em;",[21,1167,1169],{"className":1168},[76,77,78,79],[21,1170,1172],{"className":1171},[42,79],[21,1173,1110],{"className":1174,"style":594},[42,46,79],[21,1176,1178,1181],{"style":1177},"top:-3em;",[21,1179],{"className":1180,"style":1165},[71],[21,1182,1183],{},[21,1184,1186],{"className":1185},[281],[21,1187,1189],{"className":1188},[42,377],"min",[21,1191,188],{"className":1192},[187],[21,1194,1196],{"className":1195},[60],[21,1197,1200],{"className":1198,"style":1199},[64],"height:0.7521em;",[21,1201],{},[21,1203,1205],{"className":1204},[215]," ",[21,1207],{"className":1208,"style":216},[215],[21,1210,1212],{"className":1211},[281,1148],[21,1213,1215,1252],{"className":1214},[56,164],[21,1216,1218,1249],{"className":1217},[60],[21,1219,1221,1235],{"className":1220,"style":131},[64],[21,1222,1223,1226],{"style":1161},[21,1224],{"className":1225,"style":1165},[71],[21,1227,1229],{"className":1228},[76,77,78,79],[21,1230,1232],{"className":1231},[42,79],[21,1233,996],{"className":1234,"style":135},[42,46,79],[21,1236,1237,1240],{"style":1177},[21,1238],{"className":1239,"style":1165},[71],[21,1241,1242],{},[21,1243,1245],{"className":1244},[281],[21,1246,1248],{"className":1247},[42,377],"max",[21,1250,188],{"className":1251},[187],[21,1253,1255],{"className":1254},[60],[21,1256,1259],{"className":1257,"style":1258},[64],"height:0.8882em;",[21,1260],{},[21,1262],{"className":1263,"style":228},[215],[21,1265],{"className":1266,"style":216},[215],[21,1268,1270,1274],{"className":1269},[42],[21,1271,752],{"className":1272},[42,1273],"mathbb",[21,1275,1277],{"className":1276},[52],[21,1278,1280,1403],{"className":1279},[56,164],[21,1281,1283,1400],{"className":1282},[60],[21,1284,1286],{"className":1285,"style":735},[64],[21,1287,1289,1292],{"style":1288},"top:-2.5198em;margin-left:0em;margin-right:0.05em;",[21,1290],{"className":1291,"style":72},[71],[21,1293,1295],{"className":1294},[76,77,78,79],[21,1296,1298,1301,1304,1307,1310,1313,1317],{"className":1297},[42,79],[21,1299,202],{"className":1300},[201,79],[21,1302,206],{"className":1303},[42,46,79],[21,1305,211],{"className":1306},[210,79],[21,1308,15],{"className":1309},[42,46,79],[21,1311,224],{"className":1312},[223,79],[21,1314,1316],{"className":1315},[232,79],"∼",[21,1318,1320,1323],{"className":1319},[42,79],[21,1321,157],{"className":1322},[42,46,79],[21,1324,1326],{"className":1325},[52],[21,1327,1329,1391],{"className":1328},[56,164],[21,1330,1332,1388],{"className":1331},[60],[21,1333,1336],{"className":1334,"style":1335},[64],"height:0.1645em;",[21,1337,1339,1342],{"style":1338},"top:-2.357em;margin-left:0em;margin-right:0.0714em;",[21,1340],{"className":1341,"style":742},[71],[21,1343,1345],{"className":1344},[76,746,747,79],[21,1346,1348],{"className":1347},[42,79],[21,1349,1351,1354],{"className":1350},[42,79],[21,1352,136],{"className":1353,"style":135},[42,46,79],[21,1355,1357],{"className":1356},[52],[21,1358,1360,1379],{"className":1359},[56,164],[21,1361,1363,1376],{"className":1362},[60],[21,1364,1366],{"className":1365,"style":735},[64],[21,1367,1369,1373],{"style":1368},"top:-2.3448em;margin-left:-0.0359em;margin-right:0.1em;",[21,1370],{"className":1371,"style":1372},[71],"height:2.6833em;",[21,1374,752],{"className":1375,"style":751},[42,46,79],[21,1377,188],{"className":1378},[187],[21,1380,1382],{"className":1381},[60],[21,1383,1386],{"className":1384,"style":1385},[64],"height:0.3385em;",[21,1387],{},[21,1389,188],{"className":1390},[187],[21,1392,1394],{"className":1393},[60],[21,1395,1398],{"className":1396,"style":1397},[64],"height:0.3848em;",[21,1399],{},[21,1401,188],{"className":1402},[187],[21,1404,1406],{"className":1405},[60],[21,1407,1410],{"className":1408,"style":1409},[64],"height:0.4496em;",[21,1411],{},[21,1413],{"className":1414,"style":1415},[215],"margin-right:-0.1667em;",[21,1417,1419],{"className":1418},[201],[21,1420,1423],{"className":1421},[1422,747],"delimsizing","[",[21,1425,1427],{"className":1426},[281],[21,1428,1431],{"className":1429,"style":1430},[42,377],"margin-right:0.0139em;","log",[21,1433],{"className":1434,"style":216},[215],[21,1436,1438,1441],{"className":1437},[42],[21,1439,970],{"className":1440,"style":594},[42,46],[21,1442,1444],{"className":1443},[52],[21,1445,1447,1467],{"className":1446},[56,164],[21,1448,1450,1464],{"className":1449},[60],[21,1451,1453],{"className":1452,"style":983},[64],[21,1454,1455,1458],{"style":986},[21,1456],{"className":1457,"style":72},[71],[21,1459,1461],{"className":1460},[76,77,78,79],[21,1462,996],{"className":1463,"style":135},[42,46,79],[21,1465,188],{"className":1466},[187],[21,1468,1470],{"className":1469},[60],[21,1471,1473],{"className":1472,"style":1006},[64],[21,1474],{},[21,1476,202],{"className":1477},[201],[21,1479,206],{"className":1480},[42,46],[21,1482,211],{"className":1483},[210],[21,1485],{"className":1486,"style":216},[215],[21,1488,15],{"className":1489},[42,46],[21,1491,224],{"className":1492},[223],[21,1494,1496],{"className":1495},[223],[21,1497,1499],{"className":1498},[1422,747],"]",[21,1501],{"className":1502,"style":228},[215],[21,1504],{"className":1505,"style":1506},[215],"margin-right:0.2222em;",[21,1508,1511],{"className":1509},[1510],"mbin","+",[21,1513],{"className":1514,"style":228},[215],[21,1516],{"className":1517,"style":1506},[215],[21,1519,1521,1525,1664,1667,1673,1679,1685,1688,1691,1695],{"className":1520},[33],[21,1522],{"className":1523,"style":1524},[37],"height:1.3051em;vertical-align:-0.4551em;",[21,1526,1528,1531],{"className":1527},[42],[21,1529,752],{"className":1530},[42,1273],[21,1532,1534],{"className":1533},[52],[21,1535,1537,1655],{"className":1536},[56,164],[21,1538,1540,1652],{"className":1539},[60],[21,1541,1543],{"className":1542,"style":735},[64],[21,1544,1545,1548],{"style":1288},[21,1546],{"className":1547,"style":72},[71],[21,1549,1551],{"className":1550},[76,77,78,79],[21,1552,1554,1557,1560,1563,1566,1569,1572],{"className":1553},[42,79],[21,1555,202],{"className":1556},[201,79],[21,1558,206],{"className":1559},[42,46,79],[21,1561,211],{"className":1562},[210,79],[21,1564,15],{"className":1565},[42,46,79],[21,1567,224],{"className":1568},[223,79],[21,1570,1316],{"className":1571},[232,79],[21,1573,1575,1578],{"className":1574},[42,79],[21,1576,157],{"className":1577},[42,46,79],[21,1579,1581],{"className":1580},[52],[21,1582,1584,1643],{"className":1583},[56,164],[21,1585,1587,1640],{"className":1586},[60],[21,1588,1590],{"className":1589,"style":1335},[64],[21,1591,1592,1595],{"style":1338},[21,1593],{"className":1594,"style":742},[71],[21,1596,1598],{"className":1597},[76,746,747,79],[21,1599,1601],{"className":1600},[42,79],[21,1602,1604,1607],{"className":1603},[42,79],[21,1605,136],{"className":1606,"style":135},[42,46,79],[21,1608,1610],{"className":1609},[52],[21,1611,1613,1631],{"className":1612},[56,164],[21,1614,1616,1628],{"className":1615},[60],[21,1617,1619],{"className":1618,"style":735},[64],[21,1620,1621,1625],{"style":1368},[21,1622],{"className":1623,"style":1624},[71],"height:2.6944em;",[21,1626,1110],{"className":1627,"style":594},[42,46,79],[21,1629,188],{"className":1630},[187],[21,1632,1634],{"className":1633},[60],[21,1635,1638],{"className":1636,"style":1637},[64],"height:0.3496em;",[21,1639],{},[21,1641,188],{"className":1642},[187],[21,1644,1646],{"className":1645},[60],[21,1647,1650],{"className":1648,"style":1649},[64],"height:0.3927em;",[21,1651],{},[21,1653,188],{"className":1654},[187],[21,1656,1658],{"className":1657},[60],[21,1659,1662],{"className":1660,"style":1661},[64],"height:0.4551em;",[21,1663],{},[21,1665],{"className":1666,"style":1415},[215],[21,1668,1670],{"className":1669},[201],[21,1671,1423],{"className":1672},[1422,747],[21,1674,1676],{"className":1675},[281],[21,1677,1431],{"className":1678,"style":1430},[42,377],[21,1680,1682],{"className":1681},[201],[21,1683,202],{"className":1684},[1422,747],[21,1686,940],{"className":1687},[42],[21,1689],{"className":1690,"style":1506},[215],[21,1692,1694],{"className":1693},[1510],"−",[21,1696],{"className":1697,"style":1506},[215],[21,1699,1701,1705,1745,1748,1751,1754,1757,1760,1763,1769,1775,1778,1781,1784,1787],{"className":1700},[33],[21,1702],{"className":1703,"style":1704},[37],"height:1.2em;vertical-align:-0.35em;",[21,1706,1708,1711],{"className":1707},[42],[21,1709,970],{"className":1710,"style":594},[42,46],[21,1712,1714],{"className":1713},[52],[21,1715,1717,1737],{"className":1716},[56,164],[21,1718,1720,1734],{"className":1719},[60],[21,1721,1723],{"className":1722,"style":983},[64],[21,1724,1725,1728],{"style":986},[21,1726],{"className":1727,"style":72},[71],[21,1729,1731],{"className":1730},[76,77,78,79],[21,1732,996],{"className":1733,"style":135},[42,46,79],[21,1735,188],{"className":1736},[187],[21,1738,1740],{"className":1739},[60],[21,1741,1743],{"className":1742,"style":1006},[64],[21,1744],{},[21,1746,202],{"className":1747},[201],[21,1749,206],{"className":1750},[42,46],[21,1752,211],{"className":1753},[210],[21,1755],{"className":1756,"style":216},[215],[21,1758,15],{"className":1759},[42,46],[21,1761,224],{"className":1762},[223],[21,1764,1766],{"className":1765},[223],[21,1767,224],{"className":1768},[1422,747],[21,1770,1772],{"className":1771},[223],[21,1773,1499],{"className":1774},[1422,747],[21,1776],{"className":1777,"style":228},[215],[21,1779],{"className":1780,"style":1506},[215],[21,1782,1694],{"className":1783},[1510],[21,1785],{"className":1786,"style":228},[215],[21,1788],{"className":1789,"style":1506},[215],[21,1791,1793,1796,1800,1803,1808,1811,1851,1854],{"className":1792},[33],[21,1794],{"className":1795,"style":150},[37],[21,1797,1799],{"className":1798},[42,46],"λ",[21,1801],{"className":1802,"style":216},[215],[21,1804,1807],{"className":1805,"style":1806},[42,46],"margin-right:0.0813em;","H",[21,1809,202],{"className":1810},[201],[21,1812,1814,1817],{"className":1813},[42],[21,1815,136],{"className":1816,"style":135},[42,46],[21,1818,1820],{"className":1819},[52],[21,1821,1823,1843],{"className":1822},[56,164],[21,1824,1826,1840],{"className":1825},[60],[21,1827,1829],{"className":1828,"style":983},[64],[21,1830,1831,1834],{"style":1100},[21,1832],{"className":1833,"style":72},[71],[21,1835,1837],{"className":1836},[76,77,78,79],[21,1838,1110],{"className":1839,"style":594},[42,46,79],[21,1841,188],{"className":1842},[187],[21,1844,1846],{"className":1845},[60],[21,1847,1849],{"className":1848,"style":195},[64],[21,1850],{},[21,1852,224],{"className":1853},[223],[21,1855,211],{"className":1856},[210],[11,1858,1859,1860,1921,1922,2018,2019,2111,2112,2128,2129,2132,2133,2136,2137,2141,2142,2254,2255,2270,2271,2304,2305,2309],{},"with an entropy bonus ",[21,1861,1863],{"className":1862},[24],[21,1864,1866],{"className":1865,"ariaHidden":29},[28],[21,1867,1869,1872,1875,1878,1918],{"className":1868},[33],[21,1870],{"className":1871,"style":150},[37],[21,1873,1807],{"className":1874,"style":1806},[42,46],[21,1876,202],{"className":1877},[201],[21,1879,1881,1884],{"className":1880},[42],[21,1882,136],{"className":1883,"style":135},[42,46],[21,1885,1887],{"className":1886},[52],[21,1888,1890,1910],{"className":1889},[56,164],[21,1891,1893,1907],{"className":1892},[60],[21,1894,1896],{"className":1895,"style":983},[64],[21,1897,1898,1901],{"style":1100},[21,1899],{"className":1900,"style":72},[71],[21,1902,1904],{"className":1903},[76,77,78,79],[21,1905,1110],{"className":1906,"style":594},[42,46,79],[21,1908,188],{"className":1909},[187],[21,1911,1913],{"className":1912},[60],[21,1914,1916],{"className":1915,"style":195},[64],[21,1917],{},[21,1919,224],{"className":1920},[223]," inherited from the maximum-entropy view. The\ndiscriminator maximizes its ability to separate the two distributions; the policy\nminimizes it, driving ",[21,1923,1925],{"className":1924},[24],[21,1926,1928],{"className":1927,"ariaHidden":29},[28],[21,1929,1931,1935],{"className":1930},[33],[21,1932],{"className":1933,"style":1934},[37],"height:0.6864em;vertical-align:-0.2559em;",[21,1936,1938,1941],{"className":1937},[42],[21,1939,157],{"className":1940},[42,46],[21,1942,1944],{"className":1943},[52],[21,1945,1947,2009],{"className":1946},[56,164],[21,1948,1950,2006],{"className":1949},[60],[21,1951,1953],{"className":1952,"style":171},[64],[21,1954,1955,1958],{"style":174},[21,1956],{"className":1957,"style":72},[71],[21,1959,1961],{"className":1960},[76,77,78,79],[21,1962,1964],{"className":1963},[42,79],[21,1965,1967,1970],{"className":1966},[42,79],[21,1968,136],{"className":1969,"style":135},[42,46,79],[21,1971,1973],{"className":1972},[52],[21,1974,1976,1997],{"className":1975},[56,164],[21,1977,1979,1994],{"className":1978},[60],[21,1980,1982],{"className":1981,"style":735},[64],[21,1983,1985,1988],{"style":1984},"top:-2.3488em;margin-left:-0.0359em;margin-right:0.0714em;",[21,1986],{"className":1987,"style":742},[71],[21,1989,1991],{"className":1990},[76,746,747,79],[21,1992,1110],{"className":1993,"style":594},[42,46,79],[21,1995,188],{"className":1996},[187],[21,1998,2000],{"className":1999},[60],[21,2001,2004],{"className":2002,"style":2003},[64],"height:0.1512em;",[21,2005],{},[21,2007,188],{"className":2008},[187],[21,2010,2012],{"className":2011},[60],[21,2013,2016],{"className":2014,"style":2015},[64],"height:0.2559em;",[21,2017],{}," toward ",[21,2020,2022],{"className":2021},[24],[21,2023,2025],{"className":2024,"ariaHidden":29},[28],[21,2026,2028,2031],{"className":2027},[33],[21,2029],{"className":2030,"style":687},[37],[21,2032,2034,2037],{"className":2033},[42],[21,2035,157],{"className":2036},[42,46],[21,2038,2040],{"className":2039},[52],[21,2041,2043,2103],{"className":2042},[56,164],[21,2044,2046,2100],{"className":2045},[60],[21,2047,2049],{"className":2048,"style":171},[64],[21,2050,2051,2054],{"style":174},[21,2052],{"className":2053,"style":72},[71],[21,2055,2057],{"className":2056},[76,77,78,79],[21,2058,2060],{"className":2059},[42,79],[21,2061,2063,2066],{"className":2062},[42,79],[21,2064,136],{"className":2065,"style":135},[42,46,79],[21,2067,2069],{"className":2068},[52],[21,2070,2072,2092],{"className":2071},[56,164],[21,2073,2075,2089],{"className":2074},[60],[21,2076,2078],{"className":2077,"style":735},[64],[21,2079,2080,2083],{"style":738},[21,2081],{"className":2082,"style":742},[71],[21,2084,2086],{"className":2085},[76,746,747,79],[21,2087,752],{"className":2088,"style":751},[42,46,79],[21,2090,188],{"className":2091},[187],[21,2093,2095],{"className":2094},[60],[21,2096,2098],{"className":2097,"style":762},[64],[21,2099],{},[21,2101,188],{"className":2102},[187],[21,2104,2106],{"className":2105},[60],[21,2107,2109],{"className":2108,"style":774},[64],[21,2110],{},". The\npolicy cannot be trained by supervised backprop through ",[21,2113,2115],{"className":2114},[24],[21,2116,2118],{"className":2117,"ariaHidden":29},[28],[21,2119,2121,2125],{"className":2120},[33],[21,2122],{"className":2123,"style":2124},[37],"height:0.6833em;",[21,2126,970],{"className":2127,"style":594},[42,46]," — the state-action pairs\ncome from ",[1124,2130,2131],{},"running the policy in the environment",", so the discriminator's verdict\nbecomes a ",[101,2134,2135],{},"reward signal"," the policy improves against by an ordinary\n",[15,2138,2140],{"href":2139},"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods","policy-gradient","\nupdate. Concretely, ",[21,2143,2145],{"className":2144},[24],[21,2146,2148,2184],{"className":2147,"ariaHidden":29},[28],[21,2149,2151,2154,2157,2160,2166,2172,2175,2178,2181],{"className":2150},[33],[21,2152],{"className":2153,"style":1704},[37],[21,2155,1694],{"className":2156},[42],[21,2158],{"className":2159,"style":216},[215],[21,2161,2163],{"className":2162},[281],[21,2164,1431],{"className":2165,"style":1430},[42,377],[21,2167,2169],{"className":2168},[201],[21,2170,202],{"className":2171},[1422,747],[21,2173,940],{"className":2174},[42],[21,2176],{"className":2177,"style":1506},[215],[21,2179,1694],{"className":2180},[1510],[21,2182],{"className":2183,"style":1506},[215],[21,2185,2187,2190,2230,2233,2236,2239,2242,2245,2248],{"className":2186},[33],[21,2188],{"className":2189,"style":1704},[37],[21,2191,2193,2196],{"className":2192},[42],[21,2194,970],{"className":2195,"style":594},[42,46],[21,2197,2199],{"className":2198},[52],[21,2200,2202,2222],{"className":2201},[56,164],[21,2203,2205,2219],{"className":2204},[60],[21,2206,2208],{"className":2207,"style":983},[64],[21,2209,2210,2213],{"style":986},[21,2211],{"className":2212,"style":72},[71],[21,2214,2216],{"className":2215},[76,77,78,79],[21,2217,996],{"className":2218,"style":135},[42,46,79],[21,2220,188],{"className":2221},[187],[21,2223,2225],{"className":2224},[60],[21,2226,2228],{"className":2227,"style":1006},[64],[21,2229],{},[21,2231,202],{"className":2232},[201],[21,2234,206],{"className":2235},[42,46],[21,2237,211],{"className":2238},[210],[21,2240],{"className":2241,"style":216},[215],[21,2243,15],{"className":2244},[42,46],[21,2246,224],{"className":2247},[223],[21,2249,2251],{"className":2250},[223],[21,2252,224],{"className":2253},[1422,747]," (high when ",[21,2256,2258],{"className":2257},[24],[21,2259,2261],{"className":2260,"ariaHidden":29},[28],[21,2262,2264,2267],{"className":2263},[33],[21,2265],{"className":2266,"style":2124},[37],[21,2268,970],{"className":2269,"style":594},[42,46]," is fooled)\nplays the role of ",[21,2272,2274],{"className":2273},[24],[21,2275,2277],{"className":2276,"ariaHidden":29},[28],[21,2278,2280,2283,2286,2289,2292,2295,2298,2301],{"className":2279},[33],[21,2281],{"className":2282,"style":150},[37],[21,2284,595],{"className":2285,"style":594},[42,46],[21,2287,202],{"className":2288},[201],[21,2290,206],{"className":2291},[42,46],[21,2293,211],{"className":2294},[210],[21,2296],{"className":2297,"style":216},[215],[21,2299,15],{"className":2300},[42,46],[21,2302,224],{"className":2303},[223],", and TRPO or PPO does the ",[15,2306,2308],{"href":2307},"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality","value-function","-based credit\nassignment.",[615,2311],{"hash":2312},"3a7d1a746fc9956d67f957fcdd9f166c83479e940da91de8dc849661f36f91dc",[11,2314,2315,2316,2320],{},"GAIL matches the theoretical power of maximum-entropy IRL — it recovers the same\noccupancy-matching behavior — but pays none of IRL's double-loop cost, because the\ndiscriminator replaces the nested forward-RL solve with a cheap classification step.\nIt scales to high-dimensional continuous control where classical IRL is intractable,\nand it learns from a fixed demonstration set (no interactive expert, unlike DAgger).\nThe price is GAN training: adversarial optimization is delicate, sample-hungry in\nenvironment steps (each policy-gradient update needs fresh rollouts), and prone to\nthe instabilities familiar from the\n",[15,2317,2319],{"href":2318},"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks","generative-adversarial-network","\nlesson — mode collapse, oscillation, and a discriminator that outpaces the\ngenerator. GAIL is the conceptual bridge: the same min-max game that generates\nphotorealistic images, pointed at trajectories, produces expert-like behavior.",[93,2322,2324],{"id":2323},"from-gail-back-to-a-reward-adversarial-irl","From GAIL back to a reward: adversarial IRL",[11,2326,2327,2328,2331,2332,2365],{},"GAIL buys efficiency by ",[1124,2329,2330],{},"dissolving"," the reward — it matches occupancy measures and\nnever names ",[21,2333,2335],{"className":2334},[24],[21,2336,2338],{"className":2337,"ariaHidden":29},[28],[21,2339,2341,2344,2347,2350,2353,2356,2359,2362],{"className":2340},[33],[21,2342],{"className":2343,"style":150},[37],[21,2345,595],{"className":2346,"style":594},[42,46],[21,2348,202],{"className":2349},[201],[21,2351,206],{"className":2352},[42,46],[21,2354,211],{"className":2355},[210],[21,2357],{"className":2358,"style":216},[215],[21,2360,15],{"className":2361},[42,46],[21,2363,224],{"className":2364},[223],". That is the right trade when you only want the behavior, but\nit forfeits IRL's original benefit: a reward that transfers to new dynamics. The\nresolution is to keep GAIL's adversarial machinery yet read a reward back out of the\ndiscriminator, and two lines of work do exactly that.",[11,2367,2368,2371,2372,2389,2390,2397,2398,2401],{},[101,2369,2370],{},"Guided Cost Learning"," (Finn, Levine, Abbeel 2016) makes maximum-entropy IRL\npractical for deep continuous control by replacing the intractable partition\nfunction ",[21,2373,2375],{"className":2374},[24],[21,2376,2378],{"className":2377,"ariaHidden":29},[28],[21,2379,2381,2384],{"className":2380},[33],[21,2382],{"className":2383,"style":2124},[37],[21,2385,2388],{"className":2386,"style":2387},[42,46],"margin-right:0.0715em;","Z"," with a sampling-based estimate — importance-sampled from the current\npolicy — so the reward network can be trained by gradient descent without an exact\ninner solve.",[932,2391,2392],{},[15,2393,83],{"href":2394,"ariaDescribedBy":2395,"dataFootnoteRef":6,"id":2396},"#user-content-fn-gcl",[938],"user-content-fnref-gcl"," Finn et al. then showed this sampling-based IRL is ",[1124,2399,2400],{},"formally the\nsame algorithm"," as a GAN with a particular discriminator form, making explicit the\nGAIL connection: the discriminator and the reward are two views of one object.",[11,2403,2404,2407],{},[101,2405,2406],{},"Adversarial Inverse Reinforcement Learning"," (Fu, Luo, Levine 2018) exploits that\nview to recover a reward that generalizes. It constrains the discriminator to the\nform",[21,2409,2411],{"className":2410},[1131],[21,2412,2414],{"className":2413},[24],[21,2415,2417,2532,2925,2990,3090],{"className":2416,"ariaHidden":29},[28],[21,2418,2420,2424,2464,2467,2470,2473,2476,2479,2482,2485,2520,2523,2526,2529],{"className":2419},[33],[21,2421],{"className":2422,"style":2423},[37],"height:1.088em;vertical-align:-0.2861em;",[21,2425,2427,2430],{"className":2426},[42],[21,2428,970],{"className":2429,"style":594},[42,46],[21,2431,2433],{"className":2432},[52],[21,2434,2436,2456],{"className":2435},[56,164],[21,2437,2439,2453],{"className":2438},[60],[21,2440,2442],{"className":2441,"style":983},[64],[21,2443,2444,2447],{"style":986},[21,2445],{"className":2446,"style":72},[71],[21,2448,2450],{"className":2449},[76,77,78,79],[21,2451,996],{"className":2452,"style":135},[42,46,79],[21,2454,188],{"className":2455},[187],[21,2457,2459],{"className":2458},[60],[21,2460,2462],{"className":2461,"style":1006},[64],[21,2463],{},[21,2465,202],{"className":2466},[201],[21,2468,206],{"className":2469},[42,46],[21,2471,211],{"className":2472},[210],[21,2474],{"className":2475,"style":216},[215],[21,2477,15],{"className":2478},[42,46],[21,2480,211],{"className":2481},[210],[21,2483],{"className":2484,"style":216},[215],[21,2486,2488,2491],{"className":2487},[42],[21,2489,206],{"className":2490},[42,46],[21,2492,2494],{"className":2493},[52],[21,2495,2497],{"className":2496},[56],[21,2498,2500],{"className":2499},[60],[21,2501,2504],{"className":2502,"style":2503},[64],"height:0.8019em;",[21,2505,2507,2510],{"style":2506},"top:-3.113em;margin-right:0.05em;",[21,2508],{"className":2509,"style":72},[71],[21,2511,2513],{"className":2512},[76,77,78,79],[21,2514,2516],{"className":2515},[42,79],[21,2517,2519],{"className":2518},[42,79],"′",[21,2521,224],{"className":2522},[223],[21,2524],{"className":2525,"style":228},[215],[21,2527,233],{"className":2528},[232],[21,2530],{"className":2531,"style":228},[215],[21,2533,2535,2539,2866,2869,2873,2876,2916,2919,2922],{"className":2534},[33],[21,2536],{"className":2537,"style":2538},[37],"height:2.68em;vertical-align:-1.09em;",[21,2540,2542,2546,2863],{"className":2541},[42],[21,2543],{"className":2544},[201,2545],"nulldelimiter",[21,2547,2550],{"className":2548},[2549],"mfrac",[21,2551,2553,2854],{"className":2552},[56,164],[21,2554,2556,2851],{"className":2555},[60],[21,2557,2560,2719,2730],{"className":2558,"style":2559},[64],"height:1.59em;",[21,2561,2563,2566],{"style":2562},"top:-2.26em;",[21,2564],{"className":2565,"style":1165},[71],[21,2567,2569,2573,2579,2622,2625,2628,2631,2634,2637,2640,2643,2677,2680,2686,2689,2692,2695,2698,2701,2704,2707,2710,2713,2716],{"className":2568},[42],[21,2570,2572],{"className":2571},[281],"exp",[21,2574,2576],{"className":2575},[201],[21,2577,202],{"className":2578},[1422,747],[21,2580,2582,2587],{"className":2581},[42],[21,2583,2586],{"className":2584,"style":2585},[42,46],"margin-right:0.1076em;","f",[21,2588,2590],{"className":2589},[52],[21,2591,2593,2614],{"className":2592},[56,164],[21,2594,2596,2611],{"className":2595},[60],[21,2597,2599],{"className":2598,"style":983},[64],[21,2600,2602,2605],{"style":2601},"top:-2.55em;margin-left:-0.1076em;margin-right:0.05em;",[21,2603],{"className":2604,"style":72},[71],[21,2606,2608],{"className":2607},[76,77,78,79],[21,2609,996],{"className":2610,"style":135},[42,46,79],[21,2612,188],{"className":2613},[187],[21,2615,2617],{"className":2616},[60],[21,2618,2620],{"className":2619,"style":1006},[64],[21,2621],{},[21,2623,202],{"className":2624},[201],[21,2626,206],{"className":2627},[42,46],[21,2629,211],{"className":2630},[210],[21,2632],{"className":2633,"style":216},[215],[21,2635,15],{"className":2636},[42,46],[21,2638,211],{"className":2639},[210],[21,2641],{"className":2642,"style":216},[215],[21,2644,2646,2649],{"className":2645},[42],[21,2647,206],{"className":2648},[42,46],[21,2650,2652],{"className":2651},[52],[21,2653,2655],{"className":2654},[56],[21,2656,2658],{"className":2657},[60],[21,2659,2662],{"className":2660,"style":2661},[64],"height:0.6779em;",[21,2663,2665,2668],{"style":2664},"top:-2.989em;margin-right:0.05em;",[21,2666],{"className":2667,"style":72},[71],[21,2669,2671],{"className":2670},[76,77,78,79],[21,2672,2674],{"className":2673},[42,79],[21,2675,2519],{"className":2676},[42,79],[21,2678,224],{"className":2679},[223],[21,2681,2683],{"className":2682},[223],[21,2684,224],{"className":2685},[1422,747],[21,2687],{"className":2688,"style":1506},[215],[21,2690,1511],{"className":2691},[1510],[21,2693],{"className":2694,"style":1506},[215],[21,2696,136],{"className":2697,"style":135},[42,46],[21,2699,202],{"className":2700},[201],[21,2702,15],{"className":2703},[42,46],[21,2705],{"className":2706,"style":228},[215],[21,2708,258],{"className":2709},[232],[21,2711],{"className":2712,"style":228},[215],[21,2714,206],{"className":2715},[42,46],[21,2717,224],{"className":2718},[223],[21,2720,2722,2725],{"style":2721},"top:-3.23em;",[21,2723],{"className":2724,"style":1165},[71],[21,2726],{"className":2727,"style":2729},[2728],"frac-line","border-bottom-width:0.04em;",[21,2731,2733,2736],{"style":2732},"top:-3.74em;",[21,2734],{"className":2735,"style":1165},[71],[21,2737,2739,2742,2748,2788,2791,2794,2797,2800,2803,2806,2809,2842,2845],{"className":2738},[42],[21,2740,2572],{"className":2741},[281],[21,2743,2745],{"className":2744},[201],[21,2746,202],{"className":2747},[1422,747],[21,2749,2751,2754],{"className":2750},[42],[21,2752,2586],{"className":2753,"style":2585},[42,46],[21,2755,2757],{"className":2756},[52],[21,2758,2760,2780],{"className":2759},[56,164],[21,2761,2763,2777],{"className":2762},[60],[21,2764,2766],{"className":2765,"style":983},[64],[21,2767,2768,2771],{"style":2601},[21,2769],{"className":2770,"style":72},[71],[21,2772,2774],{"className":2773},[76,77,78,79],[21,2775,996],{"className":2776,"style":135},[42,46,79],[21,2778,188],{"className":2779},[187],[21,2781,2783],{"className":2782},[60],[21,2784,2786],{"className":2785,"style":1006},[64],[21,2787],{},[21,2789,202],{"className":2790},[201],[21,2792,206],{"className":2793},[42,46],[21,2795,211],{"className":2796},[210],[21,2798],{"className":2799,"style":216},[215],[21,2801,15],{"className":2802},[42,46],[21,2804,211],{"className":2805},[210],[21,2807],{"className":2808,"style":216},[215],[21,2810,2812,2815],{"className":2811},[42],[21,2813,206],{"className":2814},[42,46],[21,2816,2818],{"className":2817},[52],[21,2819,2821],{"className":2820},[56],[21,2822,2824],{"className":2823},[60],[21,2825,2828],{"className":2826,"style":2827},[64],"height:0.7519em;",[21,2829,2830,2833],{"style":67},[21,2831],{"className":2832,"style":72},[71],[21,2834,2836],{"className":2835},[76,77,78,79],[21,2837,2839],{"className":2838},[42,79],[21,2840,2519],{"className":2841},[42,79],[21,2843,224],{"className":2844},[223],[21,2846,2848],{"className":2847},[223],[21,2849,224],{"className":2850},[1422,747],[21,2852,188],{"className":2853},[187],[21,2855,2857],{"className":2856},[60],[21,2858,2861],{"className":2859,"style":2860},[64],"height:1.09em;",[21,2862],{},[21,2864],{"className":2865},[223,2545],[21,2867,211],{"className":2868},[210],[21,2870],{"className":2871,"style":2872},[215],"margin-right:2em;",[21,2874],{"className":2875,"style":216},[215],[21,2877,2879,2882],{"className":2878},[42],[21,2880,2586],{"className":2881,"style":2585},[42,46],[21,2883,2885],{"className":2884},[52],[21,2886,2888,2908],{"className":2887},[56,164],[21,2889,2891,2905],{"className":2890},[60],[21,2892,2894],{"className":2893,"style":983},[64],[21,2895,2896,2899],{"style":2601},[21,2897],{"className":2898,"style":72},[71],[21,2900,2902],{"className":2901},[76,77,78,79],[21,2903,996],{"className":2904,"style":135},[42,46,79],[21,2906,188],{"className":2907},[187],[21,2909,2911],{"className":2910},[60],[21,2912,2914],{"className":2913,"style":1006},[64],[21,2915],{},[21,2917],{"className":2918,"style":228},[215],[21,2920,233],{"className":2921},[232],[21,2923],{"className":2924,"style":228},[215],[21,2926,2928,2931,2972,2975,2978,2981,2984,2987],{"className":2927},[33],[21,2929],{"className":2930,"style":963},[37],[21,2932,2934,2938],{"className":2933},[42],[21,2935,2937],{"className":2936,"style":135},[42,46],"g",[21,2939,2941],{"className":2940},[52],[21,2942,2944,2964],{"className":2943},[56,164],[21,2945,2947,2961],{"className":2946},[60],[21,2948,2950],{"className":2949,"style":983},[64],[21,2951,2952,2955],{"style":1100},[21,2953],{"className":2954,"style":72},[71],[21,2956,2958],{"className":2957},[76,77,78,79],[21,2959,996],{"className":2960,"style":135},[42,46,79],[21,2962,188],{"className":2963},[187],[21,2965,2967],{"className":2966},[60],[21,2968,2970],{"className":2969,"style":1006},[64],[21,2971],{},[21,2973,202],{"className":2974},[201],[21,2976,206],{"className":2977},[42,46],[21,2979,224],{"className":2980},[223],[21,2982],{"className":2983,"style":1506},[215],[21,2985,1511],{"className":2986},[1510],[21,2988],{"className":2989,"style":1506},[215],[21,2991,2993,2996,2999,3002,3043,3046,3078,3081,3084,3087],{"className":2992},[33],[21,2994],{"className":2995,"style":2423},[37],[21,2997,340],{"className":2998,"style":339},[42,46],[21,3000],{"className":3001,"style":216},[215],[21,3003,3005,3009],{"className":3004},[42],[21,3006,3008],{"className":3007},[42,46],"h",[21,3010,3012],{"className":3011},[52],[21,3013,3015,3035],{"className":3014},[56,164],[21,3016,3018,3032],{"className":3017},[60],[21,3019,3021],{"className":3020,"style":983},[64],[21,3022,3023,3026],{"style":174},[21,3024],{"className":3025,"style":72},[71],[21,3027,3029],{"className":3028},[76,77,78,79],[21,3030,996],{"className":3031,"style":135},[42,46,79],[21,3033,188],{"className":3034},[187],[21,3036,3038],{"className":3037},[60],[21,3039,3041],{"className":3040,"style":1006},[64],[21,3042],{},[21,3044,202],{"className":3045},[201],[21,3047,3049,3052],{"className":3048},[42],[21,3050,206],{"className":3051},[42,46],[21,3053,3055],{"className":3054},[52],[21,3056,3058],{"className":3057},[56],[21,3059,3061],{"className":3060},[60],[21,3062,3064],{"className":3063,"style":2503},[64],[21,3065,3066,3069],{"style":2506},[21,3067],{"className":3068,"style":72},[71],[21,3070,3072],{"className":3071},[76,77,78,79],[21,3073,3075],{"className":3074},[42,79],[21,3076,2519],{"className":3077},[42,79],[21,3079,224],{"className":3080},[223],[21,3082],{"className":3083,"style":1506},[215],[21,3085,1694],{"className":3086},[1510],[21,3088],{"className":3089,"style":1506},[215],[21,3091,3093,3096,3136,3139,3142,3145],{"className":3092},[33],[21,3094],{"className":3095,"style":963},[37],[21,3097,3099,3102],{"className":3098},[42],[21,3100,3008],{"className":3101},[42,46],[21,3103,3105],{"className":3104},[52],[21,3106,3108,3128],{"className":3107},[56,164],[21,3109,3111,3125],{"className":3110},[60],[21,3112,3114],{"className":3113,"style":983},[64],[21,3115,3116,3119],{"style":174},[21,3117],{"className":3118,"style":72},[71],[21,3120,3122],{"className":3121},[76,77,78,79],[21,3123,996],{"className":3124,"style":135},[42,46,79],[21,3126,188],{"className":3127},[187],[21,3129,3131],{"className":3130},[60],[21,3132,3134],{"className":3133,"style":1006},[64],[21,3135],{},[21,3137,202],{"className":3138},[201],[21,3140,206],{"className":3141},[42,46],[21,3143,224],{"className":3144},[223],[21,3146,211],{"className":3147},[210],[11,3149,3150,3151,3212,3213,3266,3267,3352,3353,3361,3362,3365,3366,3419],{},"so that at convergence ",[21,3152,3154],{"className":3153},[24],[21,3155,3157],{"className":3156,"ariaHidden":29},[28],[21,3158,3160,3163,3203,3206,3209],{"className":3159},[33],[21,3161],{"className":3162,"style":963},[37],[21,3164,3166,3169],{"className":3165},[42],[21,3167,2937],{"className":3168,"style":135},[42,46],[21,3170,3172],{"className":3171},[52],[21,3173,3175,3195],{"className":3174},[56,164],[21,3176,3178,3192],{"className":3177},[60],[21,3179,3181],{"className":3180,"style":983},[64],[21,3182,3183,3186],{"style":1100},[21,3184],{"className":3185,"style":72},[71],[21,3187,3189],{"className":3188},[76,77,78,79],[21,3190,996],{"className":3191,"style":135},[42,46,79],[21,3193,188],{"className":3194},[187],[21,3196,3198],{"className":3197},[60],[21,3199,3201],{"className":3200,"style":1006},[64],[21,3202],{},[21,3204,202],{"className":3205},[201],[21,3207,206],{"className":3208},[42,46],[21,3210,224],{"className":3211},[223]," recovers the reward and ",[21,3214,3216],{"className":3215},[24],[21,3217,3219],{"className":3218,"ariaHidden":29},[28],[21,3220,3222,3226],{"className":3221},[33],[21,3223],{"className":3224,"style":3225},[37],"height:0.9805em;vertical-align:-0.2861em;",[21,3227,3229,3232],{"className":3228},[42],[21,3230,3008],{"className":3231},[42,46],[21,3233,3235],{"className":3234},[52],[21,3236,3238,3258],{"className":3237},[56,164],[21,3239,3241,3255],{"className":3240},[60],[21,3242,3244],{"className":3243,"style":983},[64],[21,3245,3246,3249],{"style":174},[21,3247],{"className":3248,"style":72},[71],[21,3250,3252],{"className":3251},[76,77,78,79],[21,3253,996],{"className":3254,"style":135},[42,46,79],[21,3256,188],{"className":3257},[187],[21,3259,3261],{"className":3260},[60],[21,3262,3264],{"className":3263,"style":1006},[64],[21,3265],{}," absorbs the\npotential-shaping term the reward is ambiguous up to (the same ",[21,3268,3270],{"className":3269},[24],[21,3271,3273,3334],{"className":3272,"ariaHidden":29},[28],[21,3274,3276,3280,3283,3287,3290,3322,3325,3328,3331],{"className":3275},[33],[21,3277],{"className":3278,"style":3279},[37],"height:1.0019em;vertical-align:-0.25em;",[21,3281,340],{"className":3282,"style":339},[42,46],[21,3284,3286],{"className":3285},[42,46],"ϕ",[21,3288,202],{"className":3289},[201],[21,3291,3293,3296],{"className":3292},[42],[21,3294,206],{"className":3295},[42,46],[21,3297,3299],{"className":3298},[52],[21,3300,3302],{"className":3301},[56],[21,3303,3305],{"className":3304},[60],[21,3306,3308],{"className":3307,"style":2827},[64],[21,3309,3310,3313],{"style":67},[21,3311],{"className":3312,"style":72},[71],[21,3314,3316],{"className":3315},[76,77,78,79],[21,3317,3319],{"className":3318},[42,79],[21,3320,2519],{"className":3321},[42,79],[21,3323,224],{"className":3324},[223],[21,3326],{"className":3327,"style":1506},[215],[21,3329,1694],{"className":3330},[1510],[21,3332],{"className":3333,"style":1506},[215],[21,3335,3337,3340,3343,3346,3349],{"className":3336},[33],[21,3338],{"className":3339,"style":150},[37],[21,3341,3286],{"className":3342},[42,46],[21,3344,202],{"className":3345},[201],[21,3347,206],{"className":3348},[42,46],[21,3350,224],{"className":3351},[223]," shaping that made IRL ill-posed).",[932,3354,3355],{},[15,3356,3360],{"href":3357,"ariaDescribedBy":3358,"dataFootnoteRef":6,"id":3359},"#user-content-fn-airl",[938],"user-content-fnref-airl","3"," Because AIRL isolates the\n",[1124,3363,3364],{},"state-only"," reward ",[21,3367,3369],{"className":3368},[24],[21,3370,3372],{"className":3371,"ariaHidden":29},[28],[21,3373,3375,3379],{"className":3374},[33],[21,3376],{"className":3377,"style":3378},[37],"height:0.7167em;vertical-align:-0.2861em;",[21,3380,3382,3385],{"className":3381},[42],[21,3383,2937],{"className":3384,"style":135},[42,46],[21,3386,3388],{"className":3387},[52],[21,3389,3391,3411],{"className":3390},[56,164],[21,3392,3394,3408],{"className":3393},[60],[21,3395,3397],{"className":3396,"style":983},[64],[21,3398,3399,3402],{"style":1100},[21,3400],{"className":3401,"style":72},[71],[21,3403,3405],{"className":3404},[76,77,78,79],[21,3406,996],{"className":3407,"style":135},[42,46,79],[21,3409,188],{"className":3410},[187],[21,3412,3414],{"className":3413},[60],[21,3415,3417],{"className":3416,"style":1006},[64],[21,3418],{}," from the shaping, the recovered reward transfers across\nchanges in dynamics: under new physics it still specifies the same goal, where\nGAIL's occupancy-matched policy would have to relearn from scratch. AIRL is the deep,\nadversarial descendant of MaxEnt IRL, closing the loop back to a portable reward\nwithout paying the classical double-loop cost.",[615,3421],{"hash":3422},"e9b66689b13e54647b5d8176ec377b57623645da68739c96321b89e55ecfe47c",[93,3424,3426],{"id":3425},"choosing-an-approach","Choosing an approach",[11,3428,3429],{},"The four methods sort along one axis — how much work they do to handle the\ncovariate shift that sinks naive cloning.",[3431,3432,3433,3455],"table",{},[3434,3435,3436],"thead",{},[3437,3438,3439,3443,3446,3449,3452],"tr",{},[3440,3441,3442],"th",{},"Method",[3440,3444,3445],{},"What it produces",[3440,3447,3448],{},"Handles covariate shift?",[3440,3450,3451],{},"Cost",[3440,3453,3454],{},"Needs",[3456,3457,3458,3521,3542,3559],"tbody",{},[3437,3459,3460,3464,3467,3515,3518],{},[3461,3462,3463],"td",{},"Behavioral cloning",[3461,3465,3466],{},"a policy, by supervised learning",[3461,3468,3469,3470,3514],{},"no — ",[21,3471,3473],{"className":3472},[24],[21,3474,3476],{"className":3475,"ariaHidden":29},[28],[21,3477,3479,3482,3511],{"className":3478},[33],[21,3480],{"className":3481,"style":38},[37],[21,3483,3485,3488],{"className":3484},[42],[21,3486,48],{"className":3487,"style":47},[42,46],[21,3489,3491],{"className":3490},[52],[21,3492,3494],{"className":3493},[56],[21,3495,3497],{"className":3496},[60],[21,3498,3500],{"className":3499,"style":38},[64],[21,3501,3502,3505],{"style":67},[21,3503],{"className":3504,"style":72},[71],[21,3506,3508],{"className":3507},[76,77,78,79],[21,3509,83],{"className":3510},[42,79],[21,3512,87],{"className":3513},[42,46]," compounding",[3461,3516,3517],{},"very cheap (one fit)",[3461,3519,3520],{},"a fixed demo set",[3437,3522,3523,3526,3529,3532,3535],{},[3461,3524,3525],{},"DAgger",[3461,3527,3528],{},"a policy, over aggregation rounds",[3461,3530,3531],{},"yes — trains on learner's states",[3461,3533,3534],{},"moderate",[3461,3536,3537,3538,3541],{},"an ",[101,3539,3540],{},"interactive"," expert",[3437,3543,3544,3547,3550,3553,3556],{},[3461,3545,3546],{},"Max-Ent IRL",[3461,3548,3549],{},"a reward function",[3461,3551,3552],{},"yes — reward generalizes",[3461,3554,3555],{},"expensive (RL in the inner loop)",[3461,3557,3558],{},"a fixed demo set + forward solver",[3437,3560,3561,3564,3567,3570,3573],{},[3461,3562,3563],{},"GAIL",[3461,3565,3566],{},"a policy, adversarially",[3461,3568,3569],{},"yes — matches occupancy measure",[3461,3571,3572],{},"expensive (GAN + env rollouts)",[3461,3574,3575],{},"a fixed demo set + environment",[11,3577,3578],{},"Behavioral cloning is the honest baseline: reach for it first, especially as a warm\nstart, and accept that its policy drifts once it leaves the demonstrated states. If\nyou have a queryable expert, DAgger fixes the drift directly and cheaply. If you\nneed a reward that transfers to new tasks or want the possibility of beating the\ndemonstrator, IRL recovers one, at the cost of a nested RL solve. If you only need\nthe behavior and have environment access but no interactive expert, GAIL matches the\nexpert's occupancy measure through the adversarial game, trading IRL's inner loop for\nGAN instability.",[93,3580,3582],{"id":3581},"reward-models-diffusion-policies-and-scaled-cloning","Reward models, diffusion policies, and scaled cloning",[11,3584,3585],{},"Imitation learning has moved well past the four classical methods, in directions\nSutton & Barto do not cover.",[11,3587,3588,3591,3592,3596,3597,3605,3606,3609],{},[101,3589,3590],{},"IRL is the reward model in RLHF."," The single largest deployment of inverse\nreward learning is aligning language models. A reward model trained on human\npreference comparisons is an IRL step in disguise: it recovers a scalar reward that\n",[3593,3594,3595],"q",{},"explains"," which of two responses a human preferred, then ordinary RL (PPO)\noptimizes a policy against it (Christiano et al. 2017; Ouyang et al. 2022,\nInstructGPT).",[932,3598,3599],{},[15,3600,3604],{"href":3601,"ariaDescribedBy":3602,"dataFootnoteRef":6,"id":3603},"#user-content-fn-rlhf",[938],"user-content-fnref-rlhf","4"," The connection to this lesson is exact — preference-based\nreward learning is IRL with pairwise-comparison supervision instead of full\ndemonstrations, and the KL penalty that keeps the tuned model near the reference is\nthe same ",[3593,3607,3608],{},"stay near the demonstrator"," pressure that stabilizes imitation. Direct\nPreference Optimization (Rafailov et al. 2023) later showed the reward model can be\nskipped entirely, folding the IRL and RL steps into one supervised loss.",[11,3611,3612,3615,3616,3660,3661,3664,3665,3668,3669,3672,3673,3676,3677,3680,3681,3684],{},[101,3613,3614],{},"Behavioral cloning, scaled, is competitive again."," The ",[21,3617,3619],{"className":3618},[24],[21,3620,3622],{"className":3621,"ariaHidden":29},[28],[21,3623,3625,3628,3657],{"className":3624},[33],[21,3626],{"className":3627,"style":38},[37],[21,3629,3631,3634],{"className":3630},[42],[21,3632,48],{"className":3633,"style":47},[42,46],[21,3635,3637],{"className":3636},[52],[21,3638,3640],{"className":3639},[56],[21,3641,3643],{"className":3642},[60],[21,3644,3646],{"className":3645,"style":38},[64],[21,3647,3648,3651],{"style":67},[21,3649],{"className":3650,"style":72},[71],[21,3652,3654],{"className":3653},[76,77,78,79],[21,3655,83],{"className":3656},[42,79],[21,3658,87],{"className":3659},[42,46]," pessimism\nis a worst case, and modern practice has learned to blunt it without an interactive\nexpert. Two levers matter. First, ",[1124,3662,3663],{},"sheer scale",": robotics foundation models such as\n",[101,3666,3667],{},"RT-1"," (Brohan et al. 2022) and ",[101,3670,3671],{},"RT-2"," are behavioral clones trained on\nenormous, diverse teleoperation datasets, where broad coverage means the policy\nrarely leaves the demonstrated distribution in the first place. Second, ",[1124,3674,3675],{},"expressive\naction distributions",": ",[101,3678,3679],{},"Diffusion Policy"," (Chi et al. 2023) clones by fitting a\ndiffusion model over action sequences rather than a unimodal Gaussian, which\ncaptures the multi-modality of human demonstrations (a human might swerve left ",[1124,3682,3683],{},"or","\nright around an obstacle) that a mean-squared clone averages into an unusable\nin-between. Modeling the full action distribution, not its mean, turns out to fix\nmuch of what made naive cloning brittle.",[615,3686],{"hash":3687},"f2491c716a034c8086b0670852bb9d4296527e5abd86ff9fda664c00f94c5548",[11,3689,3690,3693,3694,3697,3698,3701,3702,3705],{},[101,3691,3692],{},"Offline imitation and observation-only learning."," GAIL needs environment\nrollouts; ",[101,3695,3696],{},"ValueDICE"," and related ",[3593,3699,3700],{},"DICE"," methods (Kostrikov et al. 2019) match\noccupancy measures entirely offline, from a fixed dataset, closing the gap to the\noffline-RL lesson. And when only expert ",[1124,3703,3704],{},"states"," are available with no action\nlabels — video of an expert, say — imitation-from-observation methods recover\nbehavior by matching state occupancy alone, extending the occupancy-matching view of\nGAIL to the label-free setting.",[11,3707,3708],{},"The through-line is the covariate-shift diagnosis. Behavioral cloning fails because\nit trains on one distribution and is tested on another that its own actions create;\nevery method that beats it does so by confronting the distribution the learner\nactually visits — DAgger by labelling those states, IRL and GAIL by matching the\nlong-run occupancy the learner induces rather than the individual actions the expert\ntook. Demonstrations can stand in for a reward, but only once you stop treating\ncontrol as if it were supervised learning.",[3710,3711,3714,3719],"section",{"className":3712,"dataFootnotes":6},[3713],"footnotes",[93,3715,3718],{"className":3716,"id":938},[3717],"sr-only","Footnotes",[3720,3721,3722,3740,3755,3916],"ol",{},[3723,3724,3726,3729,3730,3732,3733],"li",{"id":3725},"user-content-fn-gail",[101,3727,3728],{},"Ho & Ermon (2016)",", ",[3593,3731,946],{},", NeurIPS — shows that RL on the IRL-recovered reward reduces to occupancy-measure matching, and casts it as a GAN: a discriminator separating expert from learner state-action pairs supplies the reward a policy-gradient method optimizes, imitating without an explicit reward. ",[15,3734,3739],{"href":3735,"ariaLabel":3736,"className":3737,"dataFootnoteBackref":6},"#user-content-fnref-gail","Back to reference 1",[3738],"data-footnote-backref","↩",[3723,3741,3743,3729,3746,3749,3750],{"id":3742},"user-content-fn-gcl",[101,3744,3745],{},"Finn, Levine, Abbeel (2016)",[3593,3747,3748],{},"Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization",", ICML — sampling-based maximum-entropy IRL for deep continuous control, estimating the partition function from policy samples; the companion note (Finn, Christiano, Abbeel, Levine 2016) shows the algorithm is equivalent to a GAN with a specific discriminator, tying IRL to GAIL. ",[15,3751,3739],{"href":3752,"ariaLabel":3753,"className":3754,"dataFootnoteBackref":6},"#user-content-fnref-gcl","Back to reference 2",[3738],[3723,3756,3758,3729,3761,3764,3765,3894,3895,3910,3911],{"id":3757},"user-content-fn-airl",[101,3759,3760],{},"Fu, Luo, Levine (2018)",[3593,3762,3763],{},"Learning Robust Rewards with Adversarial Inverse Reinforcement Learning",", ICLR — AIRL constrains the discriminator to a reward-plus-shaping form ",[21,3766,3768],{"className":3767},[24],[21,3769,3771,3790,3817,3876],{"className":3770,"ariaHidden":29},[28],[21,3772,3774,3778,3781,3784,3787],{"className":3773},[33],[21,3775],{"className":3776,"style":3777},[37],"height:0.8889em;vertical-align:-0.1944em;",[21,3779,2586],{"className":3780,"style":2585},[42,46],[21,3782],{"className":3783,"style":228},[215],[21,3785,233],{"className":3786},[232],[21,3788],{"className":3789,"style":228},[215],[21,3791,3793,3796,3799,3802,3805,3808,3811,3814],{"className":3792},[33],[21,3794],{"className":3795,"style":150},[37],[21,3797,2937],{"className":3798,"style":135},[42,46],[21,3800,202],{"className":3801},[201],[21,3803,206],{"className":3804},[42,46],[21,3806,224],{"className":3807},[223],[21,3809],{"className":3810,"style":1506},[215],[21,3812,1511],{"className":3813},[1510],[21,3815],{"className":3816,"style":1506},[215],[21,3818,3820,3823,3826,3829,3832,3864,3867,3870,3873],{"className":3819},[33],[21,3821],{"className":3822,"style":3279},[37],[21,3824,340],{"className":3825,"style":339},[42,46],[21,3827,3008],{"className":3828},[42,46],[21,3830,202],{"className":3831},[201],[21,3833,3835,3838],{"className":3834},[42],[21,3836,206],{"className":3837},[42,46],[21,3839,3841],{"className":3840},[52],[21,3842,3844],{"className":3843},[56],[21,3845,3847],{"className":3846},[60],[21,3848,3850],{"className":3849,"style":2827},[64],[21,3851,3852,3855],{"style":67},[21,3853],{"className":3854,"style":72},[71],[21,3856,3858],{"className":3857},[76,77,78,79],[21,3859,3861],{"className":3860},[42,79],[21,3862,2519],{"className":3863},[42,79],[21,3865,224],{"className":3866},[223],[21,3868],{"className":3869,"style":1506},[215],[21,3871,1694],{"className":3872},[1510],[21,3874],{"className":3875,"style":1506},[215],[21,3877,3879,3882,3885,3888,3891],{"className":3878},[33],[21,3880],{"className":3881,"style":150},[37],[21,3883,3008],{"className":3884},[42,46],[21,3886,202],{"className":3887},[201],[21,3889,206],{"className":3890},[42,46],[21,3892,224],{"className":3893},[223],", recovering a state-only reward ",[21,3896,3898],{"className":3897},[24],[21,3899,3901],{"className":3900,"ariaHidden":29},[28],[21,3902,3904,3907],{"className":3903},[33],[21,3905],{"className":3906,"style":633},[37],[21,3908,2937],{"className":3909,"style":135},[42,46]," that is disentangled from potential shaping and therefore transfers across changes in the dynamics. ",[15,3912,3739],{"href":3913,"ariaLabel":3914,"className":3915,"dataFootnoteBackref":6},"#user-content-fnref-airl","Back to reference 3",[3738],[3723,3917,3919,3729,3922,3925,3926,3729,3929,3932,3933],{"id":3918},"user-content-fn-rlhf",[101,3920,3921],{},"Christiano, Leike, Brown, Martic, Legg, Amodei (2017)",[3593,3923,3924],{},"Deep Reinforcement Learning from Human Preferences",", NeurIPS — learns a reward model from pairwise human preferences and optimizes a policy against it; ",[101,3927,3928],{},"Ouyang et al. (2022)",[3593,3930,3931],{},"Training language models to follow instructions with human feedback"," (InstructGPT), applies the same preference-based reward-learning-then-PPO pipeline to align a large language model. ",[15,3934,3739],{"href":3935,"ariaLabel":3936,"className":3937,"dataFootnoteBackref":6},"#user-content-fnref-rlhf","Back to reference 4",[3738],{"title":6,"searchDepth":3939,"depth":3939,"links":3940},2,[3941,3942,3943,3944,3945],{"id":95,"depth":3939,"text":96},{"id":2323,"depth":3939,"text":2324},{"id":3425,"depth":3939,"text":3426},{"id":3581,"depth":3939,"text":3582},{"id":938,"depth":3939,"text":3718},[],"computer-science","This builds on\nImitation Learning: Cloning, DAgger, and Inverse RL,\nwhich built behavioral cloning (and its T2ϵ compounding error), DAgger (which\nqueries an interactive expert on the learner's own states), and inverse RL (which\nrecovers the reward the expert optimizes, resolving the ill-posedness with the\nmaximum-entropy principle at the cost of a forward-RL solve in the inner loop).",false,"md",{"moduleNumber":3952,"lessonNumber":3953,"order":3954},5,12,512,"Modern Deep Reinforcement Learning",true,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2",[],"---\ntitle: \"Imitation as Adversarial Matching: GAIL and AIRL\"\nmodule: Modern Deep Reinforcement Learning\nmoduleNumber: 5\nlessonNumber: 12\norder: 512\nsummary: >\n  A companion to the imitation-learning lesson. If the point of recovering a reward is\n  only to re-run RL and match the expert, you can skip the reward and match the\n  behavior directly. GAIL casts imitation as a GAN — a discriminator separating expert\n  from learner state-action pairs supplies the reward a policy-gradient method\n  optimizes — matching occupancy measures without ever naming a reward. AIRL reads a\n  transferable reward back out of the discriminator. We compare all four methods and\n  close with reward models in RLHF, scaled cloning, and diffusion policies.\ntopics: [Deep RL]\nsources:\n  - book: Sutton & Barto\n    ref: \"Ch. 3 — Finite Markov Decision Processes; Ch. 13 — Policy Gradient Methods\"\n  - book: Grokking Deep RL\n    ref: \"Ch. 12 — advanced actor-critic; learning from demonstrations\"\n---\n\nThis builds on\n[Imitation Learning: Cloning, DAgger, and Inverse RL](\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl),\nwhich built behavioral cloning (and its $T^2\\epsilon$ compounding error), DAgger (which\nqueries an interactive expert on the learner's own states), and inverse RL (which\nrecovers the reward the expert optimizes, resolving the ill-posedness with the\nmaximum-entropy principle at the cost of a forward-RL solve in the inner loop).\n\nThat inner solve is the opening this lesson exploits. If recovering a reward only ever\nserves to re-run RL and reproduce the expert, the reward can be dissolved entirely —\nmatch the behavior directly, as an adversarial game — and then, if a portable reward is\nstill wanted, read one back out of that game.\n\n## GAIL: imitation as a GAN\n\nMaximum-entropy IRL suggests a suspicion that Ho and Ermon made precise: if the\nwhole point of recovering a reward is to run RL and reproduce the expert's behavior,\nmaybe you can **skip the reward** and match the behavior directly. Their reframing\nstarts from the object that actually characterizes a policy's long-run behavior, the\n**occupancy measure**.\n\n> **Definition (Occupancy measure).** For a policy $\\pi$, the discounted\n> distribution of state-action pairs it visits,\n> $\\rho_\\pi(s,a) = \\pi(a \\mid s)\\sum_{t} \\gamma^t\\, \\Pr(s_t = s \\mid \\pi)$. Two\n> policies are identical if and only if their occupancy measures are identical, so\n> matching occupancy measures amounts to imitation. Expected reward is linear in\n> the occupancy measure, $\\sum_{s,a}\\rho_\\pi(s,a)\\,r(s,a)$.\n\n$$\n% caption: Occupancy-measure matching. The expert's discounted state-action visits\n% (blue) form a distribution over the space; the learner's current occupancy (red)\n% differs. GAIL drives the learner's occupancy toward the expert's until the two\n% distributions coincide, which is exactly imitation, since two policies are equal\n% iff their occupancy measures are equal.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\draw[->, black] (-0.2,0) -- (9.2,0) node[anchor=north, black, font=\\footnotesize] {state-action space};\n  \\draw[->, black] (0,-0.2) -- (0,3.4) node[anchor=east, black, font=\\footnotesize] {visitation};\n  % expert occupancy: peak around 3\n  \\draw[acc, very thick, smooth] plot coordinates {(0.4,0.3)(1.4,0.7)(2.4,1.9)(3.2,2.6)(4.0,2.0)(5.0,0.9)(6.2,0.4)(7.6,0.25)(8.7,0.2)};\n  \\node[acc, anchor=west, font=\\scriptsize] at (3.3,2.7) {expert occupancy};\n  % learner occupancy: peak shifted right\n  \\draw[red, thick, dashed, smooth] plot coordinates {(0.4,0.2)(1.4,0.3)(2.4,0.5)(3.6,0.9)(4.8,1.7)(5.8,2.1)(6.6,1.5)(7.6,0.7)(8.7,0.35)};\n  \\node[red, anchor=west, font=\\scriptsize] at (5.8,2.15) {learner occupancy};\n  \\draw[->, black, thick] (5.6,1.0) -- (4.2,1.0) node[midway, above, font=\\scriptsize] {push toward expert};\n\\end{tikzpicture}\n$$\n\nHo and Ermon show that running RL on the reward IRL recovers is\nequivalent to finding a policy whose occupancy measure $\\rho_\\pi$ is close\nto the expert's $\\rho_{\\pi_E}$ under a particular divergence. The reward is an\nintermediary that can be dissolved: **directly minimize a divergence between\n$\\rho_\\pi$ and $\\rho_{\\pi_E}$** and you imitate without ever naming a reward. And\nwhen the divergence is the Jensen-Shannon divergence, minimizing it becomes the\nobjective a **generative adversarial network** optimizes.[^gail]\n\nThis yields **Generative Adversarial Imitation Learning** (GAIL). A **discriminator**\n$D_\\psi(s,a) \\to (0,1)$ is trained to tell expert state-action pairs from the\nlearner's, outputting the probability that a pair came from the expert. The\n**policy** $\\pi_\\theta$ plays the role of the GAN's generator: it is trained to\nproduce state-action pairs the discriminator _cannot_ distinguish from the expert's.\nThe two optimize the adversarial objective\n\n$$\n\\min_{\\theta}\\ \\max_{\\psi}\\;\n\\mathbb{E}_{(s,a)\\sim \\rho_{\\pi_E}}\\!\\bigl[\\log D_\\psi(s,a)\\bigr]\n\\;+\\;\n\\mathbb{E}_{(s,a)\\sim \\rho_{\\pi_\\theta}}\\!\\bigl[\\log\\bigl(1 - D_\\psi(s,a)\\bigr)\\bigr]\n\\;-\\; \\lambda\\, H(\\pi_\\theta),\n$$\n\nwith an entropy bonus $H(\\pi_\\theta)$ inherited from the maximum-entropy view. The\ndiscriminator maximizes its ability to separate the two distributions; the policy\nminimizes it, driving $\\rho_{\\pi_\\theta}$ toward $\\rho_{\\pi_E}$. The\npolicy cannot be trained by supervised backprop through $D$ — the state-action pairs\ncome from _running the policy in the environment_, so the discriminator's verdict\nbecomes a **reward signal** the policy improves against by an ordinary\n[policy-gradient](\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods)\nupdate. Concretely, $-\\log\\bigl(1 - D_\\psi(s,a)\\bigr)$ (high when $D$ is fooled)\nplays the role of $r(s,a)$, and TRPO or PPO does the [value-function](\n\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality)-based credit\nassignment.\n\n$$\n% caption: The GAIL adversarial loop. The discriminator learns to separate expert\n% state-action pairs from the policy's rollouts; its output is fed back as a reward\n% the policy maximizes by policy gradient, pushing the learner's occupancy measure\n% toward the expert's until the discriminator can no longer tell them apart.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize,\n  box\u002F.style={draw, minimum width=28mm, minimum height=12mm, align=center}]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\node[box, draw=acc, text=acc, thick] (pol) at (0,0) {policy (generator)};\n  \\node[box] (env) at (0,-2.6) {environment:\\\\rollout (s, a) pairs};\n  \\node[box, draw=red, text=red, thick] (disc) at (6.4,-1.3) {discriminator D};\n  \\node[box] (exp) at (6.4,1.5) {expert pairs};\n  % policy -> env\n  \\draw[->, acc, thick] (pol) -- (env) node[midway, left, font=\\scriptsize] {act};\n  % env rollouts -> discriminator\n  \\draw[->, black, thick] (env) -- (disc) node[midway, below, font=\\scriptsize] {learner (s, a)};\n  % expert -> discriminator\n  \\draw[->, black, thick] (exp) -- (disc) node[midway, right, font=\\scriptsize] {expert (s, a)};\n  % discriminator -> policy as reward\n  \\draw[->, red, thick] (disc) to[bend right=22] node[midway, above, font=\\scriptsize] {reward = -log(1 - D)} (pol);\n\\end{tikzpicture}\n$$\n\nGAIL matches the theoretical power of maximum-entropy IRL — it recovers the same\noccupancy-matching behavior — but pays none of IRL's double-loop cost, because the\ndiscriminator replaces the nested forward-RL solve with a cheap classification step.\nIt scales to high-dimensional continuous control where classical IRL is intractable,\nand it learns from a fixed demonstration set (no interactive expert, unlike DAgger).\nThe price is GAN training: adversarial optimization is delicate, sample-hungry in\nenvironment steps (each policy-gradient update needs fresh rollouts), and prone to\nthe instabilities familiar from the\n[generative-adversarial-network](\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks)\nlesson — mode collapse, oscillation, and a discriminator that outpaces the\ngenerator. GAIL is the conceptual bridge: the same min-max game that generates\nphotorealistic images, pointed at trajectories, produces expert-like behavior.\n\n## From GAIL back to a reward: adversarial IRL\n\nGAIL buys efficiency by _dissolving_ the reward — it matches occupancy measures and\nnever names $r(s,a)$. That is the right trade when you only want the behavior, but\nit forfeits IRL's original benefit: a reward that transfers to new dynamics. The\nresolution is to keep GAIL's adversarial machinery yet read a reward back out of the\ndiscriminator, and two lines of work do exactly that.\n\n**Guided Cost Learning** (Finn, Levine, Abbeel 2016) makes maximum-entropy IRL\npractical for deep continuous control by replacing the intractable partition\nfunction $Z$ with a sampling-based estimate — importance-sampled from the current\npolicy — so the reward network can be trained by gradient descent without an exact\ninner solve.[^gcl] Finn et al. then showed this sampling-based IRL is _formally the\nsame algorithm_ as a GAN with a particular discriminator form, making explicit the\nGAIL connection: the discriminator and the reward are two views of one object.\n\n**Adversarial Inverse Reinforcement Learning** (Fu, Luo, Levine 2018) exploits that\nview to recover a reward that generalizes. It constrains the discriminator to the\nform\n\n$$\nD_\\psi(s, a, s') = \\frac{\\exp\\bigl(f_\\psi(s, a, s')\\bigr)}{\\exp\\bigl(f_\\psi(s,a,s')\\bigr) + \\pi(a \\mid s)},\n\\qquad\nf_\\psi = g_\\psi(s) + \\gamma\\, h_\\psi(s') - h_\\psi(s),\n$$\n\nso that at convergence $g_\\psi(s)$ recovers the reward and $h_\\psi$ absorbs the\npotential-shaping term the reward is ambiguous up to (the same $\\gamma\\phi(s') -\n\\phi(s)$ shaping that made IRL ill-posed).[^airl] Because AIRL isolates the\n_state-only_ reward $g_\\psi$ from the shaping, the recovered reward transfers across\nchanges in dynamics: under new physics it still specifies the same goal, where\nGAIL's occupancy-matched policy would have to relearn from scratch. AIRL is the deep,\nadversarial descendant of MaxEnt IRL, closing the loop back to a portable reward\nwithout paying the classical double-loop cost.\n\n$$\n% caption: The imitation-learning family as a single spectrum. Behavioral cloning\n% copies actions; DAgger copies actions on the learner's own states; GAIL matches\n% occupancy without a reward; MaxEnt IRL, Guided Cost Learning, and AIRL recover an\n% explicit reward, trading more computation for a transferable object.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize,\n  node distance=0mm]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\draw[->, black] (-0.3,0) -- (11.2,0);\n  \\node[black, anchor=north west, font=\\scriptsize] at (-0.3,-0.15) {copy behavior};\n  \\node[black, anchor=north east, font=\\scriptsize] at (11.2,-0.15) {recover reward (transfers)};\n  \\foreach \\x\u002F\\lbl\u002F\\c in {0.3\u002FBC\u002Facc, 2.6\u002FDAgger\u002Facc, 5.4\u002FGAIL\u002Fred, 7.7\u002F{MaxEnt IRL}\u002Fred, 10.4\u002FAIRL\u002Fred} {\n    \\fill[\\c] (\\x,0) circle (2pt);\n    \\node[\\c, anchor=south, font=\\scriptsize] at (\\x,0.15) {\\lbl};\n  }\n\\end{tikzpicture}\n$$\n\n## Choosing an approach\n\nThe four methods sort along one axis — how much work they do to handle the\ncovariate shift that sinks naive cloning.\n\n| Method | What it produces | Handles covariate shift? | Cost | Needs |\n| --- | --- | --- | --- | --- |\n| Behavioral cloning | a policy, by supervised learning | no — $T^2\\epsilon$ compounding | very cheap (one fit) | a fixed demo set |\n| DAgger | a policy, over aggregation rounds | yes — trains on learner's states | moderate | an **interactive** expert |\n| Max-Ent IRL | a reward function | yes — reward generalizes | expensive (RL in the inner loop) | a fixed demo set + forward solver |\n| GAIL | a policy, adversarially | yes — matches occupancy measure | expensive (GAN + env rollouts) | a fixed demo set + environment |\n\nBehavioral cloning is the honest baseline: reach for it first, especially as a warm\nstart, and accept that its policy drifts once it leaves the demonstrated states. If\nyou have a queryable expert, DAgger fixes the drift directly and cheaply. If you\nneed a reward that transfers to new tasks or want the possibility of beating the\ndemonstrator, IRL recovers one, at the cost of a nested RL solve. If you only need\nthe behavior and have environment access but no interactive expert, GAIL matches the\nexpert's occupancy measure through the adversarial game, trading IRL's inner loop for\nGAN instability.\n\n## Reward models, diffusion policies, and scaled cloning\n\nImitation learning has moved well past the four classical methods, in directions\nSutton & Barto do not cover.\n\n**IRL is the reward model in RLHF.** The single largest deployment of inverse\nreward learning is aligning language models. A reward model trained on human\npreference comparisons is an IRL step in disguise: it recovers a scalar reward that\n\"explains\" which of two responses a human preferred, then ordinary RL (PPO)\noptimizes a policy against it (Christiano et al. 2017; Ouyang et al. 2022,\nInstructGPT).[^rlhf] The connection to this lesson is exact — preference-based\nreward learning is IRL with pairwise-comparison supervision instead of full\ndemonstrations, and the KL penalty that keeps the tuned model near the reference is\nthe same \"stay near the demonstrator\" pressure that stabilizes imitation. Direct\nPreference Optimization (Rafailov et al. 2023) later showed the reward model can be\nskipped entirely, folding the IRL and RL steps into one supervised loss.\n\n**Behavioral cloning, scaled, is competitive again.** The $T^2\\epsilon$ pessimism\nis a worst case, and modern practice has learned to blunt it without an interactive\nexpert. Two levers matter. First, _sheer scale_: robotics foundation models such as\n**RT-1** (Brohan et al. 2022) and **RT-2** are behavioral clones trained on\nenormous, diverse teleoperation datasets, where broad coverage means the policy\nrarely leaves the demonstrated distribution in the first place. Second, _expressive\naction distributions_: **Diffusion Policy** (Chi et al. 2023) clones by fitting a\ndiffusion model over action sequences rather than a unimodal Gaussian, which\ncaptures the multi-modality of human demonstrations (a human might swerve left _or_\nright around an obstacle) that a mean-squared clone averages into an unusable\nin-between. Modeling the full action distribution, not its mean, turns out to fix\nmuch of what made naive cloning brittle.\n\n$$\n% caption: Why expressive action distributions matter for cloning. Human\n% demonstrations are multi-modal: at an obstacle, experts go left OR right. A\n% unimodal (Gaussian) clone fits the mean of the two modes and drives straight into\n% the obstacle; a diffusion policy captures both modes and commits to one.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\draw[->, black] (-0.2,0) -- (9.2,0) node[anchor=north, black, font=\\footnotesize] {steering action};\n  \\draw[->, black] (0,-0.2) -- (0,3.2) node[anchor=east, black, font=\\footnotesize] {density};\n  % two expert modes\n  \\draw[acc, very thick, smooth] plot coordinates {(0.5,0.1)(1.6,0.5)(2.4,2.4)(3.0,0.6)(3.8,0.15)(4.6,0.6)(5.6,2.4)(6.4,0.5)(7.4,0.1)};\n  \\node[acc, anchor=south, font=\\scriptsize] at (2.4,2.4) {left};\n  \\node[acc, anchor=south, font=\\scriptsize] at (5.6,2.4) {right};\n  \\node[acc, anchor=west, font=\\scriptsize] at (6.6,1.4) {di\\\u002Ff\\\u002Ffusion: both modes};\n  % unimodal clone: mean between them -> straight into obstacle\n  \\draw[red, thick, dashed, smooth] plot coordinates {(2.6,0.1)(3.4,0.8)(4.0,1.5)(4.6,0.8)(5.4,0.1)};\n  \\fill[red] (4.0,1.5) circle (2pt);\n  \\node[red, anchor=west, font=\\scriptsize] at (0.3,0.75) {clone averages: hits obstacle};\n\\end{tikzpicture}\n$$\n\n**Offline imitation and observation-only learning.** GAIL needs environment\nrollouts; **ValueDICE** and related \"DICE\" methods (Kostrikov et al. 2019) match\noccupancy measures entirely offline, from a fixed dataset, closing the gap to the\noffline-RL lesson. And when only expert _states_ are available with no action\nlabels — video of an expert, say — imitation-from-observation methods recover\nbehavior by matching state occupancy alone, extending the occupancy-matching view of\nGAIL to the label-free setting.\n\nThe through-line is the covariate-shift diagnosis. Behavioral cloning fails because\nit trains on one distribution and is tested on another that its own actions create;\nevery method that beats it does so by confronting the distribution the learner\nactually visits — DAgger by labelling those states, IRL and GAIL by matching the\nlong-run occupancy the learner induces rather than the individual actions the expert\ntook. Demonstrations can stand in for a reward, but only once you stop treating\ncontrol as if it were supervised learning.\n\n\n[^gail]: **Ho & Ermon (2016)**, \"Generative Adversarial Imitation Learning\", NeurIPS — shows that RL on the IRL-recovered reward reduces to occupancy-measure matching, and casts it as a GAN: a discriminator separating expert from learner state-action pairs supplies the reward a policy-gradient method optimizes, imitating without an explicit reward.\n[^gcl]: **Finn, Levine, Abbeel (2016)**, \"Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization\", ICML — sampling-based maximum-entropy IRL for deep continuous control, estimating the partition function from policy samples; the companion note (Finn, Christiano, Abbeel, Levine 2016) shows the algorithm is equivalent to a GAN with a specific discriminator, tying IRL to GAIL.\n[^airl]: **Fu, Luo, Levine (2018)**, \"Learning Robust Rewards with Adversarial Inverse Reinforcement Learning\", ICLR — AIRL constrains the discriminator to a reward-plus-shaping form $f = g(s) + \\gamma h(s') - h(s)$, recovering a state-only reward $g$ that is disentangled from potential shaping and therefore transfers across changes in the dynamics.\n[^rlhf]: **Christiano, Leike, Brown, Martic, Legg, Amodei (2017)**, \"Deep Reinforcement Learning from Human Preferences\", NeurIPS — learns a reward model from pairwise human preferences and optimizes a policy against it; **Ouyang et al. (2022)**, \"Training language models to follow instructions with human feedback\" (InstructGPT), applies the same preference-based reward-learning-then-PPO pipeline to align a large language model.\n",{"text":3961,"minutes":3962,"time":3963,"words":3964},"9 min read",8.095,485700,1619,{"title":5,"description":3948},[3967,3970],{"book":3968,"ref":3969},"Sutton & Barto","Ch. 3 — Finite Markov Decision Processes; Ch. 13 — Policy Gradient Methods",{"book":3971,"ref":3972},"Grokking Deep RL","Ch. 12 — advanced actor-critic; learning from demonstrations","available","07.reinforcement-learning\u002F05.modern-deep-rl\u002F12.imitation-and-inverse-rl-part-2","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",[3977],"Deep RL","cZI60fsLoCJNBzLAaUc4PrFwXTN70jxlnjbsnFtgjbA",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":3980,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":3981,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":3982,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":3983,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":3984,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":3985,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":3986,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":3987,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":3988,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":3989,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":3990,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":3991,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":3992,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":3993,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":3994,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":3995,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":3996,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":3997,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":3998,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":3999,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":4000,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":4001,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":4002,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":4003,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":4004,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":4005,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":4006,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":4007,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":4008,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":4009,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":4010,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":4011,"\u002Falgorithms\u002Fsequences\u002Ftries":4012,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":4013,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":4014,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":4015,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":4016,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":4017,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":4018,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":4019,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":4020,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":4021,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":4022,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":4023,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":4024,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":4025,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":4026,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":4027,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":4028,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":4029,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":4030,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":4031,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":4032,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":4033,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":4034,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":4035,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":4036,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":4037,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":4038,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":4039,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":4040,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":4041,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":4042,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":4043,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":4044,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":4045,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":4046,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":4047,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":4048,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":4049,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":4050,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":4051,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":4052,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":4053,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":4054,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":4055,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":4056,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":4057,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":4058,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":4059,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":4060,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":4061,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":4062,"\u002Falgorithms":4063,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":4064,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":4065,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":4066,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":4067,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":4068,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":4069,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":4070,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":4071,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":4072,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":4073,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":4074,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":4075,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":4076,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":4077,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":4078,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":4079,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":4080,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":4081,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":4082,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":4083,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":4084,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":4085,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":4086,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":4087,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":4088,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":4089,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":4090,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":4091,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":4092,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":4093,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":4094,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":4095,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":4096,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":4097,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":4078,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":4098,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":4099,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":4100,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":4068,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":4101,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":4102,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":4103,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":4104,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":4105,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":4106,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":4107,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":4108,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":4109,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":4110,"\u002Fcalculus":4111,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":4112,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":4113,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":4114,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":4115,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":4116,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":4117,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":4118,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":4119,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":4120,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":4121,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":4122,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":4123,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":4124,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":4125,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":4126,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":4127,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":4128,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":4129,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":4130,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":4131,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":4132,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":4133,"\u002Fmechanics\u002Frotation\u002Frolling-motion":4134,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":4135,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":4136,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":4137,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":4138,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":4139,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":4140,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":4141,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":4142,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":4143,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":4144,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":4145,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":4146,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":4147,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":4148,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":4149,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":4150,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":4151,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":4152,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":4153,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":4154,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":4155,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":4156,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":4157,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":4158,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":4159,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":4160,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":4161,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":4162,"\u002Fmechanics":4163,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":4164,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":4165,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":4166,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":4167,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":4168,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":4169,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":4170,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":4171,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":4172,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":4173,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":4174,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":4175,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":4152,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":4176,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":4177,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":4178,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":4148,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":4013,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":4179,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":4139,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":4180,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":4181,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":4182,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":4183,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":4184,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":4185,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":4186,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":4187,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":4188,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":4113,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":4189,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":4190,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":4191,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":4192,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":4193,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":4194,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":4195,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":4196,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":4131,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":4130,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":4197,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":4198,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":4199,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":4200,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":4201,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":4202,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":4203,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":4204,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":4205,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":4157,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":4155,"\u002Felectricity-and-magnetism":4206,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":4207,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":4208,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":4209,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":4210,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":4211,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":4212,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":4213,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":4214,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":4215,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":4065,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":4216,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":4217,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":4069,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":4218,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":4219,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":4220,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":4221,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":4222,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":4223,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":4224,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":4225,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":4226,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":4227,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":4228,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":4229,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":4230,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":4231,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":4232,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":4233,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":4234,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":4235,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":4236,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":4237,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":4104,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":4238,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":4239,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":4240,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":4241,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":4242,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":4243,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":4244,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":4245,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":4246,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":4247,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":4248,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":4249,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":4250,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":4251,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":4252,"\u002Flinear-algebra":4253,"\u002Ftheory-of-computation":4254,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":4255,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":4256,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":4257,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":4258,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":4259,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":4260,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":4261,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":4262,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":4263,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":4264,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":4265,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":4266,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":4267,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":4268,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":4269,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":4270,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":4271,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":4272,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":4273,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":4274,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":4275,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":4276,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":4277,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":4278,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":4279,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":4280,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":4281,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":4282,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":4283,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":4284,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":4285,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":4286,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":4287,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":4288,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":4289,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":4290,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":4291,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":4292,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":4293,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":4294,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":4295,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":4296,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":4297,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":4298,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":4299,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":4300,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":4301,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":4302,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":4303,"\u002Fcomputer-architecture":4254,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":4304,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":4305,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":4306,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":4069,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":4307,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":4068,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":4075,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":4308,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":4309,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":4109,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":4310,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":4311,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":4312,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":4313,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":4314,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":4315,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":4316,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":4317,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":4318,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":4319,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":4320,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":4321,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":4316,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":4322,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":4323,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":4324,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":4325,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":4326,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":4327,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":4328,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":4329,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":4330,"\u002Fdifferential-equations":4331,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":4332,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":4333,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":4334,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":4335,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":4214,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":4336,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":4337,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":4338,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":4339,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":4340,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":4341,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":4084,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":4342,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":4343,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":4344,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":4345,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":4346,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":4347,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":4348,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":4349,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":4350,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":4351,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":4306,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":4352,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":4353,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":4354,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":4355,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":4356,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":4235,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":4357,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":4358,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":4245,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":4359,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":4360,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":4361,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":4362,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":4363,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":4364,"\u002Frelativity":4365,"\u002Fphysical-computing":4254,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":4366,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":4345,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":4367,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":4368,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":4369,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":4370,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":4371,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":4372,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":4373,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":4321,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":4245,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":4374,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":4375,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":4376,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":4377,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":4373,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":4378,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":4353,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":4106,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":4379,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":4380,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":4086,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":4381,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":4382,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":4383,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":4384,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":4385,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":4386,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":4387,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":4388,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":4389,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":4345,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":4390,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":4391,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":4392,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":4379,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":4067,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":4393,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":4394,"\u002Fquantum-mechanics":4395,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":4329,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":4396,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":4397,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":4218,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":4398,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":4104,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":4399,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":4400,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":4241,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":4351,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":4401,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":4402,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":4403,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":4404,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":4405,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":4378,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":4406,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":4211,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":4407,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":4408,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":4065,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":4409,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":4410,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":4367,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":4094,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":4245,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":4411,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":4412,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":4230,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":4355,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":4413,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":4414,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":4415,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":4250,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":4416,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":4417,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":4418,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":4418,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":4419,"\u002Freal-analysis":4420,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":4421,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":4422,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":4423,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":4424,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":4425,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":4426,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":4427,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":4428,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":4429,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":4430,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":4394,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":4431,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":4423,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":4340,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":4432,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":4433,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":4434,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":4435,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":4436,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":4437,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":4438,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":4439,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":4433,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":4440,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":4409,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":4441,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":4442,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":4443,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":4444,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":4445,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":4446,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":4447,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":4448,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":4449,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":4450,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":4083,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":4451,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":4452,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":4325,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":4453,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":4454,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":4382,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":4454,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":4455,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":4456,"\u002Fabstract-algebra":4457,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":4458,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":4459,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":4460,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":4461,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":4462,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":4374,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":4463,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":4464,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":4465,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":4466,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":4467,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":4468,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":4469,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":4208,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":4337,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":4083,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":4470,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":4067,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":4471,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":4472,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":4105,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":4399,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":4473,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":4474,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":4475,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":4476,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":4477,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":4478,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":4479,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":4480,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":4481,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":4482,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":4483,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":4484,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":4485,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":4486,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":4430,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":4487,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":4488,"\u002Fatomic-physics":4489,"\u002Fdatabases":4254,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":4490,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":4491,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":4492,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":4421,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":4493,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":4494,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":4495,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":4496,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":4497,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":4498,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":4499,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":4500,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":4501,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":4502,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":4503,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":4504,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":4505,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":4506,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":4507,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":4508,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":4509,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":4510,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":4511,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":4512,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":4503,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":4513,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":4514,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":4515,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":4516,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":4517,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":4462,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":4518,"\u002Fcategory-theory":4519,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":4520,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":4521,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":4522,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":4523,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":4524,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":4525,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":4484,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":4526,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":4527,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":4528,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":4529,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":4530,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":4531,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":4532,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":4533,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":4534,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":4535,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":4536,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":4537,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":4538,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":4539,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":4540,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":4541,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":4542,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":4543,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":4544,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":4545,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":4546,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":4547,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":4548,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":4549,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":4550,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":4551,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":4552,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":4496,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":4553,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":4554,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":4555,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":4556,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":4557,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":4558,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":4559,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":4048,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":4560,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":4561,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":4284,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":4562,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":4563,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":4564,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":4565,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":4566,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":4567,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":4568,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":4569,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":4570,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":4571,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":4572,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":4573,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":4257,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":4574,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":4575,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":4576,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":4577,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":4294,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":4578,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":4579,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":4580,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":4581,"\u002Fdeep-learning":4254,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":4582,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":4379,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":4583,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":4584,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":4585,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":4586,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":4587,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":4588,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":4589,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":4590,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":4426,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":4591,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":4592,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":4593,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":4313,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":4106,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":4594,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":4595,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":4596,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":4240,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":4597,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":4598,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":4318,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":4245,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":4599,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":4214,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":4084,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":4100,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":4600,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":4601,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":4602,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":4232,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":4603,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":4094,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":4604,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":4605,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":4606,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":4607,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":4428,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":4608,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":4609,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":4610,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":4611,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":4374,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":4612,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":4352,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":4613,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":4213,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":4614,"\u002Fstatistical-mechanics":4615,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":4616,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":4079,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":4339,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":4617,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":4618,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":4619,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":4620,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":4621,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":4622,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":4212,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":4623,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":4624,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":4625,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":4626,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":4355,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":4627,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":4628,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":4629,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":4630,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":4631,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":4410,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":4354,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":4632,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":4633,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":4634,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":4635,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":4345,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":4636,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":4637,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":4582,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":4482,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":4209,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":4638,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":4075,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":4639,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":4640,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":4220,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":4641,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":4475,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":4642,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":4067,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":4643,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":4078,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":4644,"\u002Fcondensed-matter":4395,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":4645,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":4646,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":4647,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":4648,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":4092,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":4649,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":4650,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":4092,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":4651,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":4505,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":4652,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":4653,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":4654,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":4652,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":4655,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":4656,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":4657,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":4658,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":4659,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":4660,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":4661,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":4662,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":4583,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":4663,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":4656,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":4664,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":4665,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":4298,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":4666,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":4483,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":4667,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":4668,"\u002Flogic":4669,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":4670,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":4671,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":4284,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":4672,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":4673,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":4674,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":4675,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":4665,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":4676,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":4677,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":4678,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":4576,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":4679,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":4680,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":4681,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":4682,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":4683,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":4301,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":4684,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":4685,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":4686,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":4687,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":4492,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":4688,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":4664,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":4689,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":4690,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":4691,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":4312,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":4692,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":4442,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":4693,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":4694,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":4274,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":4695,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":4696,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":4697,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":4698,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":4699,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":4552,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":4700,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":4701,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":4702,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":4587,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":4703,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":4704,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":4705,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":4301,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":4368,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":4706,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":4707,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":3964,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":4708,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":4709,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":4710,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":4711,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":4712,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":4713,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":4714,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":4715,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":4716,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":4717,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":4718,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":4719,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":4720,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":4721,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":4722,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":4723,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":4724,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":4725,"\u002Freinforcement-learning":4254,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":4726,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":4727,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":4728,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":4729,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":4730,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":4731,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":4732,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":4733,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":4734,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":4735,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":4736,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":4737,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":4738,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":4581,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":4436,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":4739,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":4740,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":4741,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":4742,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":4743,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":4744,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":4563,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":4745,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":4746,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":4747,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":4748,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":4749,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":4750,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":4751,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":4752,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":4753,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":4754,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":4755,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":4756,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":4495,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":4746,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":4757,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":4035,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":4758,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":4759,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":4760,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":4761,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":4762,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":4544,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":4763,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":4764,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":4765,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":4766,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":4767,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":4768,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":4769,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":4770,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":4771,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":4772,"\u002Fartificial-intelligence":4254,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":4511,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":4773,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":4071,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":4069,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":4605,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":4774,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":4097,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":4407,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":4775,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":4776,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":4777,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":4467,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":4778,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":4779,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":4780,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":4666,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":4781,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":4782,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":4081,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":4310,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":4783,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":4411,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":4784,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":4785,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":4306,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":4394,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":4786,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":4787,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":4788,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":4076,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":4451,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":4313,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":4789,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":4361,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":4425,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":4790,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":4791,"\u002Fnuclear-physics":4792,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":4793,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":4794,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":4432,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":4795,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":4796,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":4797,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":4280,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":4798,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":4799,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":4577,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":4800,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":4745,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":4801,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":4802,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":4803,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":4804,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":4805,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":4806,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":4807,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":4258,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":4808,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":4809,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":4751,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":4810,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":4811,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":4812,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":4813,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":4814,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":4815,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":4816,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":4817,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":4676,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":4818,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":4819,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":4820,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":4821,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":4822,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":4823,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":4824,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":4825,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":4826,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":4827,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":4828,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":4829,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":4530,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":4697,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":4286,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":4830,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":4831,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":4832,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":4833,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":4544,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":4834,"\u002Fnatural-language-processing":4254,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":4835,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":4452,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":4836,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":4597,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":4837,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":4838,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":4786,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":4839,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":4840,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":4402,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":4104,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":4841,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":4356,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":4842,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":4389,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":4843,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":4643,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":4844,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":4845,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":4612,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":4846,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":4075,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":4847,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":4848,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":4849,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":4393,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":4609,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":4850,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":4851,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":4468,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":4852,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":4513,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":4853,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":4854,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":4402,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":4435,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":4855,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":4856,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":4857,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":4491,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":4858,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":4232,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":4859,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":4335,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":4860,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":4861,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":4659,"\u002Fparticle-physics":4862,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":4453,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":4607,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":4863,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":4392,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":4864,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":4452,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":4364,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":4865,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":4866,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":4867,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":4868,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":4869,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":4658,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":4589,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":4870,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":4871,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":4872,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":4873,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":4785,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":4874,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":4348,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":4411,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":4393,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":4875,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":4477,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":4093,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":4876,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":4877,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":4608,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":4878,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":4879,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":4880,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":4881,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":4074,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":4882,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":4883,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":4335,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":4884,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":4885,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":4601,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":4256,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":4886,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":4887,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":4513,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":4499,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":4511,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":4608,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":4888,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":4073,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":4265,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":4889,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":4352,"\u002Fastrophysics-cosmology":4457,"\u002Fcolophon":4890,"\u002F":4254},4250,4808,3626,2682,4109,4786,3878,3875,3751,3415,4067,3153,3000,4042,5461,5808,3961,3749,4327,5067,4246,4655,4154,5436,2640,4003,3601,2158,4331,4189,2273,3252,4633,4964,4172,3131,5524,3160,4031,2309,4207,3226,2648,4842,5340,3307,5701,4977,4039,2615,3472,4460,3848,4075,4400,3382,3010,3602,3737,3740,3707,3922,5191,4043,3804,4542,4214,5062,2850,4361,3443,3627,4044,3766,4140,3860,4006,5199,4334,5234,3651,5509,5680,153,1375,1073,1093,1125,1146,1014,1132,876,1541,1189,1173,984,1402,1301,950,1268,1063,1107,1408,1161,925,1012,866,964,1090,1142,1085,1020,1207,973,980,728,764,1225,1329,796,929,801,878,774,1044,1488,1175,1130,890,814,870,154,4073,5140,4961,5127,4870,5382,5195,4955,5369,4501,5576,3824,4132,4289,4307,4570,3403,5084,5105,5201,5116,5341,5175,5368,5188,5211,5499,5155,4981,5125,5415,5255,5304,5130,5167,5552,5164,5094,5239,5036,5190,5004,5099,5035,5159,5088,5026,4937,5023,5264,5244,133,5114,5078,5043,5312,5170,5342,5139,5151,5049,5212,5013,5068,5079,5102,5121,5081,5029,5379,5854,5110,2139,3798,5055,5364,4984,4935,4895,4972,5289,5112,5156,4987,5031,5025,5149,5302,5042,5002,4979,4922,4960,5279,126,1877,1180,1129,907,958,1112,1300,1053,1250,1181,1241,1234,966,1050,734,1190,484,1082,926,733,761,571,607,798,804,952,977,731,784,645,771,1017,742,1004,1000,1562,1254,1288,1101,1011,1486,1061,856,992,1169,988,137,0,2037,1782,2384,2254,2123,2332,1643,1714,2089,1751,1367,1660,2511,1998,1892,1854,1791,2438,2487,1917,2375,2525,2266,1845,2275,1810,1631,2310,2166,2233,2113,2505,2347,2672,2112,2473,2592,2380,3013,2513,3256,3218,2194,2173,2205,2326,2081,3342,3152,1799,1670,1027,960,1095,1291,986,897,1209,1055,1817,1801,1593,1465,1196,1464,1201,1230,1435,1684,1461,1926,1500,1409,1284,1774,1869,162,1487,1122,1188,1001,1351,982,1005,979,1325,1046,943,1279,824,1008,989,1798,1277,1025,987,1043,1211,1074,981,939,1002,739,1139,1108,1013,1070,978,1458,1317,157,1357,1077,2355,1116,1037,1178,1637,1314,1109,1056,1702,1474,1071,1158,832,993,1404,1024,1068,1339,1106,1264,1248,913,1848,1328,1633,1224,1143,135,1378,959,1028,998,911,1527,1203,1266,1483,1165,990,938,965,1257,1418,1099,942,1352,956,1035,1398,1003,1094,1292,138,1721,1827,1449,1354,1148,1184,1285,1281,1213,1290,1271,1252,1274,1778,1591,1503,1437,1571,1584,1957,1117,1781,1648,1342,1667,1510,1965,1607,1365,1849,1259,1303,1356,1238,2208,1564,173,1671,1286,1227,1638,1529,668,1078,918,709,865,880,940,1534,1015,874,922,841,794,1194,822,1105,1658,1359,1296,1438,1921,1844,1570,1429,1324,1400,140,1787,1558,1654,1492,1747,2224,2002,2009,1323,1349,1785,1573,1722,1829,1353,1548,1552,1583,1624,1585,1245,1364,1514,1343,1397,1355,2211,1481,1770,160,2388,2293,2256,2552,2569,2478,2039,2496,2578,2814,2519,2461,2587,2492,2714,3278,2654,3050,2447,2849,2238,2369,2061,2214,2602,2563,2186,2985,2749,3364,2038,2282,2409,2126,2573,2206,2176,2268,2182,2402,2705,2633,2414,2213,2801,3313,3410,3195,1952,2017,1509,2537,2645,2027,2415,2838,2356,1906,3184,2950,2807,2954,1683,1316,1034,1138,1763,1822,1705,1246,1701,1097,1104,1187,1032,1083,1228,916,1489,1033,1652,997,692,837,1023,888,864,1089,1231,1214,1675,1156,1075,1520,1309,139,1205,1051,735,1123,1072,915,567,768,825,1253,983,1007,762,1058,861,862,971,1208,1149,1145,1029,1084,927,810,838,857,807,936,949,2321,1622,1069,1113,1057,854,1958,1528,1618,2049,1432,1679,1796,1685,1346,1275,1476,1505,1610,2018,1599,1215,1838,1909,132,3902,2215,2240,3266,3208,3073,2454,2969,2451,1875,2728,1884,2371,2516,2842,1690,1904,2346,3146,1386,2607,1966,2668,1665,2885,1606,2577,3074,2869,2403,2433,2082,1939,1587,2460,2747,2032,2642,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":4892,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":4897,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":4901,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":4905,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":4909,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":4913,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":4917,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":4922,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":4926,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":4930,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":4934,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":4939,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":4943,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":4947,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":4951,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":4956,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":4960,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":4964,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":4968,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":4972,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":4976,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":4980,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":4984,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":4988,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":4992,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":4996,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":5000,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":5005,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":5009,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":5013,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":5017,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":5021,"\u002Falgorithms\u002Fsequences\u002Ftries":5025,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":5029,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":5033,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":5038,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":5042,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":5046,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":5050,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":5054,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":5058,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":5062,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":5066,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":5070,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":5074,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":5078,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":5082,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":5086,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":5090,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":5095,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":5099,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":5103,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":5107,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":5111,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":5116,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":5120,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":5124,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":5128,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":5132,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":5136,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":5140,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":5144,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":5148,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":5152,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":5156,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":5161,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":5165,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":5169,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":5173,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":5178,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":5182,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":5186,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":5190,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":5194,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":5198,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":5202,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":5207,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":5211,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":5215,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":5219,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":5224,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":5228,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":5232,"\u002Falgorithms":5236,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":5239,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":5244,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":5248,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":5252,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":5256,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":5261,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":5265,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":5269,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":5273,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":5278,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":5282,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":5286,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":5290,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":5295,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":5299,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":5303,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":5308,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":5312,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":5316,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":5321,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":5325,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":5329,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":5334,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":5338,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":5342,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":5346,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":5351,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":5355,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":5359,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":5364,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":5368,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":5372,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":5376,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":5380,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":5385,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":5389,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":5393,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":5397,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":5401,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":5406,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":5409,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":5413,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":5417,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":5421,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":5426,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":5430,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":5434,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":5438,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":5442,"\u002Fcalculus":5446,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":5449,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":5453,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":5457,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":5462,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":5466,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":5470,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":5474,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":5478,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":5483,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":5487,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":5491,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":5495,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":5499,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":5504,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":5508,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":5512,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":5516,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":5520,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":5525,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":5529,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":5533,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":5538,"\u002Fmechanics\u002Frotation\u002Frolling-motion":5542,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":5546,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":5550,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":5554,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":5558,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":5563,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":5567,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":5571,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":5575,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":5579,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":5583,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":5587,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":5592,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":5596,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":5600,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":5604,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":5608,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":5612,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":5616,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":5620,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":5624,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":5628,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":5632,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":5636,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":5641,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":5645,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":5649,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":5653,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":5657,"\u002Fmechanics":5661,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":5664,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":5669,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":5673,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":5677,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":5681,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":5685,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":5690,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":5694,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":5699,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":5703,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":5707,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":5711,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":5715,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":5720,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":5724,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":5728,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":5732,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":5737,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":5741,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":5745,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":5750,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":5754,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":5758,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":5762,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":5766,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":5771,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":5775,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":5779,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":5783,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":5787,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":5791,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":5796,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":5800,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":5804,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":5808,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":5812,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":5816,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":5820,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":5824,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":5829,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":5833,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":5837,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":5841,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":5845,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":5850,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":5854,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":5858,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":5862,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":5866,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":5871,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":5875,"\u002Felectricity-and-magnetism":5879,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":5882,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":5887,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":5891,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":5895,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":5899,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":5903,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":5908,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":5912,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":5916,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":5920,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":5924,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":5929,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":5933,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":5937,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":5942,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":5946,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":5950,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":5954,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":5958,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":5962,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":5966,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":5971,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":5975,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":5979,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":5983,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":5987,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":5991,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":5995,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":6000,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":6004,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":6008,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":6012,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":6016,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":6020,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":6025,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":6029,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":6033,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":6037,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":6041,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":6046,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":6050,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":6054,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":6058,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":6062,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":6066,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":6071,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":6075,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":6079,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":6083,"\u002Flinear-algebra":6087,"\u002Ftheory-of-computation":6090,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":6093,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":6097,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":6101,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":6105,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":6109,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":6113,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":6118,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":6122,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":6126,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":6130,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":6134,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":6138,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":6142,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":6147,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":6151,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":6155,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":6159,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":6163,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":6168,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":6172,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":6176,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":6180,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":6184,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":6189,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":6193,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":6197,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":6201,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":6205,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":6210,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":6214,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":6218,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":6222,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":6226,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":6231,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":6235,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":6239,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":6243,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":6247,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":6252,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":6256,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":6260,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":6265,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":6269,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":6274,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":6278,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":6282,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":6286,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":6290,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":6295,"\u002Fcomputer-architecture":6299,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":6302,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":6306,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":6310,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":6315,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":6319,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":6323,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":6327,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":6331,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":6335,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":6340,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":6344,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":6348,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":6352,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":6356,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":6360,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":6365,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":6369,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":6373,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":6378,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":6382,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":6387,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":6391,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":6395,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":6400,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":6404,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":6409,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":6413,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":6417,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":6422,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":6426,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":6430,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":6435,"\u002Fdifferential-equations":6439,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":6442,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":6447,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":6451,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":6455,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":6459,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":6463,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":6468,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":6472,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":6476,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":6480,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":6485,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":6489,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":6493,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":6497,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":6502,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":6506,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":6510,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":6514,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":6519,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":6523,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":6527,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":6531,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":6535,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":6539,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":6544,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":6548,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":6552,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":6557,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":6561,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":6565,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":6569,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":6574,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":6578,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":6582,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":6587,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":6591,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":6595,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":6600,"\u002Frelativity":6604,"\u002Fphysical-computing":6607,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":6610,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":6615,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":6619,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":6623,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":6627,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":6632,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":6636,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":6640,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":6645,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":6649,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":6653,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":6657,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":6661,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":6665,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":6670,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":6674,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":6678,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":6682,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":6686,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":6690,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":6695,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":6699,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":6703,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":6707,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":6711,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":6715,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":6719,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":6724,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":6728,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":6732,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":6737,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":6741,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":6745,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":6750,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":6754,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":6759,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":6763,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":6767,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":6771,"\u002Fquantum-mechanics":6775,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":6778,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":6783,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":6787,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":6791,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":6795,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":6800,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":6804,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":6808,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":6812,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":6816,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":6820,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":6825,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":6829,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":6833,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":6837,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":6841,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":6845,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":6849,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":6853,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":6857,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":6861,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":6865,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":6870,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":6874,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":6878,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":6882,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":6887,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":6891,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":6895,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":6898,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":6902,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":6907,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":6911,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":6915,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":6919,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":6924,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":6928,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":6932,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":6936,"\u002Freal-analysis":6940,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":6943,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":6947,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":6951,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":6956,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":6960,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":6964,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":6968,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":6973,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":6977,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":6981,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":6985,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":6989,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":6993,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":6998,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":7002,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":7006,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":7010,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":7015,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":7019,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":7023,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":7027,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":7032,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":7036,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":7040,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":7045,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":7049,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":7053,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":7057,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":7062,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":7066,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":7070,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":7074,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":7079,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":7083,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":7087,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":7092,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":7096,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":7100,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":7104,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":7109,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":7113,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":7117,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":7121,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":7125,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":7130,"\u002Fabstract-algebra":7134,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":7137,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":7142,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":7146,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":7150,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":7154,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":7158,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":7163,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":7167,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":7171,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":7175,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":7179,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":7183,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":7187,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":7192,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":7196,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":7200,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":7204,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":7209,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":7213,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":7217,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":7222,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":7226,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":7230,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":7234,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":7238,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":7242,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":7247,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":7251,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":7255,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":7260,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":7264,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":7268,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":7272,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":7277,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":7281,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":7285,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":7290,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":7294,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":7298,"\u002Fatomic-physics":7302,"\u002Fdatabases":7305,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":7308,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":7312,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":7316,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":7320,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":7324,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":7328,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":7332,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":7337,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":7341,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":7345,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":7350,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":7354,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":7358,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":7363,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":7367,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":7371,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":7375,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":7379,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":7384,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":7388,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":7392,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":7396,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":7401,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":7405,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":7409,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":7413,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":7418,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":7422,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":7426,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":7430,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":7435,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":7439,"\u002Fcategory-theory":7443,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":7446,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":7450,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":7454,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":7458,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":7461,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":7465,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":7469,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":7473,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":7478,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":7482,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":7486,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":7490,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":7494,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":7499,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":7503,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":7507,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":7511,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":7515,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":7520,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":7524,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":7528,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":7532,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":7537,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":7541,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":7545,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":7549,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":7553,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":7557,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":7561,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":7565,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":7569,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":7574,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":7578,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":7582,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":7586,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":7590,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":7595,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":7599,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":7603,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":7606,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":7610,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":7614,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":7618,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":7623,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":7627,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":7631,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":7636,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":7640,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":7644,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":7648,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":7652,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":7656,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":7660,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":7665,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":7669,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":7673,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":7677,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":7681,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":7685,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":7689,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":7693,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":7697,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":7701,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":7705,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":7710,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":7714,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":7718,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":7722,"\u002Fdeep-learning":7726,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":7729,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":7733,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":7737,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":7741,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":7745,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":7749,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":7754,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":7758,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":7762,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":7766,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":7771,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":7775,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":7779,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":7783,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":7788,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":7792,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":7796,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":7800,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":7804,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":7809,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":7813,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":7817,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":7822,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":7826,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":7830,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":7835,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":7839,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":7843,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":7847,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":7852,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":7856,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":7860,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":7864,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":7868,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":7872,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":7877,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":7881,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":7885,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":7889,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":7894,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":7898,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":7902,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":7907,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":7911,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":7915,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":7919,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":7923,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":7928,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":7932,"\u002Fstatistical-mechanics":7936,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":7939,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":7944,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":7948,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":7952,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":7956,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":7961,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":7965,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":7969,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":7973,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":7978,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":7982,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":7986,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":7990,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":7995,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":7999,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":8003,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":8007,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":8012,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":8016,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":8020,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":8024,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":8029,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":8033,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":8037,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":8041,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":8046,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":8050,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":8054,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":8058,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":8062,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":8067,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":8071,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":8076,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":8080,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":8084,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":8088,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":8093,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":8097,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":8101,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":8105,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":8109,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":8114,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":8118,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":8122,"\u002Fcondensed-matter":8126,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":8129,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":8133,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":8138,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":8142,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":8146,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":8150,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":8154,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":8158,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":8162,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":8167,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":8171,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":8175,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":8179,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":8184,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":8188,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":8192,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":8196,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":8201,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":8205,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":8209,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":8213,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":8218,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":8222,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":8226,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":8230,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":8235,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":8239,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":8243,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":8248,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":8252,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":8257,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":8261,"\u002Flogic":8265,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":8268,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":8272,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":8276,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":8280,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":8284,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":8288,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":8291,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":8295,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":8299,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":8303,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":8307,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":8311,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":8315,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":8319,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":8323,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":8327,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":8331,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":8335,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":8339,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":8344,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":8348,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":8352,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":8356,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":8360,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":8364,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":8368,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":8372,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":8375,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":8379,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":8383,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":8387,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":8391,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":8395,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":8399,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":8403,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":8407,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":8411,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":8415,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":8419,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":8423,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":8427,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":8431,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":8435,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":8439,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":8443,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":8447,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":8451,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":8455,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":8459,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":8463,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":8467,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":8469,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":8470,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":8474,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":8478,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":8482,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":8486,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":8490,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":8494,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":8498,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":8502,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":8506,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":8510,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":8515,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":8519,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":8523,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":8527,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":8531,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":8535,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":8539,"\u002Freinforcement-learning":8543,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":8545,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":8549,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":8553,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":8557,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":8561,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":8566,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":8570,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":8574,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":8578,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":8582,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":8586,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":8590,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":8594,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":8598,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":8602,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":8606,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":8610,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":8615,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":8619,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":8623,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":8627,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":8631,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":8635,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":8639,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":8643,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":8647,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":8651,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":8655,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":8659,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":8664,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":8668,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":8672,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":8676,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":8680,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":8684,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":8688,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":8691,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":8695,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":8699,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":8704,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":8708,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":8712,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":8716,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":8719,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":8723,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":8727,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":8731,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":8736,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":8740,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":8744,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":8748,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":8752,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":8756,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":8760,"\u002Fartificial-intelligence":8764,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":8767,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":8772,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":8776,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":8780,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":8784,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":8788,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":8793,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":8797,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":8801,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":8805,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":8810,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":8814,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":8818,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":8822,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":8827,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":8831,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":8836,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":8840,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":8845,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":8849,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":8853,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":8857,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":8862,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":8866,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":8870,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":8875,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":8879,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":8883,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":8888,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":8892,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":8897,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":8901,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":8905,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":8910,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":8914,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":8918,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":8922,"\u002Fnuclear-physics":8926,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":8929,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":8933,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":8937,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":8941,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":8945,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":8949,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":8954,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":8958,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":8962,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":8966,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":8971,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":8975,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":8979,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":8983,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":8987,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":8991,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":8995,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":8998,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":9001,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":9005,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":9009,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":9013,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":9018,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":9022,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":9026,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":9030,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":9034,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":9038,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":9042,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":9046,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":9050,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":9054,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":9058,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":9062,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":9066,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":9070,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":9074,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":9078,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":9082,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":9086,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":9090,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":9094,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":9098,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":9102,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":9106,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":9110,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":9114,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":9118,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":9122,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":9126,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":9131,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":9135,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":9139,"\u002Fnatural-language-processing":9143,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":9146,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":9150,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":9154,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":9158,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":9163,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":9167,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":9171,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":9175,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":9180,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":9184,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":9188,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":9192,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":9197,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":9201,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":9205,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":9209,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":9214,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":9218,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":9222,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":9227,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":9231,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":9235,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":9239,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":9244,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":9248,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":9252,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":9256,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":9261,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":9265,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":9269,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":9273,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":9278,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":9282,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":9286,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":9290,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":9294,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":9299,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":9303,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":9307,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":9312,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":9316,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":9320,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":9324,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":9328,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":9332,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":9336,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":9340,"\u002Fparticle-physics":9344,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":9347,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":9352,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":9356,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":9360,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":9365,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":9369,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":9373,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":9377,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":9382,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":9386,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":9390,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":9394,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":9399,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":9403,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":9407,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":9411,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":9416,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":9420,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":9424,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":9428,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":9433,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":9437,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":9441,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":9446,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":9450,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":9454,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":9458,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":9462,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":9466,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":9470,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":9474,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":9478,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":9483,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":9487,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":9491,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":9495,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":9500,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":9504,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":9508,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":9512,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":9516,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":9521,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":9525,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":9528,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":9532,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":9536,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":9541,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":9545,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":9549,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":9553,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":9557,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":9561,"\u002Fastrophysics-cosmology":9565,"\u002Fcolophon":9568,"\u002F":9571},{"path":4893,"title":4894,"module":4895,"summary":4896},"\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":4898,"title":4899,"module":4895,"summary":4900},"\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":4902,"title":4903,"module":4895,"summary":4904},"\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":4906,"title":4907,"module":4895,"summary":4908},"\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":4910,"title":4911,"module":4895,"summary":4912},"\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":4914,"title":4915,"module":4895,"summary":4916},"\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":4918,"title":4919,"module":4920,"summary":4921},"\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":4923,"title":4924,"module":4920,"summary":4925},"\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":4927,"title":4928,"module":4920,"summary":4929},"\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":4931,"title":4932,"module":4920,"summary":4933},"\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":4935,"title":4936,"module":4937,"summary":4938},"\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":4940,"title":4941,"module":4937,"summary":4942},"\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":4944,"title":4945,"module":4937,"summary":4946},"\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":4948,"title":4949,"module":4937,"summary":4950},"\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":4952,"title":4953,"module":4954,"summary":4955},"\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":4957,"title":4958,"module":4954,"summary":4959},"\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":4961,"title":4962,"module":4954,"summary":4963},"\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":4965,"title":4966,"module":4954,"summary":4967},"\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":4969,"title":4970,"module":4954,"summary":4971},"\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":4973,"title":4974,"module":4954,"summary":4975},"\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":4977,"title":4978,"module":4954,"summary":4979},"\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":4981,"title":4982,"module":4954,"summary":4983},"\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":4985,"title":4986,"module":4954,"summary":4987},"\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":4989,"title":4990,"module":4954,"summary":4991},"\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":4993,"title":4994,"module":4954,"summary":4995},"\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":4997,"title":4998,"module":4954,"summary":4999},"\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":5001,"title":5002,"module":5003,"summary":5004},"\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":5006,"title":5007,"module":5003,"summary":5008},"\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":5010,"title":5011,"module":5003,"summary":5012},"\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":5014,"title":5015,"module":5003,"summary":5016},"\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":5018,"title":5019,"module":5003,"summary":5020},"\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":5022,"title":5023,"module":5003,"summary":5024},"\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":5026,"title":5027,"module":5003,"summary":5028},"\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":5030,"title":5031,"module":5003,"summary":5032},"\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":5034,"title":5035,"module":5036,"summary":5037},"\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":5039,"title":5040,"module":5036,"summary":5041},"\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":5043,"title":5044,"module":5036,"summary":5045},"\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":5047,"title":5048,"module":5036,"summary":5049},"\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":5051,"title":5052,"module":5036,"summary":5053},"\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":5055,"title":5056,"module":5036,"summary":5057},"\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":5059,"title":5060,"module":5036,"summary":5061},"\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":5063,"title":5064,"module":5036,"summary":5065},"\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":5067,"title":5068,"module":5036,"summary":5069},"\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":5071,"title":5072,"module":5036,"summary":5073},"\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":5075,"title":5076,"module":5036,"summary":5077},"\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":5079,"title":5080,"module":5036,"summary":5081},"\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":5083,"title":5084,"module":5036,"summary":5085},"\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":5087,"title":5088,"module":5036,"summary":5089},"\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":5091,"title":5092,"module":5093,"summary":5094},"\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":5096,"title":5097,"module":5093,"summary":5098},"\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":5100,"title":5101,"module":5093,"summary":5102},"\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":5104,"title":5105,"module":5093,"summary":5106},"\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":5108,"title":5109,"module":5093,"summary":5110},"\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":5112,"title":5113,"module":5114,"summary":5115},"\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":5117,"title":5118,"module":5114,"summary":5119},"\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":5121,"title":5122,"module":5114,"summary":5123},"\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":5125,"title":5126,"module":5114,"summary":5127},"\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":5129,"title":5130,"module":5114,"summary":5131},"\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":5133,"title":5134,"module":5114,"summary":5135},"\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":5137,"title":5138,"module":5114,"summary":5139},"\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":5141,"title":5142,"module":5114,"summary":5143},"\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":5145,"title":5146,"module":5114,"summary":5147},"\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":5149,"title":5150,"module":5114,"summary":5151},"\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":5153,"title":5154,"module":5114,"summary":5155},"\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":5157,"title":5158,"module":5159,"summary":5160},"\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":5162,"title":5163,"module":5159,"summary":5164},"\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":5166,"title":5167,"module":5159,"summary":5168},"\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":5170,"title":5171,"module":5159,"summary":5172},"\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":5174,"title":5175,"module":5176,"summary":5177},"\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":5179,"title":5180,"module":5176,"summary":5181},"\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":5183,"title":5184,"module":5176,"summary":5185},"\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":5187,"title":5188,"module":5176,"summary":5189},"\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":5191,"title":5192,"module":5176,"summary":5193},"\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":5195,"title":5196,"module":5176,"summary":5197},"\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":5199,"title":5200,"module":5176,"summary":5201},"\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":5203,"title":5204,"module":5205,"summary":5206},"\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":5208,"title":5209,"module":5205,"summary":5210},"\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":5212,"title":5213,"module":5205,"summary":5214},"\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":5216,"title":5217,"module":5205,"summary":5218},"\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":5220,"title":5221,"module":5222,"summary":5223},"\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":5225,"title":5226,"module":5222,"summary":5227},"\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":5229,"title":5230,"module":5222,"summary":5231},"\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":5233,"title":5234,"module":5222,"summary":5235},"\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":5237,"title":5238,"module":6,"summary":6},"\u002Falgorithms","Algorithms",{"path":5240,"title":5241,"module":5242,"summary":5243},"\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":5245,"title":5246,"module":5242,"summary":5247},"\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":5249,"title":5250,"module":5242,"summary":5251},"\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":5253,"title":5254,"module":5242,"summary":5255},"\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":5257,"title":5258,"module":5259,"summary":5260},"\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":5262,"title":5263,"module":5259,"summary":5264},"\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":5266,"title":5267,"module":5259,"summary":5268},"\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":5270,"title":5271,"module":5259,"summary":5272},"\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":5274,"title":5275,"module":5276,"summary":5277},"\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":5279,"title":5280,"module":5276,"summary":5281},"\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":5283,"title":5284,"module":5276,"summary":5285},"\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":5287,"title":5288,"module":5276,"summary":5289},"\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":5291,"title":5292,"module":5293,"summary":5294},"\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":5296,"title":5297,"module":5293,"summary":5298},"\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":5300,"title":5301,"module":5293,"summary":5302},"\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":5304,"title":5305,"module":5306,"summary":5307},"\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":5309,"title":5310,"module":5306,"summary":5311},"\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":5313,"title":5314,"module":5306,"summary":5315},"\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":5317,"title":5318,"module":5319,"summary":5320},"\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":5322,"title":5323,"module":5319,"summary":5324},"\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":5326,"title":5327,"module":5319,"summary":5328},"\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":5330,"title":5331,"module":5332,"summary":5333},"\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":5335,"title":5336,"module":5332,"summary":5337},"\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":5339,"title":5340,"module":5332,"summary":5341},"\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":5343,"title":5344,"module":5332,"summary":5345},"\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":5347,"title":5348,"module":5349,"summary":5350},"\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":5352,"title":5353,"module":5349,"summary":5354},"\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":5356,"title":5357,"module":5349,"summary":5358},"\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":5360,"title":5361,"module":5362,"summary":5363},"\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":5365,"title":5366,"module":5362,"summary":5367},"\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":5369,"title":5370,"module":5362,"summary":5371},"\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":5373,"title":5374,"module":5362,"summary":5375},"\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":5377,"title":5378,"module":5362,"summary":5379},"\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":5381,"title":5382,"module":5383,"summary":5384},"\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":5386,"title":5387,"module":5383,"summary":5388},"\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":5390,"title":5391,"module":5383,"summary":5392},"\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":5394,"title":5395,"module":5383,"summary":5396},"\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":5398,"title":5399,"module":5383,"summary":5400},"\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":5402,"title":5403,"module":5404,"summary":5405},"\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":5407,"title":5404,"module":5404,"summary":5408},"\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":5410,"title":5411,"module":5404,"summary":5412},"\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":5414,"title":5415,"module":5404,"summary":5416},"\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":5418,"title":5419,"module":5404,"summary":5420},"\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":5422,"title":5423,"module":5424,"summary":5425},"\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":5427,"title":5428,"module":5424,"summary":5429},"\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":5431,"title":5432,"module":5424,"summary":5433},"\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":5435,"title":5436,"module":5424,"summary":5437},"\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":5439,"title":5440,"module":5424,"summary":5441},"\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":5443,"title":5444,"module":5424,"summary":5445},"\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":5447,"title":5448,"module":6,"summary":6},"\u002Fcalculus","Calculus",{"path":5450,"title":5451,"module":4895,"summary":5452},"\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":5454,"title":5455,"module":4895,"summary":5456},"\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":5458,"title":5459,"module":5460,"summary":5461},"\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":5463,"title":5464,"module":5460,"summary":5465},"\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":5467,"title":5468,"module":5460,"summary":5469},"\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":5471,"title":5472,"module":5460,"summary":5473},"\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":5475,"title":5476,"module":5460,"summary":5477},"\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":5479,"title":5480,"module":5481,"summary":5482},"\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":5484,"title":5485,"module":5481,"summary":5486},"\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":5488,"title":5489,"module":5481,"summary":5490},"\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":5492,"title":5493,"module":5481,"summary":5494},"\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":5496,"title":5497,"module":5481,"summary":5498},"\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":5500,"title":5501,"module":5502,"summary":5503},"\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":5505,"title":5506,"module":5502,"summary":5507},"\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":5509,"title":5510,"module":5502,"summary":5511},"\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":5513,"title":5514,"module":5502,"summary":5515},"\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":5517,"title":5518,"module":5502,"summary":5519},"\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":5521,"title":5522,"module":5523,"summary":5524},"\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":5526,"title":5527,"module":5523,"summary":5528},"\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":5530,"title":5531,"module":5523,"summary":5532},"\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":5534,"title":5535,"module":5536,"summary":5537},"\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":5539,"title":5540,"module":5536,"summary":5541},"\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":5543,"title":5544,"module":5536,"summary":5545},"\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":5547,"title":5548,"module":5536,"summary":5549},"\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":5551,"title":5552,"module":5536,"summary":5553},"\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":5555,"title":5556,"module":5536,"summary":5557},"\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":5559,"title":5560,"module":5561,"summary":5562},"\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":5564,"title":5565,"module":5561,"summary":5566},"\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":5568,"title":5569,"module":5561,"summary":5570},"\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":5572,"title":5573,"module":5561,"summary":5574},"\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":5576,"title":5577,"module":5561,"summary":5578},"\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":5580,"title":5581,"module":5561,"summary":5582},"\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":5584,"title":5585,"module":5561,"summary":5586},"\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":5588,"title":5589,"module":5590,"summary":5591},"\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":5593,"title":5594,"module":5590,"summary":5595},"\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":5597,"title":5598,"module":5590,"summary":5599},"\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":5601,"title":5602,"module":5590,"summary":5603},"\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":5605,"title":5606,"module":5590,"summary":5607},"\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":5609,"title":5610,"module":5590,"summary":5611},"\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":5613,"title":5614,"module":5590,"summary":5615},"\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":5617,"title":5618,"module":5590,"summary":5619},"\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":5621,"title":5622,"module":5590,"summary":5623},"\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":5625,"title":5626,"module":5590,"summary":5627},"\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":5629,"title":5630,"module":5590,"summary":5631},"\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":5633,"title":5634,"module":5590,"summary":5635},"\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":5637,"title":5638,"module":5639,"summary":5640},"\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":5642,"title":5643,"module":5639,"summary":5644},"\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":5646,"title":5647,"module":5639,"summary":5648},"\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":5650,"title":5651,"module":5639,"summary":5652},"\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":5654,"title":5655,"module":5639,"summary":5656},"\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":5658,"title":5659,"module":5639,"summary":5660},"\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":5662,"title":5663,"module":6,"summary":6},"\u002Fmechanics","Mechanics & Dynamics",{"path":5665,"title":5666,"module":5667,"summary":5668},"\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":5670,"title":5671,"module":5667,"summary":5672},"\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":5674,"title":5675,"module":5667,"summary":5676},"\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":5678,"title":5679,"module":5667,"summary":5680},"\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":5682,"title":5683,"module":5667,"summary":5684},"\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":5686,"title":5687,"module":5688,"summary":5689},"\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":5691,"title":5692,"module":5688,"summary":5693},"\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":5695,"title":5696,"module":5697,"summary":5698},"\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":5700,"title":5701,"module":5697,"summary":5702},"\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":5704,"title":5705,"module":5697,"summary":5706},"\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":5708,"title":5709,"module":5697,"summary":5710},"\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":5712,"title":5713,"module":5697,"summary":5714},"\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":5716,"title":5717,"module":5718,"summary":5719},"\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":5721,"title":5722,"module":5718,"summary":5723},"\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":5725,"title":5726,"module":5718,"summary":5727},"\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":5729,"title":5730,"module":5718,"summary":5731},"\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":5733,"title":5734,"module":5735,"summary":5736},"\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":5738,"title":5739,"module":5735,"summary":5740},"\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":5742,"title":5743,"module":5735,"summary":5744},"\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":5746,"title":5747,"module":5748,"summary":5749},"\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":5751,"title":5752,"module":5748,"summary":5753},"\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":5755,"title":5756,"module":5748,"summary":5757},"\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":5759,"title":5760,"module":5748,"summary":5761},"\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":5763,"title":5764,"module":5748,"summary":5765},"\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":5767,"title":5768,"module":5769,"summary":5770},"\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":5772,"title":5773,"module":5769,"summary":5774},"\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":5776,"title":5777,"module":5769,"summary":5778},"\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":5780,"title":5781,"module":5769,"summary":5782},"\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":5784,"title":5785,"module":5769,"summary":5786},"\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":5788,"title":5789,"module":5769,"summary":5790},"\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":5792,"title":5793,"module":5794,"summary":5795},"\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":5797,"title":5798,"module":5794,"summary":5799},"\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":5801,"title":5802,"module":5794,"summary":5803},"\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":5805,"title":5806,"module":5794,"summary":5807},"\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":5809,"title":5810,"module":5794,"summary":5811},"\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":5813,"title":5814,"module":5794,"summary":5815},"\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":5817,"title":5818,"module":5794,"summary":5819},"\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":5821,"title":5822,"module":5794,"summary":5823},"\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":5825,"title":5826,"module":5827,"summary":5828},"\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":5830,"title":5831,"module":5827,"summary":5832},"\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":5834,"title":5835,"module":5827,"summary":5836},"\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":5838,"title":5839,"module":5827,"summary":5840},"\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":5842,"title":5843,"module":5827,"summary":5844},"\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":5846,"title":5847,"module":5848,"summary":5849},"\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":5851,"title":5852,"module":5848,"summary":5853},"\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":5855,"title":5856,"module":5848,"summary":5857},"\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":5859,"title":5860,"module":5848,"summary":5861},"\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":5863,"title":5864,"module":5848,"summary":5865},"\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":5867,"title":5868,"module":5869,"summary":5870},"\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":5872,"title":5873,"module":5869,"summary":5874},"\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":5876,"title":5877,"module":5869,"summary":5878},"\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":5880,"title":5881,"module":6,"summary":6},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":5883,"title":5884,"module":5885,"summary":5886},"\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":5888,"title":5889,"module":5885,"summary":5890},"\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":5892,"title":5893,"module":5885,"summary":5894},"\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":5896,"title":5897,"module":5885,"summary":5898},"\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":5900,"title":5901,"module":5885,"summary":5902},"\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":5904,"title":5905,"module":5906,"summary":5907},"\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":5909,"title":5910,"module":5906,"summary":5911},"\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":5913,"title":5914,"module":5906,"summary":5915},"\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":5917,"title":5918,"module":5906,"summary":5919},"\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":5921,"title":5922,"module":5906,"summary":5923},"\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":5925,"title":5926,"module":5927,"summary":5928},"\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":5930,"title":5931,"module":5927,"summary":5932},"\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":5934,"title":5935,"module":5927,"summary":5936},"\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":5938,"title":5939,"module":5940,"summary":5941},"\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":5943,"title":5944,"module":5940,"summary":5945},"\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":5947,"title":5948,"module":5940,"summary":5949},"\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":5951,"title":5952,"module":5940,"summary":5953},"\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":5955,"title":5956,"module":5940,"summary":5957},"\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":5959,"title":5960,"module":5940,"summary":5961},"\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":5963,"title":5964,"module":5940,"summary":5965},"\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":5967,"title":5968,"module":5969,"summary":5970},"\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":5972,"title":5973,"module":5969,"summary":5974},"\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":5976,"title":5977,"module":5969,"summary":5978},"\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":5980,"title":5981,"module":5969,"summary":5982},"\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":5984,"title":5985,"module":5969,"summary":5986},"\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":5988,"title":5989,"module":5969,"summary":5990},"\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":5992,"title":5993,"module":5969,"summary":5994},"\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":5996,"title":5997,"module":5998,"summary":5999},"\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":6001,"title":6002,"module":5998,"summary":6003},"\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":6005,"title":6006,"module":5998,"summary":6007},"\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":6009,"title":6010,"module":5998,"summary":6011},"\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":6013,"title":6014,"module":5998,"summary":6015},"\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":6017,"title":6018,"module":5998,"summary":6019},"\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":6021,"title":6022,"module":6023,"summary":6024},"\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":6026,"title":6027,"module":6023,"summary":6028},"\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":6030,"title":6031,"module":6023,"summary":6032},"\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":6034,"title":6035,"module":6023,"summary":6036},"\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":6038,"title":6039,"module":6023,"summary":6040},"\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":6042,"title":6043,"module":6044,"summary":6045},"\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":6047,"title":6048,"module":6044,"summary":6049},"\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":6051,"title":6052,"module":6044,"summary":6053},"\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":6055,"title":6056,"module":6044,"summary":6057},"\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":6059,"title":6060,"module":6044,"summary":6061},"\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":6063,"title":6064,"module":6044,"summary":6065},"\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":6067,"title":6068,"module":6069,"summary":6070},"\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":6072,"title":6073,"module":6069,"summary":6074},"\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":6076,"title":6077,"module":6069,"summary":6078},"\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":6080,"title":6081,"module":6069,"summary":6082},"\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":6084,"title":6085,"module":6069,"summary":6086},"\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":6088,"title":6089,"module":6,"summary":6},"\u002Flinear-algebra","Linear Algebra",{"path":6091,"title":6092,"module":6,"summary":6},"\u002Ftheory-of-computation","Theory of Computation",{"path":6094,"title":6095,"module":4895,"summary":6096},"\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":6098,"title":6099,"module":4895,"summary":6100},"\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":6102,"title":6103,"module":4895,"summary":6104},"\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":6106,"title":6107,"module":4895,"summary":6108},"\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":6110,"title":6111,"module":4895,"summary":6112},"\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":6114,"title":6115,"module":6116,"summary":6117},"\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":6119,"title":6120,"module":6116,"summary":6121},"\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":6123,"title":6124,"module":6116,"summary":6125},"\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":6127,"title":6128,"module":6116,"summary":6129},"\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":6131,"title":6132,"module":6116,"summary":6133},"\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":6135,"title":6136,"module":6116,"summary":6137},"\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":6139,"title":6140,"module":6116,"summary":6141},"\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":6143,"title":6144,"module":6145,"summary":6146},"\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":6148,"title":6149,"module":6145,"summary":6150},"\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":6152,"title":6153,"module":6145,"summary":6154},"\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":6156,"title":6157,"module":6145,"summary":6158},"\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":6160,"title":6161,"module":6145,"summary":6162},"\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":6164,"title":6165,"module":6166,"summary":6167},"\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":6169,"title":6170,"module":6166,"summary":6171},"\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":6173,"title":6174,"module":6166,"summary":6175},"\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":6177,"title":6178,"module":6166,"summary":6179},"\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":6181,"title":6182,"module":6166,"summary":6183},"\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":6185,"title":6186,"module":6187,"summary":6188},"\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":6190,"title":6191,"module":6187,"summary":6192},"\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":6194,"title":6195,"module":6187,"summary":6196},"\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":6198,"title":6199,"module":6187,"summary":6200},"\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":6202,"title":6203,"module":6187,"summary":6204},"\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":6206,"title":6207,"module":6208,"summary":6209},"\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":6211,"title":6212,"module":6208,"summary":6213},"\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":6215,"title":6216,"module":6208,"summary":6217},"\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":6219,"title":6220,"module":6208,"summary":6221},"\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":6223,"title":6224,"module":6208,"summary":6225},"\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":6227,"title":6228,"module":6229,"summary":6230},"\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":6232,"title":6233,"module":6229,"summary":6234},"\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":6236,"title":6237,"module":6229,"summary":6238},"\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":6240,"title":6241,"module":6229,"summary":6242},"\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":6244,"title":6245,"module":6229,"summary":6246},"\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":6248,"title":6249,"module":6250,"summary":6251},"\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":6253,"title":6254,"module":6250,"summary":6255},"\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":6257,"title":6258,"module":6250,"summary":6259},"\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":6261,"title":6262,"module":6263,"summary":6264},"\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":6266,"title":6267,"module":6263,"summary":6268},"\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":6270,"title":6271,"module":6272,"summary":6273},"\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":6275,"title":6276,"module":6272,"summary":6277},"\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":6279,"title":6280,"module":6272,"summary":6281},"\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":6283,"title":6284,"module":6272,"summary":6285},"\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":6287,"title":6288,"module":6272,"summary":6289},"\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":6291,"title":6292,"module":6293,"summary":6294},"\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":6296,"title":6297,"module":6293,"summary":6298},"\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":6300,"title":6301,"module":6,"summary":6},"\u002Fcomputer-architecture","Computer Architecture",{"path":6303,"title":6304,"module":4895,"summary":6305},"\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":6307,"title":6308,"module":4895,"summary":6309},"\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":6311,"title":6312,"module":6313,"summary":6314},"\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":6316,"title":6317,"module":6313,"summary":6318},"\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":6320,"title":6321,"module":6313,"summary":6322},"\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":6324,"title":6325,"module":6313,"summary":6326},"\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":6328,"title":6329,"module":6313,"summary":6330},"\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":6332,"title":6333,"module":6313,"summary":6334},"\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":6336,"title":6337,"module":6338,"summary":6339},"\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":6341,"title":6342,"module":6338,"summary":6343},"\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":6345,"title":6346,"module":6338,"summary":6347},"\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":6349,"title":6350,"module":6338,"summary":6351},"\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":6353,"title":6354,"module":6338,"summary":6355},"\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":6357,"title":6358,"module":6338,"summary":6359},"\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":6361,"title":6362,"module":6363,"summary":6364},"\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":6366,"title":6367,"module":6363,"summary":6368},"\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":6370,"title":6371,"module":6363,"summary":6372},"\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":6374,"title":6375,"module":6376,"summary":6377},"\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":6379,"title":6380,"module":6376,"summary":6381},"\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":6383,"title":6384,"module":6385,"summary":6386},"\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":6388,"title":6389,"module":6385,"summary":6390},"\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":6392,"title":6393,"module":6385,"summary":6394},"\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":6396,"title":6397,"module":6398,"summary":6399},"\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":6401,"title":6402,"module":6398,"summary":6403},"\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":6405,"title":6406,"module":6407,"summary":6408},"\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":6410,"title":6411,"module":6407,"summary":6412},"\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":6414,"title":6415,"module":6407,"summary":6416},"\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":6418,"title":6419,"module":6420,"summary":6421},"\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":6423,"title":6424,"module":6420,"summary":6425},"\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":6427,"title":6428,"module":6420,"summary":6429},"\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":6431,"title":6432,"module":6433,"summary":6434},"\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":6436,"title":6437,"module":6433,"summary":6438},"\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":6440,"title":6441,"module":6,"summary":6},"\u002Fdifferential-equations","Differential Equations",{"path":6443,"title":6444,"module":6445,"summary":6446},"\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":6448,"title":6449,"module":6445,"summary":6450},"\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":6452,"title":6453,"module":6445,"summary":6454},"\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":6456,"title":6457,"module":6445,"summary":6458},"\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":6460,"title":6461,"module":6445,"summary":6462},"\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":6464,"title":6465,"module":6466,"summary":6467},"\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":6469,"title":6470,"module":6466,"summary":6471},"\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":6473,"title":6474,"module":6466,"summary":6475},"\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":6477,"title":6478,"module":6466,"summary":6479},"\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":6481,"title":6482,"module":6483,"summary":6484},"\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":6486,"title":6487,"module":6483,"summary":6488},"\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":6490,"title":6491,"module":6483,"summary":6492},"\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":6494,"title":6495,"module":6483,"summary":6496},"\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":6498,"title":6499,"module":6500,"summary":6501},"\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":6503,"title":6504,"module":6500,"summary":6505},"\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":6507,"title":6508,"module":6500,"summary":6509},"\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":6511,"title":6512,"module":6500,"summary":6513},"\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":6515,"title":6516,"module":6517,"summary":6518},"\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":6520,"title":6521,"module":6517,"summary":6522},"\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":6524,"title":6525,"module":6517,"summary":6526},"\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":6528,"title":6529,"module":6517,"summary":6530},"\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":6532,"title":6533,"module":6517,"summary":6534},"\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":6536,"title":6537,"module":6517,"summary":6538},"\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":6540,"title":6541,"module":6542,"summary":6543},"\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":6545,"title":6546,"module":6542,"summary":6547},"\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":6549,"title":6550,"module":6542,"summary":6551},"\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":6553,"title":6554,"module":6555,"summary":6556},"\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":6558,"title":6559,"module":6555,"summary":6560},"\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":6562,"title":6563,"module":6555,"summary":6564},"\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":6566,"title":6567,"module":6555,"summary":6568},"\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":6570,"title":6571,"module":6572,"summary":6573},"\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":6575,"title":6576,"module":6572,"summary":6577},"\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":6579,"title":6580,"module":6572,"summary":6581},"\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":6583,"title":6584,"module":6585,"summary":6586},"\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":6588,"title":6589,"module":6585,"summary":6590},"\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":6592,"title":6593,"module":6585,"summary":6594},"\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":6596,"title":6597,"module":6598,"summary":6599},"\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":6601,"title":6602,"module":6598,"summary":6603},"\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":6605,"title":6606,"module":6,"summary":6},"\u002Frelativity","Relativity",{"path":6608,"title":6609,"module":6,"summary":6},"\u002Fphysical-computing","Physical Computing",{"path":6611,"title":6612,"module":6613,"summary":6614},"\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":6616,"title":6617,"module":6613,"summary":6618},"\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":6620,"title":6621,"module":6613,"summary":6622},"\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":6624,"title":6625,"module":6613,"summary":6626},"\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":6628,"title":6629,"module":6630,"summary":6631},"\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":6633,"title":6634,"module":6630,"summary":6635},"\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":6637,"title":6638,"module":6630,"summary":6639},"\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":6641,"title":6642,"module":6643,"summary":6644},"\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":6646,"title":6647,"module":6643,"summary":6648},"\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":6650,"title":6651,"module":6643,"summary":6652},"\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":6654,"title":6655,"module":6643,"summary":6656},"\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":6658,"title":6659,"module":6643,"summary":6660},"\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":6662,"title":6663,"module":6643,"summary":6664},"\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":6666,"title":6667,"module":6668,"summary":6669},"\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":6671,"title":6672,"module":6668,"summary":6673},"\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":6675,"title":6676,"module":6668,"summary":6677},"\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":6679,"title":6680,"module":6668,"summary":6681},"\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":6683,"title":6684,"module":6668,"summary":6685},"\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":6687,"title":6688,"module":6668,"summary":6689},"\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":6691,"title":6692,"module":6693,"summary":6694},"\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":6696,"title":6697,"module":6693,"summary":6698},"\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":6700,"title":6701,"module":6693,"summary":6702},"\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":6704,"title":6705,"module":6693,"summary":6706},"\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":6708,"title":6709,"module":5548,"summary":6710},"\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":6712,"title":6713,"module":5548,"summary":6714},"\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":6716,"title":6717,"module":5548,"summary":6718},"\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":6720,"title":6721,"module":6722,"summary":6723},"\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":6725,"title":6726,"module":6722,"summary":6727},"\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":6729,"title":6730,"module":6722,"summary":6731},"\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":6733,"title":6734,"module":6735,"summary":6736},"\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":6738,"title":6739,"module":6735,"summary":6740},"\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":6742,"title":6743,"module":6735,"summary":6744},"\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":6746,"title":6747,"module":6748,"summary":6749},"\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":6751,"title":6752,"module":6748,"summary":6753},"\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":6755,"title":6756,"module":6757,"summary":6758},"\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":6760,"title":6761,"module":6757,"summary":6762},"\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":6764,"title":6765,"module":6757,"summary":6766},"\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":6768,"title":6769,"module":6757,"summary":6770},"\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":6772,"title":6773,"module":6757,"summary":6774},"\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":6776,"title":6777,"module":6,"summary":6},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":6779,"title":6780,"module":6781,"summary":6782},"\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":6784,"title":6785,"module":6781,"summary":6786},"\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":6788,"title":6789,"module":6781,"summary":6790},"\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":6792,"title":6793,"module":6781,"summary":6794},"\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":6796,"title":6797,"module":6798,"summary":6799},"\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":6801,"title":6802,"module":6798,"summary":6803},"\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":6805,"title":6806,"module":6798,"summary":6807},"\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":6809,"title":6810,"module":6798,"summary":6811},"\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":6813,"title":6814,"module":6798,"summary":6815},"\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":6817,"title":6818,"module":6798,"summary":6819},"\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":6821,"title":6822,"module":6823,"summary":6824},"\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":6826,"title":6827,"module":6823,"summary":6828},"\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":6830,"title":6831,"module":6823,"summary":6832},"\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":6834,"title":6835,"module":6823,"summary":6836},"\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":6838,"title":6839,"module":6823,"summary":6840},"\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":6842,"title":6843,"module":5242,"summary":6844},"\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":6846,"title":6847,"module":5242,"summary":6848},"\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":6850,"title":6851,"module":5242,"summary":6852},"\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":6854,"title":6855,"module":5242,"summary":6856},"\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":6858,"title":6859,"module":5242,"summary":6860},"\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":6862,"title":6863,"module":5242,"summary":6864},"\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":6866,"title":6867,"module":6868,"summary":6869},"\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":6871,"title":6872,"module":6868,"summary":6873},"\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":6875,"title":6876,"module":6868,"summary":6877},"\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":6879,"title":6880,"module":6868,"summary":6881},"\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":6883,"title":6884,"module":6885,"summary":6886},"\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":6888,"title":6889,"module":6885,"summary":6890},"\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":6892,"title":6893,"module":6885,"summary":6894},"\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":6896,"title":5297,"module":6885,"summary":6897},"\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":6899,"title":6900,"module":6885,"summary":6901},"\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":6903,"title":6904,"module":6905,"summary":6906},"\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":6908,"title":6909,"module":6905,"summary":6910},"\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":6912,"title":6913,"module":6905,"summary":6914},"\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":6916,"title":6917,"module":6905,"summary":6918},"\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":6920,"title":6921,"module":6922,"summary":6923},"\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":6925,"title":6926,"module":6922,"summary":6927},"\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":6929,"title":6930,"module":6922,"summary":6931},"\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":6933,"title":6934,"module":6922,"summary":6935},"\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":6937,"title":6938,"module":6922,"summary":6939},"\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":6941,"title":6942,"module":6,"summary":6},"\u002Freal-analysis","Real Analysis",{"path":6944,"title":6945,"module":4895,"summary":6946},"\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":6948,"title":6949,"module":4895,"summary":6950},"\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":6952,"title":6953,"module":6954,"summary":6955},"\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":6957,"title":6958,"module":6954,"summary":6959},"\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":6961,"title":6962,"module":6954,"summary":6963},"\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":6965,"title":6966,"module":6954,"summary":6967},"\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":6969,"title":6970,"module":6971,"summary":6972},"\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":6974,"title":6975,"module":6971,"summary":6976},"\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":6978,"title":6979,"module":6971,"summary":6980},"\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":6982,"title":6983,"module":6971,"summary":6984},"\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":6986,"title":6987,"module":6971,"summary":6988},"\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":6990,"title":6991,"module":6971,"summary":6992},"\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":6994,"title":6995,"module":6996,"summary":6997},"\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":6999,"title":7000,"module":6996,"summary":7001},"\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":7003,"title":7004,"module":6996,"summary":7005},"\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":7007,"title":7008,"module":6996,"summary":7009},"\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":7011,"title":7012,"module":7013,"summary":7014},"\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":7016,"title":7017,"module":7013,"summary":7018},"\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":7020,"title":7021,"module":7013,"summary":7022},"\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":7024,"title":7025,"module":7013,"summary":7026},"\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":7028,"title":7029,"module":7030,"summary":7031},"\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":7033,"title":7034,"module":7030,"summary":7035},"\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":7037,"title":7038,"module":7030,"summary":7039},"\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":7041,"title":7042,"module":7043,"summary":7044},"\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":7046,"title":7047,"module":7043,"summary":7048},"\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":7050,"title":7051,"module":7043,"summary":7052},"\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":7054,"title":7055,"module":7043,"summary":7056},"\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":7058,"title":7059,"module":7060,"summary":7061},"\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":7063,"title":7064,"module":7060,"summary":7065},"\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":7067,"title":7068,"module":7060,"summary":7069},"\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":7071,"title":7072,"module":7060,"summary":7073},"\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":7075,"title":7076,"module":7077,"summary":7078},"\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":7080,"title":7081,"module":7077,"summary":7082},"\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":7084,"title":7085,"module":7077,"summary":7086},"\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":7088,"title":7089,"module":7090,"summary":7091},"\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":7093,"title":7094,"module":7090,"summary":7095},"\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":7097,"title":7098,"module":7090,"summary":7099},"\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":7101,"title":7102,"module":7090,"summary":7103},"\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":7105,"title":7106,"module":7107,"summary":7108},"\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":7110,"title":7111,"module":7107,"summary":7112},"\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":7114,"title":7115,"module":7107,"summary":7116},"\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":7118,"title":7119,"module":7107,"summary":7120},"\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":7122,"title":7123,"module":7107,"summary":7124},"\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":7126,"title":7127,"module":7128,"summary":7129},"\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":7131,"title":7132,"module":7128,"summary":7133},"\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":7135,"title":7136,"module":6,"summary":6},"\u002Fabstract-algebra","Abstract Algebra",{"path":7138,"title":7139,"module":7140,"summary":7141},"\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":7143,"title":7144,"module":7140,"summary":7145},"\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":7147,"title":7148,"module":7140,"summary":7149},"\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":7151,"title":7152,"module":7140,"summary":7153},"\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":7155,"title":7156,"module":7140,"summary":7157},"\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":7159,"title":7160,"module":7161,"summary":7162},"\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":7164,"title":7165,"module":7161,"summary":7166},"\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":7168,"title":7169,"module":7161,"summary":7170},"\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":7172,"title":7173,"module":7161,"summary":7174},"\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":7176,"title":7177,"module":7161,"summary":7178},"\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":7180,"title":7181,"module":7161,"summary":7182},"\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":7184,"title":7185,"module":7161,"summary":7186},"\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":7188,"title":7189,"module":7190,"summary":7191},"\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":7193,"title":7194,"module":7190,"summary":7195},"\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":7197,"title":7198,"module":7190,"summary":7199},"\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":7201,"title":7202,"module":7190,"summary":7203},"\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":7205,"title":7206,"module":7207,"summary":7208},"\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":7210,"title":7211,"module":7207,"summary":7212},"\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":7214,"title":7215,"module":7207,"summary":7216},"\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":7218,"title":7219,"module":7220,"summary":7221},"\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":7223,"title":7224,"module":7220,"summary":7225},"\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":7227,"title":7228,"module":7220,"summary":7229},"\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":7231,"title":7232,"module":7220,"summary":7233},"\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":7235,"title":7236,"module":7220,"summary":7237},"\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":7239,"title":7240,"module":7220,"summary":7241},"\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":7243,"title":7244,"module":7245,"summary":7246},"\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":7248,"title":7249,"module":7245,"summary":7250},"\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":7252,"title":7253,"module":7245,"summary":7254},"\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":7256,"title":7257,"module":7258,"summary":7259},"\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":7261,"title":7262,"module":7258,"summary":7263},"\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":7265,"title":7266,"module":7258,"summary":7267},"\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":7269,"title":7270,"module":7258,"summary":7271},"\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":7273,"title":7274,"module":7275,"summary":7276},"\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":7278,"title":7279,"module":7275,"summary":7280},"\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":7282,"title":7283,"module":7275,"summary":7284},"\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":7286,"title":7287,"module":7288,"summary":7289},"\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":7291,"title":7292,"module":7288,"summary":7293},"\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":7295,"title":7296,"module":7288,"summary":7297},"\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":7299,"title":7300,"module":7288,"summary":7301},"\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":7303,"title":7304,"module":6,"summary":6},"\u002Fatomic-physics","Atomic Physics",{"path":7306,"title":7307,"module":6,"summary":6},"\u002Fdatabases","Databases",{"path":7309,"title":7310,"module":4895,"summary":7311},"\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":7313,"title":7314,"module":4895,"summary":7315},"\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":7317,"title":7318,"module":4895,"summary":7319},"\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":7321,"title":7322,"module":4895,"summary":7323},"\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":7325,"title":7326,"module":4895,"summary":7327},"\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":7329,"title":7330,"module":4895,"summary":7331},"\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":7333,"title":7334,"module":7335,"summary":7336},"\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":7338,"title":7339,"module":7335,"summary":7340},"\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":7342,"title":7343,"module":7335,"summary":7344},"\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":7346,"title":7347,"module":7348,"summary":7349},"\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":7351,"title":7352,"module":7348,"summary":7353},"\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":7355,"title":7356,"module":7348,"summary":7357},"\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":7359,"title":7360,"module":7361,"summary":7362},"\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":7364,"title":7365,"module":7361,"summary":7366},"\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":7368,"title":7369,"module":7361,"summary":7370},"\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":7372,"title":7373,"module":7361,"summary":7374},"\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":7376,"title":7377,"module":7361,"summary":7378},"\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":7380,"title":7381,"module":7382,"summary":7383},"\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":7385,"title":7386,"module":7382,"summary":7387},"\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":7389,"title":7390,"module":7382,"summary":7391},"\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":7393,"title":7394,"module":7382,"summary":7395},"\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":7397,"title":7398,"module":7399,"summary":7400},"\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":7402,"title":7403,"module":7399,"summary":7404},"\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":7406,"title":7407,"module":7399,"summary":7408},"\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":7410,"title":7411,"module":7399,"summary":7412},"\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":7414,"title":7415,"module":7416,"summary":7417},"\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":7419,"title":7420,"module":7416,"summary":7421},"\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":7423,"title":7424,"module":7416,"summary":7425},"\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":7427,"title":7428,"module":7416,"summary":7429},"\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":7431,"title":7432,"module":7433,"summary":7434},"\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":7436,"title":7437,"module":7433,"summary":7438},"\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":7440,"title":7441,"module":7433,"summary":7442},"\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":7444,"title":7445,"module":6,"summary":6},"\u002Fcategory-theory","Category Theory",{"path":7447,"title":6089,"module":7448,"summary":7449},"\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":7451,"title":7452,"module":7448,"summary":7453},"\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":7455,"title":7456,"module":7448,"summary":7457},"\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":7459,"title":5448,"module":7448,"summary":7460},"\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":7462,"title":7463,"module":4895,"summary":7464},"\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":7466,"title":7467,"module":4895,"summary":7468},"\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":7470,"title":7471,"module":4895,"summary":7472},"\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":7474,"title":7475,"module":7476,"summary":7477},"\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":7479,"title":7480,"module":7476,"summary":7481},"\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":7483,"title":7484,"module":7476,"summary":7485},"\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":7487,"title":7488,"module":7476,"summary":7489},"\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":7491,"title":7492,"module":7476,"summary":7493},"\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":7495,"title":7496,"module":7497,"summary":7498},"\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":7500,"title":7501,"module":7497,"summary":7502},"\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":7504,"title":7505,"module":7497,"summary":7506},"\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":7508,"title":7509,"module":7497,"summary":7510},"\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":7512,"title":7513,"module":7497,"summary":7514},"\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":7516,"title":7517,"module":7518,"summary":7519},"\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":7521,"title":7522,"module":7518,"summary":7523},"\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":7525,"title":7526,"module":7518,"summary":7527},"\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":7529,"title":7530,"module":7518,"summary":7531},"\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":7533,"title":7534,"module":7535,"summary":7536},"\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":7538,"title":7539,"module":7535,"summary":7540},"\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":7542,"title":7543,"module":7535,"summary":7544},"\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":7546,"title":7547,"module":7535,"summary":7548},"\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":7550,"title":7551,"module":7535,"summary":7552},"\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":7554,"title":7555,"module":7535,"summary":7556},"\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":7558,"title":7559,"module":7535,"summary":7560},"\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":7562,"title":7563,"module":7535,"summary":7564},"\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":7566,"title":7567,"module":7535,"summary":7568},"\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":7570,"title":7571,"module":7572,"summary":7573},"\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":7575,"title":7576,"module":7572,"summary":7577},"\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":7579,"title":7580,"module":7572,"summary":7581},"\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":7583,"title":7584,"module":7572,"summary":7585},"\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":7587,"title":7588,"module":7572,"summary":7589},"\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":7591,"title":7592,"module":7593,"summary":7594},"\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":7596,"title":7597,"module":7593,"summary":7598},"\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":7600,"title":7601,"module":7593,"summary":7602},"\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":2318,"title":7604,"module":7593,"summary":7605},"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":7607,"title":7608,"module":7593,"summary":7609},"\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":7611,"title":7612,"module":7593,"summary":7613},"\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":7615,"title":7616,"module":7593,"summary":7617},"\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":7619,"title":7620,"module":7621,"summary":7622},"\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":7624,"title":7625,"module":7621,"summary":7626},"\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":7628,"title":7629,"module":7621,"summary":7630},"\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":7632,"title":7633,"module":7634,"summary":7635},"\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":7637,"title":7638,"module":7634,"summary":7639},"\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":7641,"title":7642,"module":7634,"summary":7643},"\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":7645,"title":7646,"module":7634,"summary":7647},"\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":7649,"title":7650,"module":7634,"summary":7651},"\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":7653,"title":7654,"module":7634,"summary":7655},"\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":7657,"title":7658,"module":7634,"summary":7659},"\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":7661,"title":7662,"module":7663,"summary":7664},"\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":7666,"title":7667,"module":7663,"summary":7668},"\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":7670,"title":7671,"module":7663,"summary":7672},"\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":7674,"title":7675,"module":7663,"summary":7676},"\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":7678,"title":7679,"module":7663,"summary":7680},"\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":7682,"title":7683,"module":7663,"summary":7684},"\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":7686,"title":7687,"module":7663,"summary":7688},"\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":7690,"title":7691,"module":7663,"summary":7692},"\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":7694,"title":7695,"module":7663,"summary":7696},"\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":7698,"title":7699,"module":7663,"summary":7700},"\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":7702,"title":7703,"module":7663,"summary":7704},"\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":7706,"title":7707,"module":7708,"summary":7709},"\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":7711,"title":7712,"module":7708,"summary":7713},"\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":7715,"title":7716,"module":7708,"summary":7717},"\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":7719,"title":7720,"module":7708,"summary":7721},"\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":7723,"title":7724,"module":7708,"summary":7725},"\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":7727,"title":7728,"module":6,"summary":6},"\u002Fdeep-learning","Deep Learning",{"path":7730,"title":7731,"module":5639,"summary":7732},"\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":7734,"title":7735,"module":5639,"summary":7736},"\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":7738,"title":7739,"module":5639,"summary":7740},"\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":7742,"title":7743,"module":5639,"summary":7744},"\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":7746,"title":7747,"module":5639,"summary":7748},"\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":7750,"title":7751,"module":7752,"summary":7753},"\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":7755,"title":7756,"module":7752,"summary":7757},"\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":7759,"title":7760,"module":7752,"summary":7761},"\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":7763,"title":7764,"module":7752,"summary":7765},"\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":7767,"title":7768,"module":7769,"summary":7770},"\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":7772,"title":7773,"module":7769,"summary":7774},"\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":7776,"title":7777,"module":7769,"summary":7778},"\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":7780,"title":7781,"module":7769,"summary":7782},"\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":7784,"title":7785,"module":7786,"summary":7787},"\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":7789,"title":7790,"module":7786,"summary":7791},"\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":7793,"title":7794,"module":7786,"summary":7795},"\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":7797,"title":7798,"module":7786,"summary":7799},"\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":7801,"title":7802,"module":7786,"summary":7803},"\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":7805,"title":7806,"module":7807,"summary":7808},"\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":7810,"title":7811,"module":7807,"summary":7812},"\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":7814,"title":7815,"module":7807,"summary":7816},"\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":7818,"title":7819,"module":7820,"summary":7821},"\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":7823,"title":7824,"module":7820,"summary":7825},"\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":7827,"title":7828,"module":7820,"summary":7829},"\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":7831,"title":7832,"module":7833,"summary":7834},"\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":7836,"title":7837,"module":7833,"summary":7838},"\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":7840,"title":7841,"module":7833,"summary":7842},"\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":7844,"title":7845,"module":7833,"summary":7846},"\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":7848,"title":7849,"module":7850,"summary":7851},"\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":7853,"title":7854,"module":7850,"summary":7855},"\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":7857,"title":7858,"module":7850,"summary":7859},"\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":7861,"title":7862,"module":7850,"summary":7863},"\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":7865,"title":7866,"module":7850,"summary":7867},"\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":7869,"title":7870,"module":7850,"summary":7871},"\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":7873,"title":7874,"module":7875,"summary":7876},"\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":7878,"title":7879,"module":7875,"summary":7880},"\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":7882,"title":7883,"module":7875,"summary":7884},"\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":7886,"title":7887,"module":7875,"summary":7888},"\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":7890,"title":7891,"module":7892,"summary":7893},"\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":7895,"title":7896,"module":7892,"summary":7897},"\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":7899,"title":7900,"module":7892,"summary":7901},"\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":7903,"title":7904,"module":7905,"summary":7906},"\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":7908,"title":7909,"module":7905,"summary":7910},"\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":7912,"title":7913,"module":7905,"summary":7914},"\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":7916,"title":7917,"module":7905,"summary":7918},"\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":7920,"title":7921,"module":7905,"summary":7922},"\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":7924,"title":7925,"module":7926,"summary":7927},"\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":7929,"title":7930,"module":7926,"summary":7931},"\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":7933,"title":7934,"module":7926,"summary":7935},"\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":7937,"title":7938,"module":6,"summary":6},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":7940,"title":7941,"module":7942,"summary":7943},"\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":7945,"title":7946,"module":7942,"summary":7947},"\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":7949,"title":7950,"module":7942,"summary":7951},"\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":7953,"title":7954,"module":7942,"summary":7955},"\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":7957,"title":7958,"module":7959,"summary":7960},"\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":7962,"title":7963,"module":7959,"summary":7964},"\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":7966,"title":7967,"module":7959,"summary":7968},"\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":7970,"title":7971,"module":7959,"summary":7972},"\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":7974,"title":7975,"module":7976,"summary":7977},"\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":7979,"title":7980,"module":7976,"summary":7981},"\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":7983,"title":7984,"module":7976,"summary":7985},"\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":7987,"title":7988,"module":7976,"summary":7989},"\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":7991,"title":7992,"module":7993,"summary":7994},"\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":7996,"title":7997,"module":7993,"summary":7998},"\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":8000,"title":8001,"module":7993,"summary":8002},"\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":8004,"title":8005,"module":7993,"summary":8006},"\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":8008,"title":8009,"module":8010,"summary":8011},"\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":8013,"title":8014,"module":8010,"summary":8015},"\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":8017,"title":8018,"module":8010,"summary":8019},"\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":8021,"title":8022,"module":8010,"summary":8023},"\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":8025,"title":8026,"module":8027,"summary":8028},"\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":8030,"title":8031,"module":8027,"summary":8032},"\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":8034,"title":8035,"module":8027,"summary":8036},"\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":8038,"title":8039,"module":8027,"summary":8040},"\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":8042,"title":8043,"module":8044,"summary":8045},"\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":8047,"title":8048,"module":8044,"summary":8049},"\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":8051,"title":8052,"module":8044,"summary":8053},"\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":8055,"title":8056,"module":8044,"summary":8057},"\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":8059,"title":8060,"module":8044,"summary":8061},"\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":8063,"title":8064,"module":8065,"summary":8066},"\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":8068,"title":8069,"module":8065,"summary":8070},"\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":8072,"title":8073,"module":8074,"summary":8075},"\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":8077,"title":8078,"module":8074,"summary":8079},"\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":8081,"title":8082,"module":8074,"summary":8083},"\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":8085,"title":8086,"module":8074,"summary":8087},"\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":8089,"title":8090,"module":8091,"summary":8092},"\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":8094,"title":8095,"module":8091,"summary":8096},"\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":8098,"title":8099,"module":8091,"summary":8100},"\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":8102,"title":8103,"module":8091,"summary":8104},"\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":8106,"title":8107,"module":8091,"summary":8108},"\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":8110,"title":8111,"module":8112,"summary":8113},"\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":8115,"title":8116,"module":8112,"summary":8117},"\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":8119,"title":8120,"module":8112,"summary":8121},"\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":8123,"title":8124,"module":8112,"summary":8125},"\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":8127,"title":8128,"module":6,"summary":6},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":8130,"title":8131,"module":4895,"summary":8132},"\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":8134,"title":8135,"module":8136,"summary":8137},"\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":8139,"title":8140,"module":8136,"summary":8141},"\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":8143,"title":8144,"module":8136,"summary":8145},"\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":8147,"title":8148,"module":8136,"summary":8149},"\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":8151,"title":8152,"module":8136,"summary":8153},"\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":8155,"title":8156,"module":8136,"summary":8157},"\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":8159,"title":8160,"module":8136,"summary":8161},"\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":8163,"title":8164,"module":8165,"summary":8166},"\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":8168,"title":8169,"module":8165,"summary":8170},"\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":8172,"title":8173,"module":8165,"summary":8174},"\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":8176,"title":8177,"module":8165,"summary":8178},"\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":8180,"title":8181,"module":8182,"summary":8183},"\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":8185,"title":8186,"module":8182,"summary":8187},"\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":8189,"title":8190,"module":8182,"summary":8191},"\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":8193,"title":8194,"module":8182,"summary":8195},"\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":8197,"title":8198,"module":8199,"summary":8200},"\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":8202,"title":8203,"module":8199,"summary":8204},"\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":8206,"title":8207,"module":8199,"summary":8208},"\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":8210,"title":8211,"module":8199,"summary":8212},"\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":8214,"title":8215,"module":8216,"summary":8217},"\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":8219,"title":8220,"module":8216,"summary":8221},"\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":8223,"title":8224,"module":8216,"summary":8225},"\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":8227,"title":8228,"module":8216,"summary":8229},"\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":8231,"title":8232,"module":8233,"summary":8234},"\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":8236,"title":8237,"module":8233,"summary":8238},"\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":8240,"title":8241,"module":8233,"summary":8242},"\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":8244,"title":8245,"module":8246,"summary":8247},"\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":8249,"title":8250,"module":8246,"summary":8251},"\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":8253,"title":8254,"module":8255,"summary":8256},"\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":8258,"title":8259,"module":8255,"summary":8260},"\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":8262,"title":8263,"module":8255,"summary":8264},"\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":8266,"title":8267,"module":6,"summary":6},"\u002Flogic","Logic",{"path":8269,"title":8270,"module":4895,"summary":8271},"\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":8273,"title":8274,"module":4895,"summary":8275},"\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":8277,"title":8278,"module":4895,"summary":8279},"\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":8281,"title":8282,"module":4895,"summary":8283},"\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":8285,"title":8286,"module":4895,"summary":8287},"\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":2307,"title":8289,"module":4895,"summary":8290},"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":8292,"title":5114,"module":8293,"summary":8294},"\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":8296,"title":8297,"module":8293,"summary":8298},"\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":8300,"title":8301,"module":8293,"summary":8302},"\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":8304,"title":8305,"module":8293,"summary":8306},"\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":8308,"title":8309,"module":8293,"summary":8310},"\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":8312,"title":8313,"module":8293,"summary":8314},"\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":8316,"title":8317,"module":8293,"summary":8318},"\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":8320,"title":8321,"module":8293,"summary":8322},"\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":8324,"title":8325,"module":8293,"summary":8326},"\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":8328,"title":8329,"module":8293,"summary":8330},"\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":8332,"title":8333,"module":8293,"summary":8334},"\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":8336,"title":8337,"module":8293,"summary":8338},"\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":8340,"title":8341,"module":8342,"summary":8343},"\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":8345,"title":8346,"module":8342,"summary":8347},"\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":8349,"title":8350,"module":8342,"summary":8351},"\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":8353,"title":8354,"module":8342,"summary":8355},"\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":8357,"title":8358,"module":8342,"summary":8359},"\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":8361,"title":8362,"module":8342,"summary":8363},"\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":8365,"title":8366,"module":8342,"summary":8367},"\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":8369,"title":8370,"module":8342,"summary":8371},"\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":2139,"title":8373,"module":8342,"summary":8374},"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":8376,"title":8377,"module":8342,"summary":8378},"\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":8380,"title":8381,"module":8342,"summary":8382},"\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":8384,"title":8385,"module":8342,"summary":8386},"\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":8388,"title":8389,"module":8342,"summary":8390},"\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":8392,"title":8393,"module":8342,"summary":8394},"\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":8396,"title":7716,"module":8397,"summary":8398},"\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":8400,"title":8401,"module":8397,"summary":8402},"\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":8404,"title":8405,"module":8397,"summary":8406},"\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":8408,"title":8409,"module":8397,"summary":8410},"\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":8412,"title":8413,"module":8397,"summary":8414},"\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":8416,"title":8417,"module":8397,"summary":8418},"\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":8420,"title":8421,"module":8397,"summary":8422},"\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":8424,"title":8425,"module":8397,"summary":8426},"\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":8428,"title":8429,"module":3955,"summary":8430},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow","Sharpening DQN: Improvements and the Distributional Idea","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":8432,"title":8433,"module":3955,"summary":8434},"\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":8436,"title":8437,"module":3955,"summary":8438},"\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":8440,"title":8441,"module":3955,"summary":8442},"\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":8444,"title":8445,"module":3955,"summary":8446},"\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":8448,"title":8449,"module":3955,"summary":8450},"\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":8452,"title":8453,"module":3955,"summary":8454},"\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":8456,"title":8457,"module":3955,"summary":8458},"\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":8460,"title":8461,"module":3955,"summary":8462},"\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":8464,"title":8465,"module":3955,"summary":8466},"\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":17,"title":18,"module":3955,"summary":8468},"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":3957,"title":5,"module":3955,"summary":3975},{"path":8471,"title":8472,"module":3955,"summary":8473},"\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":8475,"title":8476,"module":3955,"summary":8477},"\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":8479,"title":8480,"module":3955,"summary":8481},"\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":8483,"title":8484,"module":3955,"summary":8485},"\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":8487,"title":8488,"module":3955,"summary":8489},"\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":8491,"title":8492,"module":3955,"summary":8493},"\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":8495,"title":8496,"module":3955,"summary":8497},"\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":8499,"title":8500,"module":3955,"summary":8501},"\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":8503,"title":8504,"module":3955,"summary":8505},"\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":8507,"title":8508,"module":3955,"summary":8509},"\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":8511,"title":8512,"module":8513,"summary":8514},"\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":8516,"title":8517,"module":8513,"summary":8518},"\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":8520,"title":8521,"module":8513,"summary":8522},"\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":8524,"title":8525,"module":8513,"summary":8526},"\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":8528,"title":8529,"module":8513,"summary":8530},"\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":8532,"title":8533,"module":8513,"summary":8534},"\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":8536,"title":8537,"module":8513,"summary":8538},"\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":8540,"title":8541,"module":8513,"summary":8542},"\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":8544,"title":7708,"module":6,"summary":6},"\u002Freinforcement-learning",{"path":8546,"title":8547,"module":4895,"summary":8548},"\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":8550,"title":8551,"module":4895,"summary":8552},"\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":8554,"title":8555,"module":4895,"summary":8556},"\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":8558,"title":8559,"module":4895,"summary":8560},"\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":8562,"title":8563,"module":8564,"summary":8565},"\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":8567,"title":8568,"module":8564,"summary":8569},"\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":8571,"title":8572,"module":8564,"summary":8573},"\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":8575,"title":8576,"module":8564,"summary":8577},"\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":8579,"title":8580,"module":8564,"summary":8581},"\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":8583,"title":8584,"module":8564,"summary":8585},"\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":8587,"title":8588,"module":8564,"summary":8589},"\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":8591,"title":8592,"module":8564,"summary":8593},"\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":8595,"title":8596,"module":8564,"summary":8597},"\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":8599,"title":8600,"module":8564,"summary":8601},"\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":8603,"title":8604,"module":8564,"summary":8605},"\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":8607,"title":8608,"module":8564,"summary":8609},"\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":8611,"title":8612,"module":8613,"summary":8614},"\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":8616,"title":8617,"module":8613,"summary":8618},"\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":8620,"title":8621,"module":8613,"summary":8622},"\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":8624,"title":8625,"module":8613,"summary":8626},"\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":8628,"title":8629,"module":8613,"summary":8630},"\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":8632,"title":8633,"module":8613,"summary":8634},"\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":8636,"title":8637,"module":8613,"summary":8638},"\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":8640,"title":8641,"module":8613,"summary":8642},"\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":8644,"title":8645,"module":8613,"summary":8646},"\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":8648,"title":8649,"module":8613,"summary":8650},"\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":8652,"title":8653,"module":8613,"summary":8654},"\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":8656,"title":8657,"module":8613,"summary":8658},"\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":8660,"title":8661,"module":8662,"summary":8663},"\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":8665,"title":8666,"module":8662,"summary":8667},"\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":8669,"title":8670,"module":8662,"summary":8671},"\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":8673,"title":8674,"module":8662,"summary":8675},"\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":8677,"title":8678,"module":8662,"summary":8679},"\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":8681,"title":8682,"module":8662,"summary":8683},"\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":8685,"title":8686,"module":8662,"summary":8687},"\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":8689,"title":8286,"module":8662,"summary":8690},"\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":8692,"title":8693,"module":8662,"summary":8694},"\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":8696,"title":8697,"module":8662,"summary":8698},"\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":8700,"title":8701,"module":8702,"summary":8703},"\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":8705,"title":8706,"module":8702,"summary":8707},"\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":8709,"title":8710,"module":8702,"summary":8711},"\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":8713,"title":8714,"module":8702,"summary":8715},"\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":8717,"title":7708,"module":8702,"summary":8718},"\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":8720,"title":8721,"module":8702,"summary":8722},"\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":8724,"title":8725,"module":8702,"summary":8726},"\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":8728,"title":8729,"module":8702,"summary":8730},"\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":8732,"title":8733,"module":8734,"summary":8735},"\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":8737,"title":8738,"module":8734,"summary":8739},"\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":8741,"title":8742,"module":8734,"summary":8743},"\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":8745,"title":8746,"module":8734,"summary":8747},"\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":8749,"title":8750,"module":8734,"summary":8751},"\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":8753,"title":8754,"module":8734,"summary":8755},"\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":8757,"title":8758,"module":8734,"summary":8759},"\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":8761,"title":8762,"module":8734,"summary":8763},"\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":8765,"title":8766,"module":6,"summary":6},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":8768,"title":8769,"module":8770,"summary":8771},"\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":8773,"title":8774,"module":8770,"summary":8775},"\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":8777,"title":8778,"module":8770,"summary":8779},"\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":8781,"title":8782,"module":8770,"summary":8783},"\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":8785,"title":8786,"module":8770,"summary":8787},"\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":8789,"title":8790,"module":8791,"summary":8792},"\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":8794,"title":8795,"module":8791,"summary":8796},"\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":8798,"title":8799,"module":8791,"summary":8800},"\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":8802,"title":8803,"module":8791,"summary":8804},"\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":8806,"title":8807,"module":8808,"summary":8809},"\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":8811,"title":8812,"module":8808,"summary":8813},"\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":8815,"title":8816,"module":8808,"summary":8817},"\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":8819,"title":8820,"module":8808,"summary":8821},"\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":8823,"title":8824,"module":8825,"summary":8826},"\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":8828,"title":8829,"module":8825,"summary":8830},"\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":8832,"title":8833,"module":8834,"summary":8835},"\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":8837,"title":8838,"module":8834,"summary":8839},"\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":8841,"title":8842,"module":8843,"summary":8844},"\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":8846,"title":8847,"module":8843,"summary":8848},"\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":8850,"title":8851,"module":8843,"summary":8852},"\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":8854,"title":8855,"module":8843,"summary":8856},"\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":8858,"title":8859,"module":8860,"summary":8861},"\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":8863,"title":8864,"module":8860,"summary":8865},"\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":8867,"title":8868,"module":8860,"summary":8869},"\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":8871,"title":8872,"module":8873,"summary":8874},"\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":8876,"title":8877,"module":8873,"summary":8878},"\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":8880,"title":8881,"module":8873,"summary":8882},"\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":8884,"title":8885,"module":8886,"summary":8887},"\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":8889,"title":8890,"module":8886,"summary":8891},"\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":8893,"title":8894,"module":8895,"summary":8896},"\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":8898,"title":8899,"module":8895,"summary":8900},"\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":8902,"title":8903,"module":8895,"summary":8904},"\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":8906,"title":8907,"module":8908,"summary":8909},"\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":8911,"title":8912,"module":8908,"summary":8913},"\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":8915,"title":8916,"module":8908,"summary":8917},"\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":8919,"title":8920,"module":8908,"summary":8921},"\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":8923,"title":8924,"module":8908,"summary":8925},"\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":8927,"title":8928,"module":6,"summary":6},"\u002Fnuclear-physics","Nuclear Physics",{"path":8930,"title":8931,"module":4895,"summary":8932},"\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":8934,"title":8935,"module":4895,"summary":8936},"\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":8938,"title":8939,"module":4895,"summary":8940},"\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":8942,"title":8943,"module":4895,"summary":8944},"\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":8946,"title":8947,"module":4895,"summary":8948},"\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":8950,"title":8951,"module":8952,"summary":8953},"\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":8955,"title":8956,"module":8952,"summary":8957},"\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":8959,"title":8960,"module":8952,"summary":8961},"\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":8963,"title":8964,"module":8952,"summary":8965},"\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":8967,"title":8968,"module":8969,"summary":8970},"\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":8972,"title":8973,"module":8969,"summary":8974},"\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":8976,"title":8977,"module":8969,"summary":8978},"\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":8980,"title":8981,"module":5361,"summary":8982},"\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":8984,"title":8985,"module":5361,"summary":8986},"\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":8988,"title":8989,"module":5361,"summary":8990},"\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":8992,"title":8993,"module":5843,"summary":8994},"\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":8996,"title":7555,"module":5843,"summary":8997},"\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":8999,"title":7662,"module":5843,"summary":9000},"\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":9002,"title":9003,"module":5843,"summary":9004},"\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":9006,"title":9007,"module":5843,"summary":9008},"\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":9010,"title":9011,"module":5843,"summary":9012},"\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":9014,"title":9015,"module":9016,"summary":9017},"\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":9019,"title":9020,"module":9016,"summary":9021},"\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":9023,"title":9024,"module":9016,"summary":9025},"\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":9027,"title":9028,"module":9016,"summary":9029},"\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":9031,"title":9032,"module":9016,"summary":9033},"\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":9035,"title":9036,"module":9016,"summary":9037},"\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":9039,"title":9040,"module":9016,"summary":9041},"\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":9043,"title":9044,"module":9016,"summary":9045},"\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":9047,"title":9048,"module":9016,"summary":9049},"\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":9051,"title":9052,"module":9016,"summary":9053},"\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":9055,"title":9056,"module":9016,"summary":9057},"\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":9059,"title":9060,"module":9016,"summary":9061},"\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":9063,"title":9064,"module":9016,"summary":9065},"\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":9067,"title":9068,"module":9016,"summary":9069},"\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":9071,"title":9072,"module":9016,"summary":9073},"\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":9075,"title":9076,"module":9016,"summary":9077},"\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":9079,"title":9080,"module":9016,"summary":9081},"\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":9083,"title":9084,"module":9016,"summary":9085},"\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":9087,"title":9088,"module":9016,"summary":9089},"\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":9091,"title":9092,"module":9016,"summary":9093},"\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":9095,"title":9096,"module":7650,"summary":9097},"\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":9099,"title":9100,"module":7650,"summary":9101},"\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":9103,"title":9104,"module":7650,"summary":9105},"\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":9107,"title":9108,"module":7650,"summary":9109},"\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":9111,"title":9112,"module":7650,"summary":9113},"\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":9115,"title":9116,"module":7650,"summary":9117},"\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":9119,"title":9120,"module":7650,"summary":9121},"\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":9123,"title":9124,"module":7650,"summary":9125},"\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":9127,"title":9128,"module":9129,"summary":9130},"\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":9132,"title":9133,"module":9129,"summary":9134},"\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":9136,"title":9137,"module":9129,"summary":9138},"\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":9140,"title":9141,"module":9129,"summary":9142},"\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":9144,"title":9145,"module":6,"summary":6},"\u002Fnatural-language-processing","Natural Language Processing",{"path":9147,"title":9148,"module":4895,"summary":9149},"\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":9151,"title":9152,"module":4895,"summary":9153},"\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":9155,"title":9156,"module":4895,"summary":9157},"\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":9159,"title":9160,"module":9161,"summary":9162},"\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":9164,"title":9165,"module":9161,"summary":9166},"\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":9168,"title":9169,"module":9161,"summary":9170},"\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":9172,"title":9173,"module":9161,"summary":9174},"\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":9176,"title":9177,"module":9178,"summary":9179},"\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":9181,"title":9182,"module":9178,"summary":9183},"\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":9185,"title":9186,"module":9178,"summary":9187},"\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":9189,"title":9190,"module":9178,"summary":9191},"\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":9193,"title":9194,"module":9195,"summary":9196},"\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":9198,"title":9199,"module":9195,"summary":9200},"\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":9202,"title":9203,"module":9195,"summary":9204},"\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":9206,"title":9207,"module":9195,"summary":9208},"\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":9210,"title":9211,"module":9212,"summary":9213},"\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":9215,"title":9216,"module":9212,"summary":9217},"\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":9219,"title":9220,"module":9212,"summary":9221},"\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":9223,"title":9224,"module":9225,"summary":9226},"\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":9228,"title":9229,"module":9225,"summary":9230},"\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":9232,"title":9233,"module":9225,"summary":9234},"\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":9236,"title":9237,"module":9225,"summary":9238},"\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":9240,"title":9241,"module":9242,"summary":9243},"\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":9245,"title":9246,"module":9242,"summary":9247},"\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":9249,"title":9250,"module":9242,"summary":9251},"\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":9253,"title":9254,"module":9242,"summary":9255},"\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":9257,"title":9258,"module":9259,"summary":9260},"\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":9262,"title":9263,"module":9259,"summary":9264},"\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":9266,"title":9267,"module":9259,"summary":9268},"\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":9270,"title":9271,"module":9259,"summary":9272},"\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":9274,"title":9275,"module":9276,"summary":9277},"\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":9279,"title":9280,"module":9276,"summary":9281},"\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":9283,"title":9284,"module":9276,"summary":9285},"\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":9287,"title":9288,"module":9276,"summary":9289},"\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":9291,"title":9292,"module":9276,"summary":9293},"\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":9295,"title":9296,"module":9297,"summary":9298},"\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":9300,"title":9301,"module":9297,"summary":9302},"\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":9304,"title":9305,"module":9297,"summary":9306},"\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":9308,"title":9309,"module":9310,"summary":9311},"\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":9313,"title":9314,"module":9310,"summary":9315},"\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":9317,"title":9318,"module":9310,"summary":9319},"\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":9321,"title":9322,"module":9322,"summary":9323},"\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":9325,"title":9326,"module":9322,"summary":9327},"\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":9329,"title":9330,"module":9322,"summary":9331},"\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":9333,"title":9334,"module":9322,"summary":9335},"\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":9337,"title":9338,"module":9322,"summary":9339},"\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":9341,"title":9342,"module":9322,"summary":9343},"\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":9345,"title":9346,"module":6,"summary":6},"\u002Fparticle-physics","Particle Physics",{"path":9348,"title":9349,"module":9350,"summary":9351},"\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":9353,"title":9354,"module":9350,"summary":9355},"\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":9357,"title":9358,"module":9350,"summary":9359},"\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":9361,"title":9362,"module":9363,"summary":9364},"\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":9366,"title":9367,"module":9363,"summary":9368},"\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":9370,"title":9371,"module":9363,"summary":9372},"\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":9374,"title":9375,"module":9363,"summary":9376},"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder","The Cosmic Distance Ladder","No single method measures distances from the nearest stars to the far reaches of the universe. Instead a ladder of overlapping techniques, each calibrated by the one below it, extends the scale rung by rung: trigonometric parallax, main-sequence fitting, pulsating variables, the tip of the red-giant branch, the Tully-Fisher relation, and Type Ia supernovae. Each rung inherits the uncertainty of every rung beneath it, so the whole chain sets the accuracy of the Hubble constant.\n",{"path":9378,"title":9379,"module":9380,"summary":9381},"\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":9383,"title":9384,"module":9380,"summary":9385},"\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":9387,"title":9388,"module":9380,"summary":9389},"\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":9391,"title":9392,"module":9380,"summary":9393},"\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":9395,"title":9396,"module":9397,"summary":9398},"\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":9400,"title":9401,"module":9397,"summary":9402},"\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":9404,"title":9405,"module":9397,"summary":9406},"\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":9408,"title":9409,"module":9397,"summary":9410},"\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":9412,"title":9413,"module":9414,"summary":9415},"\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":9417,"title":9418,"module":9414,"summary":9419},"\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":9421,"title":9422,"module":9414,"summary":9423},"\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":9425,"title":9426,"module":9414,"summary":9427},"\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":9429,"title":9430,"module":9431,"summary":9432},"\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":9434,"title":9435,"module":9431,"summary":9436},"\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":9438,"title":9439,"module":9431,"summary":9440},"\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":9442,"title":9443,"module":9444,"summary":9445},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure","The Main Sequence and Its Structure","Stellar Evolution","A star settles onto the zero-age main sequence when core hydrogen ignition halts contraction. Homology scaling of the structure equations reproduces the mass–luminosity relation, and the burning mode splits the sequence into an upper branch with a convective core and a lower branch with a convective envelope. The main-sequence lifetime falls steeply with mass, and the turnoff of a coeval cluster serves as a clock.\n",{"path":9447,"title":9448,"module":9444,"summary":9449},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution","Post-Main-Sequence Evolution of Low-Mass Stars","When a low-mass star exhausts core hydrogen, burning moves to a shell, the core contracts, and the envelope swells into a red giant. A degenerate helium core ignites in a flash, settles onto the horizontal branch, and after a second contraction the star climbs the asymptotic giant branch with two burning shells. Thermal pulses and dredge-up enrich the surface, and mass loss ejects a planetary nebula, leaving a carbon–oxygen white dwarf.\n",{"path":9451,"title":9452,"module":9444,"summary":9453},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars","The Evolution of Massive Stars","Stars above about eight solar masses burn through hydrogen, helium, carbon, neon, oxygen, and silicon in stages that grow shorter as neutrino losses accelerate contraction. The interior becomes an onion of concentric burning shells around an inert iron core. Radiation pressure near the Eddington limit drives fierce winds that can strip the hydrogen envelope entirely, and silicon burning builds an iron core toward the threshold of collapse.\n",{"path":9455,"title":9456,"module":9444,"summary":9457},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip","Stellar Pulsation and the Instability Strip","Radial pulsation is a standing sound wave whose period scales inversely with the square root of the mean density. The kappa mechanism, an opacity valve seated in the helium partial-ionization zone, turns a star into a heat engine that pumps the oscillation. Stars in the instability strip pulsate as Cepheids, RR Lyrae, and Mira variables, and the Cepheid period–luminosity relation calibrates the distance ladder.\n",{"path":9459,"title":7883,"module":9460,"summary":9461},"\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":9463,"title":9464,"module":9460,"summary":9465},"\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":9467,"title":9468,"module":9460,"summary":9469},"\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":9471,"title":9472,"module":9460,"summary":9473},"\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":9475,"title":9476,"module":9460,"summary":9477},"\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":9479,"title":9480,"module":9481,"summary":9482},"\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":9484,"title":9485,"module":9481,"summary":9486},"\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":9488,"title":9489,"module":9481,"summary":9490},"\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":9492,"title":9493,"module":9481,"summary":9494},"\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":9496,"title":9497,"module":9498,"summary":9499},"\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":9501,"title":9502,"module":9498,"summary":9503},"\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":9505,"title":9506,"module":9498,"summary":9507},"\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":9509,"title":9510,"module":9498,"summary":9511},"\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":9513,"title":9514,"module":9498,"summary":9515},"\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":9517,"title":9518,"module":9519,"summary":9520},"\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":9522,"title":9523,"module":9519,"summary":9524},"\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":9526,"title":6602,"module":9519,"summary":9527},"\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":9529,"title":9530,"module":9519,"summary":9531},"\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":9533,"title":9534,"module":9519,"summary":9535},"\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":9537,"title":9538,"module":9539,"summary":9540},"\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":9542,"title":9543,"module":9539,"summary":9544},"\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":9546,"title":9547,"module":9539,"summary":9548},"\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":9550,"title":9551,"module":9539,"summary":9552},"\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":9554,"title":9555,"module":9539,"summary":9556},"\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":9558,"title":9559,"module":9539,"summary":9560},"\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":9562,"title":9563,"module":9539,"summary":9564},"\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":9566,"title":9567,"module":6,"summary":6},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":9569,"title":9570,"module":6,"summary":6},"\u002Fcolophon","Colophon",{"path":9572,"title":9573,"module":6,"summary":6},"\u002F","Study Notes",[9575,9594,9627,9661,9680,9735],{"module":4895,"moduleNumber":9576,"slug":9577,"lessons":9578},1,"foundations",[9579,9581,9583,9586,9589,9591],{"title":8270,"path":8269,"lessonNumber":9576,"topics":9580,"summary":8271},[4895],{"title":8274,"path":8273,"lessonNumber":3939,"topics":9582,"summary":8275},[4895],{"title":8278,"path":8277,"lessonNumber":9584,"topics":9585,"summary":8279},3,[4895],{"title":8282,"path":8281,"lessonNumber":9587,"topics":9588,"summary":8283},4,[4895],{"title":8286,"path":8285,"lessonNumber":3952,"topics":9590,"summary":8287},[4895],{"title":8289,"path":2307,"lessonNumber":9592,"topics":9593,"summary":8290},6,[4895],{"module":8293,"moduleNumber":3939,"slug":9595,"lessons":9596},"tabular-methods",[9597,9600,9602,9604,9606,9608,9610,9613,9616,9619,9622,9625],{"title":5114,"path":8292,"lessonNumber":9576,"topics":9598,"summary":8294},[9599],"Tabular Methods",{"title":8297,"path":8296,"lessonNumber":3939,"topics":9601,"summary":8298},[9599],{"title":8301,"path":8300,"lessonNumber":9584,"topics":9603,"summary":8302},[9599],{"title":8305,"path":8304,"lessonNumber":9587,"topics":9605,"summary":8306},[9599],{"title":8309,"path":8308,"lessonNumber":3952,"topics":9607,"summary":8310},[9599],{"title":8313,"path":8312,"lessonNumber":9592,"topics":9609,"summary":8314},[9599],{"title":8317,"path":8316,"lessonNumber":9611,"topics":9612,"summary":8318},7,[9599],{"title":8321,"path":8320,"lessonNumber":9614,"topics":9615,"summary":8322},8,[9599],{"title":8325,"path":8324,"lessonNumber":9617,"topics":9618,"summary":8326},9,[9599],{"title":8329,"path":8328,"lessonNumber":9620,"topics":9621,"summary":8330},10,[9599],{"title":8333,"path":8332,"lessonNumber":9623,"topics":9624,"summary":8334},11,[9599],{"title":8337,"path":8336,"lessonNumber":3953,"topics":9626,"summary":8338},[9599],{"module":8342,"moduleNumber":9584,"slug":9628,"lessons":9629},"approximation",[9630,9633,9635,9637,9639,9641,9643,9645,9647,9649,9651,9653,9655,9658],{"title":8341,"path":8340,"lessonNumber":9576,"topics":9631,"summary":8343},[9632],"Approximation",{"title":8346,"path":8345,"lessonNumber":3939,"topics":9634,"summary":8347},[9632],{"title":8350,"path":8349,"lessonNumber":9584,"topics":9636,"summary":8351},[9632],{"title":8354,"path":8353,"lessonNumber":9587,"topics":9638,"summary":8355},[9632],{"title":8358,"path":8357,"lessonNumber":3952,"topics":9640,"summary":8359},[9632],{"title":8362,"path":8361,"lessonNumber":9592,"topics":9642,"summary":8363},[9632],{"title":8366,"path":8365,"lessonNumber":9611,"topics":9644,"summary":8367},[9632],{"title":8370,"path":8369,"lessonNumber":9614,"topics":9646,"summary":8371},[9632],{"title":8373,"path":2139,"lessonNumber":9617,"topics":9648,"summary":8374},[9632],{"title":8377,"path":8376,"lessonNumber":9620,"topics":9650,"summary":8378},[9632],{"title":8381,"path":8380,"lessonNumber":9623,"topics":9652,"summary":8382},[9632],{"title":8385,"path":8384,"lessonNumber":3953,"topics":9654,"summary":8386},[9632],{"title":8389,"path":8388,"lessonNumber":9656,"topics":9657,"summary":8390},13,[9632],{"title":8393,"path":8392,"lessonNumber":9659,"topics":9660,"summary":8394},14,[9632],{"module":8397,"moduleNumber":9587,"slug":9662,"lessons":9663},"deep-rl",[9664,9666,9668,9670,9672,9674,9676,9678],{"title":7716,"path":8396,"lessonNumber":9576,"topics":9665,"summary":8398},[3977],{"title":8401,"path":8400,"lessonNumber":3939,"topics":9667,"summary":8402},[3977],{"title":8405,"path":8404,"lessonNumber":9584,"topics":9669,"summary":8406},[3977],{"title":8409,"path":8408,"lessonNumber":9587,"topics":9671,"summary":8410},[3977],{"title":8413,"path":8412,"lessonNumber":3952,"topics":9673,"summary":8414},[3977],{"title":8417,"path":8416,"lessonNumber":9592,"topics":9675,"summary":8418},[3977],{"title":8421,"path":8420,"lessonNumber":9611,"topics":9677,"summary":8422},[3977],{"title":8425,"path":8424,"lessonNumber":9614,"topics":9679,"summary":8426},[3977],{"module":3955,"moduleNumber":3952,"slug":9681,"lessons":9682},"modern-deep-rl",[9683,9685,9687,9689,9691,9693,9695,9697,9699,9701,9703,9705,9707,9709,9711,9714,9717,9720,9723,9726,9729,9732],{"title":8429,"path":8428,"lessonNumber":9576,"topics":9684,"summary":8430},[3977],{"title":8433,"path":8432,"lessonNumber":3939,"topics":9686,"summary":8434},[3977],{"title":8437,"path":8436,"lessonNumber":9584,"topics":9688,"summary":8438},[3977],{"title":8441,"path":8440,"lessonNumber":9587,"topics":9690,"summary":8442},[3977],{"title":8445,"path":8444,"lessonNumber":3952,"topics":9692,"summary":8446},[3977],{"title":8449,"path":8448,"lessonNumber":9592,"topics":9694,"summary":8450},[3977],{"title":8453,"path":8452,"lessonNumber":9611,"topics":9696,"summary":8454},[3977],{"title":8457,"path":8456,"lessonNumber":9614,"topics":9698,"summary":8458},[3977],{"title":8461,"path":8460,"lessonNumber":9617,"topics":9700,"summary":8462},[3977],{"title":8465,"path":8464,"lessonNumber":9620,"topics":9702,"summary":8466},[3977],{"title":18,"path":17,"lessonNumber":9623,"topics":9704,"summary":8468},[3977],{"title":5,"path":3957,"lessonNumber":3953,"topics":9706,"summary":3975},[3977],{"title":8472,"path":8471,"lessonNumber":9656,"topics":9708,"summary":8473},[3977],{"title":8476,"path":8475,"lessonNumber":9659,"topics":9710,"summary":8477},[3977],{"title":8480,"path":8479,"lessonNumber":9712,"topics":9713,"summary":8481},15,[3977],{"title":8484,"path":8483,"lessonNumber":9715,"topics":9716,"summary":8485},16,[3977],{"title":8488,"path":8487,"lessonNumber":9718,"topics":9719,"summary":8489},17,[3977],{"title":8492,"path":8491,"lessonNumber":9721,"topics":9722,"summary":8493},18,[3977],{"title":8496,"path":8495,"lessonNumber":9724,"topics":9725,"summary":8497},19,[3977],{"title":8500,"path":8499,"lessonNumber":9727,"topics":9728,"summary":8501},20,[3977],{"title":8504,"path":8503,"lessonNumber":9730,"topics":9731,"summary":8505},21,[3977],{"title":8508,"path":8507,"lessonNumber":9733,"topics":9734,"summary":8509},22,[3977],{"module":8513,"moduleNumber":9592,"slug":9736,"lessons":9737},"minds-and-brains",[9738,9741,9743,9745,9747,9749,9751,9753],{"title":8512,"path":8511,"lessonNumber":9576,"topics":9739,"summary":8514},[9740],"Minds and Brains",{"title":8517,"path":8516,"lessonNumber":3939,"topics":9742,"summary":8518},[9740],{"title":8521,"path":8520,"lessonNumber":9584,"topics":9744,"summary":8522},[9740],{"title":8525,"path":8524,"lessonNumber":9587,"topics":9746,"summary":8526},[9740],{"title":8529,"path":8528,"lessonNumber":3952,"topics":9748,"summary":8530},[9740],{"title":8533,"path":8532,"lessonNumber":9592,"topics":9750,"summary":8534},[9740],{"title":8537,"path":8536,"lessonNumber":9611,"topics":9752,"summary":8538},[9740],{"title":8541,"path":8540,"lessonNumber":9614,"topics":9754,"summary":8542},[9740],"\u003Csvg style=\"width:100%;max-width:469.987px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 352.490 122.541\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-29.672 30.485h265.456\"\u002F>\u003Cpath stroke=\"none\" d=\"m237.784 30.485-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(228.662 8.898)\">\u003Cpath d=\"M-23.700 30.477L-23.700 29.255Q-23.700 29.227-23.669 29.196Q-23.637 29.165-23.614 29.165L-23.508 29.165Q-23.438 29.165-23.422 29.227Q-23.360 29.547-23.221 29.788Q-23.083 30.028-22.850 30.169Q-22.618 30.309-22.309 30.309Q-22.071 30.309-21.862 30.249Q-21.653 30.188-21.516 30.040Q-21.379 29.891-21.379 29.645Q-21.379 29.391-21.590 29.225Q-21.801 29.059-22.071 29.005L-22.692 28.891Q-23.098 28.813-23.399 28.557Q-23.700 28.301-23.700 27.926Q-23.700 27.559-23.499 27.337Q-23.297 27.114-22.973 27.016Q-22.649 26.919-22.309 26.919Q-21.844 26.919-21.547 27.126L-21.325 26.942Q-21.301 26.919-21.270 26.919L-21.219 26.919Q-21.188 26.919-21.161 26.946Q-21.133 26.973-21.133 27.005L-21.133 27.989Q-21.133 28.020-21.159 28.049Q-21.184 28.079-21.219 28.079L-21.325 28.079Q-21.360 28.079-21.387 28.051Q-21.415 28.024-21.415 27.989Q-21.415 27.590-21.667 27.370Q-21.919 27.149-22.317 27.149Q-22.672 27.149-22.956 27.272Q-23.239 27.395-23.239 27.700Q-23.239 27.919-23.038 28.051Q-22.836 28.184-22.590 28.227L-21.965 28.340Q-21.536 28.430-21.227 28.727Q-20.919 29.024-20.919 29.438Q-20.919 30.008-21.317 30.286Q-21.715 30.563-22.309 30.563Q-22.860 30.563-23.211 30.227L-23.508 30.540Q-23.532 30.563-23.567 30.563L-23.614 30.563Q-23.637 30.563-23.669 30.532Q-23.700 30.501-23.700 30.477M-19.766 29.524L-19.766 27.333L-20.469 27.333L-20.469 27.079Q-20.114 27.079-19.872 26.846Q-19.629 26.614-19.518 26.266Q-19.407 25.919-19.407 25.563L-19.126 25.563L-19.126 27.036L-17.950 27.036L-17.950 27.333L-19.126 27.333L-19.126 29.508Q-19.126 29.829-19.006 30.057Q-18.887 30.286-18.606 30.286Q-18.426 30.286-18.309 30.163Q-18.192 30.040-18.139 29.860Q-18.086 29.680-18.086 29.508L-18.086 29.036L-17.805 29.036L-17.805 29.524Q-17.805 29.778-17.911 30.018Q-18.016 30.258-18.213 30.411Q-18.411 30.563-18.669 30.563Q-18.985 30.563-19.237 30.440Q-19.489 30.317-19.627 30.083Q-19.766 29.848-19.766 29.524M-16.989 29.653Q-16.989 29.169-16.586 28.874Q-16.184 28.579-15.633 28.460Q-15.083 28.340-14.590 28.340L-14.590 28.051Q-14.590 27.825-14.706 27.618Q-14.821 27.411-15.018 27.292Q-15.215 27.172-15.446 27.172Q-15.872 27.172-16.157 27.278Q-16.086 27.305-16.040 27.360Q-15.993 27.415-15.967 27.485Q-15.942 27.555-15.942 27.630Q-15.942 27.735-15.993 27.827Q-16.044 27.919-16.135 27.969Q-16.227 28.020-16.333 28.020Q-16.438 28.020-16.530 27.969Q-16.622 27.919-16.672 27.827Q-16.723 27.735-16.723 27.630Q-16.723 27.212-16.335 27.065Q-15.946 26.919-15.446 26.919Q-15.114 26.919-14.760 27.049Q-14.407 27.180-14.178 27.434Q-13.950 27.688-13.950 28.036L-13.950 29.837Q-13.950 29.969-13.877 30.079Q-13.805 30.188-13.676 30.188Q-13.551 30.188-13.483 30.083Q-13.415 29.977-13.415 29.837L-13.415 29.325L-13.133 29.325L-13.133 29.837Q-13.133 30.040-13.251 30.198Q-13.368 30.356-13.549 30.440Q-13.731 30.524-13.934 30.524Q-14.165 30.524-14.317 30.352Q-14.469 30.180-14.501 29.950Q-14.661 30.231-14.969 30.397Q-15.278 30.563-15.629 30.563Q-16.141 30.563-16.565 30.340Q-16.989 30.118-16.989 29.653M-16.301 29.653Q-16.301 29.938-16.075 30.124Q-15.848 30.309-15.555 30.309Q-15.309 30.309-15.085 30.192Q-14.860 30.075-14.725 29.872Q-14.590 29.669-14.590 29.415L-14.590 28.583Q-14.856 28.583-15.141 28.637Q-15.426 28.692-15.698 28.821Q-15.969 28.950-16.135 29.157Q-16.301 29.364-16.301 29.653M-12.215 29.524L-12.215 27.333L-12.919 27.333L-12.919 27.079Q-12.563 27.079-12.321 26.846Q-12.079 26.614-11.967 26.266Q-11.856 25.919-11.856 25.563L-11.575 25.563L-11.575 27.036L-10.399 27.036L-10.399 27.333L-11.575 27.333L-11.575 29.508Q-11.575 29.829-11.456 30.057Q-11.336 30.286-11.055 30.286Q-10.876 30.286-10.758 30.163Q-10.641 30.040-10.588 29.860Q-10.536 29.680-10.536 29.508L-10.536 29.036L-10.254 29.036L-10.254 29.524Q-10.254 29.778-10.360 30.018Q-10.465 30.258-10.663 30.411Q-10.860 30.563-11.118 30.563Q-11.434 30.563-11.686 30.440Q-11.938 30.317-12.077 30.083Q-12.215 29.848-12.215 29.524M-9.536 28.731Q-9.536 28.251-9.303 27.835Q-9.071 27.419-8.661 27.169Q-8.251 26.919-7.774 26.919Q-7.044 26.919-6.645 27.360Q-6.247 27.801-6.247 28.532Q-6.247 28.637-6.340 28.661L-8.790 28.661L-8.790 28.731Q-8.790 29.141-8.669 29.497Q-8.547 29.852-8.276 30.069Q-8.004 30.286-7.575 30.286Q-7.211 30.286-6.915 30.057Q-6.618 29.829-6.516 29.477Q-6.508 29.430-6.422 29.415L-6.340 29.415Q-6.247 29.442-6.247 29.524Q-6.247 29.532-6.254 29.563Q-6.317 29.790-6.456 29.973Q-6.594 30.157-6.786 30.290Q-6.977 30.422-7.196 30.493Q-7.415 30.563-7.653 30.563Q-8.024 30.563-8.362 30.426Q-8.700 30.290-8.967 30.038Q-9.235 29.786-9.385 29.446Q-9.536 29.106-9.536 28.731M-8.782 28.422L-6.821 28.422Q-6.821 28.118-6.922 27.827Q-7.024 27.536-7.241 27.354Q-7.458 27.172-7.774 27.172Q-8.075 27.172-8.305 27.360Q-8.536 27.547-8.659 27.839Q-8.782 28.130-8.782 28.422M-3.645 29.036L-5.899 29.036L-5.899 28.485L-3.645 28.485L-3.645 29.036M-2.829 29.653Q-2.829 29.169-2.426 28.874Q-2.024 28.579-1.473 28.460Q-0.922 28.340-0.430 28.340L-0.430 28.051Q-0.430 27.825-0.545 27.618Q-0.661 27.411-0.858 27.292Q-1.055 27.172-1.286 27.172Q-1.711 27.172-1.997 27.278Q-1.926 27.305-1.879 27.360Q-1.833 27.415-1.807 27.485Q-1.782 27.555-1.782 27.630Q-1.782 27.735-1.833 27.827Q-1.883 27.919-1.975 27.969Q-2.067 28.020-2.172 28.020Q-2.278 28.020-2.370 27.969Q-2.461 27.919-2.512 27.827Q-2.563 27.735-2.563 27.630Q-2.563 27.212-2.174 27.065Q-1.786 26.919-1.286 26.919Q-0.954 26.919-0.600 27.049Q-0.247 27.180-0.018 27.434Q0.210 27.688 0.210 28.036L0.210 29.837Q0.210 29.969 0.283 30.079Q0.355 30.188 0.484 30.188Q0.609 30.188 0.677 30.083Q0.746 29.977 0.746 29.837L0.746 29.325L1.027 29.325L1.027 29.837Q1.027 30.040 0.910 30.198Q0.792 30.356 0.611 30.440Q0.429 30.524 0.226 30.524Q-0.004 30.524-0.157 30.352Q-0.309 30.180-0.340 29.950Q-0.501 30.231-0.809 30.397Q-1.118 30.563-1.469 30.563Q-1.981 30.563-2.405 30.340Q-2.829 30.118-2.829 29.653M-2.141 29.653Q-2.141 29.938-1.915 30.124Q-1.688 30.309-1.395 30.309Q-1.149 30.309-0.924 30.192Q-0.700 30.075-0.565 29.872Q-0.430 29.669-0.430 29.415L-0.430 28.583Q-0.696 28.583-0.981 28.637Q-1.266 28.692-1.538 28.821Q-1.809 28.950-1.975 29.157Q-2.141 29.364-2.141 29.653M1.363 28.758Q1.363 28.262 1.613 27.837Q1.863 27.411 2.283 27.165Q2.703 26.919 3.203 26.919Q3.742 26.919 4.132 27.044Q4.523 27.169 4.523 27.583Q4.523 27.688 4.472 27.780Q4.421 27.872 4.330 27.922Q4.238 27.973 4.128 27.973Q4.023 27.973 3.931 27.922Q3.839 27.872 3.789 27.780Q3.738 27.688 3.738 27.583Q3.738 27.360 3.906 27.255Q3.683 27.196 3.210 27.196Q2.914 27.196 2.699 27.335Q2.484 27.473 2.353 27.704Q2.222 27.934 2.164 28.204Q2.105 28.473 2.105 28.758Q2.105 29.153 2.238 29.503Q2.371 29.852 2.642 30.069Q2.914 30.286 3.312 30.286Q3.687 30.286 3.962 30.069Q4.238 29.852 4.339 29.493Q4.355 29.430 4.417 29.430L4.523 29.430Q4.558 29.430 4.583 29.458Q4.609 29.485 4.609 29.524L4.609 29.547Q4.476 30.028 4.091 30.296Q3.706 30.563 3.203 30.563Q2.839 30.563 2.505 30.426Q2.171 30.290 1.912 30.040Q1.652 29.790 1.507 29.454Q1.363 29.118 1.363 28.758M5.722 29.524L5.722 27.333L5.019 27.333L5.019 27.079Q5.374 27.079 5.617 26.846Q5.859 26.614 5.970 26.266Q6.081 25.919 6.081 25.563L6.363 25.563L6.363 27.036L7.539 27.036L7.539 27.333L6.363 27.333L6.363 29.508Q6.363 29.829 6.482 30.057Q6.601 30.286 6.882 30.286Q7.062 30.286 7.179 30.163Q7.296 30.040 7.349 29.860Q7.402 29.680 7.402 29.508L7.402 29.036L7.683 29.036L7.683 29.524Q7.683 29.778 7.578 30.018Q7.472 30.258 7.275 30.411Q7.078 30.563 6.820 30.563Q6.503 30.563 6.251 30.440Q5.999 30.317 5.861 30.083Q5.722 29.848 5.722 29.524M10.261 30.485L8.484 30.485L8.484 30.188Q8.757 30.188 8.925 30.141Q9.093 30.094 9.093 29.926L9.093 27.790Q9.093 27.575 9.037 27.479Q8.980 27.383 8.867 27.362Q8.753 27.340 8.507 27.340L8.507 27.044L9.706 26.958L9.706 29.926Q9.706 30.094 9.853 30.141Q9.999 30.188 10.261 30.188L10.261 30.485M8.820 25.563Q8.820 25.372 8.955 25.241Q9.089 25.110 9.285 25.110Q9.406 25.110 9.509 25.172Q9.613 25.235 9.675 25.339Q9.738 25.442 9.738 25.563Q9.738 25.758 9.607 25.893Q9.476 26.028 9.285 26.028Q9.085 26.028 8.953 25.895Q8.820 25.762 8.820 25.563M10.761 28.790Q10.761 28.286 11.017 27.854Q11.273 27.422 11.708 27.171Q12.144 26.919 12.644 26.919Q13.031 26.919 13.373 27.063Q13.714 27.208 13.976 27.469Q14.238 27.731 14.380 28.067Q14.523 28.403 14.523 28.790Q14.523 29.282 14.259 29.692Q13.996 30.102 13.566 30.333Q13.136 30.563 12.644 30.563Q12.152 30.563 11.718 30.331Q11.285 30.098 11.023 29.690Q10.761 29.282 10.761 28.790M12.644 30.286Q13.101 30.286 13.353 30.063Q13.605 29.840 13.693 29.489Q13.781 29.137 13.781 28.692Q13.781 28.262 13.687 27.924Q13.593 27.587 13.339 27.380Q13.085 27.172 12.644 27.172Q11.996 27.172 11.751 27.589Q11.507 28.005 11.507 28.692Q11.507 29.137 11.595 29.489Q11.683 29.840 11.935 30.063Q12.187 30.286 12.644 30.286M16.937 30.485L15.081 30.485L15.081 30.188Q15.355 30.188 15.523 30.141Q15.691 30.094 15.691 29.926L15.691 27.790Q15.691 27.575 15.628 27.479Q15.566 27.383 15.447 27.362Q15.328 27.340 15.081 27.340L15.081 27.044L16.273 26.958L16.273 27.692Q16.386 27.477 16.580 27.309Q16.773 27.141 17.011 27.049Q17.249 26.958 17.503 26.958Q18.671 26.958 18.671 28.036L18.671 29.926Q18.671 30.094 18.841 30.141Q19.011 30.188 19.281 30.188L19.281 30.485L17.425 30.485L17.425 30.188Q17.699 30.188 17.867 30.141Q18.035 30.094 18.035 29.926L18.035 28.051Q18.035 27.669 17.914 27.440Q17.792 27.212 17.441 27.212Q17.128 27.212 16.874 27.374Q16.621 27.536 16.474 27.805Q16.328 28.075 16.328 28.372L16.328 29.926Q16.328 30.094 16.498 30.141Q16.667 30.188 16.937 30.188\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(228.662 8.898)\">\u003Cpath d=\"M22.625 30.477L22.625 29.255Q22.625 29.227 22.657 29.196Q22.688 29.165 22.711 29.165L22.817 29.165Q22.887 29.165 22.903 29.227Q22.965 29.547 23.104 29.788Q23.242 30.028 23.475 30.169Q23.707 30.309 24.016 30.309Q24.254 30.309 24.463 30.249Q24.672 30.188 24.809 30.040Q24.946 29.891 24.946 29.645Q24.946 29.391 24.735 29.225Q24.524 29.059 24.254 29.005L23.633 28.891Q23.227 28.813 22.926 28.557Q22.625 28.301 22.625 27.926Q22.625 27.559 22.826 27.337Q23.028 27.114 23.352 27.016Q23.676 26.919 24.016 26.919Q24.481 26.919 24.778 27.126L25 26.942Q25.024 26.919 25.055 26.919L25.106 26.919Q25.137 26.919 25.164 26.946Q25.192 26.973 25.192 27.005L25.192 27.989Q25.192 28.020 25.166 28.049Q25.141 28.079 25.106 28.079L25 28.079Q24.965 28.079 24.938 28.051Q24.910 28.024 24.910 27.989Q24.910 27.590 24.658 27.370Q24.407 27.149 24.008 27.149Q23.653 27.149 23.369 27.272Q23.086 27.395 23.086 27.700Q23.086 27.919 23.287 28.051Q23.489 28.184 23.735 28.227L24.360 28.340Q24.789 28.430 25.098 28.727Q25.407 29.024 25.407 29.438Q25.407 30.008 25.008 30.286Q24.610 30.563 24.016 30.563Q23.465 30.563 23.114 30.227L22.817 30.540Q22.793 30.563 22.758 30.563L22.711 30.563Q22.688 30.563 22.657 30.532Q22.625 30.501 22.625 30.477M27.817 32.036L25.961 32.036L25.961 31.743Q26.231 31.743 26.399 31.698Q26.567 31.653 26.567 31.477L26.567 27.653Q26.567 27.446 26.410 27.393Q26.254 27.340 25.961 27.340L25.961 27.044L27.184 26.958L27.184 27.422Q27.414 27.200 27.729 27.079Q28.043 26.958 28.383 26.958Q28.856 26.958 29.260 27.204Q29.664 27.450 29.897 27.866Q30.129 28.282 30.129 28.758Q30.129 29.133 29.981 29.462Q29.832 29.790 29.563 30.042Q29.293 30.294 28.949 30.428Q28.606 30.563 28.246 30.563Q27.957 30.563 27.686 30.442Q27.414 30.321 27.207 30.110L27.207 31.477Q27.207 31.653 27.375 31.698Q27.543 31.743 27.817 31.743L27.817 32.036M27.207 27.821L27.207 29.661Q27.360 29.950 27.621 30.130Q27.883 30.309 28.192 30.309Q28.477 30.309 28.699 30.171Q28.922 30.032 29.074 29.801Q29.227 29.571 29.305 29.299Q29.383 29.028 29.383 28.758Q29.383 28.426 29.258 28.069Q29.133 27.712 28.885 27.475Q28.637 27.239 28.289 27.239Q27.965 27.239 27.670 27.395Q27.375 27.551 27.207 27.821M30.750 29.653Q30.750 29.169 31.153 28.874Q31.555 28.579 32.106 28.460Q32.657 28.340 33.149 28.340L33.149 28.051Q33.149 27.825 33.033 27.618Q32.918 27.411 32.721 27.292Q32.524 27.172 32.293 27.172Q31.867 27.172 31.582 27.278Q31.653 27.305 31.699 27.360Q31.746 27.415 31.772 27.485Q31.797 27.555 31.797 27.630Q31.797 27.735 31.746 27.827Q31.696 27.919 31.604 27.969Q31.512 28.020 31.407 28.020Q31.301 28.020 31.209 27.969Q31.117 27.919 31.067 27.827Q31.016 27.735 31.016 27.630Q31.016 27.212 31.405 27.065Q31.793 26.919 32.293 26.919Q32.625 26.919 32.979 27.049Q33.332 27.180 33.561 27.434Q33.789 27.688 33.789 28.036L33.789 29.837Q33.789 29.969 33.862 30.079Q33.934 30.188 34.063 30.188Q34.188 30.188 34.256 30.083Q34.324 29.977 34.324 29.837L34.324 29.325L34.606 29.325L34.606 29.837Q34.606 30.040 34.489 30.198Q34.371 30.356 34.190 30.440Q34.008 30.524 33.805 30.524Q33.574 30.524 33.422 30.352Q33.270 30.180 33.239 29.950Q33.078 30.231 32.770 30.397Q32.461 30.563 32.110 30.563Q31.598 30.563 31.174 30.340Q30.750 30.118 30.750 29.653M31.438 29.653Q31.438 29.938 31.664 30.124Q31.891 30.309 32.184 30.309Q32.430 30.309 32.655 30.192Q32.879 30.075 33.014 29.872Q33.149 29.669 33.149 29.415L33.149 28.583Q32.883 28.583 32.598 28.637Q32.313 28.692 32.041 28.821Q31.770 28.950 31.604 29.157Q31.438 29.364 31.438 29.653M34.942 28.758Q34.942 28.262 35.192 27.837Q35.442 27.411 35.862 27.165Q36.282 26.919 36.782 26.919Q37.321 26.919 37.711 27.044Q38.102 27.169 38.102 27.583Q38.102 27.688 38.051 27.780Q38 27.872 37.908 27.922Q37.817 27.973 37.707 27.973Q37.602 27.973 37.510 27.922Q37.418 27.872 37.367 27.780Q37.317 27.688 37.317 27.583Q37.317 27.360 37.485 27.255Q37.262 27.196 36.789 27.196Q36.492 27.196 36.278 27.335Q36.063 27.473 35.932 27.704Q35.801 27.934 35.742 28.204Q35.684 28.473 35.684 28.758Q35.684 29.153 35.817 29.503Q35.949 29.852 36.221 30.069Q36.492 30.286 36.891 30.286Q37.266 30.286 37.541 30.069Q37.817 29.852 37.918 29.493Q37.934 29.430 37.996 29.430L38.102 29.430Q38.137 29.430 38.162 29.458Q38.188 29.485 38.188 29.524L38.188 29.547Q38.055 30.028 37.670 30.296Q37.285 30.563 36.782 30.563Q36.418 30.563 36.084 30.426Q35.750 30.290 35.490 30.040Q35.231 29.790 35.086 29.454Q34.942 29.118 34.942 28.758M38.676 28.731Q38.676 28.251 38.908 27.835Q39.141 27.419 39.551 27.169Q39.961 26.919 40.438 26.919Q41.168 26.919 41.567 27.360Q41.965 27.801 41.965 28.532Q41.965 28.637 41.871 28.661L39.422 28.661L39.422 28.731Q39.422 29.141 39.543 29.497Q39.664 29.852 39.936 30.069Q40.207 30.286 40.637 30.286Q41 30.286 41.297 30.057Q41.594 29.829 41.696 29.477Q41.703 29.430 41.789 29.415L41.871 29.415Q41.965 29.442 41.965 29.524Q41.965 29.532 41.957 29.563Q41.895 29.790 41.756 29.973Q41.617 30.157 41.426 30.290Q41.235 30.422 41.016 30.493Q40.797 30.563 40.559 30.563Q40.188 30.563 39.850 30.426Q39.512 30.290 39.244 30.038Q38.977 29.786 38.826 29.446Q38.676 29.106 38.676 28.731M39.430 28.422L41.391 28.422Q41.391 28.118 41.289 27.827Q41.188 27.536 40.971 27.354Q40.754 27.172 40.438 27.172Q40.137 27.172 39.907 27.360Q39.676 27.547 39.553 27.839Q39.430 28.130 39.430 28.422\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-23.981 36.175v-100.43\"\u002F>\u003Cpath stroke=\"none\" d=\"m-23.981-66.254-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg transform=\"translate(-38.289 -94.057)\">\u003Cpath d=\"M-21.942 30.454L-23.165 27.598Q-23.247 27.422-23.391 27.378Q-23.536 27.333-23.805 27.333L-23.805 27.036L-22.094 27.036L-22.094 27.333Q-22.516 27.333-22.516 27.516Q-22.516 27.551-22.501 27.598L-21.555 29.790L-20.715 27.813Q-20.676 27.735-20.676 27.645Q-20.676 27.505-20.782 27.419Q-20.887 27.333-21.028 27.333L-21.028 27.036L-19.676 27.036L-19.676 27.333Q-20.200 27.333-20.415 27.813L-21.540 30.454Q-21.602 30.563-21.708 30.563L-21.774 30.563Q-21.887 30.563-21.942 30.454M-17.403 30.485L-19.180 30.485L-19.180 30.188Q-18.907 30.188-18.739 30.141Q-18.571 30.094-18.571 29.926L-18.571 27.790Q-18.571 27.575-18.627 27.479Q-18.684 27.383-18.797 27.362Q-18.911 27.340-19.157 27.340L-19.157 27.044L-17.958 26.958L-17.958 29.926Q-17.958 30.094-17.811 30.141Q-17.665 30.188-17.403 30.188L-17.403 30.485M-18.844 25.563Q-18.844 25.372-18.710 25.241Q-18.575 25.110-18.379 25.110Q-18.258 25.110-18.155 25.172Q-18.051 25.235-17.989 25.339Q-17.926 25.442-17.926 25.563Q-17.926 25.758-18.057 25.893Q-18.188 26.028-18.379 26.028Q-18.579 26.028-18.711 25.895Q-18.844 25.762-18.844 25.563M-16.860 30.477L-16.860 29.255Q-16.860 29.227-16.829 29.196Q-16.797 29.165-16.774 29.165L-16.669 29.165Q-16.598 29.165-16.583 29.227Q-16.520 29.547-16.381 29.788Q-16.243 30.028-16.010 30.169Q-15.778 30.309-15.469 30.309Q-15.231 30.309-15.022 30.249Q-14.813 30.188-14.676 30.040Q-14.540 29.891-14.540 29.645Q-14.540 29.391-14.751 29.225Q-14.961 29.059-15.231 29.005L-15.852 28.891Q-16.258 28.813-16.559 28.557Q-16.860 28.301-16.860 27.926Q-16.860 27.559-16.659 27.337Q-16.458 27.114-16.133 27.016Q-15.809 26.919-15.469 26.919Q-15.004 26.919-14.708 27.126L-14.485 26.942Q-14.461 26.919-14.430 26.919L-14.379 26.919Q-14.348 26.919-14.321 26.946Q-14.294 26.973-14.294 27.005L-14.294 27.989Q-14.294 28.020-14.319 28.049Q-14.344 28.079-14.379 28.079L-14.485 28.079Q-14.520 28.079-14.547 28.051Q-14.575 28.024-14.575 27.989Q-14.575 27.590-14.827 27.370Q-15.079 27.149-15.477 27.149Q-15.833 27.149-16.116 27.272Q-16.399 27.395-16.399 27.700Q-16.399 27.919-16.198 28.051Q-15.997 28.184-15.751 28.227L-15.126 28.340Q-14.696 28.430-14.387 28.727Q-14.079 29.024-14.079 29.438Q-14.079 30.008-14.477 30.286Q-14.876 30.563-15.469 30.563Q-16.020 30.563-16.372 30.227L-16.669 30.540Q-16.692 30.563-16.727 30.563L-16.774 30.563Q-16.797 30.563-16.829 30.532Q-16.860 30.501-16.860 30.477M-11.692 30.485L-13.469 30.485L-13.469 30.188Q-13.196 30.188-13.028 30.141Q-12.860 30.094-12.860 29.926L-12.860 27.790Q-12.860 27.575-12.917 27.479Q-12.973 27.383-13.086 27.362Q-13.200 27.340-13.446 27.340L-13.446 27.044L-12.247 26.958L-12.247 29.926Q-12.247 30.094-12.100 30.141Q-11.954 30.188-11.692 30.188L-11.692 30.485M-13.133 25.563Q-13.133 25.372-12.999 25.241Q-12.864 25.110-12.669 25.110Q-12.547 25.110-12.444 25.172Q-12.340 25.235-12.278 25.339Q-12.215 25.442-12.215 25.563Q-12.215 25.758-12.346 25.893Q-12.477 26.028-12.669 26.028Q-12.868 26.028-13.001 25.895Q-13.133 25.762-13.133 25.563M-10.567 29.524L-10.567 27.333L-11.270 27.333L-11.270 27.079Q-10.915 27.079-10.672 26.846Q-10.430 26.614-10.319 26.266Q-10.208 25.919-10.208 25.563L-9.926 25.563L-9.926 27.036L-8.751 27.036L-8.751 27.333L-9.926 27.333L-9.926 29.508Q-9.926 29.829-9.807 30.057Q-9.688 30.286-9.407 30.286Q-9.227 30.286-9.110 30.163Q-8.993 30.040-8.940 29.860Q-8.887 29.680-8.887 29.508L-8.887 29.036L-8.606 29.036L-8.606 29.524Q-8.606 29.778-8.711 30.018Q-8.817 30.258-9.014 30.411Q-9.211 30.563-9.469 30.563Q-9.786 30.563-10.038 30.440Q-10.290 30.317-10.428 30.083Q-10.567 29.848-10.567 29.524M-7.790 29.653Q-7.790 29.169-7.387 28.874Q-6.985 28.579-6.434 28.460Q-5.883 28.340-5.391 28.340L-5.391 28.051Q-5.391 27.825-5.506 27.618Q-5.622 27.411-5.819 27.292Q-6.016 27.172-6.247 27.172Q-6.672 27.172-6.958 27.278Q-6.887 27.305-6.840 27.360Q-6.794 27.415-6.768 27.485Q-6.743 27.555-6.743 27.630Q-6.743 27.735-6.794 27.827Q-6.844 27.919-6.936 27.969Q-7.028 28.020-7.133 28.020Q-7.239 28.020-7.331 27.969Q-7.422 27.919-7.473 27.827Q-7.524 27.735-7.524 27.630Q-7.524 27.212-7.135 27.065Q-6.747 26.919-6.247 26.919Q-5.915 26.919-5.561 27.049Q-5.208 27.180-4.979 27.434Q-4.751 27.688-4.751 28.036L-4.751 29.837Q-4.751 29.969-4.678 30.079Q-4.606 30.188-4.477 30.188Q-4.352 30.188-4.284 30.083Q-4.215 29.977-4.215 29.837L-4.215 29.325L-3.934 29.325L-3.934 29.837Q-3.934 30.040-4.051 30.198Q-4.169 30.356-4.350 30.440Q-4.532 30.524-4.735 30.524Q-4.965 30.524-5.118 30.352Q-5.270 30.180-5.301 29.950Q-5.461 30.231-5.770 30.397Q-6.079 30.563-6.430 30.563Q-6.942 30.563-7.366 30.340Q-7.790 30.118-7.790 29.653M-7.102 29.653Q-7.102 29.938-6.876 30.124Q-6.649 30.309-6.356 30.309Q-6.110 30.309-5.885 30.192Q-5.661 30.075-5.526 29.872Q-5.391 29.669-5.391 29.415L-5.391 28.583Q-5.657 28.583-5.942 28.637Q-6.227 28.692-6.499 28.821Q-6.770 28.950-6.936 29.157Q-7.102 29.364-7.102 29.653M-3.016 29.524L-3.016 27.333L-3.719 27.333L-3.719 27.079Q-3.364 27.079-3.122 26.846Q-2.879 26.614-2.768 26.266Q-2.657 25.919-2.657 25.563L-2.376 25.563L-2.376 27.036L-1.200 27.036L-1.200 27.333L-2.376 27.333L-2.376 29.508Q-2.376 29.829-2.256 30.057Q-2.137 30.286-1.856 30.286Q-1.676 30.286-1.559 30.163Q-1.442 30.040-1.389 29.860Q-1.336 29.680-1.336 29.508L-1.336 29.036L-1.055 29.036L-1.055 29.524Q-1.055 29.778-1.161 30.018Q-1.266 30.258-1.463 30.411Q-1.661 30.563-1.919 30.563Q-2.235 30.563-2.487 30.440Q-2.739 30.317-2.877 30.083Q-3.016 29.848-3.016 29.524M1.523 30.485L-0.254 30.485L-0.254 30.188Q0.019 30.188 0.187 30.141Q0.355 30.094 0.355 29.926L0.355 27.790Q0.355 27.575 0.298 27.479Q0.242 27.383 0.128 27.362Q0.015 27.340-0.231 27.340L-0.231 27.044L0.968 26.958L0.968 29.926Q0.968 30.094 1.115 30.141Q1.261 30.188 1.523 30.188L1.523 30.485M0.081 25.563Q0.081 25.372 0.216 25.241Q0.351 25.110 0.546 25.110Q0.667 25.110 0.771 25.172Q0.874 25.235 0.937 25.339Q0.999 25.442 0.999 25.563Q0.999 25.758 0.869 25.893Q0.738 26.028 0.546 26.028Q0.347 26.028 0.214 25.895Q0.081 25.762 0.081 25.563M2.023 28.790Q2.023 28.286 2.279 27.854Q2.535 27.422 2.970 27.171Q3.406 26.919 3.906 26.919Q4.292 26.919 4.634 27.063Q4.976 27.208 5.238 27.469Q5.499 27.731 5.642 28.067Q5.785 28.403 5.785 28.790Q5.785 29.282 5.521 29.692Q5.257 30.102 4.828 30.333Q4.398 30.563 3.906 30.563Q3.414 30.563 2.980 30.331Q2.546 30.098 2.285 29.690Q2.023 29.282 2.023 28.790M3.906 30.286Q4.363 30.286 4.615 30.063Q4.867 29.840 4.955 29.489Q5.042 29.137 5.042 28.692Q5.042 28.262 4.949 27.924Q4.855 27.587 4.601 27.380Q4.347 27.172 3.906 27.172Q3.257 27.172 3.013 27.589Q2.769 28.005 2.769 28.692Q2.769 29.137 2.857 29.489Q2.945 29.840 3.197 30.063Q3.449 30.286 3.906 30.286M8.199 30.485L6.343 30.485L6.343 30.188Q6.617 30.188 6.785 30.141Q6.953 30.094 6.953 29.926L6.953 27.790Q6.953 27.575 6.890 27.479Q6.828 27.383 6.708 27.362Q6.589 27.340 6.343 27.340L6.343 27.044L7.535 26.958L7.535 27.692Q7.648 27.477 7.841 27.309Q8.035 27.141 8.273 27.049Q8.511 26.958 8.765 26.958Q9.933 26.958 9.933 28.036L9.933 29.926Q9.933 30.094 10.103 30.141Q10.273 30.188 10.542 30.188L10.542 30.485L8.687 30.485L8.687 30.188Q8.960 30.188 9.128 30.141Q9.296 30.094 9.296 29.926L9.296 28.051Q9.296 27.669 9.175 27.440Q9.054 27.212 8.703 27.212Q8.390 27.212 8.136 27.374Q7.882 27.536 7.736 27.805Q7.589 28.075 7.589 28.372L7.589 29.926Q7.589 30.094 7.759 30.141Q7.929 30.188 8.199 30.188\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-12.6 21.949s20.557-5.065 28.452-11.381C23.748 4.25 37.2-16.075 44.305-23.575c7.106-7.501 16.446-19.523 22.762-19.918 6.317-.394 15.657 10.36 22.763 17.072s19.767 24.982 28.452 31.298c8.685 6.317 23.88 11.66 34.144 14.227 10.264 2.566 29.964 3.478 39.834 4.267s31.297 1.423 31.297 1.423\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(97.427 -75.35)\">\u003Cpath d=\"M-23.708 28.950Q-23.708 28.629-23.583 28.340Q-23.458 28.051-23.232 27.828Q-23.007 27.604-22.711 27.484Q-22.416 27.364-22.098 27.364Q-21.770 27.364-21.508 27.464Q-21.247 27.563-21.071 27.745Q-20.895 27.928-20.801 28.186Q-20.707 28.444-20.707 28.776Q-20.707 28.868-20.789 28.889L-23.044 28.889L-23.044 28.950Q-23.044 29.538-22.761 29.921Q-22.477 30.304-21.910 30.304Q-21.588 30.304-21.320 30.111Q-21.052 29.918-20.963 29.603Q-20.956 29.562-20.881 29.548L-20.789 29.548Q-20.707 29.572-20.707 29.644Q-20.707 29.651-20.713 29.678Q-20.826 30.075-21.197 30.314Q-21.568 30.553-21.992 30.553Q-22.429 30.553-22.829 30.345Q-23.229 30.136-23.468 29.769Q-23.708 29.402-23.708 28.950M-23.038 28.680L-21.223 28.680Q-21.223 28.403-21.320 28.151Q-21.418 27.898-21.616 27.742Q-21.814 27.587-22.098 27.587Q-22.375 27.587-22.588 27.745Q-22.802 27.904-22.920 28.159Q-23.038 28.414-23.038 28.680M-18.936 30.485L-20.259 30.485L-20.259 30.205Q-19.698 30.205-19.319 29.805L-18.605 29.008L-19.517 27.959Q-19.654 27.812-19.803 27.780Q-19.951 27.747-20.218 27.747L-20.218 27.467L-18.717 27.467L-18.717 27.747Q-18.909 27.747-18.909 27.881Q-18.909 27.911-18.878 27.959L-18.283 28.643L-17.842 28.147Q-17.730 28.017-17.730 27.901Q-17.730 27.839-17.767 27.793Q-17.805 27.747-17.863 27.747L-17.863 27.467L-16.547 27.467L-16.547 27.747Q-17.107 27.747-17.487 28.147L-18.109 28.848L-17.114 29.996Q-17.015 30.095-16.914 30.140Q-16.814 30.184-16.702 30.194Q-16.591 30.205-16.414 30.205L-16.414 30.485L-17.907 30.485L-17.907 30.205Q-17.842 30.205-17.783 30.171Q-17.723 30.136-17.723 30.071Q-17.723 30.024-17.753 29.996L-18.430 29.210L-18.963 29.805Q-19.076 29.935-19.076 30.051Q-19.076 30.116-19.035 30.160Q-18.994 30.205-18.936 30.205L-18.936 30.485M-14.274 31.842L-15.904 31.842L-15.904 31.562Q-15.675 31.562-15.527 31.527Q-15.378 31.493-15.378 31.353L-15.378 28.007Q-15.378 27.836-15.515 27.795Q-15.651 27.754-15.904 27.754L-15.904 27.474L-14.824 27.399L-14.824 27.805Q-14.602 27.604-14.315 27.501Q-14.028 27.399-13.720 27.399Q-13.293 27.399-12.929 27.612Q-12.565 27.826-12.351 28.190Q-12.138 28.554-12.138 28.974Q-12.138 29.419-12.377 29.783Q-12.616 30.147-13.009 30.350Q-13.402 30.553-13.847 30.553Q-14.113 30.553-14.361 30.453Q-14.609 30.352-14.797 30.171L-14.797 31.353Q-14.797 31.490-14.648 31.526Q-14.500 31.562-14.274 31.562L-14.274 31.842M-14.797 28.154L-14.797 29.764Q-14.664 30.017-14.421 30.174Q-14.178 30.331-13.901 30.331Q-13.573 30.331-13.320 30.130Q-13.067 29.928-12.934 29.610Q-12.801 29.292-12.801 28.974Q-12.801 28.745-12.866 28.516Q-12.931 28.287-13.059 28.089Q-13.187 27.891-13.382 27.771Q-13.577 27.652-13.809 27.652Q-14.103 27.652-14.371 27.781Q-14.640 27.911-14.797 28.154\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(97.427 -75.35)\">\u003Cpath d=\"M-11.319 28.950Q-11.319 28.629-11.194 28.340Q-11.069 28.051-10.843 27.828Q-10.618 27.604-10.322 27.484Q-10.027 27.364-9.709 27.364Q-9.381 27.364-9.119 27.464Q-8.858 27.563-8.682 27.745Q-8.506 27.928-8.412 28.186Q-8.318 28.444-8.318 28.776Q-8.318 28.868-8.400 28.889L-10.655 28.889L-10.655 28.950Q-10.655 29.538-10.372 29.921Q-10.088 30.304-9.521 30.304Q-9.199 30.304-8.931 30.111Q-8.663 29.918-8.574 29.603Q-8.567 29.562-8.492 29.548L-8.400 29.548Q-8.318 29.572-8.318 29.644Q-8.318 29.651-8.324 29.678Q-8.437 30.075-8.808 30.314Q-9.179 30.553-9.603 30.553Q-10.040 30.553-10.440 30.345Q-10.840 30.136-11.079 29.769Q-11.319 29.402-11.319 28.950M-10.649 28.680L-8.834 28.680Q-8.834 28.403-8.931 28.151Q-9.029 27.898-9.227 27.742Q-9.425 27.587-9.709 27.587Q-9.986 27.587-10.199 27.745Q-10.413 27.904-10.531 28.159Q-10.649 28.414-10.649 28.680M-5.980 30.485L-7.716 30.485L-7.716 30.205Q-7.487 30.205-7.338 30.171Q-7.190 30.136-7.190 29.996L-7.190 28.147Q-7.190 27.877-7.297 27.816Q-7.405 27.754-7.716 27.754L-7.716 27.474L-6.687 27.399L-6.687 28.106Q-6.557 27.798-6.315 27.599Q-6.072 27.399-5.754 27.399Q-5.535 27.399-5.364 27.523Q-5.194 27.648-5.194 27.860Q-5.194 27.997-5.293 28.096Q-5.392 28.195-5.525 28.195Q-5.662 28.195-5.761 28.096Q-5.860 27.997-5.860 27.860Q-5.860 27.720-5.761 27.621Q-6.051 27.621-6.251 27.817Q-6.451 28.014-6.544 28.308Q-6.636 28.602-6.636 28.882L-6.636 29.996Q-6.636 30.205-5.980 30.205L-5.980 30.485M-4.083 29.644L-4.083 27.747L-4.722 27.747L-4.722 27.525Q-4.404 27.525-4.187 27.315Q-3.970 27.105-3.869 26.795Q-3.768 26.486-3.768 26.178L-3.502 26.178L-3.502 27.467L-2.425 27.467L-2.425 27.747L-3.502 27.747L-3.502 29.631Q-3.502 29.907-3.397 30.106Q-3.293 30.304-3.033 30.304Q-2.876 30.304-2.770 30.200Q-2.664 30.095-2.615 29.942Q-2.565 29.788-2.565 29.631L-2.565 29.217L-2.299 29.217L-2.299 29.644Q-2.299 29.870-2.398 30.080Q-2.497 30.290-2.681 30.422Q-2.866 30.553-3.095 30.553Q-3.532 30.553-3.808 30.316Q-4.083 30.078-4.083 29.644\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(97.427 -75.35)\">\u003Cpath d=\"M1.181 29.002Q1.181 28.660 1.316 28.361Q1.451 28.062 1.691 27.838Q1.930 27.614 2.248 27.489Q2.566 27.364 2.897 27.364Q3.342 27.364 3.741 27.580Q4.141 27.795 4.376 28.173Q4.610 28.550 4.610 29.002Q4.610 29.343 4.468 29.627Q4.326 29.911 4.082 30.118Q3.837 30.324 3.528 30.439Q3.219 30.553 2.897 30.553Q2.467 30.553 2.065 30.352Q1.663 30.150 1.422 29.798Q1.181 29.446 1.181 29.002M2.897 30.304Q3.499 30.304 3.723 29.926Q3.947 29.548 3.947 28.916Q3.947 28.304 3.712 27.945Q3.478 27.587 2.897 27.587Q1.845 27.587 1.845 28.916Q1.845 29.548 2.070 29.926Q2.296 30.304 2.897 30.304\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(97.427 -75.35)\">\u003Cpath d=\"M5.423 28.974Q5.423 28.646 5.558 28.345Q5.693 28.045 5.929 27.824Q6.165 27.604 6.469 27.484Q6.774 27.364 7.098 27.364Q7.604 27.364 7.953 27.467Q8.301 27.569 8.301 27.945Q8.301 28.092 8.204 28.193Q8.107 28.294 7.960 28.294Q7.806 28.294 7.707 28.195Q7.608 28.096 7.608 27.945Q7.608 27.757 7.748 27.665Q7.546 27.614 7.105 27.614Q6.750 27.614 6.521 27.810Q6.292 28.007 6.191 28.316Q6.090 28.626 6.090 28.974Q6.090 29.323 6.216 29.629Q6.343 29.935 6.598 30.119Q6.852 30.304 7.208 30.304Q7.430 30.304 7.614 30.220Q7.799 30.136 7.934 29.981Q8.069 29.825 8.127 29.617Q8.141 29.562 8.195 29.562L8.308 29.562Q8.339 29.562 8.361 29.586Q8.383 29.610 8.383 29.644L8.383 29.665Q8.298 29.952 8.110 30.150Q7.922 30.348 7.657 30.451Q7.392 30.553 7.098 30.553Q6.668 30.553 6.280 30.347Q5.892 30.140 5.658 29.777Q5.423 29.415 5.423 28.974M8.971 28.974Q8.971 28.646 9.106 28.345Q9.241 28.045 9.477 27.824Q9.713 27.604 10.017 27.484Q10.321 27.364 10.646 27.364Q11.152 27.364 11.501 27.467Q11.849 27.569 11.849 27.945Q11.849 28.092 11.752 28.193Q11.654 28.294 11.507 28.294Q11.354 28.294 11.255 28.195Q11.155 28.096 11.155 27.945Q11.155 27.757 11.296 27.665Q11.094 27.614 10.653 27.614Q10.297 27.614 10.068 27.810Q9.839 28.007 9.739 28.316Q9.638 28.626 9.638 28.974Q9.638 29.323 9.764 29.629Q9.891 29.935 10.145 30.119Q10.400 30.304 10.755 30.304Q10.978 30.304 11.162 30.220Q11.347 30.136 11.482 29.981Q11.617 29.825 11.675 29.617Q11.689 29.562 11.743 29.562L11.856 29.562Q11.887 29.562 11.909 29.586Q11.931 29.610 11.931 29.644L11.931 29.665Q11.846 29.952 11.658 30.150Q11.470 30.348 11.205 30.451Q10.940 30.553 10.646 30.553Q10.215 30.553 9.828 30.347Q9.440 30.140 9.205 29.777Q8.971 29.415 8.971 28.974M13.093 29.651L13.093 28.147Q13.093 27.877 12.986 27.816Q12.878 27.754 12.567 27.754L12.567 27.474L13.674 27.399L13.674 29.631L13.674 29.651Q13.674 29.931 13.726 30.075Q13.777 30.218 13.919 30.275Q14.061 30.331 14.348 30.331Q14.601 30.331 14.806 30.191Q15.011 30.051 15.127 29.825Q15.243 29.600 15.243 29.350L15.243 28.147Q15.243 27.877 15.136 27.816Q15.028 27.754 14.717 27.754L14.717 27.474L15.824 27.399L15.824 29.812Q15.824 30.003 15.877 30.085Q15.930 30.167 16.031 30.186Q16.132 30.205 16.347 30.205L16.347 30.485L15.271 30.553L15.271 29.989Q15.161 30.171 15.016 30.294Q14.871 30.417 14.684 30.485Q14.498 30.553 14.297 30.553Q13.093 30.553 13.093 29.651M18.579 31.842L16.949 31.842L16.949 31.562Q17.178 31.562 17.327 31.527Q17.475 31.493 17.475 31.353L17.475 28.007Q17.475 27.836 17.338 27.795Q17.202 27.754 16.949 27.754L16.949 27.474L18.029 27.399L18.029 27.805Q18.251 27.604 18.538 27.501Q18.825 27.399 19.133 27.399Q19.560 27.399 19.924 27.612Q20.288 27.826 20.502 28.190Q20.715 28.554 20.715 28.974Q20.715 29.419 20.476 29.783Q20.237 30.147 19.844 30.350Q19.451 30.553 19.006 30.553Q18.740 30.553 18.492 30.453Q18.244 30.352 18.056 30.171L18.056 31.353Q18.056 31.490 18.205 31.526Q18.354 31.562 18.579 31.562L18.579 31.842M18.056 28.154L18.056 29.764Q18.190 30.017 18.432 30.174Q18.675 30.331 18.952 30.331Q19.280 30.331 19.533 30.130Q19.786 29.928 19.919 29.610Q20.052 29.292 20.052 28.974Q20.052 28.745 19.987 28.516Q19.922 28.287 19.794 28.089Q19.666 27.891 19.471 27.771Q19.276 27.652 19.044 27.652Q18.750 27.652 18.482 27.781Q18.213 27.911 18.056 28.154M21.409 29.757Q21.409 29.425 21.633 29.198Q21.857 28.971 22.201 28.843Q22.544 28.714 22.917 28.662Q23.289 28.609 23.593 28.609L23.593 28.356Q23.593 28.151 23.486 27.971Q23.378 27.792 23.197 27.689Q23.016 27.587 22.807 27.587Q22.401 27.587 22.165 27.679Q22.254 27.716 22.300 27.800Q22.346 27.884 22.346 27.986Q22.346 28.082 22.300 28.161Q22.254 28.239 22.173 28.284Q22.093 28.328 22.004 28.328Q21.854 28.328 21.753 28.231Q21.652 28.133 21.652 27.986Q21.652 27.364 22.807 27.364Q23.019 27.364 23.269 27.428Q23.518 27.491 23.720 27.610Q23.922 27.730 24.048 27.915Q24.174 28.099 24.174 28.342L24.174 29.918Q24.174 30.034 24.236 30.130Q24.297 30.225 24.410 30.225Q24.520 30.225 24.585 30.131Q24.650 30.037 24.650 29.918L24.650 29.470L24.916 29.470L24.916 29.918Q24.916 30.188 24.689 30.353Q24.462 30.519 24.181 30.519Q23.973 30.519 23.836 30.365Q23.699 30.212 23.675 29.996Q23.528 30.263 23.246 30.408Q22.964 30.553 22.640 30.553Q22.363 30.553 22.079 30.478Q21.796 30.403 21.602 30.224Q21.409 30.044 21.409 29.757M22.025 29.757Q22.025 29.931 22.125 30.061Q22.226 30.191 22.382 30.261Q22.537 30.331 22.701 30.331Q22.920 30.331 23.129 30.234Q23.337 30.136 23.465 29.955Q23.593 29.774 23.593 29.548L23.593 28.820Q23.269 28.820 22.903 28.911Q22.537 29.002 22.281 29.214Q22.025 29.425 22.025 29.757M27.015 30.485L25.381 30.485L25.381 30.205Q25.610 30.205 25.759 30.171Q25.907 30.136 25.907 29.996L25.907 28.147Q25.907 27.877 25.800 27.816Q25.692 27.754 25.381 27.754L25.381 27.474L26.441 27.399L26.441 28.048Q26.611 27.740 26.916 27.569Q27.220 27.399 27.565 27.399Q28.071 27.399 28.355 27.622Q28.638 27.846 28.638 28.342L28.638 29.996Q28.638 30.133 28.787 30.169Q28.936 30.205 29.161 30.205L29.161 30.485L27.531 30.485L27.531 30.205Q27.760 30.205 27.909 30.171Q28.057 30.136 28.057 29.996L28.057 28.356Q28.057 28.021 27.938 27.821Q27.818 27.621 27.504 27.621Q27.234 27.621 26.999 27.757Q26.765 27.894 26.627 28.128Q26.488 28.362 26.488 28.636L26.488 29.996Q26.488 30.133 26.639 30.169Q26.789 30.205 27.015 30.205L27.015 30.485M29.749 28.974Q29.749 28.646 29.884 28.345Q30.019 28.045 30.255 27.824Q30.491 27.604 30.795 27.484Q31.099 27.364 31.424 27.364Q31.930 27.364 32.278 27.467Q32.627 27.569 32.627 27.945Q32.627 28.092 32.530 28.193Q32.432 28.294 32.285 28.294Q32.131 28.294 32.032 28.195Q31.933 28.096 31.933 27.945Q31.933 27.757 32.073 27.665Q31.872 27.614 31.431 27.614Q31.075 27.614 30.846 27.810Q30.617 28.007 30.516 28.316Q30.416 28.626 30.416 28.974Q30.416 29.323 30.542 29.629Q30.669 29.935 30.923 30.119Q31.178 30.304 31.533 30.304Q31.755 30.304 31.940 30.220Q32.125 30.136 32.260 29.981Q32.395 29.825 32.453 29.617Q32.466 29.562 32.521 29.562L32.634 29.562Q32.665 29.562 32.687 29.586Q32.709 29.610 32.709 29.644L32.709 29.665Q32.624 29.952 32.436 30.150Q32.248 30.348 31.983 30.451Q31.718 30.553 31.424 30.553Q30.993 30.553 30.605 30.347Q30.217 30.140 29.983 29.777Q29.749 29.415 29.749 28.974M33.632 31.620Q33.762 31.688 33.899 31.688Q34.069 31.688 34.220 31.599Q34.370 31.510 34.481 31.365Q34.592 31.220 34.671 31.052L34.934 30.485L33.765 27.959Q33.690 27.812 33.560 27.780Q33.430 27.747 33.198 27.747L33.198 27.467L34.719 27.467L34.719 27.747Q34.370 27.747 34.370 27.894Q34.374 27.915 34.375 27.932Q34.377 27.949 34.377 27.959L35.235 29.818L36.007 28.147Q36.042 28.079 36.042 28Q36.042 27.887 35.958 27.817Q35.874 27.747 35.761 27.747L35.761 27.467L36.958 27.467L36.958 27.747Q36.739 27.747 36.566 27.851Q36.394 27.956 36.301 28.147L34.965 31.052Q34.794 31.422 34.524 31.668Q34.254 31.914 33.899 31.914Q33.629 31.914 33.410 31.748Q33.191 31.582 33.191 31.319Q33.191 31.182 33.283 31.093Q33.376 31.005 33.516 31.005Q33.652 31.005 33.741 31.093Q33.830 31.182 33.830 31.319Q33.830 31.422 33.777 31.500Q33.724 31.579 33.632 31.620\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-warn)\" d=\"M-12.6 24.794s20.557-1.66 28.452-2.845 19.768-3.322 28.453-5.69c8.685-2.37 24.669-6.644 34.144-11.382s25.458-18.025 34.143-22.762 21.347-12.17 28.453-11.381c7.106.79 15.656 11.545 22.762 17.072s20.162 18.222 28.453 22.762c8.29 4.54 31.297 9.958 31.297 9.958\" style=\"stroke-dasharray:3.0,3.0;stroke-width:.8\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(168.559 -59.423)\">\u003Cpath d=\"M-21.999 30.485L-23.602 30.485L-23.602 30.205Q-23.376 30.205-23.227 30.171Q-23.079 30.136-23.079 29.996L-23.079 26.377Q-23.079 26.107-23.186 26.045Q-23.294 25.984-23.602 25.984L-23.602 25.703L-22.525 25.628L-22.525 29.996Q-22.525 30.133-22.375 30.169Q-22.224 30.205-21.999 30.205L-21.999 30.485M-21.445 28.950Q-21.445 28.629-21.320 28.340Q-21.195 28.051-20.970 27.828Q-20.744 27.604-20.449 27.484Q-20.153 27.364-19.835 27.364Q-19.507 27.364-19.245 27.464Q-18.984 27.563-18.808 27.745Q-18.632 27.928-18.538 28.186Q-18.444 28.444-18.444 28.776Q-18.444 28.868-18.526 28.889L-20.782 28.889L-20.782 28.950Q-20.782 29.538-20.498 29.921Q-20.214 30.304-19.647 30.304Q-19.326 30.304-19.057 30.111Q-18.789 29.918-18.700 29.603Q-18.693 29.562-18.618 29.548L-18.526 29.548Q-18.444 29.572-18.444 29.644Q-18.444 29.651-18.451 29.678Q-18.564 30.075-18.934 30.314Q-19.305 30.553-19.729 30.553Q-20.167 30.553-20.566 30.345Q-20.966 30.136-21.206 29.769Q-21.445 29.402-21.445 28.950M-20.775 28.680L-18.960 28.680Q-18.960 28.403-19.057 28.151Q-19.155 27.898-19.353 27.742Q-19.551 27.587-19.835 27.587Q-20.112 27.587-20.325 27.745Q-20.539 27.904-20.657 28.159Q-20.775 28.414-20.775 28.680M-17.798 29.757Q-17.798 29.425-17.574 29.198Q-17.350 28.971-17.007 28.843Q-16.663 28.714-16.291 28.662Q-15.918 28.609-15.614 28.609L-15.614 28.356Q-15.614 28.151-15.721 27.971Q-15.829 27.792-16.010 27.689Q-16.191 27.587-16.400 27.587Q-16.807 27.587-17.043 27.679Q-16.954 27.716-16.908 27.800Q-16.861 27.884-16.861 27.986Q-16.861 28.082-16.908 28.161Q-16.954 28.239-17.034 28.284Q-17.114 28.328-17.203 28.328Q-17.354 28.328-17.454 28.231Q-17.555 28.133-17.555 27.986Q-17.555 27.364-16.400 27.364Q-16.188 27.364-15.939 27.428Q-15.689 27.491-15.487 27.610Q-15.286 27.730-15.159 27.915Q-15.033 28.099-15.033 28.342L-15.033 29.918Q-15.033 30.034-14.971 30.130Q-14.910 30.225-14.797 30.225Q-14.688 30.225-14.623 30.131Q-14.558 30.037-14.558 29.918L-14.558 29.470L-14.291 29.470L-14.291 29.918Q-14.291 30.188-14.518 30.353Q-14.746 30.519-15.026 30.519Q-15.234 30.519-15.371 30.365Q-15.508 30.212-15.532 29.996Q-15.679 30.263-15.961 30.408Q-16.243 30.553-16.567 30.553Q-16.844 30.553-17.128 30.478Q-17.412 30.403-17.605 30.224Q-17.798 30.044-17.798 29.757M-17.183 29.757Q-17.183 29.931-17.082 30.061Q-16.981 30.191-16.825 30.261Q-16.670 30.331-16.506 30.331Q-16.287 30.331-16.079 30.234Q-15.870 30.136-15.742 29.955Q-15.614 29.774-15.614 29.548L-15.614 28.820Q-15.939 28.820-16.304 28.911Q-16.670 29.002-16.926 29.214Q-17.183 29.425-17.183 29.757M-12.124 30.485L-13.860 30.485L-13.860 30.205Q-13.631 30.205-13.483 30.171Q-13.334 30.136-13.334 29.996L-13.334 28.147Q-13.334 27.877-13.442 27.816Q-13.549 27.754-13.860 27.754L-13.860 27.474L-12.832 27.399L-12.832 28.106Q-12.702 27.798-12.459 27.599Q-12.216 27.399-11.898 27.399Q-11.680 27.399-11.509 27.523Q-11.338 27.648-11.338 27.860Q-11.338 27.997-11.437 28.096Q-11.536 28.195-11.669 28.195Q-11.806 28.195-11.905 28.096Q-12.004 27.997-12.004 27.860Q-12.004 27.720-11.905 27.621Q-12.196 27.621-12.396 27.817Q-12.596 28.014-12.688 28.308Q-12.780 28.602-12.780 28.882L-12.780 29.996Q-12.780 30.205-12.124 30.205L-12.124 30.485M-9.072 30.485L-10.706 30.485L-10.706 30.205Q-10.477 30.205-10.328 30.171Q-10.179 30.136-10.179 29.996L-10.179 28.147Q-10.179 27.877-10.287 27.816Q-10.395 27.754-10.706 27.754L-10.706 27.474L-9.646 27.399L-9.646 28.048Q-9.475 27.740-9.171 27.569Q-8.867 27.399-8.522 27.399Q-8.016 27.399-7.732 27.622Q-7.448 27.846-7.448 28.342L-7.448 29.996Q-7.448 30.133-7.300 30.169Q-7.151 30.205-6.925 30.205L-6.925 30.485L-8.556 30.485L-8.556 30.205Q-8.327 30.205-8.178 30.171Q-8.029 30.136-8.029 29.996L-8.029 28.356Q-8.029 28.021-8.149 27.821Q-8.269 27.621-8.583 27.621Q-8.853 27.621-9.087 27.757Q-9.321 27.894-9.460 28.128Q-9.598 28.362-9.598 28.636L-9.598 29.996Q-9.598 30.133-9.448 30.169Q-9.297 30.205-9.072 30.205L-9.072 30.485M-6.378 28.950Q-6.378 28.629-6.254 28.340Q-6.129 28.051-5.903 27.828Q-5.678 27.604-5.382 27.484Q-5.086 27.364-4.769 27.364Q-4.440 27.364-4.179 27.464Q-3.918 27.563-3.741 27.745Q-3.565 27.928-3.471 28.186Q-3.377 28.444-3.377 28.776Q-3.377 28.868-3.460 28.889L-5.715 28.889L-5.715 28.950Q-5.715 29.538-5.432 29.921Q-5.148 30.304-4.581 30.304Q-4.259 30.304-3.991 30.111Q-3.723 29.918-3.634 29.603Q-3.627 29.562-3.552 29.548L-3.460 29.548Q-3.377 29.572-3.377 29.644Q-3.377 29.651-3.384 29.678Q-3.497 30.075-3.868 30.314Q-4.239 30.553-4.663 30.553Q-5.100 30.553-5.500 30.345Q-5.900 30.136-6.139 29.769Q-6.378 29.402-6.378 28.950M-5.709 28.680L-3.894 28.680Q-3.894 28.403-3.991 28.151Q-4.088 27.898-4.287 27.742Q-4.485 27.587-4.769 27.587Q-5.045 27.587-5.259 27.745Q-5.473 27.904-5.591 28.159Q-5.709 28.414-5.709 28.680M-1.040 30.485L-2.776 30.485L-2.776 30.205Q-2.547 30.205-2.398 30.171Q-2.250 30.136-2.250 29.996L-2.250 28.147Q-2.250 27.877-2.357 27.816Q-2.465 27.754-2.776 27.754L-2.776 27.474L-1.747 27.399L-1.747 28.106Q-1.617 27.798-1.375 27.599Q-1.132 27.399-0.814 27.399Q-0.595 27.399-0.424 27.523Q-0.253 27.648-0.253 27.860Q-0.253 27.997-0.353 28.096Q-0.452 28.195-0.585 28.195Q-0.722 28.195-0.821 28.096Q-0.920 27.997-0.920 27.860Q-0.920 27.720-0.821 27.621Q-1.111 27.621-1.311 27.817Q-1.511 28.014-1.604 28.308Q-1.696 28.602-1.696 28.882L-1.696 29.996Q-1.696 30.205-1.040 30.205\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(168.559 -59.423)\">\u003Cpath d=\"M3.014 29.002Q3.014 28.660 3.149 28.361Q3.284 28.062 3.524 27.838Q3.763 27.614 4.081 27.489Q4.399 27.364 4.730 27.364Q5.175 27.364 5.574 27.580Q5.974 27.795 6.209 28.173Q6.443 28.550 6.443 29.002Q6.443 29.343 6.301 29.627Q6.159 29.911 5.915 30.118Q5.670 30.324 5.361 30.439Q5.052 30.553 4.730 30.553Q4.300 30.553 3.898 30.352Q3.496 30.150 3.255 29.798Q3.014 29.446 3.014 29.002M4.730 30.304Q5.332 30.304 5.556 29.926Q5.780 29.548 5.780 28.916Q5.780 28.304 5.545 27.945Q5.311 27.587 4.730 27.587Q3.678 27.587 3.678 28.916Q3.678 29.548 3.903 29.926Q4.129 30.304 4.730 30.304\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(168.559 -59.423)\">\u003Cpath d=\"M7.256 28.974Q7.256 28.646 7.391 28.345Q7.526 28.045 7.762 27.824Q7.998 27.604 8.302 27.484Q8.607 27.364 8.931 27.364Q9.437 27.364 9.786 27.467Q10.134 27.569 10.134 27.945Q10.134 28.092 10.037 28.193Q9.940 28.294 9.793 28.294Q9.639 28.294 9.540 28.195Q9.441 28.096 9.441 27.945Q9.441 27.757 9.581 27.665Q9.379 27.614 8.938 27.614Q8.583 27.614 8.354 27.810Q8.125 28.007 8.024 28.316Q7.923 28.626 7.923 28.974Q7.923 29.323 8.049 29.629Q8.176 29.935 8.431 30.119Q8.685 30.304 9.041 30.304Q9.263 30.304 9.447 30.220Q9.632 30.136 9.767 29.981Q9.902 29.825 9.960 29.617Q9.974 29.562 10.028 29.562L10.141 29.562Q10.172 29.562 10.194 29.586Q10.216 29.610 10.216 29.644L10.216 29.665Q10.131 29.952 9.943 30.150Q9.755 30.348 9.490 30.451Q9.225 30.553 8.931 30.553Q8.501 30.553 8.113 30.347Q7.725 30.140 7.491 29.777Q7.256 29.415 7.256 28.974M10.804 28.974Q10.804 28.646 10.939 28.345Q11.074 28.045 11.310 27.824Q11.546 27.604 11.850 27.484Q12.154 27.364 12.479 27.364Q12.985 27.364 13.334 27.467Q13.682 27.569 13.682 27.945Q13.682 28.092 13.585 28.193Q13.487 28.294 13.340 28.294Q13.187 28.294 13.088 28.195Q12.988 28.096 12.988 27.945Q12.988 27.757 13.129 27.665Q12.927 27.614 12.486 27.614Q12.130 27.614 11.901 27.810Q11.672 28.007 11.572 28.316Q11.471 28.626 11.471 28.974Q11.471 29.323 11.597 29.629Q11.724 29.935 11.978 30.119Q12.233 30.304 12.588 30.304Q12.811 30.304 12.995 30.220Q13.180 30.136 13.315 29.981Q13.450 29.825 13.508 29.617Q13.522 29.562 13.576 29.562L13.689 29.562Q13.720 29.562 13.742 29.586Q13.764 29.610 13.764 29.644L13.764 29.665Q13.679 29.952 13.491 30.150Q13.303 30.348 13.038 30.451Q12.773 30.553 12.479 30.553Q12.048 30.553 11.661 30.347Q11.273 30.140 11.038 29.777Q10.804 29.415 10.804 28.974M14.926 29.651L14.926 28.147Q14.926 27.877 14.819 27.816Q14.711 27.754 14.400 27.754L14.400 27.474L15.507 27.399L15.507 29.631L15.507 29.651Q15.507 29.931 15.559 30.075Q15.610 30.218 15.752 30.275Q15.894 30.331 16.181 30.331Q16.434 30.331 16.639 30.191Q16.844 30.051 16.960 29.825Q17.076 29.600 17.076 29.350L17.076 28.147Q17.076 27.877 16.969 27.816Q16.861 27.754 16.550 27.754L16.550 27.474L17.657 27.399L17.657 29.812Q17.657 30.003 17.710 30.085Q17.763 30.167 17.864 30.186Q17.965 30.205 18.180 30.205L18.180 30.485L17.104 30.553L17.104 29.989Q16.994 30.171 16.849 30.294Q16.704 30.417 16.517 30.485Q16.331 30.553 16.130 30.553Q14.926 30.553 14.926 29.651M20.412 31.842L18.782 31.842L18.782 31.562Q19.011 31.562 19.160 31.527Q19.308 31.493 19.308 31.353L19.308 28.007Q19.308 27.836 19.171 27.795Q19.035 27.754 18.782 27.754L18.782 27.474L19.862 27.399L19.862 27.805Q20.084 27.604 20.371 27.501Q20.658 27.399 20.966 27.399Q21.393 27.399 21.757 27.612Q22.121 27.826 22.335 28.190Q22.548 28.554 22.548 28.974Q22.548 29.419 22.309 29.783Q22.070 30.147 21.677 30.350Q21.284 30.553 20.839 30.553Q20.573 30.553 20.325 30.453Q20.077 30.352 19.889 30.171L19.889 31.353Q19.889 31.490 20.038 31.526Q20.187 31.562 20.412 31.562L20.412 31.842M19.889 28.154L19.889 29.764Q20.023 30.017 20.265 30.174Q20.508 30.331 20.785 30.331Q21.113 30.331 21.366 30.130Q21.619 29.928 21.752 29.610Q21.885 29.292 21.885 28.974Q21.885 28.745 21.820 28.516Q21.755 28.287 21.627 28.089Q21.499 27.891 21.304 27.771Q21.109 27.652 20.877 27.652Q20.583 27.652 20.315 27.781Q20.046 27.911 19.889 28.154M23.242 29.757Q23.242 29.425 23.466 29.198Q23.690 28.971 24.034 28.843Q24.377 28.714 24.750 28.662Q25.122 28.609 25.426 28.609L25.426 28.356Q25.426 28.151 25.319 27.971Q25.211 27.792 25.030 27.689Q24.849 27.587 24.640 27.587Q24.234 27.587 23.998 27.679Q24.087 27.716 24.133 27.800Q24.179 27.884 24.179 27.986Q24.179 28.082 24.133 28.161Q24.087 28.239 24.006 28.284Q23.926 28.328 23.837 28.328Q23.687 28.328 23.586 28.231Q23.485 28.133 23.485 27.986Q23.485 27.364 24.640 27.364Q24.852 27.364 25.102 27.428Q25.351 27.491 25.553 27.610Q25.755 27.730 25.881 27.915Q26.007 28.099 26.007 28.342L26.007 29.918Q26.007 30.034 26.069 30.130Q26.130 30.225 26.243 30.225Q26.353 30.225 26.418 30.131Q26.483 30.037 26.483 29.918L26.483 29.470L26.749 29.470L26.749 29.918Q26.749 30.188 26.522 30.353Q26.295 30.519 26.014 30.519Q25.806 30.519 25.669 30.365Q25.532 30.212 25.508 29.996Q25.361 30.263 25.079 30.408Q24.797 30.553 24.473 30.553Q24.196 30.553 23.912 30.478Q23.629 30.403 23.435 30.224Q23.242 30.044 23.242 29.757M23.858 29.757Q23.858 29.931 23.958 30.061Q24.059 30.191 24.215 30.261Q24.370 30.331 24.534 30.331Q24.753 30.331 24.962 30.234Q25.170 30.136 25.298 29.955Q25.426 29.774 25.426 29.548L25.426 28.820Q25.102 28.820 24.736 28.911Q24.370 29.002 24.114 29.214Q23.858 29.425 23.858 29.757M28.848 30.485L27.214 30.485L27.214 30.205Q27.443 30.205 27.592 30.171Q27.740 30.136 27.740 29.996L27.740 28.147Q27.740 27.877 27.633 27.816Q27.525 27.754 27.214 27.754L27.214 27.474L28.274 27.399L28.274 28.048Q28.444 27.740 28.749 27.569Q29.053 27.399 29.398 27.399Q29.904 27.399 30.188 27.622Q30.471 27.846 30.471 28.342L30.471 29.996Q30.471 30.133 30.620 30.169Q30.769 30.205 30.994 30.205L30.994 30.485L29.364 30.485L29.364 30.205Q29.593 30.205 29.742 30.171Q29.890 30.136 29.890 29.996L29.890 28.356Q29.890 28.021 29.771 27.821Q29.651 27.621 29.337 27.621Q29.067 27.621 28.832 27.757Q28.598 27.894 28.460 28.128Q28.321 28.362 28.321 28.636L28.321 29.996Q28.321 30.133 28.472 30.169Q28.622 30.205 28.848 30.205L28.848 30.485M31.582 28.974Q31.582 28.646 31.717 28.345Q31.852 28.045 32.088 27.824Q32.324 27.604 32.628 27.484Q32.932 27.364 33.257 27.364Q33.763 27.364 34.111 27.467Q34.460 27.569 34.460 27.945Q34.460 28.092 34.363 28.193Q34.265 28.294 34.118 28.294Q33.964 28.294 33.865 28.195Q33.766 28.096 33.766 27.945Q33.766 27.757 33.906 27.665Q33.705 27.614 33.264 27.614Q32.908 27.614 32.679 27.810Q32.450 28.007 32.349 28.316Q32.249 28.626 32.249 28.974Q32.249 29.323 32.375 29.629Q32.502 29.935 32.756 30.119Q33.011 30.304 33.366 30.304Q33.588 30.304 33.773 30.220Q33.958 30.136 34.093 29.981Q34.228 29.825 34.286 29.617Q34.299 29.562 34.354 29.562L34.467 29.562Q34.498 29.562 34.520 29.586Q34.542 29.610 34.542 29.644L34.542 29.665Q34.457 29.952 34.269 30.150Q34.081 30.348 33.816 30.451Q33.551 30.553 33.257 30.553Q32.826 30.553 32.438 30.347Q32.050 30.140 31.816 29.777Q31.582 29.415 31.582 28.974M35.465 31.620Q35.595 31.688 35.732 31.688Q35.902 31.688 36.053 31.599Q36.203 31.510 36.314 31.365Q36.425 31.220 36.504 31.052L36.767 30.485L35.598 27.959Q35.523 27.812 35.393 27.780Q35.263 27.747 35.031 27.747L35.031 27.467L36.552 27.467L36.552 27.747Q36.203 27.747 36.203 27.894Q36.207 27.915 36.208 27.932Q36.210 27.949 36.210 27.959L37.068 29.818L37.840 28.147Q37.875 28.079 37.875 28Q37.875 27.887 37.791 27.817Q37.707 27.747 37.594 27.747L37.594 27.467L38.791 27.467L38.791 27.747Q38.572 27.747 38.399 27.851Q38.227 27.956 38.134 28.147L36.798 31.052Q36.627 31.422 36.357 31.668Q36.087 31.914 35.732 31.914Q35.462 31.914 35.243 31.748Q35.024 31.582 35.024 31.319Q35.024 31.182 35.116 31.093Q35.209 31.005 35.349 31.005Q35.485 31.005 35.574 31.093Q35.663 31.182 35.663 31.319Q35.663 31.422 35.610 31.500Q35.557 31.579 35.465 31.620\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M135.354 2.032H98.12\"\u002F>\u003Cpath stroke=\"none\" d=\"m95.52 2.032 4.16 2.08-1.56-2.08 1.56-2.08\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(105.46 -33.547)\">\u003Cpath d=\"M-22.023 31.842L-23.653 31.842L-23.653 31.562Q-23.424 31.562-23.275 31.527Q-23.127 31.493-23.127 31.353L-23.127 28.007Q-23.127 27.836-23.263 27.795Q-23.400 27.754-23.653 27.754L-23.653 27.474L-22.573 27.399L-22.573 27.805Q-22.351 27.604-22.064 27.501Q-21.776 27.399-21.469 27.399Q-21.042 27.399-20.678 27.612Q-20.314 27.826-20.100 28.190Q-19.886 28.554-19.886 28.974Q-19.886 29.419-20.126 29.783Q-20.365 30.147-20.758 30.350Q-21.151 30.553-21.595 30.553Q-21.862 30.553-22.110 30.453Q-22.357 30.352-22.545 30.171L-22.545 31.353Q-22.545 31.490-22.397 31.526Q-22.248 31.562-22.023 31.562L-22.023 31.842M-22.545 28.154L-22.545 29.764Q-22.412 30.017-22.169 30.174Q-21.927 30.331-21.650 30.331Q-21.322 30.331-21.069 30.130Q-20.816 29.928-20.683 29.610Q-20.549 29.292-20.549 28.974Q-20.549 28.745-20.614 28.516Q-20.679 28.287-20.807 28.089Q-20.936 27.891-21.130 27.771Q-21.325 27.652-21.558 27.652Q-21.852 27.652-22.120 27.781Q-22.388 27.911-22.545 28.154M-18.676 29.651L-18.676 28.147Q-18.676 27.877-18.784 27.816Q-18.892 27.754-19.203 27.754L-19.203 27.474L-18.095 27.399L-18.095 29.631L-18.095 29.651Q-18.095 29.931-18.044 30.075Q-17.993 30.218-17.851 30.275Q-17.709 30.331-17.422 30.331Q-17.169 30.331-16.964 30.191Q-16.759 30.051-16.643 29.825Q-16.526 29.600-16.526 29.350L-16.526 28.147Q-16.526 27.877-16.634 27.816Q-16.742 27.754-17.053 27.754L-17.053 27.474L-15.945 27.399L-15.945 29.812Q-15.945 30.003-15.892 30.085Q-15.839 30.167-15.739 30.186Q-15.638 30.205-15.422 30.205L-15.422 30.485L-16.499 30.553L-16.499 29.989Q-16.608 30.171-16.754 30.294Q-16.899 30.417-17.085 30.485Q-17.272 30.553-17.473 30.553Q-18.676 30.553-18.676 29.651M-14.835 30.478L-14.835 29.415Q-14.835 29.391-14.807 29.364Q-14.780 29.337-14.756 29.337L-14.647 29.337Q-14.582 29.337-14.568 29.395Q-14.472 29.829-14.226 30.080Q-13.980 30.331-13.566 30.331Q-13.225 30.331-12.972 30.198Q-12.719 30.065-12.719 29.757Q-12.719 29.600-12.813 29.485Q-12.907 29.371-13.045 29.302Q-13.184 29.234-13.351 29.196L-13.932 29.097Q-14.288 29.029-14.561 28.808Q-14.835 28.588-14.835 28.246Q-14.835 27.997-14.723 27.822Q-14.612 27.648-14.426 27.549Q-14.240 27.450-14.024 27.407Q-13.809 27.364-13.566 27.364Q-13.153 27.364-12.873 27.546L-12.657 27.371Q-12.647 27.368-12.640 27.366Q-12.633 27.364-12.623 27.364L-12.572 27.364Q-12.544 27.364-12.521 27.388Q-12.497 27.412-12.497 27.440L-12.497 28.287Q-12.497 28.308-12.521 28.335Q-12.544 28.362-12.572 28.362L-12.685 28.362Q-12.712 28.362-12.738 28.337Q-12.763 28.311-12.763 28.287Q-12.763 28.051-12.869 27.887Q-12.975 27.723-13.158 27.641Q-13.341 27.559-13.573 27.559Q-13.901 27.559-14.158 27.662Q-14.414 27.764-14.414 28.041Q-14.414 28.236-14.231 28.345Q-14.048 28.455-13.819 28.496L-13.245 28.602Q-12.999 28.650-12.785 28.778Q-12.572 28.906-12.435 29.109Q-12.298 29.313-12.298 29.562Q-12.298 30.075-12.664 30.314Q-13.030 30.553-13.566 30.553Q-14.062 30.553-14.394 30.259L-14.660 30.533Q-14.681 30.553-14.708 30.553L-14.756 30.553Q-14.780 30.553-14.807 30.526Q-14.835 30.499-14.835 30.478M-9.988 30.485L-11.622 30.485L-11.622 30.205Q-11.393 30.205-11.244 30.171Q-11.095 30.136-11.095 29.996L-11.095 26.377Q-11.095 26.107-11.203 26.045Q-11.311 25.984-11.622 25.984L-11.622 25.703L-10.542 25.628L-10.542 28.014Q-10.436 27.829-10.258 27.687Q-10.080 27.546-9.872 27.472Q-9.663 27.399-9.438 27.399Q-8.932 27.399-8.648 27.622Q-8.364 27.846-8.364 28.342L-8.364 29.996Q-8.364 30.133-8.216 30.169Q-8.067 30.205-7.841 30.205L-7.841 30.485L-9.472 30.485L-9.472 30.205Q-9.243 30.205-9.094 30.171Q-8.945 30.136-8.945 29.996L-8.945 28.356Q-8.945 28.021-9.065 27.821Q-9.185 27.621-9.499 27.621Q-9.769 27.621-10.003 27.757Q-10.237 27.894-10.376 28.128Q-10.514 28.362-10.514 28.636L-10.514 29.996Q-10.514 30.133-10.364 30.169Q-10.213 30.205-9.988 30.205\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(105.46 -33.547)\">\u003Cpath d=\"M-4.028 29.644L-4.028 27.747L-4.667 27.747L-4.667 27.525Q-4.349 27.525-4.132 27.315Q-3.915 27.105-3.815 26.795Q-3.714 26.486-3.714 26.178L-3.447 26.178L-3.447 27.467L-2.370 27.467L-2.370 27.747L-3.447 27.747L-3.447 29.631Q-3.447 29.907-3.343 30.106Q-3.239 30.304-2.979 30.304Q-2.822 30.304-2.716 30.200Q-2.610 30.095-2.560 29.942Q-2.511 29.788-2.511 29.631L-2.511 29.217L-2.244 29.217L-2.244 29.644Q-2.244 29.870-2.343 30.080Q-2.442 30.290-2.627 30.422Q-2.811 30.553-3.040 30.553Q-3.478 30.553-3.753 30.316Q-4.028 30.078-4.028 29.644M-1.475 29.002Q-1.475 28.660-1.340 28.361Q-1.205 28.062-0.966 27.838Q-0.726 27.614-0.409 27.489Q-0.091 27.364 0.241 27.364Q0.685 27.364 1.085 27.580Q1.485 27.795 1.719 28.173Q1.953 28.550 1.953 29.002Q1.953 29.343 1.811 29.627Q1.670 29.911 1.425 30.118Q1.181 30.324 0.871 30.439Q0.562 30.553 0.241 30.553Q-0.190 30.553-0.591 30.352Q-0.993 30.150-1.234 29.798Q-1.475 29.446-1.475 29.002M0.241 30.304Q0.842 30.304 1.066 29.926Q1.290 29.548 1.290 28.916Q1.290 28.304 1.056 27.945Q0.822 27.587 0.241 27.587Q-0.812 27.587-0.812 28.916Q-0.812 29.548-0.586 29.926Q-0.361 30.304 0.241 30.304\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(105.46 -33.547)\">\u003Cpath d=\"M3.729 30.458L2.748 27.959Q2.687 27.816 2.569 27.781Q2.451 27.747 2.235 27.747L2.235 27.467L3.715 27.467L3.715 27.747Q3.336 27.747 3.336 27.908Q3.336 27.918 3.350 27.959L4.064 29.791L4.737 28.086Q4.707 28.014 4.707 27.986Q4.707 27.959 4.679 27.959Q4.618 27.812 4.500 27.780Q4.382 27.747 4.170 27.747L4.170 27.467L5.568 27.467L5.568 27.747Q5.192 27.747 5.192 27.908Q5.192 27.939 5.199 27.959L5.954 29.897L6.641 28.147Q6.662 28.096 6.662 28.041Q6.662 27.901 6.549 27.824Q6.436 27.747 6.296 27.747L6.296 27.467L7.516 27.467L7.516 27.747Q7.311 27.747 7.156 27.853Q7 27.959 6.928 28.147L6.023 30.458Q5.988 30.553 5.876 30.553L5.807 30.553Q5.698 30.553 5.660 30.458L4.878 28.455L4.091 30.458Q4.057 30.553 3.944 30.553L3.876 30.553Q3.767 30.553 3.729 30.458\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(105.46 -33.547)\">\u003Cpath d=\"M7.893 29.757Q7.893 29.425 8.116 29.198Q8.340 28.971 8.684 28.843Q9.027 28.714 9.400 28.662Q9.772 28.609 10.077 28.609L10.077 28.356Q10.077 28.151 9.969 27.971Q9.861 27.792 9.680 27.689Q9.499 27.587 9.291 27.587Q8.884 27.587 8.648 27.679Q8.737 27.716 8.783 27.800Q8.829 27.884 8.829 27.986Q8.829 28.082 8.783 28.161Q8.737 28.239 8.656 28.284Q8.576 28.328 8.487 28.328Q8.337 28.328 8.236 28.231Q8.135 28.133 8.135 27.986Q8.135 27.364 9.291 27.364Q9.502 27.364 9.752 27.428Q10.001 27.491 10.203 27.610Q10.405 27.730 10.531 27.915Q10.658 28.099 10.658 28.342L10.658 29.918Q10.658 30.034 10.719 30.130Q10.781 30.225 10.894 30.225Q11.003 30.225 11.068 30.131Q11.133 30.037 11.133 29.918L11.133 29.470L11.399 29.470L11.399 29.918Q11.399 30.188 11.172 30.353Q10.945 30.519 10.665 30.519Q10.456 30.519 10.319 30.365Q10.183 30.212 10.159 29.996Q10.012 30.263 9.730 30.408Q9.448 30.553 9.123 30.553Q8.846 30.553 8.562 30.478Q8.279 30.403 8.086 30.224Q7.893 30.044 7.893 29.757M8.508 29.757Q8.508 29.931 8.609 30.061Q8.709 30.191 8.865 30.261Q9.020 30.331 9.185 30.331Q9.403 30.331 9.612 30.234Q9.820 30.136 9.948 29.955Q10.077 29.774 10.077 29.548L10.077 28.820Q9.752 28.820 9.386 28.911Q9.020 29.002 8.764 29.214Q8.508 29.425 8.508 29.757M13.566 30.485L11.830 30.485L11.830 30.205Q12.059 30.205 12.208 30.171Q12.356 30.136 12.356 29.996L12.356 28.147Q12.356 27.877 12.249 27.816Q12.141 27.754 11.830 27.754L11.830 27.474L12.859 27.399L12.859 28.106Q12.989 27.798 13.231 27.599Q13.474 27.399 13.792 27.399Q14.011 27.399 14.182 27.523Q14.353 27.648 14.353 27.860Q14.353 27.997 14.253 28.096Q14.154 28.195 14.021 28.195Q13.884 28.195 13.785 28.096Q13.686 27.997 13.686 27.860Q13.686 27.720 13.785 27.621Q13.495 27.621 13.295 27.817Q13.095 28.014 13.002 28.308Q12.910 28.602 12.910 28.882L12.910 29.996Q12.910 30.205 13.566 30.205L13.566 30.485M14.937 28.974Q14.937 28.636 15.077 28.345Q15.217 28.055 15.462 27.841Q15.706 27.628 16.010 27.513Q16.314 27.399 16.639 27.399Q16.909 27.399 17.172 27.498Q17.436 27.597 17.627 27.775L17.627 26.377Q17.627 26.107 17.519 26.045Q17.412 25.984 17.101 25.984L17.101 25.703L18.177 25.628L18.177 29.812Q18.177 30 18.232 30.083Q18.287 30.167 18.387 30.186Q18.488 30.205 18.704 30.205L18.704 30.485L17.596 30.553L17.596 30.136Q17.179 30.553 16.554 30.553Q16.123 30.553 15.750 30.341Q15.378 30.130 15.157 29.769Q14.937 29.408 14.937 28.974M16.612 30.331Q16.820 30.331 17.007 30.259Q17.193 30.188 17.347 30.051Q17.500 29.914 17.596 29.736L17.596 28.127Q17.511 27.980 17.365 27.860Q17.220 27.740 17.051 27.681Q16.882 27.621 16.701 27.621Q16.140 27.621 15.872 28.010Q15.603 28.400 15.603 28.981Q15.603 29.552 15.838 29.942Q16.072 30.331 16.612 30.331\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(105.46 -33.547)\">\u003Cpath d=\"M22.015 28.950Q22.015 28.629 22.140 28.340Q22.265 28.051 22.491 27.828Q22.716 27.604 23.012 27.484Q23.307 27.364 23.625 27.364Q23.953 27.364 24.215 27.464Q24.476 27.563 24.652 27.745Q24.828 27.928 24.922 28.186Q25.016 28.444 25.016 28.776Q25.016 28.868 24.934 28.889L22.679 28.889L22.679 28.950Q22.679 29.538 22.962 29.921Q23.246 30.304 23.813 30.304Q24.135 30.304 24.403 30.111Q24.671 29.918 24.760 29.603Q24.767 29.562 24.842 29.548L24.934 29.548Q25.016 29.572 25.016 29.644Q25.016 29.651 25.010 29.678Q24.897 30.075 24.526 30.314Q24.155 30.553 23.731 30.553Q23.294 30.553 22.894 30.345Q22.494 30.136 22.255 29.769Q22.015 29.402 22.015 28.950M22.685 28.680L24.500 28.680Q24.500 28.403 24.403 28.151Q24.305 27.898 24.107 27.742Q23.909 27.587 23.625 27.587Q23.348 27.587 23.135 27.745Q22.921 27.904 22.803 28.159Q22.685 28.414 22.685 28.680M26.787 30.485L25.464 30.485L25.464 30.205Q26.025 30.205 26.404 29.805L27.118 29.008L26.206 27.959Q26.069 27.812 25.920 27.780Q25.772 27.747 25.505 27.747L25.505 27.467L27.006 27.467L27.006 27.747Q26.814 27.747 26.814 27.881Q26.814 27.911 26.845 27.959L27.440 28.643L27.881 28.147Q27.993 28.017 27.993 27.901Q27.993 27.839 27.956 27.793Q27.918 27.747 27.860 27.747L27.860 27.467L29.176 27.467L29.176 27.747Q28.616 27.747 28.236 28.147L27.614 28.848L28.609 29.996Q28.708 30.095 28.809 30.140Q28.909 30.184 29.021 30.194Q29.132 30.205 29.309 30.205L29.309 30.485L27.816 30.485L27.816 30.205Q27.881 30.205 27.940 30.171Q28 30.136 28 30.071Q28 30.024 27.970 29.996L27.293 29.210L26.760 29.805Q26.647 29.935 26.647 30.051Q26.647 30.116 26.688 30.160Q26.729 30.205 26.787 30.205L26.787 30.485M31.449 31.842L29.819 31.842L29.819 31.562Q30.048 31.562 30.196 31.527Q30.345 31.493 30.345 31.353L30.345 28.007Q30.345 27.836 30.208 27.795Q30.072 27.754 29.819 27.754L29.819 27.474L30.899 27.399L30.899 27.805Q31.121 27.604 31.408 27.501Q31.695 27.399 32.003 27.399Q32.430 27.399 32.794 27.612Q33.158 27.826 33.372 28.190Q33.585 28.554 33.585 28.974Q33.585 29.419 33.346 29.783Q33.107 30.147 32.714 30.350Q32.321 30.553 31.876 30.553Q31.610 30.553 31.362 30.453Q31.114 30.352 30.926 30.171L30.926 31.353Q30.926 31.490 31.075 31.526Q31.223 31.562 31.449 31.562L31.449 31.842M30.926 28.154L30.926 29.764Q31.059 30.017 31.302 30.174Q31.545 30.331 31.822 30.331Q32.150 30.331 32.403 30.130Q32.656 29.928 32.789 29.610Q32.922 29.292 32.922 28.974Q32.922 28.745 32.857 28.516Q32.792 28.287 32.664 28.089Q32.536 27.891 32.341 27.771Q32.146 27.652 31.914 27.652Q31.620 27.652 31.352 27.781Q31.083 27.911 30.926 28.154\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(105.46 -33.547)\">\u003Cpath d=\"M34.404 28.950Q34.404 28.629 34.529 28.340Q34.654 28.051 34.880 27.828Q35.105 27.604 35.401 27.484Q35.696 27.364 36.014 27.364Q36.342 27.364 36.604 27.464Q36.865 27.563 37.041 27.745Q37.217 27.928 37.311 28.186Q37.405 28.444 37.405 28.776Q37.405 28.868 37.323 28.889L35.068 28.889L35.068 28.950Q35.068 29.538 35.351 29.921Q35.635 30.304 36.202 30.304Q36.524 30.304 36.792 30.111Q37.060 29.918 37.149 29.603Q37.156 29.562 37.231 29.548L37.323 29.548Q37.405 29.572 37.405 29.644Q37.405 29.651 37.399 29.678Q37.286 30.075 36.915 30.314Q36.544 30.553 36.120 30.553Q35.683 30.553 35.283 30.345Q34.883 30.136 34.644 29.769Q34.404 29.402 34.404 28.950M35.074 28.680L36.889 28.680Q36.889 28.403 36.792 28.151Q36.694 27.898 36.496 27.742Q36.298 27.587 36.014 27.587Q35.737 27.587 35.524 27.745Q35.310 27.904 35.192 28.159Q35.074 28.414 35.074 28.680M39.743 30.485L38.007 30.485L38.007 30.205Q38.236 30.205 38.385 30.171Q38.533 30.136 38.533 29.996L38.533 28.147Q38.533 27.877 38.426 27.816Q38.318 27.754 38.007 27.754L38.007 27.474L39.036 27.399L39.036 28.106Q39.166 27.798 39.408 27.599Q39.651 27.399 39.969 27.399Q40.188 27.399 40.359 27.523Q40.529 27.648 40.529 27.860Q40.529 27.997 40.430 28.096Q40.331 28.195 40.198 28.195Q40.061 28.195 39.962 28.096Q39.863 27.997 39.863 27.860Q39.863 27.720 39.962 27.621Q39.672 27.621 39.472 27.817Q39.272 28.014 39.179 28.308Q39.087 28.602 39.087 28.882L39.087 29.996Q39.087 30.205 39.743 30.205L39.743 30.485M41.640 29.644L41.640 27.747L41.001 27.747L41.001 27.525Q41.319 27.525 41.536 27.315Q41.753 27.105 41.854 26.795Q41.955 26.486 41.955 26.178L42.221 26.178L42.221 27.467L43.298 27.467L43.298 27.747L42.221 27.747L42.221 29.631Q42.221 29.907 42.326 30.106Q42.430 30.304 42.690 30.304Q42.847 30.304 42.953 30.200Q43.059 30.095 43.108 29.942Q43.158 29.788 43.158 29.631L43.158 29.217L43.424 29.217L43.424 29.644Q43.424 29.870 43.325 30.080Q43.226 30.290 43.042 30.422Q42.857 30.553 42.628 30.553Q42.191 30.553 41.915 30.316Q41.640 30.078 41.640 29.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Occupancy-measure matching. The expert's discounted state-action visits (blue) form a distribution over the space; the learner's current occupancy (red) differs. GAIL drives the learner's occupancy toward the expert's until the two distributions coincide, which is exactly imitation, since two policies are equal iff their occupancy measures are equal.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:380.421px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 285.315 157.200\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-65.203 4.752h79.667V-29.39h-79.667Z\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-33.3 2)\">\u003Cpath d=\"M-23.249-10.768L-25.104-10.768L-25.104-11.061Q-24.835-11.061-24.667-11.106Q-24.499-11.151-24.499-11.327L-24.499-15.151Q-24.499-15.358-24.655-15.411Q-24.811-15.464-25.104-15.464L-25.104-15.760L-23.882-15.846L-23.882-15.382Q-23.651-15.604-23.337-15.725Q-23.022-15.846-22.683-15.846Q-22.210-15.846-21.806-15.600Q-21.401-15.354-21.169-14.938Q-20.936-14.522-20.936-14.046Q-20.936-13.671-21.085-13.342Q-21.233-13.014-21.503-12.762Q-21.772-12.510-22.116-12.376Q-22.460-12.241-22.819-12.241Q-23.108-12.241-23.380-12.362Q-23.651-12.483-23.858-12.694L-23.858-11.327Q-23.858-11.151-23.690-11.106Q-23.522-11.061-23.249-11.061L-23.249-10.768M-23.858-14.983L-23.858-13.143Q-23.706-12.854-23.444-12.674Q-23.183-12.495-22.874-12.495Q-22.589-12.495-22.366-12.633Q-22.143-12.772-21.991-13.003Q-21.839-13.233-21.761-13.505Q-21.683-13.776-21.683-14.046Q-21.683-14.378-21.808-14.735Q-21.933-15.092-22.181-15.329Q-22.429-15.565-22.776-15.565Q-23.100-15.565-23.395-15.409Q-23.690-15.253-23.858-14.983\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.3 2)\">\u003Cpath d=\"M-20.173-14.014Q-20.173-14.518-19.917-14.950Q-19.661-15.382-19.225-15.633Q-18.790-15.885-18.290-15.885Q-17.903-15.885-17.561-15.741Q-17.220-15.596-16.958-15.335Q-16.696-15.073-16.554-14.737Q-16.411-14.401-16.411-14.014Q-16.411-13.522-16.675-13.112Q-16.938-12.702-17.368-12.471Q-17.798-12.241-18.290-12.241Q-18.782-12.241-19.216-12.473Q-19.649-12.706-19.911-13.114Q-20.173-13.522-20.173-14.014M-18.290-12.518Q-17.833-12.518-17.581-12.741Q-17.329-12.964-17.241-13.315Q-17.153-13.667-17.153-14.112Q-17.153-14.542-17.247-14.880Q-17.341-15.217-17.595-15.424Q-17.849-15.632-18.290-15.632Q-18.938-15.632-19.182-15.215Q-19.427-14.799-19.427-14.112Q-19.427-13.667-19.339-13.315Q-19.251-12.964-18.999-12.741Q-18.747-12.518-18.290-12.518M-14.013-12.319L-15.845-12.319L-15.845-12.616Q-15.571-12.616-15.403-12.663Q-15.235-12.710-15.235-12.878L-15.235-17.038Q-15.235-17.253-15.298-17.348Q-15.360-17.444-15.479-17.465Q-15.599-17.487-15.845-17.487L-15.845-17.784L-14.622-17.870L-14.622-12.878Q-14.622-12.710-14.454-12.663Q-14.286-12.616-14.013-12.616L-14.013-12.319M-11.708-12.319L-13.485-12.319L-13.485-12.616Q-13.212-12.616-13.044-12.663Q-12.876-12.710-12.876-12.878L-12.876-15.014Q-12.876-15.229-12.932-15.325Q-12.989-15.421-13.102-15.442Q-13.216-15.464-13.462-15.464L-13.462-15.760L-12.263-15.846L-12.263-12.878Q-12.263-12.710-12.116-12.663Q-11.970-12.616-11.708-12.616L-11.708-12.319M-13.149-17.241Q-13.149-17.432-13.015-17.563Q-12.880-17.694-12.684-17.694Q-12.563-17.694-12.460-17.632Q-12.356-17.569-12.294-17.465Q-12.231-17.362-12.231-17.241Q-12.231-17.046-12.362-16.911Q-12.493-16.776-12.684-16.776Q-12.884-16.776-13.016-16.909Q-13.149-17.042-13.149-17.241M-11.165-14.046Q-11.165-14.542-10.915-14.967Q-10.665-15.393-10.245-15.639Q-9.825-15.885-9.325-15.885Q-8.786-15.885-8.395-15.760Q-8.005-15.635-8.005-15.221Q-8.005-15.116-8.056-15.024Q-8.106-14.932-8.198-14.882Q-8.290-14.831-8.399-14.831Q-8.505-14.831-8.597-14.882Q-8.688-14.932-8.739-15.024Q-8.790-15.116-8.790-15.221Q-8.790-15.444-8.622-15.549Q-8.845-15.608-9.317-15.608Q-9.614-15.608-9.829-15.469Q-10.044-15.331-10.175-15.100Q-10.306-14.870-10.364-14.600Q-10.423-14.331-10.423-14.046Q-10.423-13.651-10.290-13.301Q-10.157-12.952-9.886-12.735Q-9.614-12.518-9.216-12.518Q-8.841-12.518-8.565-12.735Q-8.290-12.952-8.188-13.311Q-8.173-13.374-8.110-13.374L-8.005-13.374Q-7.970-13.374-7.944-13.346Q-7.919-13.319-7.919-13.280L-7.919-13.257Q-8.052-12.776-8.436-12.508Q-8.821-12.241-9.325-12.241Q-9.688-12.241-10.022-12.378Q-10.356-12.514-10.616-12.764Q-10.876-13.014-11.020-13.350Q-11.165-13.686-11.165-14.046M-7.013-11.022Q-6.899-10.944-6.724-10.944Q-6.434-10.944-6.214-11.157Q-5.993-11.370-5.868-11.671L-5.579-12.319L-6.852-15.206Q-6.934-15.382-7.079-15.426Q-7.224-15.471-7.493-15.471L-7.493-15.768L-5.774-15.768L-5.774-15.471Q-6.196-15.471-6.196-15.288Q-6.196-15.276-6.181-15.206L-5.243-13.081L-4.411-14.991Q-4.372-15.081-4.372-15.159Q-4.372-15.299-4.474-15.385Q-4.575-15.471-4.716-15.471L-4.716-15.768L-3.364-15.768L-3.364-15.471Q-3.618-15.471-3.811-15.346Q-4.005-15.221-4.110-14.991L-5.556-11.671Q-5.669-11.417-5.835-11.194Q-6.001-10.971-6.229-10.829Q-6.458-10.686-6.724-10.686Q-7.020-10.686-7.261-10.878Q-7.501-11.069-7.501-11.358Q-7.501-11.514-7.395-11.616Q-7.290-11.717-7.141-11.717Q-7.036-11.717-6.956-11.671Q-6.876-11.624-6.829-11.546Q-6.782-11.467-6.782-11.358Q-6.782-11.237-6.843-11.149Q-6.903-11.061-7.013-11.022\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.3 2)\">\u003Cpath d=\"M2.276-10.327Q1.663-10.784 1.261-11.419Q0.858-12.053 0.663-12.799Q0.468-13.546 0.468-14.319Q0.468-15.092 0.663-15.839Q0.858-16.585 1.261-17.219Q1.663-17.854 2.276-18.311Q2.288-18.315 2.296-18.317Q2.304-18.319 2.315-18.319L2.393-18.319Q2.432-18.319 2.458-18.292Q2.483-18.264 2.483-18.221Q2.483-18.171 2.452-18.151Q1.944-17.698 1.622-17.075Q1.300-16.452 1.159-15.757Q1.018-15.061 1.018-14.319Q1.018-13.585 1.157-12.885Q1.296-12.186 1.620-11.561Q1.944-10.936 2.452-10.487Q2.483-10.467 2.483-10.417Q2.483-10.374 2.458-10.346Q2.432-10.319 2.393-10.319L2.315-10.319Q2.307-10.323 2.298-10.325Q2.288-10.327 2.276-10.327M3.202-11.710Q3.202-11.991 3.413-12.202Q3.624-12.413 3.909-12.503Q3.753-12.628 3.675-12.817Q3.596-13.007 3.596-13.206Q3.596-13.561 3.827-13.854Q3.460-14.194 3.460-14.663Q3.460-15.014 3.663-15.284Q3.866-15.553 4.186-15.700Q4.507-15.846 4.850-15.846Q5.370-15.846 5.741-15.565Q6.104-15.936 6.651-15.936Q6.831-15.936 6.958-15.809Q7.085-15.682 7.085-15.503Q7.085-15.397 7.007-15.319Q6.929-15.241 6.819-15.241Q6.710-15.241 6.634-15.317Q6.557-15.393 6.557-15.503Q6.557-15.604 6.596-15.655Q6.604-15.663 6.608-15.669Q6.612-15.674 6.612-15.678Q6.237-15.678 5.917-15.424Q6.237-15.085 6.237-14.663Q6.237-14.393 6.120-14.176Q6.003-13.960 5.798-13.801Q5.593-13.643 5.350-13.561Q5.108-13.479 4.850-13.479Q4.632-13.479 4.419-13.538Q4.206-13.596 4.011-13.717Q3.917-13.577 3.917-13.397Q3.917-13.190 4.054-13.038Q4.190-12.885 4.397-12.885L5.093-12.885Q5.581-12.885 5.993-12.801Q6.405-12.717 6.684-12.460Q6.964-12.202 6.964-11.710Q6.964-11.346 6.643-11.114Q6.323-10.882 5.882-10.780Q5.440-10.678 5.085-10.678Q4.729-10.678 4.286-10.780Q3.843-10.882 3.522-11.114Q3.202-11.346 3.202-11.710M3.706-11.710Q3.706-11.514 3.850-11.366Q3.995-11.217 4.208-11.128Q4.421-11.038 4.661-10.991Q4.901-10.944 5.085-10.944Q5.327-10.944 5.657-11.022Q5.987-11.100 6.223-11.274Q6.460-11.448 6.460-11.710Q6.460-12.116 6.050-12.225Q5.639-12.335 5.077-12.335L4.397-12.335Q4.128-12.335 3.917-12.157Q3.706-11.979 3.706-11.710M4.850-13.745Q5.573-13.745 5.573-14.663Q5.573-15.585 4.850-15.585Q4.124-15.585 4.124-14.663Q4.124-13.745 4.850-13.745M7.448-14.073Q7.448-14.553 7.680-14.969Q7.913-15.385 8.323-15.635Q8.733-15.885 9.210-15.885Q9.940-15.885 10.339-15.444Q10.737-15.003 10.737-14.272Q10.737-14.167 10.643-14.143L8.194-14.143L8.194-14.073Q8.194-13.663 8.315-13.307Q8.436-12.952 8.708-12.735Q8.979-12.518 9.409-12.518Q9.772-12.518 10.069-12.747Q10.366-12.975 10.468-13.327Q10.475-13.374 10.561-13.389L10.643-13.389Q10.737-13.362 10.737-13.280Q10.737-13.272 10.729-13.241Q10.667-13.014 10.528-12.831Q10.389-12.647 10.198-12.514Q10.007-12.382 9.788-12.311Q9.569-12.241 9.331-12.241Q8.960-12.241 8.622-12.378Q8.284-12.514 8.016-12.766Q7.749-13.018 7.598-13.358Q7.448-13.698 7.448-14.073M8.202-14.382L10.163-14.382Q10.163-14.686 10.061-14.977Q9.960-15.268 9.743-15.450Q9.526-15.632 9.210-15.632Q8.909-15.632 8.679-15.444Q8.448-15.257 8.325-14.965Q8.202-14.674 8.202-14.382M13.155-12.319L11.300-12.319L11.300-12.616Q11.573-12.616 11.741-12.663Q11.909-12.710 11.909-12.878L11.909-15.014Q11.909-15.229 11.846-15.325Q11.784-15.421 11.665-15.442Q11.546-15.464 11.300-15.464L11.300-15.760L12.491-15.846L12.491-15.112Q12.604-15.327 12.798-15.495Q12.991-15.663 13.229-15.755Q13.468-15.846 13.721-15.846Q14.889-15.846 14.889-14.768L14.889-12.878Q14.889-12.710 15.059-12.663Q15.229-12.616 15.499-12.616L15.499-12.319L13.643-12.319L13.643-12.616Q13.917-12.616 14.085-12.663Q14.253-12.710 14.253-12.878L14.253-14.753Q14.253-15.135 14.132-15.364Q14.011-15.592 13.659-15.592Q13.346-15.592 13.093-15.430Q12.839-15.268 12.692-14.999Q12.546-14.729 12.546-14.432L12.546-12.878Q12.546-12.710 12.716-12.663Q12.886-12.616 13.155-12.616L13.155-12.319M15.944-14.073Q15.944-14.553 16.177-14.969Q16.409-15.385 16.819-15.635Q17.229-15.885 17.706-15.885Q18.436-15.885 18.835-15.444Q19.233-15.003 19.233-14.272Q19.233-14.167 19.139-14.143L16.690-14.143L16.690-14.073Q16.690-13.663 16.811-13.307Q16.932-12.952 17.204-12.735Q17.475-12.518 17.905-12.518Q18.268-12.518 18.565-12.747Q18.862-12.975 18.964-13.327Q18.971-13.374 19.057-13.389L19.139-13.389Q19.233-13.362 19.233-13.280Q19.233-13.272 19.225-13.241Q19.163-13.014 19.024-12.831Q18.886-12.647 18.694-12.514Q18.503-12.382 18.284-12.311Q18.065-12.241 17.827-12.241Q17.456-12.241 17.118-12.378Q16.780-12.514 16.513-12.766Q16.245-13.018 16.095-13.358Q15.944-13.698 15.944-14.073M16.698-14.382L18.659-14.382Q18.659-14.686 18.557-14.977Q18.456-15.268 18.239-15.450Q18.022-15.632 17.706-15.632Q17.405-15.632 17.175-15.444Q16.944-15.257 16.821-14.965Q16.698-14.674 16.698-14.382M21.729-12.319L19.749-12.319L19.749-12.616Q20.018-12.616 20.186-12.661Q20.354-12.706 20.354-12.878L20.354-15.014Q20.354-15.229 20.292-15.325Q20.229-15.421 20.112-15.442Q19.995-15.464 19.749-15.464L19.749-15.760L20.917-15.846L20.917-15.061Q20.995-15.272 21.147-15.458Q21.300-15.643 21.499-15.745Q21.698-15.846 21.925-15.846Q22.171-15.846 22.362-15.702Q22.554-15.557 22.554-15.327Q22.554-15.171 22.448-15.061Q22.343-14.952 22.186-14.952Q22.030-14.952 21.921-15.061Q21.811-15.171 21.811-15.327Q21.811-15.487 21.917-15.592Q21.593-15.592 21.378-15.364Q21.163-15.135 21.067-14.796Q20.971-14.456 20.971-14.151L20.971-12.878Q20.971-12.710 21.198-12.663Q21.425-12.616 21.729-12.616L21.729-12.319M23.132-13.151Q23.132-13.635 23.534-13.930Q23.936-14.225 24.487-14.344Q25.038-14.464 25.530-14.464L25.530-14.753Q25.530-14.979 25.415-15.186Q25.300-15.393 25.102-15.512Q24.905-15.632 24.675-15.632Q24.249-15.632 23.964-15.526Q24.034-15.499 24.081-15.444Q24.128-15.389 24.153-15.319Q24.179-15.249 24.179-15.174Q24.179-15.069 24.128-14.977Q24.077-14.885 23.985-14.835Q23.893-14.784 23.788-14.784Q23.682-14.784 23.591-14.835Q23.499-14.885 23.448-14.977Q23.397-15.069 23.397-15.174Q23.397-15.592 23.786-15.739Q24.175-15.885 24.675-15.885Q25.007-15.885 25.360-15.755Q25.714-15.624 25.942-15.370Q26.171-15.116 26.171-14.768L26.171-12.967Q26.171-12.835 26.243-12.725Q26.315-12.616 26.444-12.616Q26.569-12.616 26.638-12.721Q26.706-12.827 26.706-12.967L26.706-13.479L26.987-13.479L26.987-12.967Q26.987-12.764 26.870-12.606Q26.753-12.448 26.571-12.364Q26.389-12.280 26.186-12.280Q25.956-12.280 25.804-12.452Q25.651-12.624 25.620-12.854Q25.460-12.573 25.151-12.407Q24.843-12.241 24.491-12.241Q23.979-12.241 23.555-12.464Q23.132-12.686 23.132-13.151M23.819-13.151Q23.819-12.866 24.046-12.680Q24.272-12.495 24.565-12.495Q24.811-12.495 25.036-12.612Q25.261-12.729 25.395-12.932Q25.530-13.135 25.530-13.389L25.530-14.221Q25.264-14.221 24.979-14.167Q24.694-14.112 24.423-13.983Q24.151-13.854 23.985-13.647Q23.819-13.440 23.819-13.151M27.905-13.280L27.905-15.471L27.202-15.471L27.202-15.725Q27.557-15.725 27.800-15.958Q28.042-16.190 28.153-16.538Q28.264-16.885 28.264-17.241L28.546-17.241L28.546-15.768L29.721-15.768L29.721-15.471L28.546-15.471L28.546-13.296Q28.546-12.975 28.665-12.747Q28.784-12.518 29.065-12.518Q29.245-12.518 29.362-12.641Q29.479-12.764 29.532-12.944Q29.585-13.124 29.585-13.296L29.585-13.768L29.866-13.768L29.866-13.280Q29.866-13.026 29.761-12.786Q29.655-12.546 29.458-12.393Q29.261-12.241 29.003-12.241Q28.686-12.241 28.434-12.364Q28.182-12.487 28.044-12.721Q27.905-12.956 27.905-13.280M30.585-14.014Q30.585-14.518 30.841-14.950Q31.096-15.382 31.532-15.633Q31.968-15.885 32.468-15.885Q32.854-15.885 33.196-15.741Q33.538-15.596 33.800-15.335Q34.061-15.073 34.204-14.737Q34.346-14.401 34.346-14.014Q34.346-13.522 34.083-13.112Q33.819-12.702 33.389-12.471Q32.960-12.241 32.468-12.241Q31.975-12.241 31.542-12.473Q31.108-12.706 30.846-13.114Q30.585-13.522 30.585-14.014M32.468-12.518Q32.925-12.518 33.177-12.741Q33.429-12.964 33.516-13.315Q33.604-13.667 33.604-14.112Q33.604-14.542 33.511-14.880Q33.417-15.217 33.163-15.424Q32.909-15.632 32.468-15.632Q31.819-15.632 31.575-15.215Q31.331-14.799 31.331-14.112Q31.331-13.667 31.419-13.315Q31.507-12.964 31.759-12.741Q32.011-12.518 32.468-12.518M36.839-12.319L34.858-12.319L34.858-12.616Q35.128-12.616 35.296-12.661Q35.464-12.706 35.464-12.878L35.464-15.014Q35.464-15.229 35.401-15.325Q35.339-15.421 35.221-15.442Q35.104-15.464 34.858-15.464L34.858-15.760L36.026-15.846L36.026-15.061Q36.104-15.272 36.257-15.458Q36.409-15.643 36.608-15.745Q36.807-15.846 37.034-15.846Q37.280-15.846 37.471-15.702Q37.663-15.557 37.663-15.327Q37.663-15.171 37.557-15.061Q37.452-14.952 37.296-14.952Q37.139-14.952 37.030-15.061Q36.921-15.171 36.921-15.327Q36.921-15.487 37.026-15.592Q36.702-15.592 36.487-15.364Q36.272-15.135 36.177-14.796Q36.081-14.456 36.081-14.151L36.081-12.878Q36.081-12.710 36.307-12.663Q36.534-12.616 36.839-12.616L36.839-12.319M38.546-10.319L38.464-10.319Q38.429-10.319 38.403-10.348Q38.378-10.378 38.378-10.417Q38.378-10.467 38.409-10.487Q38.796-10.823 39.079-11.272Q39.362-11.721 39.528-12.221Q39.694-12.721 39.768-13.239Q39.843-13.757 39.843-14.319Q39.843-14.889 39.768-15.405Q39.694-15.921 39.528-16.417Q39.362-16.913 39.083-17.360Q38.804-17.807 38.409-18.151Q38.378-18.171 38.378-18.221Q38.378-18.260 38.403-18.290Q38.429-18.319 38.464-18.319L38.546-18.319Q38.557-18.319 38.567-18.317Q38.577-18.315 38.585-18.311Q39.198-17.854 39.600-17.219Q40.003-16.585 40.198-15.839Q40.393-15.092 40.393-14.319Q40.393-13.546 40.198-12.799Q40.003-12.053 39.600-11.419Q39.198-10.784 38.585-10.327Q38.573-10.327 38.565-10.325Q38.557-10.323 38.546-10.319\" 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-65.203 78.73h79.667V44.586h-79.667Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M-15.518-23.573Q-15.518-24.053-15.285-24.469Q-15.053-24.885-14.643-25.135Q-14.233-25.385-13.756-25.385Q-13.026-25.385-12.627-24.944Q-12.229-24.503-12.229-23.772Q-12.229-23.667-12.322-23.643L-14.772-23.643L-14.772-23.573Q-14.772-23.163-14.651-22.807Q-14.529-22.452-14.258-22.235Q-13.986-22.018-13.557-22.018Q-13.194-22.018-12.897-22.247Q-12.600-22.475-12.498-22.827Q-12.490-22.874-12.404-22.889L-12.322-22.889Q-12.229-22.862-12.229-22.780Q-12.229-22.772-12.236-22.741Q-12.299-22.514-12.438-22.331Q-12.576-22.147-12.768-22.014Q-12.959-21.881-13.178-21.811Q-13.397-21.741-13.635-21.741Q-14.006-21.741-14.344-21.878Q-14.682-22.014-14.949-22.266Q-15.217-22.518-15.367-22.858Q-15.518-23.198-15.518-23.573M-14.764-23.881L-12.803-23.881Q-12.803-24.186-12.904-24.477Q-13.006-24.768-13.223-24.950Q-13.440-25.131-13.756-25.131Q-14.057-25.131-14.287-24.944Q-14.518-24.756-14.641-24.465Q-14.764-24.174-14.764-23.881M-9.811-21.819L-11.666-21.819L-11.666-22.116Q-11.393-22.116-11.225-22.163Q-11.057-22.210-11.057-22.378L-11.057-24.514Q-11.057-24.729-11.119-24.825Q-11.182-24.921-11.301-24.942Q-11.420-24.964-11.666-24.964L-11.666-25.260L-10.475-25.346L-10.475-24.612Q-10.361-24.827-10.168-24.995Q-9.975-25.163-9.736-25.255Q-9.498-25.346-9.244-25.346Q-8.076-25.346-8.076-24.268L-8.076-22.378Q-8.076-22.210-7.906-22.163Q-7.736-22.116-7.467-22.116L-7.467-21.819L-9.322-21.819L-9.322-22.116Q-9.049-22.116-8.881-22.163Q-8.713-22.210-8.713-22.378L-8.713-24.253Q-8.713-24.635-8.834-24.864Q-8.955-25.092-9.307-25.092Q-9.619-25.092-9.873-24.930Q-10.127-24.768-10.274-24.499Q-10.420-24.229-10.420-23.932L-10.420-22.378Q-10.420-22.210-10.250-22.163Q-10.080-22.116-9.811-22.116\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M-5.453-21.850L-6.676-24.706Q-6.758-24.881-6.902-24.926Q-7.047-24.971-7.316-24.971L-7.316-25.268L-5.605-25.268L-5.605-24.971Q-6.027-24.971-6.027-24.788Q-6.027-24.753-6.012-24.706L-5.066-22.514L-4.226-24.491Q-4.187-24.569-4.187-24.659Q-4.187-24.799-4.293-24.885Q-4.398-24.971-4.539-24.971L-4.539-25.268L-3.187-25.268L-3.187-24.971Q-3.711-24.971-3.926-24.491L-5.051-21.850Q-5.113-21.741-5.219-21.741L-5.285-21.741Q-5.398-21.741-5.453-21.850M-0.914-21.819L-2.691-21.819L-2.691-22.116Q-2.418-22.116-2.250-22.163Q-2.082-22.210-2.082-22.378L-2.082-24.514Q-2.082-24.729-2.138-24.825Q-2.195-24.921-2.308-24.942Q-2.422-24.964-2.668-24.964L-2.668-25.260L-1.469-25.346L-1.469-22.378Q-1.469-22.210-1.322-22.163Q-1.176-22.116-0.914-22.116L-0.914-21.819M-2.355-26.741Q-2.355-26.932-2.221-27.063Q-2.086-27.194-1.890-27.194Q-1.769-27.194-1.666-27.131Q-1.562-27.069-1.500-26.965Q-1.437-26.862-1.437-26.741Q-1.437-26.546-1.568-26.411Q-1.699-26.276-1.890-26.276Q-2.090-26.276-2.222-26.409Q-2.355-26.542-2.355-26.741M1.594-21.819L-0.387-21.819L-0.387-22.116Q-0.117-22.116 0.051-22.161Q0.219-22.206 0.219-22.378L0.219-24.514Q0.219-24.729 0.156-24.825Q0.094-24.921-0.023-24.942Q-0.140-24.964-0.387-24.964L-0.387-25.260L0.781-25.346L0.781-24.561Q0.860-24.772 1.012-24.958Q1.164-25.143 1.363-25.245Q1.563-25.346 1.789-25.346Q2.035-25.346 2.227-25.202Q2.418-25.057 2.418-24.827Q2.418-24.671 2.313-24.561Q2.207-24.452 2.051-24.452Q1.895-24.452 1.785-24.561Q1.676-24.671 1.676-24.827Q1.676-24.987 1.781-25.092Q1.457-25.092 1.242-24.864Q1.028-24.635 0.932-24.296Q0.836-23.956 0.836-23.651L0.836-22.378Q0.836-22.210 1.063-22.163Q1.289-22.116 1.594-22.116L1.594-21.819M2.899-23.514Q2.899-24.018 3.154-24.450Q3.410-24.881 3.846-25.133Q4.281-25.385 4.781-25.385Q5.168-25.385 5.510-25.241Q5.852-25.096 6.113-24.835Q6.375-24.573 6.518-24.237Q6.660-23.901 6.660-23.514Q6.660-23.022 6.397-22.612Q6.133-22.202 5.703-21.971Q5.274-21.741 4.781-21.741Q4.289-21.741 3.856-21.973Q3.422-22.206 3.160-22.614Q2.899-23.022 2.899-23.514M4.781-22.018Q5.238-22.018 5.490-22.241Q5.742-22.464 5.830-22.815Q5.918-23.167 5.918-23.612Q5.918-24.042 5.824-24.380Q5.731-24.717 5.477-24.924Q5.223-25.131 4.781-25.131Q4.133-25.131 3.889-24.715Q3.645-24.299 3.645-23.612Q3.645-23.167 3.733-22.815Q3.821-22.464 4.072-22.241Q4.324-22.018 4.781-22.018M9.074-21.819L7.219-21.819L7.219-22.116Q7.492-22.116 7.660-22.163Q7.828-22.210 7.828-22.378L7.828-24.514Q7.828-24.729 7.766-24.825Q7.703-24.921 7.584-24.942Q7.465-24.964 7.219-24.964L7.219-25.260L8.410-25.346L8.410-24.612Q8.524-24.827 8.717-24.995Q8.910-25.163 9.149-25.255Q9.387-25.346 9.641-25.346Q10.809-25.346 10.809-24.268L10.809-22.378Q10.809-22.210 10.979-22.163Q11.149-22.116 11.418-22.116L11.418-21.819L9.563-21.819L9.563-22.116Q9.836-22.116 10.004-22.163Q10.172-22.210 10.172-22.378L10.172-24.253Q10.172-24.635 10.051-24.864Q9.930-25.092 9.578-25.092Q9.266-25.092 9.012-24.930Q8.758-24.768 8.612-24.499Q8.465-24.229 8.465-23.932L8.465-22.378Q8.465-22.210 8.635-22.163Q8.805-22.116 9.074-22.116L9.074-21.819M13.793-21.819L11.938-21.819L11.938-22.116Q12.211-22.116 12.379-22.163Q12.547-22.210 12.547-22.378L12.547-24.514Q12.547-24.729 12.485-24.825Q12.422-24.921 12.303-24.942Q12.184-24.964 11.938-24.964L11.938-25.260L13.129-25.346L13.129-24.612Q13.242-24.827 13.436-24.995Q13.629-25.163 13.867-25.255Q14.106-25.346 14.360-25.346Q15.320-25.346 15.496-24.635Q15.680-24.964 16.008-25.155Q16.336-25.346 16.715-25.346Q17.891-25.346 17.891-24.268L17.891-22.378Q17.891-22.210 18.059-22.163Q18.227-22.116 18.496-22.116L18.496-21.819L16.641-21.819L16.641-22.116Q16.914-22.116 17.082-22.161Q17.250-22.206 17.250-22.378L17.250-24.253Q17.250-24.639 17.125-24.866Q17-25.092 16.649-25.092Q16.344-25.092 16.088-24.930Q15.832-24.768 15.684-24.499Q15.535-24.229 15.535-23.932L15.535-22.378Q15.535-22.210 15.705-22.163Q15.875-22.116 16.145-22.116L16.145-21.819L14.289-21.819L14.289-22.116Q14.563-22.116 14.731-22.163Q14.899-22.210 14.899-22.378L14.899-24.253Q14.899-24.639 14.774-24.866Q14.649-25.092 14.297-25.092Q13.992-25.092 13.737-24.930Q13.481-24.768 13.332-24.499Q13.184-24.229 13.184-23.932L13.184-22.378Q13.184-22.210 13.354-22.163Q13.524-22.116 13.793-22.116L13.793-21.819M18.942-23.573Q18.942-24.053 19.174-24.469Q19.406-24.885 19.817-25.135Q20.227-25.385 20.703-25.385Q21.434-25.385 21.832-24.944Q22.231-24.503 22.231-23.772Q22.231-23.667 22.137-23.643L19.688-23.643L19.688-23.573Q19.688-23.163 19.809-22.807Q19.930-22.452 20.201-22.235Q20.473-22.018 20.903-22.018Q21.266-22.018 21.563-22.247Q21.860-22.475 21.961-22.827Q21.969-22.874 22.055-22.889L22.137-22.889Q22.231-22.862 22.231-22.780Q22.231-22.772 22.223-22.741Q22.160-22.514 22.022-22.331Q21.883-22.147 21.692-22.014Q21.500-21.881 21.281-21.811Q21.063-21.741 20.824-21.741Q20.453-21.741 20.115-21.878Q19.778-22.014 19.510-22.266Q19.242-22.518 19.092-22.858Q18.942-23.198 18.942-23.573M19.695-23.881L21.656-23.881Q21.656-24.186 21.555-24.477Q21.453-24.768 21.237-24.950Q21.020-25.131 20.703-25.131Q20.403-25.131 20.172-24.944Q19.942-24.756 19.819-24.465Q19.695-24.174 19.695-23.881M24.649-21.819L22.793-21.819L22.793-22.116Q23.067-22.116 23.235-22.163Q23.403-22.210 23.403-22.378L23.403-24.514Q23.403-24.729 23.340-24.825Q23.278-24.921 23.158-24.942Q23.039-24.964 22.793-24.964L22.793-25.260L23.985-25.346L23.985-24.612Q24.098-24.827 24.291-24.995Q24.485-25.163 24.723-25.255Q24.961-25.346 25.215-25.346Q26.383-25.346 26.383-24.268L26.383-22.378Q26.383-22.210 26.553-22.163Q26.723-22.116 26.992-22.116L26.992-21.819L25.137-21.819L25.137-22.116Q25.410-22.116 25.578-22.163Q25.746-22.210 25.746-22.378L25.746-24.253Q25.746-24.635 25.625-24.864Q25.504-25.092 25.153-25.092Q24.840-25.092 24.586-24.930Q24.332-24.768 24.186-24.499Q24.039-24.229 24.039-23.932L24.039-22.378Q24.039-22.210 24.209-22.163Q24.379-22.116 24.649-22.116\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M27.851-22.780L27.851-24.971L27.148-24.971L27.148-25.225Q27.504-25.225 27.746-25.458Q27.988-25.690 28.099-26.038Q28.211-26.385 28.211-26.741L28.492-26.741L28.492-25.268L29.668-25.268L29.668-24.971L28.492-24.971L28.492-22.796Q28.492-22.475 28.611-22.247Q28.730-22.018 29.011-22.018Q29.191-22.018 29.308-22.141Q29.425-22.264 29.478-22.444Q29.531-22.624 29.531-22.796L29.531-23.268L29.812-23.268L29.812-22.780Q29.812-22.526 29.707-22.286Q29.601-22.046 29.404-21.893Q29.207-21.741 28.949-21.741Q28.633-21.741 28.381-21.864Q28.129-21.987 27.990-22.221Q27.851-22.456 27.851-22.780M31.011-22.284Q31.011-22.467 31.148-22.604Q31.285-22.741 31.476-22.741Q31.668-22.741 31.800-22.608Q31.933-22.475 31.933-22.284Q31.933-22.085 31.800-21.952Q31.668-21.819 31.476-21.819Q31.285-21.819 31.148-21.956Q31.011-22.092 31.011-22.284M31.011-24.811Q31.011-24.995 31.148-25.131Q31.285-25.268 31.476-25.268Q31.668-25.268 31.800-25.135Q31.933-25.003 31.933-24.811Q31.933-24.612 31.800-24.479Q31.668-24.346 31.476-24.346Q31.285-24.346 31.148-24.483Q31.011-24.620 31.011-24.811\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M-23.124-12.319L-25.104-12.319L-25.104-12.616Q-24.835-12.616-24.667-12.661Q-24.499-12.706-24.499-12.878L-24.499-15.014Q-24.499-15.229-24.561-15.325Q-24.624-15.421-24.741-15.442Q-24.858-15.464-25.104-15.464L-25.104-15.760L-23.936-15.846L-23.936-15.061Q-23.858-15.272-23.706-15.458Q-23.554-15.643-23.354-15.745Q-23.155-15.846-22.929-15.846Q-22.683-15.846-22.491-15.702Q-22.300-15.557-22.300-15.327Q-22.300-15.171-22.405-15.061Q-22.511-14.952-22.667-14.952Q-22.823-14.952-22.933-15.061Q-23.042-15.171-23.042-15.327Q-23.042-15.487-22.936-15.592Q-23.261-15.592-23.475-15.364Q-23.690-15.135-23.786-14.796Q-23.882-14.456-23.882-14.151L-23.882-12.878Q-23.882-12.710-23.655-12.663Q-23.429-12.616-23.124-12.616L-23.124-12.319M-21.819-14.014Q-21.819-14.518-21.563-14.950Q-21.308-15.382-20.872-15.633Q-20.436-15.885-19.936-15.885Q-19.550-15.885-19.208-15.741Q-18.866-15.596-18.604-15.335Q-18.343-15.073-18.200-14.737Q-18.058-14.401-18.058-14.014Q-18.058-13.522-18.321-13.112Q-18.585-12.702-19.015-12.471Q-19.444-12.241-19.936-12.241Q-20.429-12.241-20.862-12.473Q-21.296-12.706-21.558-13.114Q-21.819-13.522-21.819-14.014M-19.936-12.518Q-19.479-12.518-19.227-12.741Q-18.975-12.964-18.888-13.315Q-18.800-13.667-18.800-14.112Q-18.800-14.542-18.893-14.880Q-18.987-15.217-19.241-15.424Q-19.495-15.632-19.936-15.632Q-20.585-15.632-20.829-15.215Q-21.073-14.799-21.073-14.112Q-21.073-13.667-20.985-13.315Q-20.897-12.964-20.645-12.741Q-20.393-12.518-19.936-12.518M-15.659-12.319L-17.491-12.319L-17.491-12.616Q-17.218-12.616-17.050-12.663Q-16.882-12.710-16.882-12.878L-16.882-17.038Q-16.882-17.253-16.944-17.348Q-17.007-17.444-17.126-17.465Q-17.245-17.487-17.491-17.487L-17.491-17.784L-16.268-17.870L-16.268-12.878Q-16.268-12.710-16.100-12.663Q-15.933-12.616-15.659-12.616L-15.659-12.319M-13.300-12.319L-15.132-12.319L-15.132-12.616Q-14.858-12.616-14.690-12.663Q-14.522-12.710-14.522-12.878L-14.522-17.038Q-14.522-17.253-14.585-17.348Q-14.647-17.444-14.766-17.465Q-14.886-17.487-15.132-17.487L-15.132-17.784L-13.909-17.870L-13.909-12.878Q-13.909-12.710-13.741-12.663Q-13.573-12.616-13.300-12.616L-13.300-12.319M-12.854-14.014Q-12.854-14.518-12.599-14.950Q-12.343-15.382-11.907-15.633Q-11.472-15.885-10.972-15.885Q-10.585-15.885-10.243-15.741Q-9.901-15.596-9.640-15.335Q-9.378-15.073-9.235-14.737Q-9.093-14.401-9.093-14.014Q-9.093-13.522-9.356-13.112Q-9.620-12.702-10.050-12.471Q-10.479-12.241-10.972-12.241Q-11.464-12.241-11.897-12.473Q-12.331-12.706-12.593-13.114Q-12.854-13.522-12.854-14.014M-10.972-12.518Q-10.515-12.518-10.263-12.741Q-10.011-12.964-9.923-13.315Q-9.835-13.667-9.835-14.112Q-9.835-14.542-9.929-14.880Q-10.022-15.217-10.276-15.424Q-10.530-15.632-10.972-15.632Q-11.620-15.632-11.864-15.215Q-12.108-14.799-12.108-14.112Q-12.108-13.667-12.020-13.315Q-11.933-12.964-11.681-12.741Q-11.429-12.518-10.972-12.518M-7.925-13.272L-7.925-15.014Q-7.925-15.229-7.987-15.325Q-8.050-15.421-8.169-15.442Q-8.288-15.464-8.534-15.464L-8.534-15.760L-7.288-15.846L-7.288-13.296L-7.288-13.272Q-7.288-12.960-7.233-12.798Q-7.179-12.635-7.028-12.565Q-6.878-12.495-6.558-12.495Q-6.128-12.495-5.854-12.833Q-5.581-13.171-5.581-13.616L-5.581-15.014Q-5.581-15.229-5.643-15.325Q-5.706-15.421-5.825-15.442Q-5.944-15.464-6.190-15.464L-6.190-15.760L-4.944-15.846L-4.944-13.061Q-4.944-12.850-4.882-12.755Q-4.819-12.659-4.700-12.637Q-4.581-12.616-4.335-12.616L-4.335-12.319L-5.558-12.241L-5.558-12.862Q-5.725-12.573-6.007-12.407Q-6.288-12.241-6.608-12.241Q-7.925-12.241-7.925-13.272M-3.265-13.280L-3.265-15.471L-3.968-15.471L-3.968-15.725Q-3.612-15.725-3.370-15.958Q-3.128-16.190-3.016-16.538Q-2.905-16.885-2.905-17.241L-2.624-17.241L-2.624-15.768L-1.448-15.768L-1.448-15.471L-2.624-15.471L-2.624-13.296Q-2.624-12.975-2.505-12.747Q-2.386-12.518-2.104-12.518Q-1.925-12.518-1.808-12.641Q-1.690-12.764-1.638-12.944Q-1.585-13.124-1.585-13.296L-1.585-13.768L-1.304-13.768L-1.304-13.280Q-1.304-13.026-1.409-12.786Q-1.515-12.546-1.712-12.393Q-1.909-12.241-2.167-12.241Q-2.483-12.241-2.735-12.364Q-2.987-12.487-3.126-12.721Q-3.265-12.956-3.265-13.280\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M4.644-10.327Q4.031-10.784 3.629-11.419Q3.226-12.053 3.031-12.799Q2.836-13.546 2.836-14.319Q2.836-15.092 3.031-15.839Q3.226-16.585 3.629-17.219Q4.031-17.854 4.644-18.311Q4.656-18.315 4.664-18.317Q4.672-18.319 4.683-18.319L4.761-18.319Q4.800-18.319 4.826-18.292Q4.851-18.264 4.851-18.221Q4.851-18.171 4.820-18.151Q4.312-17.698 3.990-17.075Q3.668-16.452 3.527-15.757Q3.386-15.061 3.386-14.319Q3.386-13.585 3.525-12.885Q3.664-12.186 3.988-11.561Q4.312-10.936 4.820-10.487Q4.851-10.467 4.851-10.417Q4.851-10.374 4.826-10.346Q4.800-10.319 4.761-10.319L4.683-10.319Q4.675-10.323 4.666-10.325Q4.656-10.327 4.644-10.327M5.613-12.327L5.613-13.549Q5.613-13.577 5.644-13.608Q5.675-13.639 5.699-13.639L5.804-13.639Q5.875-13.639 5.890-13.577Q5.953-13.257 6.091-13.016Q6.230-12.776 6.463-12.635Q6.695-12.495 7.004-12.495Q7.242-12.495 7.451-12.555Q7.660-12.616 7.797-12.764Q7.933-12.913 7.933-13.159Q7.933-13.413 7.722-13.579Q7.511-13.745 7.242-13.799L6.621-13.913Q6.215-13.991 5.914-14.247Q5.613-14.503 5.613-14.878Q5.613-15.245 5.814-15.467Q6.015-15.690 6.340-15.788Q6.664-15.885 7.004-15.885Q7.468-15.885 7.765-15.678L7.988-15.862Q8.011-15.885 8.043-15.885L8.093-15.885Q8.125-15.885 8.152-15.858Q8.179-15.831 8.179-15.799L8.179-14.815Q8.179-14.784 8.154-14.755Q8.129-14.725 8.093-14.725L7.988-14.725Q7.953-14.725 7.925-14.753Q7.898-14.780 7.898-14.815Q7.898-15.214 7.646-15.434Q7.394-15.655 6.996-15.655Q6.640-15.655 6.357-15.532Q6.074-15.409 6.074-15.104Q6.074-14.885 6.275-14.753Q6.476-14.620 6.722-14.577L7.347-14.464Q7.777-14.374 8.086-14.077Q8.394-13.780 8.394-13.366Q8.394-12.796 7.996-12.518Q7.597-12.241 7.004-12.241Q6.453-12.241 6.101-12.577L5.804-12.264Q5.781-12.241 5.746-12.241L5.699-12.241Q5.675-12.241 5.644-12.272Q5.613-12.303 5.613-12.327M9.507-10.913Q9.507-10.936 9.539-10.983Q9.832-11.245 9.998-11.612Q10.164-11.979 10.164-12.366L10.164-12.424Q10.035-12.319 9.867-12.319Q9.675-12.319 9.539-12.452Q9.402-12.585 9.402-12.784Q9.402-12.975 9.539-13.108Q9.675-13.241 9.867-13.241Q10.168-13.241 10.293-12.971Q10.418-12.702 10.418-12.366Q10.418-11.917 10.236-11.503Q10.054-11.089 9.715-10.792Q9.691-10.768 9.652-10.768Q9.605-10.768 9.556-10.813Q9.507-10.858 9.507-10.913\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M14.216-13.151Q14.216-13.635 14.618-13.930Q15.021-14.225 15.571-14.344Q16.122-14.464 16.614-14.464L16.614-14.753Q16.614-14.979 16.499-15.186Q16.384-15.393 16.187-15.512Q15.989-15.632 15.759-15.632Q15.333-15.632 15.048-15.526Q15.118-15.499 15.165-15.444Q15.212-15.389 15.237-15.319Q15.263-15.249 15.263-15.174Q15.263-15.069 15.212-14.977Q15.161-14.885 15.069-14.835Q14.978-14.784 14.872-14.784Q14.767-14.784 14.675-14.835Q14.583-14.885 14.532-14.977Q14.482-15.069 14.482-15.174Q14.482-15.592 14.870-15.739Q15.259-15.885 15.759-15.885Q16.091-15.885 16.444-15.755Q16.798-15.624 17.026-15.370Q17.255-15.116 17.255-14.768L17.255-12.967Q17.255-12.835 17.327-12.725Q17.400-12.616 17.528-12.616Q17.653-12.616 17.722-12.721Q17.790-12.827 17.790-12.967L17.790-13.479L18.071-13.479L18.071-12.967Q18.071-12.764 17.954-12.606Q17.837-12.448 17.655-12.364Q17.474-12.280 17.271-12.280Q17.040-12.280 16.888-12.452Q16.735-12.624 16.704-12.854Q16.544-12.573 16.235-12.407Q15.927-12.241 15.575-12.241Q15.064-12.241 14.640-12.464Q14.216-12.686 14.216-13.151M14.903-13.151Q14.903-12.866 15.130-12.680Q15.357-12.495 15.650-12.495Q15.896-12.495 16.120-12.612Q16.345-12.729 16.480-12.932Q16.614-13.135 16.614-13.389L16.614-14.221Q16.349-14.221 16.064-14.167Q15.778-14.112 15.507-13.983Q15.235-13.854 15.069-13.647Q14.903-13.440 14.903-13.151M18.767-10.319L18.685-10.319Q18.650-10.319 18.624-10.348Q18.599-10.378 18.599-10.417Q18.599-10.467 18.630-10.487Q19.017-10.823 19.300-11.272Q19.583-11.721 19.749-12.221Q19.915-12.721 19.989-13.239Q20.064-13.757 20.064-14.319Q20.064-14.889 19.989-15.405Q19.915-15.921 19.749-16.417Q19.583-16.913 19.304-17.360Q19.025-17.807 18.630-18.151Q18.599-18.171 18.599-18.221Q18.599-18.260 18.624-18.290Q18.650-18.319 18.685-18.319L18.767-18.319Q18.778-18.319 18.788-18.317Q18.798-18.315 18.806-18.311Q19.419-17.854 19.821-17.219Q20.224-16.585 20.419-15.839Q20.614-15.092 20.614-14.319Q20.614-13.546 20.419-12.799Q20.224-12.053 19.821-11.419Q19.419-10.784 18.806-10.327Q18.794-10.327 18.786-10.325Q18.778-10.323 18.767-10.319\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.819 80.41)\">\u003Cpath d=\"M26.390-10.768L24.535-10.768L24.535-11.061Q24.804-11.061 24.972-11.106Q25.140-11.151 25.140-11.327L25.140-15.151Q25.140-15.358 24.984-15.411Q24.828-15.464 24.535-15.464L24.535-15.760L25.757-15.846L25.757-15.382Q25.988-15.604 26.302-15.725Q26.617-15.846 26.956-15.846Q27.429-15.846 27.833-15.600Q28.238-15.354 28.470-14.938Q28.703-14.522 28.703-14.046Q28.703-13.671 28.554-13.342Q28.406-13.014 28.136-12.762Q27.867-12.510 27.523-12.376Q27.179-12.241 26.820-12.241Q26.531-12.241 26.259-12.362Q25.988-12.483 25.781-12.694L25.781-11.327Q25.781-11.151 25.949-11.106Q26.117-11.061 26.390-11.061L26.390-10.768M25.781-14.983L25.781-13.143Q25.933-12.854 26.195-12.674Q26.456-12.495 26.765-12.495Q27.050-12.495 27.273-12.633Q27.496-12.772 27.648-13.003Q27.800-13.233 27.878-13.505Q27.956-13.776 27.956-14.046Q27.956-14.378 27.831-14.735Q27.706-15.092 27.458-15.329Q27.210-15.565 26.863-15.565Q26.539-15.565 26.244-15.409Q25.949-15.253 25.781-14.983M29.324-13.151Q29.324-13.635 29.726-13.930Q30.128-14.225 30.679-14.344Q31.230-14.464 31.722-14.464L31.722-14.753Q31.722-14.979 31.607-15.186Q31.492-15.393 31.294-15.512Q31.097-15.632 30.867-15.632Q30.441-15.632 30.156-15.526Q30.226-15.499 30.273-15.444Q30.320-15.389 30.345-15.319Q30.371-15.249 30.371-15.174Q30.371-15.069 30.320-14.977Q30.269-14.885 30.177-14.835Q30.085-14.784 29.980-14.784Q29.874-14.784 29.783-14.835Q29.691-14.885 29.640-14.977Q29.589-15.069 29.589-15.174Q29.589-15.592 29.978-15.739Q30.367-15.885 30.867-15.885Q31.199-15.885 31.552-15.755Q31.906-15.624 32.134-15.370Q32.363-15.116 32.363-14.768L32.363-12.967Q32.363-12.835 32.435-12.725Q32.507-12.616 32.636-12.616Q32.761-12.616 32.830-12.721Q32.898-12.827 32.898-12.967L32.898-13.479L33.179-13.479L33.179-12.967Q33.179-12.764 33.062-12.606Q32.945-12.448 32.763-12.364Q32.581-12.280 32.378-12.280Q32.148-12.280 31.996-12.452Q31.843-12.624 31.812-12.854Q31.652-12.573 31.343-12.407Q31.035-12.241 30.683-12.241Q30.171-12.241 29.748-12.464Q29.324-12.686 29.324-13.151M30.011-13.151Q30.011-12.866 30.238-12.680Q30.464-12.495 30.757-12.495Q31.003-12.495 31.228-12.612Q31.453-12.729 31.587-12.932Q31.722-13.135 31.722-13.389L31.722-14.221Q31.456-14.221 31.171-14.167Q30.886-14.112 30.615-13.983Q30.343-13.854 30.177-13.647Q30.011-13.440 30.011-13.151M35.331-12.319L33.554-12.319L33.554-12.616Q33.828-12.616 33.996-12.663Q34.164-12.710 34.164-12.878L34.164-15.014Q34.164-15.229 34.107-15.325Q34.050-15.421 33.937-15.442Q33.824-15.464 33.578-15.464L33.578-15.760L34.777-15.846L34.777-12.878Q34.777-12.710 34.923-12.663Q35.070-12.616 35.331-12.616L35.331-12.319M33.890-17.241Q33.890-17.432 34.025-17.563Q34.160-17.694 34.355-17.694Q34.476-17.694 34.580-17.632Q34.683-17.569 34.746-17.465Q34.808-17.362 34.808-17.241Q34.808-17.046 34.677-16.911Q34.546-16.776 34.355-16.776Q34.156-16.776 34.023-16.909Q33.890-17.042 33.890-17.241M37.839-12.319L35.859-12.319L35.859-12.616Q36.128-12.616 36.296-12.661Q36.464-12.706 36.464-12.878L36.464-15.014Q36.464-15.229 36.402-15.325Q36.339-15.421 36.222-15.442Q36.105-15.464 35.859-15.464L35.859-15.760L37.027-15.846L37.027-15.061Q37.105-15.272 37.257-15.458Q37.410-15.643 37.609-15.745Q37.808-15.846 38.035-15.846Q38.281-15.846 38.472-15.702Q38.664-15.557 38.664-15.327Q38.664-15.171 38.558-15.061Q38.453-14.952 38.296-14.952Q38.140-14.952 38.031-15.061Q37.921-15.171 37.921-15.327Q37.921-15.487 38.027-15.592Q37.703-15.592 37.488-15.364Q37.273-15.135 37.177-14.796Q37.081-14.456 37.081-14.151L37.081-12.878Q37.081-12.710 37.308-12.663Q37.535-12.616 37.839-12.616L37.839-12.319M39.187-12.327L39.187-13.549Q39.187-13.577 39.218-13.608Q39.249-13.639 39.273-13.639L39.378-13.639Q39.449-13.639 39.464-13.577Q39.527-13.257 39.665-13.016Q39.804-12.776 40.037-12.635Q40.269-12.495 40.578-12.495Q40.816-12.495 41.025-12.555Q41.234-12.616 41.371-12.764Q41.507-12.913 41.507-13.159Q41.507-13.413 41.296-13.579Q41.085-13.745 40.816-13.799L40.195-13.913Q39.789-13.991 39.488-14.247Q39.187-14.503 39.187-14.878Q39.187-15.245 39.388-15.467Q39.589-15.690 39.914-15.788Q40.238-15.885 40.578-15.885Q41.042-15.885 41.339-15.678L41.562-15.862Q41.585-15.885 41.617-15.885L41.667-15.885Q41.699-15.885 41.726-15.858Q41.753-15.831 41.753-15.799L41.753-14.815Q41.753-14.784 41.728-14.755Q41.703-14.725 41.667-14.725L41.562-14.725Q41.527-14.725 41.499-14.753Q41.472-14.780 41.472-14.815Q41.472-15.214 41.220-15.434Q40.968-15.655 40.570-15.655Q40.214-15.655 39.931-15.532Q39.648-15.409 39.648-15.104Q39.648-14.885 39.849-14.753Q40.050-14.620 40.296-14.577L40.921-14.464Q41.351-14.374 41.660-14.077Q41.968-13.780 41.968-13.366Q41.968-12.796 41.570-12.518Q41.171-12.241 40.578-12.241Q40.027-12.241 39.675-12.577L39.378-12.264Q39.355-12.241 39.320-12.241L39.273-12.241Q39.249-12.241 39.218-12.272Q39.187-12.303 39.187-12.327\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"var(--tk-warn)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M116.894 41.741h79.668V7.598h-79.668Z\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(152.85 39.766)\">\u003Cpath d=\"M-23.315-12.241Q-23.796-12.241-24.204-12.485Q-24.612-12.729-24.850-13.143Q-25.089-13.557-25.089-14.046Q-25.089-14.538-24.831-14.954Q-24.573-15.370-24.141-15.608Q-23.710-15.846-23.218-15.846Q-22.597-15.846-22.147-15.409L-22.147-17.038Q-22.147-17.253-22.210-17.348Q-22.272-17.444-22.390-17.465Q-22.507-17.487-22.753-17.487L-22.753-17.784L-21.530-17.870L-21.530-13.061Q-21.530-12.850-21.468-12.755Q-21.405-12.659-21.288-12.637Q-21.171-12.616-20.921-12.616L-20.921-12.319L-22.171-12.241L-22.171-12.725Q-22.636-12.241-23.315-12.241M-23.249-12.495Q-22.909-12.495-22.616-12.686Q-22.323-12.878-22.171-13.174L-22.171-15.007Q-22.319-15.280-22.581-15.436Q-22.843-15.592-23.155-15.592Q-23.780-15.592-24.063-15.145Q-24.347-14.698-24.347-14.038Q-24.347-13.393-24.095-12.944Q-23.843-12.495-23.249-12.495M-18.554-12.319L-20.331-12.319L-20.331-12.616Q-20.058-12.616-19.890-12.663Q-19.722-12.710-19.722-12.878L-19.722-15.014Q-19.722-15.229-19.778-15.325Q-19.835-15.421-19.948-15.442Q-20.061-15.464-20.308-15.464L-20.308-15.760L-19.108-15.846L-19.108-12.878Q-19.108-12.710-18.962-12.663Q-18.815-12.616-18.554-12.616L-18.554-12.319M-19.995-17.241Q-19.995-17.432-19.860-17.563Q-19.725-17.694-19.530-17.694Q-19.409-17.694-19.306-17.632Q-19.202-17.569-19.140-17.465Q-19.077-17.362-19.077-17.241Q-19.077-17.046-19.208-16.911Q-19.339-16.776-19.530-16.776Q-19.729-16.776-19.862-16.909Q-19.995-17.042-19.995-17.241M-18.011-12.327L-18.011-13.549Q-18.011-13.577-17.979-13.608Q-17.948-13.639-17.925-13.639L-17.819-13.639Q-17.749-13.639-17.733-13.577Q-17.671-13.257-17.532-13.016Q-17.393-12.776-17.161-12.635Q-16.929-12.495-16.620-12.495Q-16.382-12.495-16.173-12.555Q-15.964-12.616-15.827-12.764Q-15.690-12.913-15.690-13.159Q-15.690-13.413-15.901-13.579Q-16.112-13.745-16.382-13.799L-17.003-13.913Q-17.409-13.991-17.710-14.247Q-18.011-14.503-18.011-14.878Q-18.011-15.245-17.809-15.467Q-17.608-15.690-17.284-15.788Q-16.960-15.885-16.620-15.885Q-16.155-15.885-15.858-15.678L-15.636-15.862Q-15.612-15.885-15.581-15.885L-15.530-15.885Q-15.499-15.885-15.472-15.858Q-15.444-15.831-15.444-15.799L-15.444-14.815Q-15.444-14.784-15.470-14.755Q-15.495-14.725-15.530-14.725L-15.636-14.725Q-15.671-14.725-15.698-14.753Q-15.725-14.780-15.725-14.815Q-15.725-15.214-15.977-15.434Q-16.229-15.655-16.628-15.655Q-16.983-15.655-17.266-15.532Q-17.550-15.409-17.550-15.104Q-17.550-14.885-17.349-14.753Q-17.147-14.620-16.901-14.577L-16.276-14.464Q-15.847-14.374-15.538-14.077Q-15.229-13.780-15.229-13.366Q-15.229-12.796-15.628-12.518Q-16.026-12.241-16.620-12.241Q-17.171-12.241-17.522-12.577L-17.819-12.264Q-17.843-12.241-17.878-12.241L-17.925-12.241Q-17.948-12.241-17.979-12.272Q-18.011-12.303-18.011-12.327M-14.659-14.046Q-14.659-14.542-14.409-14.967Q-14.159-15.393-13.739-15.639Q-13.319-15.885-12.819-15.885Q-12.280-15.885-11.890-15.760Q-11.499-15.635-11.499-15.221Q-11.499-15.116-11.550-15.024Q-11.600-14.932-11.692-14.882Q-11.784-14.831-11.893-14.831Q-11.999-14.831-12.091-14.882Q-12.183-14.932-12.233-15.024Q-12.284-15.116-12.284-15.221Q-12.284-15.444-12.116-15.549Q-12.339-15.608-12.811-15.608Q-13.108-15.608-13.323-15.469Q-13.538-15.331-13.669-15.100Q-13.800-14.870-13.858-14.600Q-13.917-14.331-13.917-14.046Q-13.917-13.651-13.784-13.301Q-13.651-12.952-13.380-12.735Q-13.108-12.518-12.710-12.518Q-12.335-12.518-12.059-12.735Q-11.784-12.952-11.683-13.311Q-11.667-13.374-11.604-13.374L-11.499-13.374Q-11.464-13.374-11.438-13.346Q-11.413-13.319-11.413-13.280L-11.413-13.257Q-11.546-12.776-11.931-12.508Q-12.315-12.241-12.819-12.241Q-13.183-12.241-13.516-12.378Q-13.850-12.514-14.110-12.764Q-14.370-13.014-14.515-13.350Q-14.659-13.686-14.659-14.046M-8.917-12.319L-10.897-12.319L-10.897-12.616Q-10.628-12.616-10.460-12.661Q-10.292-12.706-10.292-12.878L-10.292-15.014Q-10.292-15.229-10.354-15.325Q-10.417-15.421-10.534-15.442Q-10.651-15.464-10.897-15.464L-10.897-15.760L-9.729-15.846L-9.729-15.061Q-9.651-15.272-9.499-15.458Q-9.347-15.643-9.147-15.745Q-8.948-15.846-8.722-15.846Q-8.475-15.846-8.284-15.702Q-8.093-15.557-8.093-15.327Q-8.093-15.171-8.198-15.061Q-8.304-14.952-8.460-14.952Q-8.616-14.952-8.725-15.061Q-8.835-15.171-8.835-15.327Q-8.835-15.487-8.729-15.592Q-9.054-15.592-9.268-15.364Q-9.483-15.135-9.579-14.796Q-9.675-14.456-9.675-14.151L-9.675-12.878Q-9.675-12.710-9.448-12.663Q-9.222-12.616-8.917-12.616L-8.917-12.319M-5.753-12.319L-7.530-12.319L-7.530-12.616Q-7.257-12.616-7.089-12.663Q-6.921-12.710-6.921-12.878L-6.921-15.014Q-6.921-15.229-6.977-15.325Q-7.034-15.421-7.147-15.442Q-7.261-15.464-7.507-15.464L-7.507-15.760L-6.308-15.846L-6.308-12.878Q-6.308-12.710-6.161-12.663Q-6.015-12.616-5.753-12.616L-5.753-12.319M-7.194-17.241Q-7.194-17.432-7.059-17.563Q-6.925-17.694-6.729-17.694Q-6.608-17.694-6.505-17.632Q-6.401-17.569-6.339-17.465Q-6.276-17.362-6.276-17.241Q-6.276-17.046-6.407-16.911Q-6.538-16.776-6.729-16.776Q-6.929-16.776-7.061-16.909Q-7.194-17.042-7.194-17.241M-3.323-12.319L-5.179-12.319L-5.179-12.616Q-4.905-12.616-4.737-12.663Q-4.569-12.710-4.569-12.878L-4.569-15.014Q-4.569-15.229-4.632-15.325Q-4.694-15.421-4.813-15.442Q-4.933-15.464-5.179-15.464L-5.179-15.760L-3.987-15.846L-3.987-15.112Q-3.874-15.327-3.681-15.495Q-3.487-15.663-3.249-15.755Q-3.011-15.846-2.757-15.846Q-1.796-15.846-1.620-15.135Q-1.436-15.464-1.108-15.655Q-0.780-15.846-0.401-15.846Q0.775-15.846 0.775-14.768L0.775-12.878Q0.775-12.710 0.942-12.663Q1.110-12.616 1.380-12.616L1.380-12.319L-0.475-12.319L-0.475-12.616Q-0.202-12.616-0.034-12.661Q0.134-12.706 0.134-12.878L0.134-14.753Q0.134-15.139 0.009-15.366Q-0.116-15.592-0.468-15.592Q-0.772-15.592-1.028-15.430Q-1.284-15.268-1.433-14.999Q-1.581-14.729-1.581-14.432L-1.581-12.878Q-1.581-12.710-1.411-12.663Q-1.241-12.616-0.972-12.616L-0.972-12.319L-2.827-12.319L-2.827-12.616Q-2.554-12.616-2.386-12.663Q-2.218-12.710-2.218-12.878L-2.218-14.753Q-2.218-15.139-2.343-15.366Q-2.468-15.592-2.819-15.592Q-3.124-15.592-3.380-15.430Q-3.636-15.268-3.784-14.999Q-3.933-14.729-3.933-14.432L-3.933-12.878Q-3.933-12.710-3.763-12.663Q-3.593-12.616-3.323-12.616L-3.323-12.319M3.685-12.319L1.907-12.319L1.907-12.616Q2.181-12.616 2.349-12.663Q2.517-12.710 2.517-12.878L2.517-15.014Q2.517-15.229 2.460-15.325Q2.403-15.421 2.290-15.442Q2.177-15.464 1.931-15.464L1.931-15.760L3.130-15.846L3.130-12.878Q3.130-12.710 3.276-12.663Q3.423-12.616 3.685-12.616L3.685-12.319M2.243-17.241Q2.243-17.432 2.378-17.563Q2.513-17.694 2.708-17.694Q2.829-17.694 2.933-17.632Q3.036-17.569 3.099-17.465Q3.161-17.362 3.161-17.241Q3.161-17.046 3.030-16.911Q2.900-16.776 2.708-16.776Q2.509-16.776 2.376-16.909Q2.243-17.042 2.243-17.241M6.114-12.319L4.259-12.319L4.259-12.616Q4.532-12.616 4.700-12.663Q4.868-12.710 4.868-12.878L4.868-15.014Q4.868-15.229 4.806-15.325Q4.743-15.421 4.624-15.442Q4.505-15.464 4.259-15.464L4.259-15.760L5.450-15.846L5.450-15.112Q5.564-15.327 5.757-15.495Q5.950-15.663 6.189-15.755Q6.427-15.846 6.681-15.846Q7.849-15.846 7.849-14.768L7.849-12.878Q7.849-12.710 8.019-12.663Q8.189-12.616 8.458-12.616L8.458-12.319L6.603-12.319L6.603-12.616Q6.876-12.616 7.044-12.663Q7.212-12.710 7.212-12.878L7.212-14.753Q7.212-15.135 7.091-15.364Q6.970-15.592 6.618-15.592Q6.306-15.592 6.052-15.430Q5.798-15.268 5.651-14.999Q5.505-14.729 5.505-14.432L5.505-12.878Q5.505-12.710 5.675-12.663Q5.845-12.616 6.114-12.616L6.114-12.319M9.001-13.151Q9.001-13.635 9.403-13.930Q9.806-14.225 10.357-14.344Q10.907-14.464 11.400-14.464L11.400-14.753Q11.400-14.979 11.284-15.186Q11.169-15.393 10.972-15.512Q10.775-15.632 10.544-15.632Q10.118-15.632 9.833-15.526Q9.903-15.499 9.950-15.444Q9.997-15.389 10.023-15.319Q10.048-15.249 10.048-15.174Q10.048-15.069 9.997-14.977Q9.946-14.885 9.855-14.835Q9.763-14.784 9.657-14.784Q9.552-14.784 9.460-14.835Q9.368-14.885 9.317-14.977Q9.267-15.069 9.267-15.174Q9.267-15.592 9.655-15.739Q10.044-15.885 10.544-15.885Q10.876-15.885 11.230-15.755Q11.583-15.624 11.812-15.370Q12.040-15.116 12.040-14.768L12.040-12.967Q12.040-12.835 12.112-12.725Q12.185-12.616 12.314-12.616Q12.439-12.616 12.507-12.721Q12.575-12.827 12.575-12.967L12.575-13.479L12.857-13.479L12.857-12.967Q12.857-12.764 12.739-12.606Q12.622-12.448 12.441-12.364Q12.259-12.280 12.056-12.280Q11.825-12.280 11.673-12.452Q11.521-12.624 11.489-12.854Q11.329-12.573 11.021-12.407Q10.712-12.241 10.360-12.241Q9.849-12.241 9.425-12.464Q9.001-12.686 9.001-13.151M9.689-13.151Q9.689-12.866 9.915-12.680Q10.142-12.495 10.435-12.495Q10.681-12.495 10.905-12.612Q11.130-12.729 11.265-12.932Q11.400-13.135 11.400-13.389L11.400-14.221Q11.134-14.221 10.849-14.167Q10.564-14.112 10.292-13.983Q10.021-13.854 9.855-13.647Q9.689-13.440 9.689-13.151M13.775-13.280L13.775-15.471L13.071-15.471L13.071-15.725Q13.427-15.725 13.669-15.958Q13.911-16.190 14.023-16.538Q14.134-16.885 14.134-17.241L14.415-17.241L14.415-15.768L15.591-15.768L15.591-15.471L14.415-15.471L14.415-13.296Q14.415-12.975 14.534-12.747Q14.653-12.518 14.935-12.518Q15.114-12.518 15.232-12.641Q15.349-12.764 15.401-12.944Q15.454-13.124 15.454-13.296L15.454-13.768L15.735-13.768L15.735-13.280Q15.735-13.026 15.630-12.786Q15.525-12.546 15.327-12.393Q15.130-12.241 14.872-12.241Q14.556-12.241 14.304-12.364Q14.052-12.487 13.913-12.721Q13.775-12.956 13.775-13.280M16.454-14.014Q16.454-14.518 16.710-14.950Q16.966-15.382 17.401-15.633Q17.837-15.885 18.337-15.885Q18.724-15.885 19.066-15.741Q19.407-15.596 19.669-15.335Q19.931-15.073 20.073-14.737Q20.216-14.401 20.216-14.014Q20.216-13.522 19.952-13.112Q19.689-12.702 19.259-12.471Q18.829-12.241 18.337-12.241Q17.845-12.241 17.411-12.473Q16.978-12.706 16.716-13.114Q16.454-13.522 16.454-14.014M18.337-12.518Q18.794-12.518 19.046-12.741Q19.298-12.964 19.386-13.315Q19.474-13.667 19.474-14.112Q19.474-14.542 19.380-14.880Q19.286-15.217 19.032-15.424Q18.778-15.632 18.337-15.632Q17.689-15.632 17.444-15.215Q17.200-14.799 17.200-14.112Q17.200-13.667 17.288-13.315Q17.376-12.964 17.628-12.741Q17.880-12.518 18.337-12.518M22.708-12.319L20.728-12.319L20.728-12.616Q20.997-12.616 21.165-12.661Q21.333-12.706 21.333-12.878L21.333-15.014Q21.333-15.229 21.271-15.325Q21.208-15.421 21.091-15.442Q20.974-15.464 20.728-15.464L20.728-15.760L21.896-15.846L21.896-15.061Q21.974-15.272 22.126-15.458Q22.278-15.643 22.478-15.745Q22.677-15.846 22.903-15.846Q23.150-15.846 23.341-15.702Q23.532-15.557 23.532-15.327Q23.532-15.171 23.427-15.061Q23.321-14.952 23.165-14.952Q23.009-14.952 22.900-15.061Q22.790-15.171 22.790-15.327Q22.790-15.487 22.896-15.592Q22.571-15.592 22.357-15.364Q22.142-15.135 22.046-14.796Q21.950-14.456 21.950-14.151L21.950-12.878Q21.950-12.710 22.177-12.663Q22.403-12.616 22.708-12.616\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(152.85 39.766)\">\u003Cpath d=\"M30.051-12.319L26.989-12.319L26.989-12.616Q27.313-12.616 27.555-12.663Q27.797-12.710 27.797-12.878L27.797-17.221Q27.797-17.393 27.555-17.440Q27.313-17.487 26.989-17.487L26.989-17.784L30.051-17.784Q30.602-17.784 31.080-17.557Q31.559-17.331 31.912-16.936Q32.266-16.542 32.455-16.042Q32.645-15.542 32.645-14.999Q32.645-14.292 32.301-13.674Q31.957-13.057 31.362-12.688Q30.766-12.319 30.051-12.319M28.539-17.221L28.539-12.878Q28.539-12.706 28.631-12.661Q28.723-12.616 28.942-12.616L29.836-12.616Q30.282-12.616 30.674-12.786Q31.067-12.956 31.338-13.280Q31.610-13.604 31.707-14.024Q31.805-14.444 31.805-14.999Q31.805-15.354 31.768-15.667Q31.731-15.979 31.625-16.274Q31.520-16.569 31.340-16.792Q31.157-17.026 30.918-17.176Q30.680-17.327 30.399-17.407Q30.117-17.487 29.836-17.487L28.942-17.487Q28.723-17.487 28.631-17.444Q28.539-17.401 28.539-17.221\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M116.894-37.927h79.668V-72.07h-79.668Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(159.872 -40.774)\">\u003Cpath d=\"M-25.132-14.073Q-25.132-14.553-24.899-14.969Q-24.667-15.385-24.257-15.635Q-23.847-15.885-23.370-15.885Q-22.640-15.885-22.241-15.444Q-21.843-15.003-21.843-14.272Q-21.843-14.167-21.936-14.143L-24.386-14.143L-24.386-14.073Q-24.386-13.663-24.265-13.307Q-24.143-12.952-23.872-12.735Q-23.600-12.518-23.171-12.518Q-22.808-12.518-22.511-12.747Q-22.214-12.975-22.112-13.327Q-22.104-13.374-22.018-13.389L-21.936-13.389Q-21.843-13.362-21.843-13.280Q-21.843-13.272-21.850-13.241Q-21.913-13.014-22.052-12.831Q-22.190-12.647-22.382-12.514Q-22.573-12.382-22.792-12.311Q-23.011-12.241-23.249-12.241Q-23.620-12.241-23.958-12.378Q-24.296-12.514-24.563-12.766Q-24.831-13.018-24.981-13.358Q-25.132-13.698-25.132-14.073M-24.378-14.382L-22.417-14.382Q-22.417-14.686-22.518-14.977Q-22.620-15.268-22.837-15.450Q-23.054-15.632-23.370-15.632Q-23.671-15.632-23.901-15.444Q-24.132-15.257-24.255-14.965Q-24.378-14.674-24.378-14.382M-19.968-12.319L-21.464-12.319L-21.464-12.616Q-20.831-12.616-20.409-13.096L-19.640-14.007L-20.632-15.206Q-20.788-15.385-20.950-15.428Q-21.112-15.471-21.417-15.471L-21.417-15.768L-19.729-15.768L-19.729-15.471Q-19.823-15.471-19.899-15.428Q-19.975-15.385-19.975-15.296Q-19.975-15.253-19.944-15.206L-19.288-14.417L-18.808-14.991Q-18.690-15.128-18.690-15.264Q-18.690-15.354-18.741-15.413Q-18.792-15.471-18.874-15.471L-18.874-15.768L-17.386-15.768L-17.386-15.471Q-18.022-15.471-18.433-14.991L-19.112-14.190L-18.026-12.878Q-17.866-12.702-17.706-12.659Q-17.546-12.616-17.241-12.616L-17.241-12.319L-18.929-12.319L-18.929-12.616Q-18.839-12.616-18.761-12.659Q-18.683-12.702-18.683-12.792Q-18.683-12.815-18.714-12.878L-19.456-13.784L-20.042-13.096Q-20.159-12.960-20.159-12.823Q-20.159-12.737-20.108-12.676Q-20.058-12.616-19.968-12.616L-19.968-12.319M-14.991-10.768L-16.847-10.768L-16.847-11.061Q-16.577-11.061-16.409-11.106Q-16.241-11.151-16.241-11.327L-16.241-15.151Q-16.241-15.358-16.397-15.411Q-16.554-15.464-16.847-15.464L-16.847-15.760L-15.624-15.846L-15.624-15.382Q-15.393-15.604-15.079-15.725Q-14.765-15.846-14.425-15.846Q-13.952-15.846-13.548-15.600Q-13.143-15.354-12.911-14.938Q-12.679-14.522-12.679-14.046Q-12.679-13.671-12.827-13.342Q-12.975-13.014-13.245-12.762Q-13.515-12.510-13.858-12.376Q-14.202-12.241-14.561-12.241Q-14.850-12.241-15.122-12.362Q-15.393-12.483-15.600-12.694L-15.600-11.327Q-15.600-11.151-15.433-11.106Q-15.265-11.061-14.991-11.061L-14.991-10.768M-15.600-14.983L-15.600-13.143Q-15.448-12.854-15.186-12.674Q-14.925-12.495-14.616-12.495Q-14.331-12.495-14.108-12.633Q-13.886-12.772-13.733-13.003Q-13.581-13.233-13.503-13.505Q-13.425-13.776-13.425-14.046Q-13.425-14.378-13.550-14.735Q-13.675-15.092-13.923-15.329Q-14.171-15.565-14.518-15.565Q-14.843-15.565-15.138-15.409Q-15.433-15.253-15.600-14.983\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(159.872 -40.774)\">\u003Cpath d=\"M-11.909-14.073Q-11.909-14.553-11.676-14.969Q-11.444-15.385-11.034-15.635Q-10.624-15.885-10.147-15.885Q-9.417-15.885-9.018-15.444Q-8.620-15.003-8.620-14.272Q-8.620-14.167-8.713-14.143L-11.163-14.143L-11.163-14.073Q-11.163-13.663-11.042-13.307Q-10.920-12.952-10.649-12.735Q-10.377-12.518-9.948-12.518Q-9.585-12.518-9.288-12.747Q-8.991-12.975-8.889-13.327Q-8.881-13.374-8.795-13.389L-8.713-13.389Q-8.620-13.362-8.620-13.280Q-8.620-13.272-8.627-13.241Q-8.690-13.014-8.829-12.831Q-8.967-12.647-9.159-12.514Q-9.350-12.382-9.569-12.311Q-9.788-12.241-10.026-12.241Q-10.397-12.241-10.735-12.378Q-11.073-12.514-11.340-12.766Q-11.608-13.018-11.758-13.358Q-11.909-13.698-11.909-14.073M-11.155-14.382L-9.194-14.382Q-9.194-14.686-9.295-14.977Q-9.397-15.268-9.614-15.450Q-9.831-15.632-10.147-15.632Q-10.448-15.632-10.678-15.444Q-10.909-15.257-11.032-14.965Q-11.155-14.674-11.155-14.382M-6.124-12.319L-8.104-12.319L-8.104-12.616Q-7.835-12.616-7.667-12.661Q-7.499-12.706-7.499-12.878L-7.499-15.014Q-7.499-15.229-7.561-15.325Q-7.624-15.421-7.741-15.442Q-7.858-15.464-8.104-15.464L-8.104-15.760L-6.936-15.846L-6.936-15.061Q-6.858-15.272-6.706-15.458Q-6.553-15.643-6.354-15.745Q-6.155-15.846-5.928-15.846Q-5.682-15.846-5.491-15.702Q-5.299-15.557-5.299-15.327Q-5.299-15.171-5.405-15.061Q-5.510-14.952-5.667-14.952Q-5.823-14.952-5.932-15.061Q-6.042-15.171-6.042-15.327Q-6.042-15.487-5.936-15.592Q-6.260-15.592-6.475-15.364Q-6.690-15.135-6.786-14.796Q-6.881-14.456-6.881-14.151L-6.881-12.878Q-6.881-12.710-6.655-12.663Q-6.428-12.616-6.124-12.616L-6.124-12.319M-4.194-13.280L-4.194-15.471L-4.897-15.471L-4.897-15.725Q-4.542-15.725-4.299-15.958Q-4.057-16.190-3.946-16.538Q-3.835-16.885-3.835-17.241L-3.553-17.241L-3.553-15.768L-2.377-15.768L-2.377-15.471L-3.553-15.471L-3.553-13.296Q-3.553-12.975-3.434-12.747Q-3.315-12.518-3.034-12.518Q-2.854-12.518-2.737-12.641Q-2.620-12.764-2.567-12.944Q-2.514-13.124-2.514-13.296L-2.514-13.768L-2.233-13.768L-2.233-13.280Q-2.233-13.026-2.338-12.786Q-2.444-12.546-2.641-12.393Q-2.838-12.241-3.096-12.241Q-3.413-12.241-3.665-12.364Q-3.917-12.487-4.055-12.721Q-4.194-12.956-4.194-13.280\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(159.872 -40.774)\">\u003Cpath d=\"M3.203-10.768L1.348-10.768L1.348-11.061Q1.617-11.061 1.785-11.106Q1.953-11.151 1.953-11.327L1.953-15.151Q1.953-15.358 1.797-15.411Q1.641-15.464 1.348-15.464L1.348-15.760L2.570-15.846L2.570-15.382Q2.801-15.604 3.115-15.725Q3.430-15.846 3.769-15.846Q4.242-15.846 4.646-15.600Q5.051-15.354 5.283-14.938Q5.516-14.522 5.516-14.046Q5.516-13.671 5.367-13.342Q5.219-13.014 4.949-12.762Q4.680-12.510 4.336-12.376Q3.992-12.241 3.633-12.241Q3.344-12.241 3.072-12.362Q2.801-12.483 2.594-12.694L2.594-11.327Q2.594-11.151 2.762-11.106Q2.930-11.061 3.203-11.061L3.203-10.768M2.594-14.983L2.594-13.143Q2.746-12.854 3.008-12.674Q3.269-12.495 3.578-12.495Q3.863-12.495 4.086-12.633Q4.309-12.772 4.461-13.003Q4.613-13.233 4.691-13.505Q4.769-13.776 4.769-14.046Q4.769-14.378 4.644-14.735Q4.519-15.092 4.271-15.329Q4.023-15.565 3.676-15.565Q3.352-15.565 3.057-15.409Q2.762-15.253 2.594-14.983M6.137-13.151Q6.137-13.635 6.539-13.930Q6.941-14.225 7.492-14.344Q8.043-14.464 8.535-14.464L8.535-14.753Q8.535-14.979 8.420-15.186Q8.305-15.393 8.107-15.512Q7.910-15.632 7.680-15.632Q7.254-15.632 6.969-15.526Q7.039-15.499 7.086-15.444Q7.133-15.389 7.158-15.319Q7.184-15.249 7.184-15.174Q7.184-15.069 7.133-14.977Q7.082-14.885 6.990-14.835Q6.898-14.784 6.793-14.784Q6.687-14.784 6.596-14.835Q6.504-14.885 6.453-14.977Q6.402-15.069 6.402-15.174Q6.402-15.592 6.791-15.739Q7.180-15.885 7.680-15.885Q8.012-15.885 8.365-15.755Q8.719-15.624 8.947-15.370Q9.176-15.116 9.176-14.768L9.176-12.967Q9.176-12.835 9.248-12.725Q9.320-12.616 9.449-12.616Q9.574-12.616 9.643-12.721Q9.711-12.827 9.711-12.967L9.711-13.479L9.992-13.479L9.992-12.967Q9.992-12.764 9.875-12.606Q9.758-12.448 9.576-12.364Q9.395-12.280 9.191-12.280Q8.961-12.280 8.809-12.452Q8.656-12.624 8.625-12.854Q8.465-12.573 8.156-12.407Q7.848-12.241 7.496-12.241Q6.984-12.241 6.561-12.464Q6.137-12.686 6.137-13.151M6.824-13.151Q6.824-12.866 7.051-12.680Q7.277-12.495 7.570-12.495Q7.816-12.495 8.041-12.612Q8.266-12.729 8.400-12.932Q8.535-13.135 8.535-13.389L8.535-14.221Q8.270-14.221 7.984-14.167Q7.699-14.112 7.428-13.983Q7.156-13.854 6.990-13.647Q6.824-13.440 6.824-13.151M12.145-12.319L10.367-12.319L10.367-12.616Q10.641-12.616 10.809-12.663Q10.977-12.710 10.977-12.878L10.977-15.014Q10.977-15.229 10.920-15.325Q10.863-15.421 10.750-15.442Q10.637-15.464 10.391-15.464L10.391-15.760L11.590-15.846L11.590-12.878Q11.590-12.710 11.736-12.663Q11.883-12.616 12.145-12.616L12.145-12.319M10.703-17.241Q10.703-17.432 10.838-17.563Q10.973-17.694 11.168-17.694Q11.289-17.694 11.393-17.632Q11.496-17.569 11.559-17.465Q11.621-17.362 11.621-17.241Q11.621-17.046 11.490-16.911Q11.359-16.776 11.168-16.776Q10.969-16.776 10.836-16.909Q10.703-17.042 10.703-17.241M14.652-12.319L12.672-12.319L12.672-12.616Q12.941-12.616 13.109-12.661Q13.277-12.706 13.277-12.878L13.277-15.014Q13.277-15.229 13.215-15.325Q13.152-15.421 13.035-15.442Q12.918-15.464 12.672-15.464L12.672-15.760L13.840-15.846L13.840-15.061Q13.918-15.272 14.070-15.458Q14.223-15.643 14.422-15.745Q14.621-15.846 14.848-15.846Q15.094-15.846 15.285-15.702Q15.477-15.557 15.477-15.327Q15.477-15.171 15.371-15.061Q15.266-14.952 15.109-14.952Q14.953-14.952 14.844-15.061Q14.734-15.171 14.734-15.327Q14.734-15.487 14.840-15.592Q14.516-15.592 14.301-15.364Q14.086-15.135 13.990-14.796Q13.895-14.456 13.895-14.151L13.895-12.878Q13.895-12.710 14.121-12.663Q14.348-12.616 14.652-12.616L14.652-12.319M16-12.327L16-13.549Q16-13.577 16.031-13.608Q16.062-13.639 16.086-13.639L16.191-13.639Q16.262-13.639 16.277-13.577Q16.340-13.257 16.478-13.016Q16.617-12.776 16.850-12.635Q17.082-12.495 17.391-12.495Q17.629-12.495 17.838-12.555Q18.047-12.616 18.184-12.764Q18.320-12.913 18.320-13.159Q18.320-13.413 18.109-13.579Q17.898-13.745 17.629-13.799L17.008-13.913Q16.602-13.991 16.301-14.247Q16-14.503 16-14.878Q16-15.245 16.201-15.467Q16.402-15.690 16.727-15.788Q17.051-15.885 17.391-15.885Q17.855-15.885 18.152-15.678L18.375-15.862Q18.398-15.885 18.430-15.885L18.480-15.885Q18.512-15.885 18.539-15.858Q18.566-15.831 18.566-15.799L18.566-14.815Q18.566-14.784 18.541-14.755Q18.516-14.725 18.480-14.725L18.375-14.725Q18.340-14.725 18.312-14.753Q18.285-14.780 18.285-14.815Q18.285-15.214 18.033-15.434Q17.781-15.655 17.383-15.655Q17.027-15.655 16.744-15.532Q16.461-15.409 16.461-15.104Q16.461-14.885 16.662-14.753Q16.863-14.620 17.109-14.577L17.734-14.464Q18.164-14.374 18.473-14.077Q18.781-13.780 18.781-13.366Q18.781-12.796 18.383-12.518Q17.984-12.241 17.391-12.241Q16.840-12.241 16.488-12.577L16.191-12.264Q16.168-12.241 16.133-12.241L16.086-12.241Q16.062-12.241 16.031-12.272Q16-12.303 16-12.327\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-25.37 5.152v36.634\"\u002F>\u003Cpath stroke=\"none\" d=\"m-25.37 44.386 2.08-4.16-2.08 1.56-2.08-1.56\"\u002F>\u003Cg transform=\"translate(-14.4 39.241)\">\u003Cpath d=\"M-24.997-13.047Q-24.997-13.379-24.774-13.606Q-24.550-13.833-24.206-13.961Q-23.863-14.090-23.490-14.142Q-23.118-14.195-22.813-14.195L-22.813-14.448Q-22.813-14.653-22.921-14.833Q-23.029-15.012-23.210-15.115Q-23.391-15.217-23.599-15.217Q-24.006-15.217-24.242-15.125Q-24.153-15.088-24.107-15.004Q-24.061-14.920-24.061-14.818Q-24.061-14.722-24.107-14.643Q-24.153-14.565-24.234-14.520Q-24.314-14.476-24.403-14.476Q-24.553-14.476-24.654-14.573Q-24.755-14.671-24.755-14.818Q-24.755-15.440-23.599-15.440Q-23.388-15.440-23.138-15.376Q-22.889-15.313-22.687-15.194Q-22.485-15.074-22.359-14.889Q-22.232-14.705-22.232-14.462L-22.232-12.886Q-22.232-12.770-22.171-12.674Q-22.109-12.579-21.996-12.579Q-21.887-12.579-21.822-12.673Q-21.757-12.767-21.757-12.886L-21.757-13.334L-21.491-13.334L-21.491-12.886Q-21.491-12.616-21.718-12.451Q-21.945-12.285-22.225-12.285Q-22.434-12.285-22.571-12.439Q-22.707-12.592-22.731-12.808Q-22.878-12.541-23.160-12.396Q-23.442-12.251-23.767-12.251Q-24.044-12.251-24.328-12.326Q-24.611-12.401-24.804-12.580Q-24.997-12.760-24.997-13.047M-24.382-13.047Q-24.382-12.873-24.281-12.743Q-24.181-12.613-24.025-12.543Q-23.870-12.473-23.705-12.473Q-23.487-12.473-23.278-12.570Q-23.070-12.668-22.942-12.849Q-22.813-13.030-22.813-13.256L-22.813-13.984Q-23.138-13.984-23.504-13.893Q-23.870-13.802-24.126-13.590Q-24.382-13.379-24.382-13.047M-21.074-13.830Q-21.074-14.158-20.939-14.459Q-20.804-14.759-20.568-14.980Q-20.332-15.200-20.028-15.320Q-19.724-15.440-19.399-15.440Q-18.893-15.440-18.544-15.337Q-18.196-15.235-18.196-14.859Q-18.196-14.712-18.293-14.611Q-18.391-14.510-18.537-14.510Q-18.691-14.510-18.790-14.609Q-18.890-14.708-18.890-14.859Q-18.890-15.047-18.749-15.139Q-18.951-15.190-19.392-15.190Q-19.747-15.190-19.976-14.994Q-20.205-14.797-20.306-14.488Q-20.407-14.178-20.407-13.830Q-20.407-13.481-20.281-13.175Q-20.154-12.869-19.900-12.685Q-19.645-12.500-19.289-12.500Q-19.067-12.500-18.883-12.584Q-18.698-12.668-18.563-12.823Q-18.428-12.979-18.370-13.187Q-18.356-13.242-18.302-13.242L-18.189-13.242Q-18.158-13.242-18.136-13.218Q-18.114-13.194-18.114-13.160L-18.114-13.139Q-18.199-12.852-18.387-12.654Q-18.575-12.456-18.840-12.353Q-19.105-12.251-19.399-12.251Q-19.829-12.251-20.217-12.457Q-20.605-12.664-20.839-13.027Q-21.074-13.389-21.074-13.830M-16.999-13.160L-16.999-15.057L-17.639-15.057L-17.639-15.279Q-17.321-15.279-17.104-15.489Q-16.887-15.699-16.786-16.009Q-16.685-16.318-16.685-16.626L-16.418-16.626L-16.418-15.337L-15.342-15.337L-15.342-15.057L-16.418-15.057L-16.418-13.173Q-16.418-12.897-16.314-12.698Q-16.210-12.500-15.950-12.500Q-15.793-12.500-15.687-12.604Q-15.581-12.709-15.531-12.862Q-15.482-13.016-15.482-13.173L-15.482-13.587L-15.215-13.587L-15.215-13.160Q-15.215-12.934-15.314-12.724Q-15.413-12.514-15.598-12.382Q-15.783-12.251-16.012-12.251Q-16.449-12.251-16.724-12.488Q-16.999-12.726-16.999-13.160\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m14.664 53.538 99.282-20.199\"\u002F>\u003Cpath stroke=\"none\" d=\"m116.494 32.821-4.49-1.209 1.942 1.727-1.113 2.35\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(68.406 64.482)\">\u003Cpath d=\"M-23.388-12.319L-24.991-12.319L-24.991-12.599Q-24.765-12.599-24.616-12.633Q-24.468-12.668-24.468-12.808L-24.468-16.427Q-24.468-16.697-24.575-16.759Q-24.683-16.820-24.991-16.820L-24.991-17.101L-23.914-17.176L-23.914-12.808Q-23.914-12.671-23.764-12.635Q-23.613-12.599-23.388-12.599L-23.388-12.319M-22.834-13.854Q-22.834-14.175-22.709-14.464Q-22.584-14.753-22.359-14.976Q-22.133-15.200-21.838-15.320Q-21.542-15.440-21.224-15.440Q-20.896-15.440-20.634-15.340Q-20.373-15.241-20.197-15.059Q-20.021-14.876-19.927-14.618Q-19.833-14.360-19.833-14.028Q-19.833-13.936-19.915-13.915L-22.171-13.915L-22.171-13.854Q-22.171-13.266-21.887-12.883Q-21.603-12.500-21.036-12.500Q-20.715-12.500-20.446-12.693Q-20.178-12.886-20.089-13.201Q-20.082-13.242-20.007-13.256L-19.915-13.256Q-19.833-13.232-19.833-13.160Q-19.833-13.153-19.840-13.126Q-19.953-12.729-20.323-12.490Q-20.694-12.251-21.118-12.251Q-21.556-12.251-21.955-12.459Q-22.355-12.668-22.595-13.035Q-22.834-13.402-22.834-13.854M-22.164-14.124L-20.349-14.124Q-20.349-14.401-20.446-14.653Q-20.544-14.906-20.742-15.062Q-20.940-15.217-21.224-15.217Q-21.501-15.217-21.714-15.059Q-21.928-14.900-22.046-14.645Q-22.164-14.390-22.164-14.124M-19.187-13.047Q-19.187-13.379-18.963-13.606Q-18.739-13.833-18.396-13.961Q-18.052-14.090-17.680-14.142Q-17.307-14.195-17.003-14.195L-17.003-14.448Q-17.003-14.653-17.110-14.833Q-17.218-15.012-17.399-15.115Q-17.580-15.217-17.789-15.217Q-18.196-15.217-18.432-15.125Q-18.343-15.088-18.297-15.004Q-18.250-14.920-18.250-14.818Q-18.250-14.722-18.297-14.643Q-18.343-14.565-18.423-14.520Q-18.503-14.476-18.592-14.476Q-18.743-14.476-18.843-14.573Q-18.944-14.671-18.944-14.818Q-18.944-15.440-17.789-15.440Q-17.577-15.440-17.328-15.376Q-17.078-15.313-16.876-15.194Q-16.675-15.074-16.548-14.889Q-16.422-14.705-16.422-14.462L-16.422-12.886Q-16.422-12.770-16.360-12.674Q-16.299-12.579-16.186-12.579Q-16.077-12.579-16.012-12.673Q-15.947-12.767-15.947-12.886L-15.947-13.334L-15.680-13.334L-15.680-12.886Q-15.680-12.616-15.907-12.451Q-16.135-12.285-16.415-12.285Q-16.623-12.285-16.760-12.439Q-16.897-12.592-16.921-12.808Q-17.068-12.541-17.350-12.396Q-17.632-12.251-17.956-12.251Q-18.233-12.251-18.517-12.326Q-18.801-12.401-18.994-12.580Q-19.187-12.760-19.187-13.047M-18.572-13.047Q-18.572-12.873-18.471-12.743Q-18.370-12.613-18.214-12.543Q-18.059-12.473-17.895-12.473Q-17.676-12.473-17.468-12.570Q-17.259-12.668-17.131-12.849Q-17.003-13.030-17.003-13.256L-17.003-13.984Q-17.328-13.984-17.693-13.893Q-18.059-13.802-18.315-13.590Q-18.572-13.379-18.572-13.047M-13.513-12.319L-15.249-12.319L-15.249-12.599Q-15.020-12.599-14.872-12.633Q-14.723-12.668-14.723-12.808L-14.723-14.657Q-14.723-14.927-14.831-14.988Q-14.938-15.050-15.249-15.050L-15.249-15.330L-14.221-15.405L-14.221-14.698Q-14.091-15.006-13.848-15.205Q-13.605-15.405-13.287-15.405Q-13.069-15.405-12.898-15.281Q-12.727-15.156-12.727-14.944Q-12.727-14.807-12.826-14.708Q-12.925-14.609-13.058-14.609Q-13.195-14.609-13.294-14.708Q-13.393-14.807-13.393-14.944Q-13.393-15.084-13.294-15.183Q-13.585-15.183-13.785-14.987Q-13.985-14.790-14.077-14.496Q-14.169-14.202-14.169-13.922L-14.169-12.808Q-14.169-12.599-13.513-12.599L-13.513-12.319M-10.461-12.319L-12.095-12.319L-12.095-12.599Q-11.866-12.599-11.717-12.633Q-11.568-12.668-11.568-12.808L-11.568-14.657Q-11.568-14.927-11.676-14.988Q-11.784-15.050-12.095-15.050L-12.095-15.330L-11.035-15.405L-11.035-14.756Q-10.864-15.064-10.560-15.235Q-10.256-15.405-9.911-15.405Q-9.405-15.405-9.121-15.182Q-8.837-14.958-8.837-14.462L-8.837-12.808Q-8.837-12.671-8.689-12.635Q-8.540-12.599-8.314-12.599L-8.314-12.319L-9.945-12.319L-9.945-12.599Q-9.716-12.599-9.567-12.633Q-9.418-12.668-9.418-12.808L-9.418-14.448Q-9.418-14.783-9.538-14.983Q-9.658-15.183-9.972-15.183Q-10.242-15.183-10.476-15.047Q-10.710-14.910-10.849-14.676Q-10.987-14.442-10.987-14.168L-10.987-12.808Q-10.987-12.671-10.837-12.635Q-10.686-12.599-10.461-12.599L-10.461-12.319M-7.767-13.854Q-7.767-14.175-7.643-14.464Q-7.518-14.753-7.292-14.976Q-7.067-15.200-6.771-15.320Q-6.475-15.440-6.158-15.440Q-5.829-15.440-5.568-15.340Q-5.307-15.241-5.130-15.059Q-4.954-14.876-4.860-14.618Q-4.766-14.360-4.766-14.028Q-4.766-13.936-4.849-13.915L-7.104-13.915L-7.104-13.854Q-7.104-13.266-6.821-12.883Q-6.537-12.500-5.970-12.500Q-5.648-12.500-5.380-12.693Q-5.112-12.886-5.023-13.201Q-5.016-13.242-4.941-13.256L-4.849-13.256Q-4.766-13.232-4.766-13.160Q-4.766-13.153-4.773-13.126Q-4.886-12.729-5.257-12.490Q-5.628-12.251-6.052-12.251Q-6.489-12.251-6.889-12.459Q-7.289-12.668-7.528-13.035Q-7.767-13.402-7.767-13.854M-7.098-14.124L-5.283-14.124Q-5.283-14.401-5.380-14.653Q-5.477-14.906-5.676-15.062Q-5.874-15.217-6.158-15.217Q-6.434-15.217-6.648-15.059Q-6.862-14.900-6.980-14.645Q-7.098-14.390-7.098-14.124M-2.429-12.319L-4.165-12.319L-4.165-12.599Q-3.936-12.599-3.787-12.633Q-3.639-12.668-3.639-12.808L-3.639-14.657Q-3.639-14.927-3.746-14.988Q-3.854-15.050-4.165-15.050L-4.165-15.330L-3.136-15.405L-3.136-14.698Q-3.006-15.006-2.764-15.205Q-2.521-15.405-2.203-15.405Q-1.984-15.405-1.813-15.281Q-1.642-15.156-1.642-14.944Q-1.642-14.807-1.742-14.708Q-1.841-14.609-1.974-14.609Q-2.111-14.609-2.210-14.708Q-2.309-14.807-2.309-14.944Q-2.309-15.084-2.210-15.183Q-2.500-15.183-2.700-14.987Q-2.900-14.790-2.993-14.496Q-3.085-14.202-3.085-13.922L-3.085-12.808Q-3.085-12.599-2.429-12.599\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(68.406 64.482)\">\u003Cpath d=\"M3.797-10.569Q3.247-10.969 2.876-11.524Q2.505-12.080 2.324-12.726Q2.143-13.372 2.143-14.069Q2.143-14.582 2.243-15.077Q2.344-15.573 2.549-16.024Q2.754-16.475 3.067-16.867Q3.380-17.258 3.797-17.562Q3.807-17.566 3.814-17.567Q3.821-17.569 3.831-17.569L3.899-17.569Q3.934-17.569 3.956-17.545Q3.978-17.521 3.978-17.484Q3.978-17.439 3.951-17.422Q3.602-17.121 3.349-16.737Q3.096-16.352 2.944-15.911Q2.792-15.470 2.720-15.014Q2.648-14.558 2.648-14.069Q2.648-13.068 2.958-12.181Q3.267-11.294 3.951-10.709Q3.978-10.692 3.978-10.648Q3.978-10.610 3.956-10.586Q3.934-10.562 3.899-10.562L3.831-10.562Q3.824-10.566 3.816-10.567Q3.807-10.569 3.797-10.569M4.788-12.326L4.788-13.389Q4.788-13.413 4.815-13.440Q4.843-13.467 4.867-13.467L4.976-13.467Q5.041-13.467 5.055-13.409Q5.150-12.975 5.396-12.724Q5.643-12.473 6.056-12.473Q6.398-12.473 6.651-12.606Q6.904-12.739 6.904-13.047Q6.904-13.204 6.810-13.319Q6.716-13.433 6.577-13.502Q6.439-13.570 6.271-13.608L5.690-13.707Q5.335-13.775 5.061-13.996Q4.788-14.216 4.788-14.558Q4.788-14.807 4.899-14.982Q5.010-15.156 5.197-15.255Q5.383-15.354 5.598-15.397Q5.813-15.440 6.056-15.440Q6.470-15.440 6.750-15.258L6.965-15.433Q6.976-15.436 6.982-15.438Q6.989-15.440 6.999-15.440L7.051-15.440Q7.078-15.440 7.102-15.416Q7.126-15.392 7.126-15.364L7.126-14.517Q7.126-14.496 7.102-14.469Q7.078-14.442 7.051-14.442L6.938-14.442Q6.911-14.442 6.885-14.467Q6.859-14.493 6.859-14.517Q6.859-14.753 6.753-14.917Q6.647-15.081 6.465-15.163Q6.282-15.245 6.049-15.245Q5.721-15.245 5.465-15.142Q5.208-15.040 5.208-14.763Q5.208-14.568 5.391-14.459Q5.574-14.349 5.803-14.308L6.377-14.202Q6.624-14.154 6.837-14.026Q7.051-13.898 7.187-13.695Q7.324-13.491 7.324-13.242Q7.324-12.729 6.958-12.490Q6.593-12.251 6.056-12.251Q5.561-12.251 5.229-12.545L4.962-12.271Q4.942-12.251 4.915-12.251L4.867-12.251Q4.843-12.251 4.815-12.278Q4.788-12.305 4.788-12.326M8.452-11.089Q8.452-11.123 8.479-11.150Q8.749-11.379 8.898-11.702Q9.047-12.025 9.047-12.381L9.047-12.418Q8.937-12.319 8.773-12.319Q8.592-12.319 8.473-12.439Q8.353-12.558 8.353-12.739Q8.353-12.914 8.473-13.033Q8.592-13.153 8.773-13.153Q9.030-13.153 9.149-12.914Q9.269-12.674 9.269-12.381Q9.269-11.981 9.100-11.610Q8.931-11.239 8.633-10.983Q8.603-10.962 8.575-10.962Q8.534-10.962 8.493-11.003Q8.452-11.044 8.452-11.089\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(68.406 64.482)\">\u003Cpath d=\"M12.977-13.047Q12.977-13.379 13.200-13.606Q13.424-13.833 13.768-13.961Q14.111-14.090 14.484-14.142Q14.856-14.195 15.161-14.195L15.161-14.448Q15.161-14.653 15.053-14.833Q14.945-15.012 14.764-15.115Q14.583-15.217 14.375-15.217Q13.968-15.217 13.732-15.125Q13.821-15.088 13.867-15.004Q13.913-14.920 13.913-14.818Q13.913-14.722 13.867-14.643Q13.821-14.565 13.740-14.520Q13.660-14.476 13.571-14.476Q13.421-14.476 13.320-14.573Q13.219-14.671 13.219-14.818Q13.219-15.440 14.375-15.440Q14.586-15.440 14.836-15.376Q15.085-15.313 15.287-15.194Q15.489-15.074 15.615-14.889Q15.742-14.705 15.742-14.462L15.742-12.886Q15.742-12.770 15.803-12.674Q15.865-12.579 15.978-12.579Q16.087-12.579 16.152-12.673Q16.217-12.767 16.217-12.886L16.217-13.334L16.483-13.334L16.483-12.886Q16.483-12.616 16.256-12.451Q16.029-12.285 15.749-12.285Q15.540-12.285 15.403-12.439Q15.267-12.592 15.243-12.808Q15.096-12.541 14.814-12.396Q14.532-12.251 14.207-12.251Q13.930-12.251 13.646-12.326Q13.363-12.401 13.170-12.580Q12.977-12.760 12.977-13.047M13.592-13.047Q13.592-12.873 13.693-12.743Q13.793-12.613 13.949-12.543Q14.104-12.473 14.269-12.473Q14.487-12.473 14.696-12.570Q14.904-12.668 15.032-12.849Q15.161-13.030 15.161-13.256L15.161-13.984Q14.836-13.984 14.470-13.893Q14.104-13.802 13.848-13.590Q13.592-13.379 13.592-13.047M17.222-10.562L17.153-10.562Q17.119-10.562 17.097-10.588Q17.075-10.613 17.075-10.648Q17.075-10.692 17.105-10.709Q17.461-11.013 17.710-11.403Q17.960-11.793 18.112-12.225Q18.264-12.657 18.334-13.126Q18.404-13.594 18.404-14.069Q18.404-14.548 18.334-15.014Q18.264-15.481 18.110-15.916Q17.957-16.352 17.705-16.740Q17.454-17.128 17.105-17.422Q17.075-17.439 17.075-17.484Q17.075-17.518 17.097-17.543Q17.119-17.569 17.153-17.569L17.222-17.569Q17.232-17.569 17.240-17.567Q17.249-17.566 17.259-17.562Q17.803-17.162 18.175-16.609Q18.548-16.055 18.729-15.409Q18.910-14.763 18.910-14.069Q18.910-13.368 18.729-12.721Q18.548-12.073 18.174-11.519Q17.799-10.965 17.259-10.569Q17.249-10.569 17.240-10.567Q17.232-10.566 17.222-10.562\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M156.728-37.727V4.598\"\u002F>\u003Cpath stroke=\"none\" d=\"m156.728 7.198 2.08-4.16-2.08 1.56-2.08-1.56\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(185.83 -1.195)\">\u003Cpath d=\"M-25.097-13.854Q-25.097-14.175-24.972-14.464Q-24.847-14.753-24.621-14.976Q-24.396-15.200-24.100-15.320Q-23.805-15.440-23.487-15.440Q-23.159-15.440-22.897-15.340Q-22.636-15.241-22.460-15.059Q-22.284-14.876-22.190-14.618Q-22.096-14.360-22.096-14.028Q-22.096-13.936-22.178-13.915L-24.433-13.915L-24.433-13.854Q-24.433-13.266-24.150-12.883Q-23.866-12.500-23.299-12.500Q-22.977-12.500-22.709-12.693Q-22.441-12.886-22.352-13.201Q-22.345-13.242-22.270-13.256L-22.178-13.256Q-22.096-13.232-22.096-13.160Q-22.096-13.153-22.102-13.126Q-22.215-12.729-22.586-12.490Q-22.957-12.251-23.381-12.251Q-23.818-12.251-24.218-12.459Q-24.618-12.668-24.857-13.035Q-25.097-13.402-25.097-13.854M-24.427-14.124L-22.612-14.124Q-22.612-14.401-22.709-14.653Q-22.807-14.906-23.005-15.062Q-23.203-15.217-23.487-15.217Q-23.764-15.217-23.977-15.059Q-24.191-14.900-24.309-14.645Q-24.427-14.390-24.427-14.124M-20.325-12.319L-21.648-12.319L-21.648-12.599Q-21.087-12.599-20.708-12.999L-19.994-13.796L-20.906-14.845Q-21.043-14.992-21.192-15.024Q-21.340-15.057-21.607-15.057L-21.607-15.337L-20.106-15.337L-20.106-15.057Q-20.298-15.057-20.298-14.923Q-20.298-14.893-20.267-14.845L-19.672-14.161L-19.231-14.657Q-19.119-14.787-19.119-14.903Q-19.119-14.965-19.156-15.011Q-19.194-15.057-19.252-15.057L-19.252-15.337L-17.936-15.337L-17.936-15.057Q-18.496-15.057-18.876-14.657L-19.498-13.956L-18.503-12.808Q-18.404-12.709-18.303-12.664Q-18.203-12.620-18.091-12.610Q-17.980-12.599-17.803-12.599L-17.803-12.319L-19.296-12.319L-19.296-12.599Q-19.231-12.599-19.172-12.633Q-19.112-12.668-19.112-12.733Q-19.112-12.780-19.142-12.808L-19.819-13.594L-20.352-12.999Q-20.465-12.869-20.465-12.753Q-20.465-12.688-20.424-12.644Q-20.383-12.599-20.325-12.599L-20.325-12.319M-15.663-10.962L-17.293-10.962L-17.293-11.242Q-17.064-11.242-16.916-11.277Q-16.767-11.311-16.767-11.451L-16.767-14.797Q-16.767-14.968-16.904-15.009Q-17.040-15.050-17.293-15.050L-17.293-15.330L-16.213-15.405L-16.213-14.999Q-15.991-15.200-15.704-15.303Q-15.417-15.405-15.109-15.405Q-14.682-15.405-14.318-15.192Q-13.954-14.978-13.740-14.614Q-13.527-14.250-13.527-13.830Q-13.527-13.385-13.766-13.021Q-14.005-12.657-14.398-12.454Q-14.791-12.251-15.236-12.251Q-15.502-12.251-15.750-12.351Q-15.998-12.452-16.186-12.633L-16.186-11.451Q-16.186-11.314-16.037-11.278Q-15.889-11.242-15.663-11.242L-15.663-10.962M-16.186-14.650L-16.186-13.040Q-16.053-12.787-15.810-12.630Q-15.567-12.473-15.290-12.473Q-14.962-12.473-14.709-12.674Q-14.456-12.876-14.323-13.194Q-14.190-13.512-14.190-13.830Q-14.190-14.059-14.255-14.288Q-14.320-14.517-14.448-14.715Q-14.576-14.913-14.771-15.033Q-14.966-15.152-15.198-15.152Q-15.492-15.152-15.760-15.023Q-16.029-14.893-16.186-14.650\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(185.83 -1.195)\">\u003Cpath d=\"M-12.708-13.854Q-12.708-14.175-12.583-14.464Q-12.458-14.753-12.232-14.976Q-12.007-15.200-11.711-15.320Q-11.416-15.440-11.098-15.440Q-10.770-15.440-10.508-15.340Q-10.247-15.241-10.071-15.059Q-9.895-14.876-9.801-14.618Q-9.707-14.360-9.707-14.028Q-9.707-13.936-9.789-13.915L-12.044-13.915L-12.044-13.854Q-12.044-13.266-11.761-12.883Q-11.477-12.500-10.910-12.500Q-10.588-12.500-10.320-12.693Q-10.052-12.886-9.963-13.201Q-9.956-13.242-9.881-13.256L-9.789-13.256Q-9.707-13.232-9.707-13.160Q-9.707-13.153-9.713-13.126Q-9.826-12.729-10.197-12.490Q-10.568-12.251-10.992-12.251Q-11.429-12.251-11.829-12.459Q-12.229-12.668-12.468-13.035Q-12.708-13.402-12.708-13.854M-12.038-14.124L-10.223-14.124Q-10.223-14.401-10.320-14.653Q-10.418-14.906-10.616-15.062Q-10.814-15.217-11.098-15.217Q-11.375-15.217-11.588-15.059Q-11.802-14.900-11.920-14.645Q-12.038-14.390-12.038-14.124M-7.369-12.319L-9.105-12.319L-9.105-12.599Q-8.876-12.599-8.727-12.633Q-8.579-12.668-8.579-12.808L-8.579-14.657Q-8.579-14.927-8.686-14.988Q-8.794-15.050-9.105-15.050L-9.105-15.330L-8.076-15.405L-8.076-14.698Q-7.946-15.006-7.704-15.205Q-7.461-15.405-7.143-15.405Q-6.924-15.405-6.753-15.281Q-6.583-15.156-6.583-14.944Q-6.583-14.807-6.682-14.708Q-6.781-14.609-6.914-14.609Q-7.051-14.609-7.150-14.708Q-7.249-14.807-7.249-14.944Q-7.249-15.084-7.150-15.183Q-7.440-15.183-7.640-14.987Q-7.840-14.790-7.933-14.496Q-8.025-14.202-8.025-13.922L-8.025-12.808Q-8.025-12.599-7.369-12.599L-7.369-12.319M-5.472-13.160L-5.472-15.057L-6.111-15.057L-6.111-15.279Q-5.793-15.279-5.576-15.489Q-5.359-15.699-5.258-16.009Q-5.157-16.318-5.157-16.626L-4.891-16.626L-4.891-15.337L-3.814-15.337L-3.814-15.057L-4.891-15.057L-4.891-13.173Q-4.891-12.897-4.786-12.698Q-4.682-12.500-4.422-12.500Q-4.265-12.500-4.159-12.604Q-4.053-12.709-4.004-12.862Q-3.954-13.016-3.954-13.173L-3.954-13.587L-3.688-13.587L-3.688-13.160Q-3.688-12.934-3.787-12.724Q-3.886-12.514-4.070-12.382Q-4.255-12.251-4.484-12.251Q-4.921-12.251-5.197-12.488Q-5.472-12.726-5.472-13.160\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(185.83 -1.195)\">\u003Cpath d=\"M1.964-10.569Q1.414-10.969 1.043-11.524Q0.672-12.080 0.491-12.726Q0.310-13.372 0.310-14.069Q0.310-14.582 0.410-15.077Q0.511-15.573 0.716-16.024Q0.921-16.475 1.234-16.867Q1.547-17.258 1.964-17.562Q1.974-17.566 1.981-17.567Q1.988-17.569 1.998-17.569L2.066-17.569Q2.101-17.569 2.123-17.545Q2.145-17.521 2.145-17.484Q2.145-17.439 2.118-17.422Q1.769-17.121 1.516-16.737Q1.263-16.352 1.111-15.911Q0.959-15.470 0.887-15.014Q0.815-14.558 0.815-14.069Q0.815-13.068 1.125-12.181Q1.434-11.294 2.118-10.709Q2.145-10.692 2.145-10.648Q2.145-10.610 2.123-10.586Q2.101-10.562 2.066-10.562L1.998-10.562Q1.991-10.566 1.983-10.567Q1.974-10.569 1.964-10.569M2.955-12.326L2.955-13.389Q2.955-13.413 2.982-13.440Q3.010-13.467 3.034-13.467L3.143-13.467Q3.208-13.467 3.222-13.409Q3.317-12.975 3.563-12.724Q3.810-12.473 4.223-12.473Q4.565-12.473 4.818-12.606Q5.071-12.739 5.071-13.047Q5.071-13.204 4.977-13.319Q4.883-13.433 4.744-13.502Q4.606-13.570 4.438-13.608L3.857-13.707Q3.502-13.775 3.228-13.996Q2.955-14.216 2.955-14.558Q2.955-14.807 3.066-14.982Q3.177-15.156 3.364-15.255Q3.550-15.354 3.765-15.397Q3.980-15.440 4.223-15.440Q4.637-15.440 4.917-15.258L5.132-15.433Q5.143-15.436 5.149-15.438Q5.156-15.440 5.166-15.440L5.218-15.440Q5.245-15.440 5.269-15.416Q5.293-15.392 5.293-15.364L5.293-14.517Q5.293-14.496 5.269-14.469Q5.245-14.442 5.218-14.442L5.105-14.442Q5.078-14.442 5.052-14.467Q5.026-14.493 5.026-14.517Q5.026-14.753 4.920-14.917Q4.814-15.081 4.632-15.163Q4.449-15.245 4.216-15.245Q3.888-15.245 3.632-15.142Q3.375-15.040 3.375-14.763Q3.375-14.568 3.558-14.459Q3.741-14.349 3.970-14.308L4.544-14.202Q4.791-14.154 5.004-14.026Q5.218-13.898 5.354-13.695Q5.491-13.491 5.491-13.242Q5.491-12.729 5.125-12.490Q4.760-12.251 4.223-12.251Q3.728-12.251 3.396-12.545L3.129-12.271Q3.109-12.251 3.082-12.251L3.034-12.251Q3.010-12.251 2.982-12.278Q2.955-12.305 2.955-12.326M6.619-11.089Q6.619-11.123 6.646-11.150Q6.916-11.379 7.065-11.702Q7.214-12.025 7.214-12.381L7.214-12.418Q7.104-12.319 6.940-12.319Q6.759-12.319 6.640-12.439Q6.520-12.558 6.520-12.739Q6.520-12.914 6.640-13.033Q6.759-13.153 6.940-13.153Q7.197-13.153 7.316-12.914Q7.436-12.674 7.436-12.381Q7.436-11.981 7.267-11.610Q7.098-11.239 6.800-10.983Q6.770-10.962 6.742-10.962Q6.701-10.962 6.660-11.003Q6.619-11.044 6.619-11.089\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(185.83 -1.195)\">\u003Cpath d=\"M11.144-13.047Q11.144-13.379 11.367-13.606Q11.591-13.833 11.935-13.961Q12.278-14.090 12.651-14.142Q13.023-14.195 13.328-14.195L13.328-14.448Q13.328-14.653 13.220-14.833Q13.112-15.012 12.931-15.115Q12.750-15.217 12.542-15.217Q12.135-15.217 11.899-15.125Q11.988-15.088 12.034-15.004Q12.080-14.920 12.080-14.818Q12.080-14.722 12.034-14.643Q11.988-14.565 11.907-14.520Q11.827-14.476 11.738-14.476Q11.588-14.476 11.487-14.573Q11.386-14.671 11.386-14.818Q11.386-15.440 12.542-15.440Q12.753-15.440 13.003-15.376Q13.252-15.313 13.454-15.194Q13.656-15.074 13.782-14.889Q13.909-14.705 13.909-14.462L13.909-12.886Q13.909-12.770 13.970-12.674Q14.032-12.579 14.145-12.579Q14.254-12.579 14.319-12.673Q14.384-12.767 14.384-12.886L14.384-13.334L14.650-13.334L14.650-12.886Q14.650-12.616 14.423-12.451Q14.196-12.285 13.916-12.285Q13.707-12.285 13.570-12.439Q13.434-12.592 13.410-12.808Q13.263-12.541 12.981-12.396Q12.699-12.251 12.374-12.251Q12.097-12.251 11.813-12.326Q11.530-12.401 11.337-12.580Q11.144-12.760 11.144-13.047M11.759-13.047Q11.759-12.873 11.860-12.743Q11.960-12.613 12.116-12.543Q12.271-12.473 12.436-12.473Q12.654-12.473 12.863-12.570Q13.071-12.668 13.199-12.849Q13.328-13.030 13.328-13.256L13.328-13.984Q13.003-13.984 12.637-13.893Q12.271-13.802 12.015-13.590Q11.759-13.379 11.759-13.047M15.389-10.562L15.320-10.562Q15.286-10.562 15.264-10.588Q15.242-10.613 15.242-10.648Q15.242-10.692 15.272-10.709Q15.628-11.013 15.877-11.403Q16.127-11.793 16.279-12.225Q16.431-12.657 16.501-13.126Q16.571-13.594 16.571-14.069Q16.571-14.548 16.501-15.014Q16.431-15.481 16.277-15.916Q16.124-16.352 15.872-16.740Q15.621-17.128 15.272-17.422Q15.242-17.439 15.242-17.484Q15.242-17.518 15.264-17.543Q15.286-17.569 15.320-17.569L15.389-17.569Q15.399-17.569 15.407-17.567Q15.416-17.566 15.426-17.562Q15.970-17.162 16.342-16.609Q16.715-16.055 16.896-15.409Q17.077-14.763 17.077-14.069Q17.077-13.368 16.896-12.721Q16.715-12.073 16.341-11.519Q15.966-10.965 15.426-10.569Q15.416-10.569 15.407-10.567Q15.399-10.566 15.389-10.562\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M130.326 7.198C92.48-19.448 60.6-26.896 17.433-20.174\"\u002F>\u003Cpath stroke=\"none\" d=\"m14.864-19.773 4.43 1.415-1.86-1.816 1.22-2.295\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(64.672 -12.115)\">\u003Cpath d=\"M-23.306-12.319L-25.042-12.319L-25.042-12.599Q-24.813-12.599-24.664-12.633Q-24.516-12.668-24.516-12.808L-24.516-14.657Q-24.516-14.927-24.623-14.988Q-24.731-15.050-25.042-15.050L-25.042-15.330L-24.013-15.405L-24.013-14.698Q-23.883-15.006-23.641-15.205Q-23.398-15.405-23.080-15.405Q-22.861-15.405-22.690-15.281Q-22.519-15.156-22.519-14.944Q-22.519-14.807-22.619-14.708Q-22.718-14.609-22.851-14.609Q-22.988-14.609-23.087-14.708Q-23.186-14.807-23.186-14.944Q-23.186-15.084-23.087-15.183Q-23.377-15.183-23.577-14.987Q-23.777-14.790-23.870-14.496Q-23.962-14.202-23.962-13.922L-23.962-12.808Q-23.962-12.599-23.306-12.599L-23.306-12.319M-21.976-13.854Q-21.976-14.175-21.851-14.464Q-21.726-14.753-21.501-14.976Q-21.275-15.200-20.980-15.320Q-20.684-15.440-20.366-15.440Q-20.038-15.440-19.776-15.340Q-19.515-15.241-19.339-15.059Q-19.163-14.876-19.069-14.618Q-18.975-14.360-18.975-14.028Q-18.975-13.936-19.057-13.915L-21.313-13.915L-21.313-13.854Q-21.313-13.266-21.029-12.883Q-20.745-12.500-20.178-12.500Q-19.857-12.500-19.589-12.693Q-19.320-12.886-19.231-13.201Q-19.224-13.242-19.149-13.256L-19.057-13.256Q-18.975-13.232-18.975-13.160Q-18.975-13.153-18.982-13.126Q-19.095-12.729-19.465-12.490Q-19.836-12.251-20.260-12.251Q-20.698-12.251-21.098-12.459Q-21.497-12.668-21.737-13.035Q-21.976-13.402-21.976-13.854M-21.306-14.124L-19.491-14.124Q-19.491-14.401-19.589-14.653Q-19.686-14.906-19.884-15.062Q-20.082-15.217-20.366-15.217Q-20.643-15.217-20.857-15.059Q-21.070-14.900-21.188-14.645Q-21.306-14.390-21.306-14.124M-16.999-12.346L-17.980-14.845Q-18.042-14.988-18.160-15.023Q-18.278-15.057-18.493-15.057L-18.493-15.337L-17.013-15.337L-17.013-15.057Q-17.392-15.057-17.392-14.896Q-17.392-14.886-17.379-14.845L-16.664-13.013L-15.991-14.718Q-16.022-14.790-16.022-14.818Q-16.022-14.845-16.049-14.845Q-16.111-14.992-16.229-15.024Q-16.347-15.057-16.558-15.057L-16.558-15.337L-15.161-15.337L-15.161-15.057Q-15.537-15.057-15.537-14.896Q-15.537-14.865-15.530-14.845L-14.774-12.907L-14.087-14.657Q-14.067-14.708-14.067-14.763Q-14.067-14.903-14.180-14.980Q-14.292-15.057-14.433-15.057L-14.433-15.337L-13.212-15.337L-13.212-15.057Q-13.417-15.057-13.573-14.951Q-13.728-14.845-13.800-14.657L-14.706-12.346Q-14.740-12.251-14.853-12.251L-14.921-12.251Q-15.031-12.251-15.068-12.346L-15.851-14.349L-16.637-12.346Q-16.671-12.251-16.784-12.251L-16.852-12.251Q-16.962-12.251-16.999-12.346\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.672 -12.115)\">\u003Cpath d=\"M-12.823-13.047Q-12.823-13.379-12.600-13.606Q-12.376-13.833-12.032-13.961Q-11.689-14.090-11.316-14.142Q-10.944-14.195-10.639-14.195L-10.639-14.448Q-10.639-14.653-10.747-14.833Q-10.855-15.012-11.036-15.115Q-11.217-15.217-11.425-15.217Q-11.832-15.217-12.068-15.125Q-11.979-15.088-11.933-15.004Q-11.887-14.920-11.887-14.818Q-11.887-14.722-11.933-14.643Q-11.979-14.565-12.060-14.520Q-12.140-14.476-12.229-14.476Q-12.379-14.476-12.480-14.573Q-12.581-14.671-12.581-14.818Q-12.581-15.440-11.425-15.440Q-11.214-15.440-10.964-15.376Q-10.715-15.313-10.513-15.194Q-10.311-15.074-10.185-14.889Q-10.058-14.705-10.058-14.462L-10.058-12.886Q-10.058-12.770-9.997-12.674Q-9.935-12.579-9.822-12.579Q-9.713-12.579-9.648-12.673Q-9.583-12.767-9.583-12.886L-9.583-13.334L-9.317-13.334L-9.317-12.886Q-9.317-12.616-9.544-12.451Q-9.771-12.285-10.051-12.285Q-10.260-12.285-10.397-12.439Q-10.533-12.592-10.557-12.808Q-10.704-12.541-10.986-12.396Q-11.268-12.251-11.593-12.251Q-11.870-12.251-12.154-12.326Q-12.437-12.401-12.630-12.580Q-12.823-12.760-12.823-13.047M-12.208-13.047Q-12.208-12.873-12.107-12.743Q-12.007-12.613-11.851-12.543Q-11.696-12.473-11.531-12.473Q-11.313-12.473-11.104-12.570Q-10.896-12.668-10.768-12.849Q-10.639-13.030-10.639-13.256L-10.639-13.984Q-10.964-13.984-11.330-13.893Q-11.696-13.802-11.952-13.590Q-12.208-13.379-12.208-13.047M-7.150-12.319L-8.886-12.319L-8.886-12.599Q-8.657-12.599-8.508-12.633Q-8.360-12.668-8.360-12.808L-8.360-14.657Q-8.360-14.927-8.467-14.988Q-8.575-15.050-8.886-15.050L-8.886-15.330L-7.857-15.405L-7.857-14.698Q-7.727-15.006-7.485-15.205Q-7.242-15.405-6.924-15.405Q-6.705-15.405-6.534-15.281Q-6.363-15.156-6.363-14.944Q-6.363-14.807-6.463-14.708Q-6.562-14.609-6.695-14.609Q-6.832-14.609-6.931-14.708Q-7.030-14.807-7.030-14.944Q-7.030-15.084-6.931-15.183Q-7.221-15.183-7.421-14.987Q-7.621-14.790-7.714-14.496Q-7.806-14.202-7.806-13.922L-7.806-12.808Q-7.806-12.599-7.150-12.599L-7.150-12.319M-5.779-13.830Q-5.779-14.168-5.639-14.459Q-5.499-14.749-5.254-14.963Q-5.010-15.176-4.706-15.291Q-4.402-15.405-4.077-15.405Q-3.807-15.405-3.544-15.306Q-3.280-15.207-3.089-15.029L-3.089-16.427Q-3.089-16.697-3.197-16.759Q-3.304-16.820-3.615-16.820L-3.615-17.101L-2.539-17.176L-2.539-12.992Q-2.539-12.804-2.484-12.721Q-2.429-12.637-2.329-12.618Q-2.228-12.599-2.012-12.599L-2.012-12.319L-3.120-12.251L-3.120-12.668Q-3.537-12.251-4.162-12.251Q-4.593-12.251-4.966-12.463Q-5.338-12.674-5.559-13.035Q-5.779-13.396-5.779-13.830M-4.104-12.473Q-3.896-12.473-3.709-12.545Q-3.523-12.616-3.369-12.753Q-3.216-12.890-3.120-13.068L-3.120-14.677Q-3.205-14.824-3.351-14.944Q-3.496-15.064-3.665-15.123Q-3.834-15.183-4.015-15.183Q-4.576-15.183-4.844-14.794Q-5.113-14.404-5.113-13.823Q-5.113-13.252-4.878-12.862Q-4.644-12.473-4.104-12.473\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.672 -12.115)\">\u003Cpath d=\"M6.508-13.126L1.675-13.126Q1.607-13.136 1.561-13.182Q1.515-13.228 1.515-13.300Q1.515-13.365 1.561-13.411Q1.607-13.457 1.675-13.467L6.508-13.467Q6.577-13.457 6.623-13.411Q6.669-13.365 6.669-13.300Q6.669-13.228 6.623-13.182Q6.577-13.136 6.508-13.126M6.508-14.664L1.675-14.664Q1.607-14.674 1.561-14.720Q1.515-14.766 1.515-14.838Q1.515-14.982 1.675-15.006L6.508-15.006Q6.669-14.982 6.669-14.838Q6.669-14.766 6.623-14.720Q6.577-14.674 6.508-14.664\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.672 -12.115)\">\u003Cpath d=\"M12.058-13.573L10-13.573L10-14.076L12.058-14.076L12.058-13.573M14.529-12.319L12.926-12.319L12.926-12.599Q13.152-12.599 13.300-12.633Q13.449-12.668 13.449-12.808L13.449-16.427Q13.449-16.697 13.341-16.759Q13.234-16.820 12.926-16.820L12.926-17.101L14.003-17.176L14.003-12.808Q14.003-12.671 14.153-12.635Q14.303-12.599 14.529-12.599L14.529-12.319M15.083-13.802Q15.083-14.144 15.218-14.443Q15.353-14.742 15.592-14.966Q15.831-15.190 16.149-15.315Q16.467-15.440 16.798-15.440Q17.243-15.440 17.643-15.224Q18.043-15.009 18.277-14.631Q18.511-14.254 18.511-13.802Q18.511-13.461 18.369-13.177Q18.227-12.893 17.983-12.686Q17.738-12.480 17.429-12.365Q17.120-12.251 16.798-12.251Q16.368-12.251 15.966-12.452Q15.565-12.654 15.324-13.006Q15.083-13.358 15.083-13.802M16.798-12.500Q17.400-12.500 17.624-12.878Q17.848-13.256 17.848-13.888Q17.848-14.500 17.614-14.859Q17.380-15.217 16.798-15.217Q15.746-15.217 15.746-13.888Q15.746-13.256 15.971-12.878Q16.197-12.500 16.798-12.500M19.065-11.786Q19.065-12.032 19.261-12.216Q19.458-12.401 19.714-12.480Q19.577-12.592 19.506-12.753Q19.434-12.914 19.434-13.095Q19.434-13.416 19.646-13.662Q19.311-13.960 19.311-14.370Q19.311-14.831 19.700-15.118Q20.090-15.405 20.568-15.405Q21.040-15.405 21.375-15.159Q21.549-15.313 21.760-15.395Q21.970-15.477 22.199-15.477Q22.363-15.477 22.484-15.370Q22.606-15.262 22.606-15.098Q22.606-15.002 22.534-14.930Q22.462-14.859 22.370-14.859Q22.271-14.859 22.201-14.932Q22.131-15.006 22.131-15.105Q22.131-15.159 22.144-15.190L22.151-15.204Q22.158-15.224 22.166-15.235Q22.175-15.245 22.178-15.252Q21.823-15.252 21.536-15.029Q21.823-14.736 21.823-14.370Q21.823-14.055 21.638-13.823Q21.454-13.590 21.165-13.462Q20.876-13.334 20.568-13.334Q20.367-13.334 20.175-13.384Q19.984-13.433 19.806-13.543Q19.714-13.416 19.714-13.273Q19.714-13.091 19.842-12.956Q19.970-12.821 20.155-12.821L20.787-12.821Q21.235-12.821 21.604-12.750Q21.973-12.678 22.233-12.449Q22.493-12.220 22.493-11.786Q22.493-11.465 22.197-11.263Q21.902-11.061 21.498-10.972Q21.095-10.883 20.780-10.883Q20.463-10.883 20.059-10.972Q19.656-11.061 19.360-11.263Q19.065-11.465 19.065-11.786M19.519-11.786Q19.519-11.557 19.738-11.408Q19.957-11.259 20.249-11.191Q20.541-11.123 20.780-11.123Q20.944-11.123 21.153-11.159Q21.361-11.194 21.568-11.275Q21.775-11.355 21.907-11.483Q22.038-11.611 22.038-11.786Q22.038-12.138 21.657-12.232Q21.276-12.326 20.774-12.326L20.155-12.326Q19.916-12.326 19.717-12.175Q19.519-12.025 19.519-11.786M20.568-13.573Q21.235-13.573 21.235-14.370Q21.235-15.170 20.568-15.170Q19.899-15.170 19.899-14.370Q19.899-13.573 20.568-13.573M25.217-10.569Q24.667-10.969 24.296-11.524Q23.925-12.080 23.744-12.726Q23.563-13.372 23.563-14.069Q23.563-14.582 23.663-15.077Q23.764-15.573 23.969-16.024Q24.174-16.475 24.487-16.867Q24.800-17.258 25.217-17.562Q25.227-17.566 25.234-17.567Q25.241-17.569 25.251-17.569L25.319-17.569Q25.354-17.569 25.376-17.545Q25.398-17.521 25.398-17.484Q25.398-17.439 25.371-17.422Q25.022-17.121 24.769-16.737Q24.516-16.352 24.364-15.911Q24.212-15.470 24.140-15.014Q24.068-14.558 24.068-14.069Q24.068-13.068 24.378-12.181Q24.687-11.294 25.371-10.709Q25.398-10.692 25.398-10.648Q25.398-10.610 25.376-10.586Q25.354-10.562 25.319-10.562L25.251-10.562Q25.244-10.566 25.236-10.567Q25.227-10.569 25.217-10.569M29.219-12.319L26.690-12.319L26.690-12.599Q27.657-12.599 27.657-12.808L27.657-16.427Q27.264-16.239 26.642-16.239L26.642-16.520Q27.059-16.520 27.423-16.621Q27.787-16.721 28.044-16.967L28.170-16.967Q28.235-16.950 28.252-16.882L28.252-12.808Q28.252-12.599 29.219-12.599\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.672 -12.115)\">\u003Cpath d=\"M34.794-13.573L32.736-13.573L32.736-14.076L34.794-14.076\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.672 -12.115)\">\u003Cpath d=\"M41.150-12.319L38.378-12.319L38.378-12.599Q39.099-12.599 39.099-12.808L39.099-16.609Q39.099-16.820 38.378-16.820L38.378-17.101L41.150-17.101Q41.635-17.101 42.071-16.906Q42.507-16.711 42.830-16.369Q43.153-16.027 43.331-15.587Q43.508-15.146 43.508-14.664Q43.508-14.178 43.324-13.755Q43.139-13.331 42.816-13.009Q42.493-12.688 42.061-12.504Q41.629-12.319 41.150-12.319M39.762-16.609L39.762-12.808Q39.762-12.668 39.851-12.633Q39.940-12.599 40.128-12.599L40.952-12.599Q41.577-12.599 41.981-12.861Q42.384-13.122 42.572-13.589Q42.760-14.055 42.760-14.664Q42.760-15.142 42.668-15.535Q42.575-15.928 42.326-16.226Q42.087-16.513 41.723-16.667Q41.359-16.820 40.952-16.820L40.128-16.820Q39.940-16.820 39.851-16.786Q39.762-16.752 39.762-16.609M44.640-10.562L44.571-10.562Q44.537-10.562 44.515-10.588Q44.493-10.613 44.493-10.648Q44.493-10.692 44.524-10.709Q44.879-11.013 45.129-11.403Q45.378-11.793 45.530-12.225Q45.682-12.657 45.752-13.126Q45.822-13.594 45.822-14.069Q45.822-14.548 45.752-15.014Q45.682-15.481 45.528-15.916Q45.375-16.352 45.123-16.740Q44.872-17.128 44.524-17.422Q44.493-17.439 44.493-17.484Q44.493-17.518 44.515-17.543Q44.537-17.569 44.571-17.569L44.640-17.569Q44.650-17.569 44.659-17.567Q44.667-17.566 44.677-17.562Q45.221-17.162 45.593-16.609Q45.966-16.055 46.147-15.409Q46.328-14.763 46.328-14.069Q46.328-13.368 46.147-12.721Q45.966-12.073 45.592-11.519Q45.217-10.965 44.677-10.569Q44.667-10.569 44.659-10.567Q44.650-10.566 44.640-10.562\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The GAIL adversarial loop. The discriminator learns to separate expert state-action pairs from the policy's rollouts; its output is fed back as a reward the policy maximizes by policy gradient, pushing the learner's occupancy measure toward the expert's until the discriminator can no longer tell them apart.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:453.698px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 340.273 41.412\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-65.403-54.992h325.206\"\u002F>\u003Cpath stroke=\"none\" d=\"m261.803-54.992-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(-5.003 12.662)\">\u003Cpath d=\"M-56.553-56.503Q-56.553-56.831-56.418-57.132Q-56.283-57.432-56.047-57.653Q-55.811-57.873-55.507-57.993Q-55.202-58.113-54.878-58.113Q-54.372-58.113-54.023-58.010Q-53.675-57.908-53.675-57.532Q-53.675-57.385-53.772-57.284Q-53.869-57.183-54.016-57.183Q-54.170-57.183-54.269-57.282Q-54.368-57.381-54.368-57.532Q-54.368-57.720-54.228-57.812Q-54.430-57.863-54.871-57.863Q-55.226-57.863-55.455-57.667Q-55.684-57.470-55.785-57.161Q-55.886-56.851-55.886-56.503Q-55.886-56.154-55.760-55.848Q-55.633-55.542-55.378-55.358Q-55.124-55.173-54.768-55.173Q-54.546-55.173-54.362-55.257Q-54.177-55.341-54.042-55.496Q-53.907-55.652-53.849-55.860Q-53.835-55.915-53.781-55.915L-53.668-55.915Q-53.637-55.915-53.615-55.891Q-53.593-55.867-53.593-55.833L-53.593-55.812Q-53.678-55.525-53.866-55.327Q-54.054-55.129-54.319-55.026Q-54.584-54.924-54.878-54.924Q-55.308-54.924-55.696-55.130Q-56.084-55.337-56.318-55.700Q-56.553-56.062-56.553-56.503M-53.046-56.475Q-53.046-56.817-52.911-57.116Q-52.776-57.415-52.536-57.639Q-52.297-57.863-51.979-57.988Q-51.661-58.113-51.330-58.113Q-50.886-58.113-50.486-57.897Q-50.086-57.682-49.852-57.304Q-49.617-56.927-49.617-56.475Q-49.617-56.134-49.759-55.850Q-49.901-55.566-50.146-55.359Q-50.390-55.153-50.699-55.038Q-51.009-54.924-51.330-54.924Q-51.761-54.924-52.162-55.125Q-52.564-55.327-52.805-55.679Q-53.046-56.031-53.046-56.475M-51.330-55.173Q-50.728-55.173-50.504-55.551Q-50.281-55.929-50.281-56.561Q-50.281-57.173-50.515-57.532Q-50.749-57.890-51.330-57.890Q-52.383-57.890-52.383-56.561Q-52.383-55.929-52.157-55.551Q-51.931-55.173-51.330-55.173M-47.379-53.635L-49.009-53.635L-49.009-53.915Q-48.780-53.915-48.631-53.950Q-48.483-53.984-48.483-54.124L-48.483-57.470Q-48.483-57.641-48.619-57.682Q-48.756-57.723-49.009-57.723L-49.009-58.003L-47.929-58.078L-47.929-57.672Q-47.707-57.873-47.420-57.976Q-47.133-58.078-46.825-58.078Q-46.398-58.078-46.034-57.865Q-45.670-57.651-45.456-57.287Q-45.242-56.923-45.242-56.503Q-45.242-56.058-45.482-55.694Q-45.721-55.330-46.114-55.127Q-46.507-54.924-46.951-54.924Q-47.218-54.924-47.466-55.024Q-47.714-55.125-47.902-55.306L-47.902-54.124Q-47.902-53.987-47.753-53.951Q-47.604-53.915-47.379-53.915L-47.379-53.635M-47.902-57.323L-47.902-55.713Q-47.768-55.460-47.526-55.303Q-47.283-55.146-47.006-55.146Q-46.678-55.146-46.425-55.347Q-46.172-55.549-46.039-55.867Q-45.906-56.185-45.906-56.503Q-45.906-56.732-45.971-56.961Q-46.035-57.190-46.164-57.388Q-46.292-57.586-46.487-57.706Q-46.681-57.825-46.914-57.825Q-47.208-57.825-47.476-57.696Q-47.744-57.566-47.902-57.323\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-5.003 12.662)\">\u003Cpath d=\"M-44.475-53.857Q-44.345-53.789-44.208-53.789Q-44.037-53.789-43.887-53.878Q-43.736-53.967-43.625-54.112Q-43.514-54.257-43.436-54.425L-43.172-54.992L-44.341-57.518Q-44.416-57.665-44.546-57.697Q-44.676-57.730-44.909-57.730L-44.909-58.010L-43.388-58.010L-43.388-57.730Q-43.736-57.730-43.736-57.583Q-43.733-57.562-43.731-57.545Q-43.729-57.528-43.729-57.518L-42.872-55.659L-42.099-57.330Q-42.065-57.398-42.065-57.477Q-42.065-57.590-42.149-57.660Q-42.232-57.730-42.345-57.730L-42.345-58.010L-41.149-58.010L-41.149-57.730Q-41.368-57.730-41.540-57.626Q-41.713-57.521-41.805-57.330L-43.142-54.425Q-43.312-54.055-43.582-53.809Q-43.853-53.563-44.208-53.563Q-44.478-53.563-44.697-53.729Q-44.916-53.895-44.916-54.158Q-44.916-54.295-44.823-54.384Q-44.731-54.472-44.591-54.472Q-44.454-54.472-44.365-54.384Q-44.276-54.295-44.276-54.158Q-44.276-54.055-44.329-53.977Q-44.382-53.898-44.475-53.857\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-5.003 12.662)\">\u003Cpath d=\"M-37.107-54.992L-37.374-54.992L-37.374-59.100Q-37.374-59.370-37.481-59.432Q-37.589-59.493-37.900-59.493L-37.900-59.774L-36.820-59.849L-36.820-57.679Q-36.611-57.870-36.326-57.974Q-36.041-58.078-35.743-58.078Q-35.425-58.078-35.128-57.957Q-34.831-57.836-34.608-57.620Q-34.386-57.405-34.260-57.120Q-34.133-56.834-34.133-56.503Q-34.133-56.058-34.373-55.694Q-34.612-55.330-35.005-55.127Q-35.398-54.924-35.842-54.924Q-36.037-54.924-36.227-54.980Q-36.416-55.036-36.577-55.141Q-36.738-55.245-36.878-55.406L-37.107-54.992M-36.792-57.337L-36.792-55.720Q-36.656-55.460-36.415-55.303Q-36.174-55.146-35.897-55.146Q-35.603-55.146-35.391-55.253Q-35.179-55.361-35.046-55.553Q-34.913-55.744-34.854-55.983Q-34.796-56.222-34.796-56.503Q-34.796-56.862-34.890-57.166Q-34.984-57.470-35.212-57.663Q-35.439-57.856-35.805-57.856Q-36.105-57.856-36.372-57.720Q-36.639-57.583-36.792-57.337\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-5.003 12.662)\">\u003Cpath d=\"M-33.323-56.527Q-33.323-56.848-33.198-57.137Q-33.073-57.426-32.847-57.649Q-32.622-57.873-32.326-57.993Q-32.031-58.113-31.713-58.113Q-31.385-58.113-31.123-58.013Q-30.862-57.914-30.686-57.732Q-30.510-57.549-30.416-57.291Q-30.322-57.033-30.322-56.701Q-30.322-56.609-30.404-56.588L-32.659-56.588L-32.659-56.527Q-32.659-55.939-32.376-55.556Q-32.092-55.173-31.525-55.173Q-31.203-55.173-30.935-55.366Q-30.667-55.559-30.578-55.874Q-30.571-55.915-30.496-55.929L-30.404-55.929Q-30.322-55.905-30.322-55.833Q-30.322-55.826-30.328-55.799Q-30.441-55.402-30.812-55.163Q-31.183-54.924-31.607-54.924Q-32.044-54.924-32.444-55.132Q-32.844-55.341-33.083-55.708Q-33.323-56.075-33.323-56.527M-32.653-56.797L-30.838-56.797Q-30.838-57.074-30.935-57.326Q-31.033-57.579-31.231-57.735Q-31.429-57.890-31.713-57.890Q-31.990-57.890-32.203-57.732Q-32.417-57.573-32.535-57.318Q-32.653-57.063-32.653-56.797M-28.052-54.992L-29.686-54.992L-29.686-55.272Q-29.457-55.272-29.308-55.306Q-29.159-55.341-29.159-55.481L-29.159-59.100Q-29.159-59.370-29.267-59.432Q-29.375-59.493-29.686-59.493L-29.686-59.774L-28.606-59.849L-28.606-57.463Q-28.500-57.648-28.322-57.790Q-28.144-57.931-27.936-58.005Q-27.727-58.078-27.502-58.078Q-26.996-58.078-26.712-57.855Q-26.429-57.631-26.429-57.135L-26.429-55.481Q-26.429-55.344-26.280-55.308Q-26.131-55.272-25.906-55.272L-25.906-54.992L-27.536-54.992L-27.536-55.272Q-27.307-55.272-27.158-55.306Q-27.010-55.341-27.010-55.481L-27.010-57.121Q-27.010-57.456-27.129-57.656Q-27.249-57.856-27.563-57.856Q-27.833-57.856-28.067-57.720Q-28.302-57.583-28.440-57.349Q-28.578-57.115-28.578-56.841L-28.578-55.481Q-28.578-55.344-28.428-55.308Q-28.278-55.272-28.052-55.272L-28.052-54.992M-25.260-55.720Q-25.260-56.052-25.036-56.279Q-24.812-56.506-24.468-56.634Q-24.125-56.763-23.752-56.815Q-23.380-56.868-23.075-56.868L-23.075-57.121Q-23.075-57.326-23.183-57.506Q-23.291-57.685-23.472-57.788Q-23.653-57.890-23.862-57.890Q-24.268-57.890-24.504-57.798Q-24.415-57.761-24.369-57.677Q-24.323-57.593-24.323-57.491Q-24.323-57.395-24.369-57.316Q-24.415-57.238-24.496-57.193Q-24.576-57.149-24.665-57.149Q-24.815-57.149-24.916-57.246Q-25.017-57.344-25.017-57.491Q-25.017-58.113-23.862-58.113Q-23.650-58.113-23.400-58.049Q-23.151-57.986-22.949-57.867Q-22.747-57.747-22.621-57.562Q-22.494-57.378-22.494-57.135L-22.494-55.559Q-22.494-55.443-22.433-55.347Q-22.371-55.252-22.259-55.252Q-22.149-55.252-22.084-55.346Q-22.019-55.440-22.019-55.559L-22.019-56.007L-21.753-56.007L-21.753-55.559Q-21.753-55.289-21.980-55.124Q-22.207-54.958-22.488-54.958Q-22.696-54.958-22.833-55.112Q-22.970-55.265-22.993-55.481Q-23.140-55.214-23.422-55.069Q-23.704-54.924-24.029-54.924Q-24.306-54.924-24.590-54.999Q-24.873-55.074-25.066-55.253Q-25.260-55.433-25.260-55.720M-24.644-55.720Q-24.644-55.546-24.544-55.416Q-24.443-55.286-24.287-55.216Q-24.132-55.146-23.968-55.146Q-23.749-55.146-23.540-55.243Q-23.332-55.341-23.204-55.522Q-23.075-55.703-23.075-55.929L-23.075-56.657Q-23.400-56.657-23.766-56.566Q-24.132-56.475-24.388-56.263Q-24.644-56.052-24.644-55.720\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-5.003 12.662)\">\u003Cpath d=\"M-19.949-55.019L-21.077-57.518Q-21.149-57.665-21.279-57.697Q-21.409-57.730-21.638-57.730L-21.638-58.010L-20.124-58.010L-20.124-57.730Q-20.476-57.730-20.476-57.583Q-20.476-57.538-20.465-57.518L-19.601-55.600L-18.821-57.330Q-18.787-57.398-18.787-57.477Q-18.787-57.590-18.871-57.660Q-18.955-57.730-19.074-57.730L-19.074-58.010L-17.878-58.010L-17.878-57.730Q-18.097-57.730-18.268-57.627Q-18.438-57.525-18.527-57.330L-19.563-55.019Q-19.611-54.924-19.717-54.924L-19.795-54.924Q-19.901-54.924-19.949-55.019M-15.721-54.992L-17.273-54.992L-17.273-55.272Q-17.047-55.272-16.899-55.306Q-16.750-55.341-16.750-55.481L-16.750-57.330Q-16.750-57.518-16.798-57.602Q-16.846-57.685-16.943-57.704Q-17.041-57.723-17.252-57.723L-17.252-58.003L-16.196-58.078L-16.196-55.481Q-16.196-55.341-16.065-55.306Q-15.933-55.272-15.721-55.272L-15.721-54.992M-16.993-59.299Q-16.993-59.470-16.870-59.589Q-16.747-59.709-16.576-59.709Q-16.408-59.709-16.285-59.589Q-16.162-59.470-16.162-59.299Q-16.162-59.124-16.285-59.001Q-16.408-58.878-16.576-58.878Q-16.747-58.878-16.870-59.001Q-16.993-59.124-16.993-59.299M-15.116-56.475Q-15.116-56.817-14.981-57.116Q-14.846-57.415-14.607-57.639Q-14.368-57.863-14.050-57.988Q-13.732-58.113-13.400-58.113Q-12.956-58.113-12.556-57.897Q-12.156-57.682-11.922-57.304Q-11.688-56.927-11.688-56.475Q-11.688-56.134-11.830-55.850Q-11.972-55.566-12.216-55.359Q-12.460-55.153-12.770-55.038Q-13.079-54.924-13.400-54.924Q-13.831-54.924-14.233-55.125Q-14.634-55.327-14.875-55.679Q-15.116-56.031-15.116-56.475M-13.400-55.173Q-12.799-55.173-12.575-55.551Q-12.351-55.929-12.351-56.561Q-12.351-57.173-12.585-57.532Q-12.819-57.890-13.400-57.890Q-14.453-57.890-14.453-56.561Q-14.453-55.929-14.228-55.551Q-14.002-55.173-13.400-55.173M-9.343-54.992L-11.080-54.992L-11.080-55.272Q-10.851-55.272-10.702-55.306Q-10.553-55.341-10.553-55.481L-10.553-57.330Q-10.553-57.600-10.661-57.661Q-10.769-57.723-11.080-57.723L-11.080-58.003L-10.051-58.078L-10.051-57.371Q-9.921-57.679-9.678-57.878Q-9.436-58.078-9.118-58.078Q-8.899-58.078-8.728-57.954Q-8.557-57.829-8.557-57.617Q-8.557-57.480-8.656-57.381Q-8.755-57.282-8.889-57.282Q-9.025-57.282-9.124-57.381Q-9.224-57.480-9.224-57.617Q-9.224-57.757-9.124-57.856Q-9.415-57.856-9.615-57.660Q-9.815-57.463-9.907-57.169Q-9.999-56.875-9.999-56.595L-9.999-55.481Q-9.999-55.272-9.343-55.272\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(224.975 13.05)\">\u003Cpath d=\"M-54.803-54.992L-56.539-54.992L-56.539-55.272Q-56.310-55.272-56.161-55.306Q-56.013-55.341-56.013-55.481L-56.013-57.330Q-56.013-57.600-56.120-57.661Q-56.228-57.723-56.539-57.723L-56.539-58.003L-55.510-58.078L-55.510-57.371Q-55.380-57.679-55.138-57.878Q-54.895-58.078-54.577-58.078Q-54.358-58.078-54.187-57.954Q-54.016-57.829-54.016-57.617Q-54.016-57.480-54.116-57.381Q-54.215-57.282-54.348-57.282Q-54.485-57.282-54.584-57.381Q-54.683-57.480-54.683-57.617Q-54.683-57.757-54.584-57.856Q-54.874-57.856-55.074-57.660Q-55.274-57.463-55.367-57.169Q-55.459-56.875-55.459-56.595L-55.459-55.481Q-55.459-55.272-54.803-55.272L-54.803-54.992M-53.473-56.527Q-53.473-56.848-53.348-57.137Q-53.223-57.426-52.998-57.649Q-52.772-57.873-52.477-57.993Q-52.181-58.113-51.863-58.113Q-51.535-58.113-51.273-58.013Q-51.012-57.914-50.836-57.732Q-50.660-57.549-50.566-57.291Q-50.472-57.033-50.472-56.701Q-50.472-56.609-50.554-56.588L-52.810-56.588L-52.810-56.527Q-52.810-55.939-52.526-55.556Q-52.242-55.173-51.675-55.173Q-51.354-55.173-51.086-55.366Q-50.817-55.559-50.728-55.874Q-50.721-55.915-50.646-55.929L-50.554-55.929Q-50.472-55.905-50.472-55.833Q-50.472-55.826-50.479-55.799Q-50.592-55.402-50.962-55.163Q-51.333-54.924-51.757-54.924Q-52.195-54.924-52.595-55.132Q-52.994-55.341-53.234-55.708Q-53.473-56.075-53.473-56.527M-52.803-56.797L-50.988-56.797Q-50.988-57.074-51.086-57.326Q-51.183-57.579-51.381-57.735Q-51.579-57.890-51.863-57.890Q-52.140-57.890-52.354-57.732Q-52.567-57.573-52.685-57.318Q-52.803-57.063-52.803-56.797M-49.884-56.503Q-49.884-56.831-49.749-57.132Q-49.614-57.432-49.378-57.653Q-49.142-57.873-48.838-57.993Q-48.534-58.113-48.209-58.113Q-47.703-58.113-47.355-58.010Q-47.006-57.908-47.006-57.532Q-47.006-57.385-47.104-57.284Q-47.201-57.183-47.348-57.183Q-47.502-57.183-47.601-57.282Q-47.700-57.381-47.700-57.532Q-47.700-57.720-47.560-57.812Q-47.762-57.863-48.202-57.863Q-48.558-57.863-48.787-57.667Q-49.016-57.470-49.117-57.161Q-49.218-56.851-49.218-56.503Q-49.218-56.154-49.091-55.848Q-48.965-55.542-48.710-55.358Q-48.455-55.173-48.100-55.173Q-47.878-55.173-47.693-55.257Q-47.509-55.341-47.374-55.496Q-47.239-55.652-47.180-55.860Q-47.167-55.915-47.112-55.915L-46.999-55.915Q-46.969-55.915-46.946-55.891Q-46.924-55.867-46.924-55.833L-46.924-55.812Q-47.010-55.525-47.198-55.327Q-47.386-55.129-47.650-55.026Q-47.915-54.924-48.209-54.924Q-48.640-54.924-49.028-55.130Q-49.416-55.337-49.650-55.700Q-49.884-56.062-49.884-56.503M-46.377-56.475Q-46.377-56.817-46.242-57.116Q-46.107-57.415-45.868-57.639Q-45.629-57.863-45.311-57.988Q-44.993-58.113-44.661-58.113Q-44.217-58.113-43.817-57.897Q-43.417-57.682-43.183-57.304Q-42.949-56.927-42.949-56.475Q-42.949-56.134-43.091-55.850Q-43.233-55.566-43.477-55.359Q-43.721-55.153-44.031-55.038Q-44.340-54.924-44.661-54.924Q-45.092-54.924-45.494-55.125Q-45.895-55.327-46.136-55.679Q-46.377-56.031-46.377-56.475M-44.661-55.173Q-44.060-55.173-43.836-55.551Q-43.612-55.929-43.612-56.561Q-43.612-57.173-43.846-57.532Q-44.080-57.890-44.661-57.890Q-45.714-57.890-45.714-56.561Q-45.714-55.929-45.489-55.551Q-45.263-55.173-44.661-55.173\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(224.975 13.05)\">\u003Cpath d=\"M-40.956-55.019L-42.084-57.518Q-42.156-57.665-42.286-57.697Q-42.416-57.730-42.645-57.730L-42.645-58.010L-41.131-58.010L-41.131-57.730Q-41.483-57.730-41.483-57.583Q-41.483-57.538-41.472-57.518L-40.608-55.600L-39.828-57.330Q-39.794-57.398-39.794-57.477Q-39.794-57.590-39.878-57.660Q-39.962-57.730-40.081-57.730L-40.081-58.010L-38.885-58.010L-38.885-57.730Q-39.104-57.730-39.275-57.627Q-39.445-57.525-39.534-57.330L-40.570-55.019Q-40.618-54.924-40.724-54.924L-40.802-54.924Q-40.908-54.924-40.956-55.019\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(224.975 13.05)\">\u003Cpath d=\"M-38.601-56.527Q-38.601-56.848-38.476-57.137Q-38.351-57.426-38.125-57.649Q-37.900-57.873-37.604-57.993Q-37.309-58.113-36.991-58.113Q-36.663-58.113-36.401-58.013Q-36.140-57.914-35.964-57.732Q-35.788-57.549-35.694-57.291Q-35.600-57.033-35.600-56.701Q-35.600-56.609-35.682-56.588L-37.937-56.588L-37.937-56.527Q-37.937-55.939-37.654-55.556Q-37.370-55.173-36.803-55.173Q-36.481-55.173-36.213-55.366Q-35.945-55.559-35.856-55.874Q-35.849-55.915-35.774-55.929L-35.682-55.929Q-35.600-55.905-35.600-55.833Q-35.600-55.826-35.606-55.799Q-35.719-55.402-36.090-55.163Q-36.461-54.924-36.885-54.924Q-37.322-54.924-37.722-55.132Q-38.122-55.341-38.361-55.708Q-38.601-56.075-38.601-56.527M-37.931-56.797L-36.116-56.797Q-36.116-57.074-36.213-57.326Q-36.311-57.579-36.509-57.735Q-36.707-57.890-36.991-57.890Q-37.268-57.890-37.481-57.732Q-37.695-57.573-37.813-57.318Q-37.931-57.063-37.931-56.797M-33.262-54.992L-34.998-54.992L-34.998-55.272Q-34.769-55.272-34.620-55.306Q-34.472-55.341-34.472-55.481L-34.472-57.330Q-34.472-57.600-34.579-57.661Q-34.687-57.723-34.998-57.723L-34.998-58.003L-33.969-58.078L-33.969-57.371Q-33.839-57.679-33.597-57.878Q-33.354-58.078-33.036-58.078Q-32.817-58.078-32.646-57.954Q-32.476-57.829-32.476-57.617Q-32.476-57.480-32.575-57.381Q-32.674-57.282-32.807-57.282Q-32.944-57.282-33.043-57.381Q-33.142-57.480-33.142-57.617Q-33.142-57.757-33.043-57.856Q-33.333-57.856-33.533-57.660Q-33.733-57.463-33.826-57.169Q-33.918-56.875-33.918-56.595L-33.918-55.481Q-33.918-55.272-33.262-55.272\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(224.975 13.05)\">\u003Cpath d=\"M-27.435-54.992L-29.171-54.992L-29.171-55.272Q-28.942-55.272-28.793-55.306Q-28.645-55.341-28.645-55.481L-28.645-57.330Q-28.645-57.600-28.752-57.661Q-28.860-57.723-29.171-57.723L-29.171-58.003L-28.142-58.078L-28.142-57.371Q-28.012-57.679-27.770-57.878Q-27.527-58.078-27.209-58.078Q-26.990-58.078-26.819-57.954Q-26.648-57.829-26.648-57.617Q-26.648-57.480-26.748-57.381Q-26.847-57.282-26.980-57.282Q-27.117-57.282-27.216-57.381Q-27.315-57.480-27.315-57.617Q-27.315-57.757-27.216-57.856Q-27.506-57.856-27.706-57.660Q-27.906-57.463-27.999-57.169Q-28.091-56.875-28.091-56.595L-28.091-55.481Q-28.091-55.272-27.435-55.272L-27.435-54.992M-26.105-56.527Q-26.105-56.848-25.980-57.137Q-25.855-57.426-25.630-57.649Q-25.404-57.873-25.109-57.993Q-24.813-58.113-24.495-58.113Q-24.167-58.113-23.905-58.013Q-23.644-57.914-23.468-57.732Q-23.292-57.549-23.198-57.291Q-23.104-57.033-23.104-56.701Q-23.104-56.609-23.186-56.588L-25.442-56.588L-25.442-56.527Q-25.442-55.939-25.158-55.556Q-24.874-55.173-24.307-55.173Q-23.986-55.173-23.718-55.366Q-23.449-55.559-23.360-55.874Q-23.353-55.915-23.278-55.929L-23.186-55.929Q-23.104-55.905-23.104-55.833Q-23.104-55.826-23.111-55.799Q-23.224-55.402-23.594-55.163Q-23.965-54.924-24.389-54.924Q-24.827-54.924-25.227-55.132Q-25.626-55.341-25.866-55.708Q-26.105-56.075-26.105-56.527M-25.435-56.797L-23.620-56.797Q-23.620-57.074-23.718-57.326Q-23.815-57.579-24.013-57.735Q-24.211-57.890-24.495-57.890Q-24.772-57.890-24.986-57.732Q-25.199-57.573-25.317-57.318Q-25.435-57.063-25.435-56.797M-21.128-55.019L-22.109-57.518Q-22.171-57.661-22.289-57.696Q-22.407-57.730-22.622-57.730L-22.622-58.010L-21.142-58.010L-21.142-57.730Q-21.521-57.730-21.521-57.569Q-21.521-57.559-21.508-57.518L-20.793-55.686L-20.120-57.391Q-20.151-57.463-20.151-57.491Q-20.151-57.518-20.178-57.518Q-20.240-57.665-20.358-57.697Q-20.476-57.730-20.687-57.730L-20.687-58.010L-19.290-58.010L-19.290-57.730Q-19.666-57.730-19.666-57.569Q-19.666-57.538-19.659-57.518L-18.903-55.580L-18.216-57.330Q-18.196-57.381-18.196-57.436Q-18.196-57.576-18.309-57.653Q-18.421-57.730-18.561-57.730L-18.561-58.010L-17.341-58.010L-17.341-57.730Q-17.546-57.730-17.702-57.624Q-17.857-57.518-17.929-57.330L-18.835-55.019Q-18.869-54.924-18.982-54.924L-19.050-54.924Q-19.160-54.924-19.197-55.019L-19.980-57.022L-20.766-55.019Q-20.800-54.924-20.913-54.924L-20.981-54.924Q-21.091-54.924-21.128-55.019\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(224.975 13.05)\">\u003Cpath d=\"M-16.953-55.720Q-16.953-56.052-16.730-56.279Q-16.506-56.506-16.162-56.634Q-15.819-56.763-15.446-56.815Q-15.074-56.868-14.769-56.868L-14.769-57.121Q-14.769-57.326-14.877-57.506Q-14.985-57.685-15.166-57.788Q-15.347-57.890-15.555-57.890Q-15.962-57.890-16.198-57.798Q-16.109-57.761-16.063-57.677Q-16.017-57.593-16.017-57.491Q-16.017-57.395-16.063-57.316Q-16.109-57.238-16.190-57.193Q-16.270-57.149-16.359-57.149Q-16.509-57.149-16.610-57.246Q-16.711-57.344-16.711-57.491Q-16.711-58.113-15.555-58.113Q-15.344-58.113-15.094-58.049Q-14.845-57.986-14.643-57.867Q-14.441-57.747-14.315-57.562Q-14.188-57.378-14.188-57.135L-14.188-55.559Q-14.188-55.443-14.127-55.347Q-14.065-55.252-13.952-55.252Q-13.843-55.252-13.778-55.346Q-13.713-55.440-13.713-55.559L-13.713-56.007L-13.447-56.007L-13.447-55.559Q-13.447-55.289-13.674-55.124Q-13.901-54.958-14.181-54.958Q-14.390-54.958-14.527-55.112Q-14.663-55.265-14.687-55.481Q-14.834-55.214-15.116-55.069Q-15.398-54.924-15.723-54.924Q-16-54.924-16.284-54.999Q-16.567-55.074-16.760-55.253Q-16.953-55.433-16.953-55.720M-16.338-55.720Q-16.338-55.546-16.237-55.416Q-16.137-55.286-15.981-55.216Q-15.826-55.146-15.661-55.146Q-15.443-55.146-15.234-55.243Q-15.026-55.341-14.898-55.522Q-14.769-55.703-14.769-55.929L-14.769-56.657Q-15.094-56.657-15.460-56.566Q-15.826-56.475-16.082-56.263Q-16.338-56.052-16.338-55.720M-11.280-54.992L-13.016-54.992L-13.016-55.272Q-12.787-55.272-12.638-55.306Q-12.490-55.341-12.490-55.481L-12.490-57.330Q-12.490-57.600-12.597-57.661Q-12.705-57.723-13.016-57.723L-13.016-58.003L-11.987-58.078L-11.987-57.371Q-11.857-57.679-11.615-57.878Q-11.372-58.078-11.054-58.078Q-10.835-58.078-10.664-57.954Q-10.493-57.829-10.493-57.617Q-10.493-57.480-10.593-57.381Q-10.692-57.282-10.825-57.282Q-10.962-57.282-11.061-57.381Q-11.160-57.480-11.160-57.617Q-11.160-57.757-11.061-57.856Q-11.351-57.856-11.551-57.660Q-11.751-57.463-11.844-57.169Q-11.936-56.875-11.936-56.595L-11.936-55.481Q-11.936-55.272-11.280-55.272L-11.280-54.992M-9.909-56.503Q-9.909-56.841-9.769-57.132Q-9.629-57.422-9.384-57.636Q-9.140-57.849-8.836-57.964Q-8.532-58.078-8.207-58.078Q-7.937-58.078-7.674-57.979Q-7.410-57.880-7.219-57.702L-7.219-59.100Q-7.219-59.370-7.327-59.432Q-7.434-59.493-7.745-59.493L-7.745-59.774L-6.669-59.849L-6.669-55.665Q-6.669-55.477-6.614-55.394Q-6.559-55.310-6.459-55.291Q-6.358-55.272-6.142-55.272L-6.142-54.992L-7.250-54.924L-7.250-55.341Q-7.667-54.924-8.292-54.924Q-8.723-54.924-9.096-55.136Q-9.468-55.347-9.689-55.708Q-9.909-56.069-9.909-56.503M-8.234-55.146Q-8.026-55.146-7.839-55.218Q-7.653-55.289-7.499-55.426Q-7.346-55.563-7.250-55.741L-7.250-57.350Q-7.335-57.497-7.481-57.617Q-7.626-57.737-7.795-57.796Q-7.964-57.856-8.145-57.856Q-8.706-57.856-8.974-57.467Q-9.243-57.077-9.243-56.496Q-9.243-55.925-9.008-55.535Q-8.774-55.146-8.234-55.146\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(224.975 13.05)\">\u003Cpath d=\"M-0.659-53.242Q-1.209-53.642-1.580-54.197Q-1.951-54.753-2.132-55.399Q-2.313-56.045-2.313-56.742Q-2.313-57.255-2.213-57.750Q-2.112-58.246-1.907-58.697Q-1.702-59.148-1.389-59.540Q-1.076-59.931-0.659-60.235Q-0.649-60.239-0.642-60.240Q-0.635-60.242-0.625-60.242L-0.557-60.242Q-0.522-60.242-0.500-60.218Q-0.478-60.194-0.478-60.157Q-0.478-60.112-0.505-60.095Q-0.854-59.794-1.107-59.410Q-1.360-59.025-1.512-58.584Q-1.664-58.143-1.736-57.687Q-1.808-57.231-1.808-56.742Q-1.808-55.741-1.498-54.854Q-1.189-53.967-0.505-53.382Q-0.478-53.365-0.478-53.321Q-0.478-53.283-0.500-53.259Q-0.522-53.235-0.557-53.235L-0.625-53.235Q-0.632-53.239-0.640-53.240Q-0.649-53.242-0.659-53.242M0.858-55.833L0.858-57.730L0.219-57.730L0.219-57.952Q0.537-57.952 0.754-58.162Q0.971-58.372 1.072-58.682Q1.173-58.991 1.173-59.299L1.439-59.299L1.439-58.010L2.516-58.010L2.516-57.730L1.439-57.730L1.439-55.846Q1.439-55.570 1.544-55.371Q1.648-55.173 1.908-55.173Q2.065-55.173 2.171-55.277Q2.277-55.382 2.326-55.535Q2.376-55.689 2.376-55.846L2.376-56.260L2.643-56.260L2.643-55.833Q2.643-55.607 2.543-55.397Q2.444-55.187 2.260-55.055Q2.075-54.924 1.846-54.924Q1.409-54.924 1.134-55.161Q0.858-55.399 0.858-55.833M5.203-54.992L3.466-54.992L3.466-55.272Q3.695-55.272 3.844-55.306Q3.993-55.341 3.993-55.481L3.993-57.330Q3.993-57.600 3.885-57.661Q3.777-57.723 3.466-57.723L3.466-58.003L4.495-58.078L4.495-57.371Q4.625-57.679 4.868-57.878Q5.110-58.078 5.428-58.078Q5.647-58.078 5.818-57.954Q5.989-57.829 5.989-57.617Q5.989-57.480 5.890-57.381Q5.791-57.282 5.657-57.282Q5.521-57.282 5.421-57.381Q5.322-57.480 5.322-57.617Q5.322-57.757 5.421-57.856Q5.131-57.856 4.931-57.660Q4.731-57.463 4.639-57.169Q4.546-56.875 4.546-56.595L4.546-55.481Q4.546-55.272 5.203-55.272L5.203-54.992M6.631-55.720Q6.631-56.052 6.855-56.279Q7.079-56.506 7.423-56.634Q7.766-56.763 8.139-56.815Q8.511-56.868 8.815-56.868L8.815-57.121Q8.815-57.326 8.708-57.506Q8.600-57.685 8.419-57.788Q8.238-57.890 8.029-57.890Q7.623-57.890 7.387-57.798Q7.476-57.761 7.522-57.677Q7.568-57.593 7.568-57.491Q7.568-57.395 7.522-57.316Q7.476-57.238 7.395-57.193Q7.315-57.149 7.226-57.149Q7.076-57.149 6.975-57.246Q6.874-57.344 6.874-57.491Q6.874-58.113 8.029-58.113Q8.241-58.113 8.491-58.049Q8.740-57.986 8.942-57.867Q9.144-57.747 9.270-57.562Q9.397-57.378 9.397-57.135L9.397-55.559Q9.397-55.443 9.458-55.347Q9.520-55.252 9.632-55.252Q9.742-55.252 9.807-55.346Q9.872-55.440 9.872-55.559L9.872-56.007L10.138-56.007L10.138-55.559Q10.138-55.289 9.911-55.124Q9.684-54.958 9.403-54.958Q9.195-54.958 9.058-55.112Q8.921-55.265 8.897-55.481Q8.751-55.214 8.469-55.069Q8.187-54.924 7.862-54.924Q7.585-54.924 7.301-54.999Q7.018-55.074 6.824-55.253Q6.631-55.433 6.631-55.720M7.247-55.720Q7.247-55.546 7.347-55.416Q7.448-55.286 7.604-55.216Q7.759-55.146 7.923-55.146Q8.142-55.146 8.351-55.243Q8.559-55.341 8.687-55.522Q8.815-55.703 8.815-55.929L8.815-56.657Q8.491-56.657 8.125-56.566Q7.759-56.475 7.503-56.263Q7.247-56.052 7.247-55.720M12.237-54.992L10.603-54.992L10.603-55.272Q10.832-55.272 10.981-55.306Q11.129-55.341 11.129-55.481L11.129-57.330Q11.129-57.600 11.022-57.661Q10.914-57.723 10.603-57.723L10.603-58.003L11.663-58.078L11.663-57.429Q11.834-57.737 12.138-57.908Q12.442-58.078 12.787-58.078Q13.293-58.078 13.577-57.855Q13.860-57.631 13.860-57.135L13.860-55.481Q13.860-55.344 14.009-55.308Q14.158-55.272 14.383-55.272L14.383-54.992L12.753-54.992L12.753-55.272Q12.982-55.272 13.131-55.306Q13.279-55.341 13.279-55.481L13.279-57.121Q13.279-57.456 13.160-57.656Q13.040-57.856 12.726-57.856Q12.456-57.856 12.221-57.720Q11.987-57.583 11.849-57.349Q11.710-57.115 11.710-56.841L11.710-55.481Q11.710-55.344 11.861-55.308Q12.011-55.272 12.237-55.272L12.237-54.992M14.971-54.999L14.971-56.062Q14.971-56.086 14.999-56.113Q15.026-56.140 15.050-56.140L15.159-56.140Q15.224-56.140 15.238-56.082Q15.334-55.648 15.580-55.397Q15.826-55.146 16.239-55.146Q16.581-55.146 16.834-55.279Q17.087-55.412 17.087-55.720Q17.087-55.877 16.993-55.992Q16.899-56.106 16.761-56.175Q16.622-56.243 16.455-56.281L15.874-56.380Q15.518-56.448 15.245-56.669Q14.971-56.889 14.971-57.231Q14.971-57.480 15.082-57.655Q15.193-57.829 15.380-57.928Q15.566-58.027 15.781-58.070Q15.997-58.113 16.239-58.113Q16.653-58.113 16.933-57.931L17.148-58.106Q17.159-58.109 17.166-58.111Q17.172-58.113 17.183-58.113L17.234-58.113Q17.261-58.113 17.285-58.089Q17.309-58.065 17.309-58.037L17.309-57.190Q17.309-57.169 17.285-57.142Q17.261-57.115 17.234-57.115L17.121-57.115Q17.094-57.115 17.068-57.140Q17.043-57.166 17.043-57.190Q17.043-57.426 16.937-57.590Q16.831-57.754 16.648-57.836Q16.465-57.918 16.232-57.918Q15.904-57.918 15.648-57.815Q15.392-57.713 15.392-57.436Q15.392-57.241 15.574-57.132Q15.757-57.022 15.986-56.981L16.561-56.875Q16.807-56.827 17.020-56.699Q17.234-56.571 17.371-56.368Q17.507-56.164 17.507-55.915Q17.507-55.402 17.142-55.163Q16.776-54.924 16.239-54.924Q15.744-54.924 15.412-55.218L15.146-54.944Q15.125-54.924 15.098-54.924L15.050-54.924Q15.026-54.924 14.999-54.951Q14.971-54.978 14.971-54.999M19.934-54.992L18.201-54.992L18.201-55.272Q18.427-55.272 18.575-55.306Q18.724-55.341 18.724-55.481L18.724-57.730L18.136-57.730L18.136-58.010L18.724-58.010L18.724-58.827Q18.724-59.145 18.902-59.393Q19.080-59.640 19.370-59.781Q19.661-59.921 19.972-59.921Q20.228-59.921 20.431-59.779Q20.635-59.637 20.635-59.394Q20.635-59.258 20.536-59.159Q20.437-59.059 20.300-59.059Q20.163-59.059 20.064-59.159Q19.965-59.258 19.965-59.394Q19.965-59.575 20.105-59.668Q20.026-59.695 19.927-59.695Q19.719-59.695 19.565-59.562Q19.411-59.429 19.331-59.225Q19.251-59.022 19.251-58.813L19.251-58.010L20.139-58.010L20.139-57.730L19.278-57.730L19.278-55.481Q19.278-55.272 19.934-55.272L19.934-54.992M20.573-56.527Q20.573-56.848 20.698-57.137Q20.823-57.426 21.048-57.649Q21.274-57.873 21.570-57.993Q21.865-58.113 22.183-58.113Q22.511-58.113 22.773-58.013Q23.034-57.914 23.210-57.732Q23.386-57.549 23.480-57.291Q23.574-57.033 23.574-56.701Q23.574-56.609 23.492-56.588L21.236-56.588L21.236-56.527Q21.236-55.939 21.520-55.556Q21.804-55.173 22.371-55.173Q22.692-55.173 22.961-55.366Q23.229-55.559 23.318-55.874Q23.325-55.915 23.400-55.929L23.492-55.929Q23.574-55.905 23.574-55.833Q23.574-55.826 23.567-55.799Q23.455-55.402 23.084-55.163Q22.713-54.924 22.289-54.924Q21.852-54.924 21.452-55.132Q21.052-55.341 20.813-55.708Q20.573-56.075 20.573-56.527M21.243-56.797L23.058-56.797Q23.058-57.074 22.961-57.326Q22.863-57.579 22.665-57.735Q22.467-57.890 22.183-57.890Q21.906-57.890 21.693-57.732Q21.479-57.573 21.361-57.318Q21.243-57.063 21.243-56.797M25.912-54.992L24.176-54.992L24.176-55.272Q24.405-55.272 24.553-55.306Q24.702-55.341 24.702-55.481L24.702-57.330Q24.702-57.600 24.595-57.661Q24.487-57.723 24.176-57.723L24.176-58.003L25.205-58.078L25.205-57.371Q25.334-57.679 25.577-57.878Q25.820-58.078 26.138-58.078Q26.356-58.078 26.527-57.954Q26.698-57.829 26.698-57.617Q26.698-57.480 26.599-57.381Q26.500-57.282 26.367-57.282Q26.230-57.282 26.131-57.381Q26.032-57.480 26.032-57.617Q26.032-57.757 26.131-57.856Q25.840-57.856 25.640-57.660Q25.440-57.463 25.348-57.169Q25.256-56.875 25.256-56.595L25.256-55.481Q25.256-55.272 25.912-55.272L25.912-54.992M27.283-54.999L27.283-56.062Q27.283-56.086 27.310-56.113Q27.337-56.140 27.361-56.140L27.471-56.140Q27.536-56.140 27.549-56.082Q27.645-55.648 27.891-55.397Q28.137-55.146 28.551-55.146Q28.893-55.146 29.146-55.279Q29.398-55.412 29.398-55.720Q29.398-55.877 29.304-55.992Q29.210-56.106 29.072-56.175Q28.934-56.243 28.766-56.281L28.185-56.380Q27.830-56.448 27.556-56.669Q27.283-56.889 27.283-57.231Q27.283-57.480 27.394-57.655Q27.505-57.829 27.691-57.928Q27.877-58.027 28.093-58.070Q28.308-58.113 28.551-58.113Q28.964-58.113 29.245-57.931L29.460-58.106Q29.470-58.109 29.477-58.111Q29.484-58.113 29.494-58.113L29.545-58.113Q29.573-58.113 29.597-58.089Q29.621-58.065 29.621-58.037L29.621-57.190Q29.621-57.169 29.597-57.142Q29.573-57.115 29.545-57.115L29.433-57.115Q29.405-57.115 29.380-57.140Q29.354-57.166 29.354-57.190Q29.354-57.426 29.248-57.590Q29.142-57.754 28.959-57.836Q28.776-57.918 28.544-57.918Q28.216-57.918 27.959-57.815Q27.703-57.713 27.703-57.436Q27.703-57.241 27.886-57.132Q28.069-57.022 28.298-56.981L28.872-56.875Q29.118-56.827 29.332-56.699Q29.545-56.571 29.682-56.368Q29.819-56.164 29.819-55.915Q29.819-55.402 29.453-55.163Q29.087-54.924 28.551-54.924Q28.055-54.924 27.724-55.218L27.457-54.944Q27.437-54.924 27.409-54.924L27.361-54.924Q27.337-54.924 27.310-54.951Q27.283-54.978 27.283-54.999M30.769-53.235L30.701-53.235Q30.667-53.235 30.644-53.261Q30.622-53.286 30.622-53.321Q30.622-53.365 30.653-53.382Q31.008-53.686 31.258-54.076Q31.507-54.466 31.659-54.898Q31.812-55.330 31.882-55.799Q31.952-56.267 31.952-56.742Q31.952-57.221 31.882-57.687Q31.812-58.154 31.658-58.589Q31.504-59.025 31.253-59.413Q31.001-59.801 30.653-60.095Q30.622-60.112 30.622-60.157Q30.622-60.191 30.644-60.216Q30.667-60.242 30.701-60.242L30.769-60.242Q30.779-60.242 30.788-60.240Q30.796-60.239 30.807-60.235Q31.350-59.835 31.723-59.282Q32.095-58.728 32.276-58.082Q32.458-57.436 32.458-56.742Q32.458-56.041 32.276-55.394Q32.095-54.746 31.721-54.192Q31.347-53.638 30.807-53.242Q30.796-53.242 30.788-53.240Q30.779-53.239 30.769-53.235\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-accent)\" stroke=\"none\" d=\"M-46.332-54.992a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(2.887 -7.8)\">\u003Cpath d=\"M-53.487-54.992L-56.460-54.992L-56.460-55.272Q-55.739-55.272-55.739-55.481L-55.739-59.282Q-55.739-59.493-56.460-59.493L-56.460-59.774L-53.702-59.774Q-53.435-59.774-53.129-59.699Q-52.824-59.623-52.564-59.476Q-52.304-59.329-52.142-59.100Q-51.979-58.871-51.979-58.577Q-51.979-58.147-52.366-57.865Q-52.752-57.583-53.234-57.491Q-52.926-57.491-52.577-57.326Q-52.229-57.162-52-56.884Q-51.771-56.605-51.771-56.287Q-51.771-55.881-52.034-55.587Q-52.297-55.293-52.695-55.142Q-53.094-54.992-53.487-54.992M-55.096-57.364L-55.096-55.481Q-55.096-55.341-55.008-55.306Q-54.919-55.272-54.731-55.272L-53.702-55.272Q-53.415-55.272-53.138-55.399Q-52.861-55.525-52.690-55.759Q-52.519-55.993-52.519-56.287Q-52.519-56.503-52.601-56.699Q-52.683-56.896-52.834-57.046Q-52.984-57.197-53.181-57.280Q-53.377-57.364-53.593-57.364L-55.096-57.364M-55.096-59.282L-55.096-57.590L-53.914-57.590Q-53.627-57.590-53.346-57.709Q-53.066-57.829-52.887-58.056Q-52.707-58.284-52.707-58.577Q-52.707-58.827-52.846-59.041Q-52.984-59.254-53.213-59.374Q-53.442-59.493-53.702-59.493L-54.731-59.493Q-54.919-59.493-55.008-59.459Q-55.096-59.425-55.096-59.282M-50.793-57.385Q-50.793-57.911-50.576-58.379Q-50.359-58.847-49.976-59.193Q-49.594-59.538-49.110-59.726Q-48.626-59.914-48.096-59.914Q-47.693-59.914-47.329-59.757Q-46.965-59.599-46.681-59.305L-46.258-59.887Q-46.223-59.914-46.200-59.914L-46.152-59.914Q-46.121-59.914-46.097-59.890Q-46.073-59.866-46.073-59.835L-46.073-57.972Q-46.073-57.949-46.099-57.923Q-46.124-57.897-46.152-57.897L-46.278-57.897Q-46.340-57.897-46.353-57.972Q-46.384-58.287-46.519-58.591Q-46.654-58.895-46.869-59.129Q-47.085-59.364-47.374-59.499Q-47.662-59.634-47.991-59.634Q-48.633-59.634-49.091-59.340Q-49.549-59.046-49.782-58.533Q-50.014-58.020-50.014-57.385Q-50.014-56.913-49.884-56.504Q-49.754-56.096-49.494-55.783Q-49.235-55.471-48.855-55.301Q-48.476-55.132-47.984-55.132Q-47.656-55.132-47.362-55.248Q-47.068-55.365-46.834-55.580Q-46.599-55.795-46.470-56.084Q-46.340-56.373-46.340-56.701Q-46.340-56.728-46.312-56.752Q-46.285-56.776-46.264-56.776L-46.152-56.776Q-46.114-56.776-46.094-56.751Q-46.073-56.725-46.073-56.687Q-46.073-56.291-46.239-55.954Q-46.405-55.617-46.692-55.370Q-46.979-55.122-47.348-54.987Q-47.717-54.852-48.096-54.852Q-48.616-54.852-49.108-55.042Q-49.600-55.231-49.980-55.575Q-50.359-55.918-50.576-56.387Q-50.793-56.855-50.793-57.385\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-accent)\" stroke=\"none\" d=\"M19.11-54.992a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(60.797 -9.162)\">\u003Cpath d=\"M-53.702-54.992L-56.474-54.992L-56.474-55.272Q-55.753-55.272-55.753-55.481L-55.753-59.282Q-55.753-59.493-56.474-59.493L-56.474-59.774L-53.702-59.774Q-53.217-59.774-52.781-59.579Q-52.345-59.384-52.022-59.042Q-51.699-58.700-51.521-58.260Q-51.344-57.819-51.344-57.337Q-51.344-56.851-51.528-56.428Q-51.713-56.004-52.036-55.682Q-52.359-55.361-52.791-55.177Q-53.223-54.992-53.702-54.992M-55.090-59.282L-55.090-55.481Q-55.090-55.341-55.001-55.306Q-54.912-55.272-54.724-55.272L-53.900-55.272Q-53.275-55.272-52.871-55.534Q-52.468-55.795-52.280-56.262Q-52.092-56.728-52.092-57.337Q-52.092-57.815-52.184-58.208Q-52.277-58.601-52.526-58.899Q-52.765-59.186-53.129-59.340Q-53.493-59.493-53.900-59.493L-54.724-59.493Q-54.912-59.493-55.001-59.459Q-55.090-59.425-55.090-59.282\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(60.797 -9.162)\">\u003Cpath d=\"M-49.158-54.992L-50.748-54.992L-50.748-55.272Q-50.105-55.272-49.948-55.672L-48.304-59.887Q-48.270-59.982-48.157-59.982L-48.075-59.982Q-47.965-59.982-47.924-59.887L-46.205-55.481Q-46.137-55.341-45.947-55.306Q-45.757-55.272-45.484-55.272L-45.484-54.992L-47.483-54.992L-47.483-55.272Q-46.919-55.272-46.919-55.447Q-46.919-55.464-46.921-55.471Q-46.923-55.477-46.926-55.481L-47.347-56.547L-49.305-56.547L-49.647-55.672Q-49.661-55.672-49.661-55.594Q-49.661-55.433-49.498-55.353Q-49.336-55.272-49.158-55.272L-49.158-54.992M-48.324-59.066L-49.192-56.827L-47.449-56.827L-48.324-59.066M-44.889-54.459Q-44.889-54.705-44.693-54.889Q-44.496-55.074-44.240-55.153Q-44.376-55.265-44.448-55.426Q-44.520-55.587-44.520-55.768Q-44.520-56.089-44.308-56.335Q-44.643-56.633-44.643-57.043Q-44.643-57.504-44.253-57.791Q-43.864-58.078-43.385-58.078Q-42.914-58.078-42.579-57.832Q-42.404-57.986-42.194-58.068Q-41.984-58.150-41.755-58.150Q-41.591-58.150-41.469-58.043Q-41.348-57.935-41.348-57.771Q-41.348-57.675-41.420-57.603Q-41.492-57.532-41.584-57.532Q-41.683-57.532-41.753-57.605Q-41.823-57.679-41.823-57.778Q-41.823-57.832-41.810-57.863L-41.803-57.877Q-41.796-57.897-41.787-57.908Q-41.779-57.918-41.775-57.925Q-42.131-57.925-42.418-57.702Q-42.131-57.409-42.131-57.043Q-42.131-56.728-42.315-56.496Q-42.500-56.263-42.789-56.135Q-43.078-56.007-43.385-56.007Q-43.587-56.007-43.778-56.057Q-43.970-56.106-44.147-56.216Q-44.240-56.089-44.240-55.946Q-44.240-55.764-44.112-55.629Q-43.983-55.494-43.799-55.494L-43.166-55.494Q-42.719-55.494-42.350-55.423Q-41.980-55.351-41.721-55.122Q-41.461-54.893-41.461-54.459Q-41.461-54.138-41.757-53.936Q-42.052-53.734-42.456-53.645Q-42.859-53.556-43.173-53.556Q-43.491-53.556-43.895-53.645Q-44.298-53.734-44.593-53.936Q-44.889-54.138-44.889-54.459M-44.435-54.459Q-44.435-54.230-44.216-54.081Q-43.997-53.932-43.705-53.864Q-43.413-53.796-43.173-53.796Q-43.009-53.796-42.801-53.832Q-42.592-53.867-42.385-53.948Q-42.179-54.028-42.047-54.156Q-41.916-54.284-41.916-54.459Q-41.916-54.811-42.297-54.905Q-42.678-54.999-43.180-54.999L-43.799-54.999Q-44.038-54.999-44.236-54.848Q-44.435-54.698-44.435-54.459M-43.385-56.246Q-42.719-56.246-42.719-57.043Q-42.719-57.843-43.385-57.843Q-44.055-57.843-44.055-57.043Q-44.055-56.246-43.385-56.246M-40.907-54.459Q-40.907-54.705-40.711-54.889Q-40.514-55.074-40.258-55.153Q-40.395-55.265-40.466-55.426Q-40.538-55.587-40.538-55.768Q-40.538-56.089-40.326-56.335Q-40.661-56.633-40.661-57.043Q-40.661-57.504-40.271-57.791Q-39.882-58.078-39.403-58.078Q-38.932-58.078-38.597-57.832Q-38.422-57.986-38.212-58.068Q-38.002-58.150-37.773-58.150Q-37.609-58.150-37.488-58.043Q-37.366-57.935-37.366-57.771Q-37.366-57.675-37.438-57.603Q-37.510-57.532-37.602-57.532Q-37.701-57.532-37.771-57.605Q-37.841-57.679-37.841-57.778Q-37.841-57.832-37.828-57.863L-37.821-57.877Q-37.814-57.897-37.805-57.908Q-37.797-57.918-37.793-57.925Q-38.149-57.925-38.436-57.702Q-38.149-57.409-38.149-57.043Q-38.149-56.728-38.333-56.496Q-38.518-56.263-38.807-56.135Q-39.096-56.007-39.403-56.007Q-39.605-56.007-39.796-56.057Q-39.988-56.106-40.166-56.216Q-40.258-56.089-40.258-55.946Q-40.258-55.764-40.130-55.629Q-40.001-55.494-39.817-55.494L-39.185-55.494Q-38.737-55.494-38.368-55.423Q-37.999-55.351-37.739-55.122Q-37.479-54.893-37.479-54.459Q-37.479-54.138-37.775-53.936Q-38.070-53.734-38.474-53.645Q-38.877-53.556-39.191-53.556Q-39.509-53.556-39.913-53.645Q-40.316-53.734-40.612-53.936Q-40.907-54.138-40.907-54.459M-40.453-54.459Q-40.453-54.230-40.234-54.081Q-40.015-53.932-39.723-53.864Q-39.431-53.796-39.191-53.796Q-39.027-53.796-38.819-53.832Q-38.610-53.867-38.404-53.948Q-38.197-54.028-38.065-54.156Q-37.934-54.284-37.934-54.459Q-37.934-54.811-38.315-54.905Q-38.696-54.999-39.198-54.999L-39.817-54.999Q-40.056-54.999-40.254-54.848Q-40.453-54.698-40.453-54.459M-39.403-56.246Q-38.737-56.246-38.737-57.043Q-38.737-57.843-39.403-57.843Q-40.073-57.843-40.073-57.043Q-40.073-56.246-39.403-56.246M-36.925-56.527Q-36.925-56.848-36.801-57.137Q-36.676-57.426-36.450-57.649Q-36.225-57.873-35.929-57.993Q-35.633-58.113-35.315-58.113Q-34.987-58.113-34.726-58.013Q-34.464-57.914-34.288-57.732Q-34.112-57.549-34.018-57.291Q-33.924-57.033-33.924-56.701Q-33.924-56.609-34.006-56.588L-36.262-56.588L-36.262-56.527Q-36.262-55.939-35.979-55.556Q-35.695-55.173-35.127-55.173Q-34.806-55.173-34.538-55.366Q-34.270-55.559-34.181-55.874Q-34.174-55.915-34.099-55.929L-34.006-55.929Q-33.924-55.905-33.924-55.833Q-33.924-55.826-33.931-55.799Q-34.044-55.402-34.415-55.163Q-34.786-54.924-35.209-54.924Q-35.647-54.924-36.047-55.132Q-36.447-55.341-36.686-55.708Q-36.925-56.075-36.925-56.527M-36.255-56.797L-34.440-56.797Q-34.440-57.074-34.538-57.326Q-34.635-57.579-34.833-57.735Q-35.032-57.890-35.315-57.890Q-35.592-57.890-35.806-57.732Q-36.020-57.573-36.137-57.318Q-36.255-57.063-36.255-56.797M-31.586-54.992L-33.323-54.992L-33.323-55.272Q-33.094-55.272-32.945-55.306Q-32.796-55.341-32.796-55.481L-32.796-57.330Q-32.796-57.600-32.904-57.661Q-33.012-57.723-33.323-57.723L-33.323-58.003L-32.294-58.078L-32.294-57.371Q-32.164-57.679-31.921-57.878Q-31.679-58.078-31.361-58.078Q-31.142-58.078-30.971-57.954Q-30.800-57.829-30.800-57.617Q-30.800-57.480-30.899-57.381Q-30.999-57.282-31.132-57.282Q-31.269-57.282-31.368-57.381Q-31.467-57.480-31.467-57.617Q-31.467-57.757-31.368-57.856Q-31.658-57.856-31.858-57.660Q-32.058-57.463-32.150-57.169Q-32.243-56.875-32.243-56.595L-32.243-55.481Q-32.243-55.272-31.586-55.272\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-warn)\" stroke=\"none\" d=\"M98.777-54.992a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg transform=\"translate(143.683 -7.8)\">\u003Cpath d=\"M-56.378-57.385Q-56.378-57.911-56.161-58.379Q-55.944-58.847-55.561-59.193Q-55.179-59.538-54.695-59.726Q-54.211-59.914-53.681-59.914Q-53.411-59.914-53.155-59.842Q-52.899-59.770-52.670-59.630Q-52.441-59.490-52.260-59.305L-51.832-59.887Q-51.805-59.914-51.778-59.914L-51.730-59.914Q-51.699-59.914-51.675-59.890Q-51.651-59.866-51.651-59.835L-51.651-57.972Q-51.651-57.949-51.677-57.923Q-51.702-57.897-51.730-57.897L-51.856-57.897Q-51.918-57.897-51.931-57.972Q-51.962-58.287-52.097-58.591Q-52.232-58.895-52.448-59.129Q-52.663-59.364-52.952-59.499Q-53.241-59.634-53.569-59.634Q-54.215-59.634-54.674-59.338Q-55.134-59.042-55.367-58.531Q-55.599-58.020-55.599-57.385Q-55.599-56.735-55.353-56.222Q-55.107-55.710-54.633-55.421Q-54.160-55.132-53.507-55.132Q-53.247-55.132-52.981-55.199Q-52.714-55.265-52.530-55.426Q-52.345-55.587-52.345-55.846L-52.345-56.434Q-52.345-56.643-53.312-56.643L-53.312-56.923L-51.115-56.923L-51.115-56.643Q-51.344-56.643-51.497-56.607Q-51.651-56.571-51.651-56.434L-51.651-55.071Q-51.651-55.036-51.680-55.014Q-51.709-54.992-51.737-54.992Q-51.798-54.992-51.969-55.153Q-52.140-55.313-52.198-55.399Q-52.400-55.098-52.806-54.975Q-53.213-54.852-53.681-54.852Q-54.201-54.852-54.693-55.042Q-55.185-55.231-55.565-55.575Q-55.944-55.918-56.161-56.387Q-56.378-56.855-56.378-57.385M-48.784-54.992L-50.373-54.992L-50.373-55.272Q-49.730-55.272-49.573-55.672L-47.929-59.887Q-47.895-59.982-47.782-59.982L-47.700-59.982Q-47.591-59.982-47.550-59.887L-45.830-55.481Q-45.762-55.341-45.572-55.306Q-45.383-55.272-45.109-55.272L-45.109-54.992L-47.109-54.992L-47.109-55.272Q-46.545-55.272-46.545-55.447Q-46.545-55.464-46.546-55.471Q-46.548-55.477-46.552-55.481L-46.972-56.547L-48.930-56.547L-49.272-55.672Q-49.286-55.672-49.286-55.594Q-49.286-55.433-49.124-55.353Q-48.961-55.272-48.784-55.272L-48.784-54.992M-47.950-59.066L-48.818-56.827L-47.075-56.827L-47.950-59.066M-42.242-54.992L-44.446-54.992L-44.446-55.272Q-43.687-55.272-43.687-55.481L-43.687-59.282Q-43.687-59.493-44.446-59.493L-44.446-59.774L-42.242-59.774L-42.242-59.493Q-42.997-59.493-42.997-59.282L-42.997-55.481Q-42.997-55.272-42.242-55.272L-42.242-54.992M-37.555-54.992L-41.524-54.992L-41.524-55.272Q-40.803-55.272-40.803-55.481L-40.803-59.282Q-40.803-59.493-41.524-59.493L-41.524-59.774L-39.210-59.774L-39.210-59.493Q-39.528-59.493-39.820-59.458Q-40.112-59.422-40.112-59.282L-40.112-55.481Q-40.112-55.341-40.023-55.306Q-39.934-55.272-39.746-55.272L-39.124-55.272Q-38.711-55.272-38.432-55.375Q-38.154-55.477-37.988-55.679Q-37.822-55.881-37.740-56.168Q-37.658-56.455-37.614-56.862L-37.347-56.862\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-warn)\" stroke=\"none\" d=\"M164.219-54.992a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(196.878 -7.8)\">\u003Cpath d=\"M-54.710-54.992L-56.447-54.992L-56.447-55.272Q-55.725-55.272-55.725-55.672L-55.725-59.282Q-55.725-59.493-56.447-59.493L-56.447-59.774L-55.090-59.774Q-54.994-59.774-54.943-59.675L-53.268-55.700L-51.596-59.675Q-51.549-59.774-51.450-59.774L-50.099-59.774L-50.099-59.493Q-50.821-59.493-50.821-59.282L-50.821-55.481Q-50.821-55.272-50.099-55.272L-50.099-54.992L-52.157-54.992L-52.157-55.272Q-51.436-55.272-51.436-55.481L-51.436-59.493L-53.288-55.091Q-53.336-54.992-53.446-54.992Q-53.558-54.992-53.606-55.091L-55.431-59.422L-55.431-55.672Q-55.431-55.272-54.710-55.272L-54.710-54.992M-49.306-55.720Q-49.306-56.052-49.083-56.279Q-48.859-56.506-48.515-56.634Q-48.172-56.763-47.799-56.815Q-47.427-56.868-47.122-56.868L-47.122-57.121Q-47.122-57.326-47.230-57.506Q-47.338-57.685-47.519-57.788Q-47.700-57.890-47.909-57.890Q-48.315-57.890-48.551-57.798Q-48.462-57.761-48.416-57.677Q-48.370-57.593-48.370-57.491Q-48.370-57.395-48.416-57.316Q-48.462-57.238-48.543-57.193Q-48.623-57.149-48.712-57.149Q-48.862-57.149-48.963-57.246Q-49.064-57.344-49.064-57.491Q-49.064-58.113-47.909-58.113Q-47.697-58.113-47.447-58.049Q-47.198-57.986-46.996-57.867Q-46.794-57.747-46.668-57.562Q-46.541-57.378-46.541-57.135L-46.541-55.559Q-46.541-55.443-46.480-55.347Q-46.418-55.252-46.305-55.252Q-46.196-55.252-46.131-55.346Q-46.066-55.440-46.066-55.559L-46.066-56.007L-45.800-56.007L-45.800-55.559Q-45.800-55.289-46.027-55.124Q-46.254-54.958-46.534-54.958Q-46.743-54.958-46.880-55.112Q-47.016-55.265-47.040-55.481Q-47.187-55.214-47.469-55.069Q-47.751-54.924-48.076-54.924Q-48.353-54.924-48.637-54.999Q-48.920-55.074-49.113-55.253Q-49.306-55.433-49.306-55.720M-48.691-55.720Q-48.691-55.546-48.590-55.416Q-48.490-55.286-48.334-55.216Q-48.179-55.146-48.014-55.146Q-47.796-55.146-47.587-55.243Q-47.379-55.341-47.251-55.522Q-47.122-55.703-47.122-55.929L-47.122-56.657Q-47.447-56.657-47.813-56.566Q-48.179-56.475-48.435-56.263Q-48.691-56.052-48.691-55.720M-44.200-54.992L-45.523-54.992L-45.523-55.272Q-44.962-55.272-44.583-55.672L-43.868-56.469L-44.781-57.518Q-44.918-57.665-45.066-57.697Q-45.215-57.730-45.482-57.730L-45.482-58.010L-43.981-58.010L-43.981-57.730Q-44.173-57.730-44.173-57.596Q-44.173-57.566-44.142-57.518L-43.547-56.834L-43.106-57.330Q-42.993-57.460-42.993-57.576Q-42.993-57.638-43.031-57.684Q-43.069-57.730-43.127-57.730L-43.127-58.010L-41.811-58.010L-41.811-57.730Q-42.371-57.730-42.751-57.330L-43.373-56.629L-42.378-55.481Q-42.279-55.382-42.178-55.337Q-42.077-55.293-41.966-55.283Q-41.855-55.272-41.678-55.272L-41.678-54.992L-43.171-54.992L-43.171-55.272Q-43.106-55.272-43.046-55.306Q-42.987-55.341-42.987-55.406Q-42.987-55.453-43.017-55.481L-43.694-56.267L-44.227-55.672Q-44.340-55.542-44.340-55.426Q-44.340-55.361-44.299-55.317Q-44.258-55.272-44.200-55.272L-44.200-54.992M-36.715-54.992L-41.117-54.992L-41.117-55.272Q-40.396-55.272-40.396-55.481L-40.396-59.282Q-40.396-59.493-41.117-59.493L-41.117-59.774L-36.827-59.774L-36.619-58.137L-36.882-58.137Q-36.940-58.608-37.043-58.873Q-37.145-59.138-37.330-59.271Q-37.514-59.405-37.786-59.449Q-38.058-59.493-38.557-59.493L-39.340-59.493Q-39.528-59.493-39.617-59.459Q-39.705-59.425-39.705-59.282L-39.705-57.617L-39.131-57.617Q-38.742-57.617-38.559-57.668Q-38.376-57.720-38.294-57.892Q-38.212-58.065-38.212-58.437L-37.949-58.437L-37.949-56.516L-38.212-56.516Q-38.212-56.889-38.294-57.062Q-38.376-57.234-38.559-57.285Q-38.742-57.337-39.131-57.337L-39.705-57.337L-39.705-55.481Q-39.705-55.341-39.617-55.306Q-39.528-55.272-39.340-55.272L-38.492-55.272Q-37.962-55.272-37.653-55.341Q-37.344-55.409-37.156-55.576Q-36.968-55.744-36.860-56.046Q-36.752-56.349-36.667-56.862L-36.400-56.862L-36.715-54.992M-34.131-54.992L-35.764-54.992L-35.764-55.272Q-35.535-55.272-35.387-55.306Q-35.238-55.341-35.238-55.481L-35.238-57.330Q-35.238-57.600-35.346-57.661Q-35.453-57.723-35.764-57.723L-35.764-58.003L-34.705-58.078L-34.705-57.429Q-34.534-57.737-34.230-57.908Q-33.926-58.078-33.580-58.078Q-33.075-58.078-32.791-57.855Q-32.507-57.631-32.507-57.135L-32.507-55.481Q-32.507-55.344-32.358-55.308Q-32.210-55.272-31.984-55.272L-31.984-54.992L-33.615-54.992L-33.615-55.272Q-33.386-55.272-33.237-55.306Q-33.088-55.341-33.088-55.481L-33.088-57.121Q-33.088-57.456-33.208-57.656Q-33.327-57.856-33.642-57.856Q-33.912-57.856-34.146-57.720Q-34.380-57.583-34.519-57.349Q-34.657-57.115-34.657-56.841L-34.657-55.481Q-34.657-55.344-34.507-55.308Q-34.356-55.272-34.131-55.272\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(196.878 -7.8)\">\u003Cpath d=\"M-31.068-55.833L-31.068-57.730L-31.707-57.730L-31.707-57.952Q-31.389-57.952-31.172-58.162Q-30.955-58.372-30.855-58.682Q-30.754-58.991-30.754-59.299L-30.487-59.299L-30.487-58.010L-29.410-58.010L-29.410-57.730L-30.487-57.730L-30.487-55.846Q-30.487-55.570-30.383-55.371Q-30.279-55.173-30.019-55.173Q-29.862-55.173-29.756-55.277Q-29.650-55.382-29.600-55.535Q-29.551-55.689-29.551-55.846L-29.551-56.260L-29.284-56.260L-29.284-55.833Q-29.284-55.607-29.383-55.397Q-29.482-55.187-29.667-55.055Q-29.851-54.924-30.080-54.924Q-30.518-54.924-30.793-55.161Q-31.068-55.399-31.068-55.833\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(196.878 -7.8)\">\u003Cpath d=\"M-23.543-54.992L-25.747-54.992L-25.747-55.272Q-24.988-55.272-24.988-55.481L-24.988-59.282Q-24.988-59.493-25.747-59.493L-25.747-59.774L-23.543-59.774L-23.543-59.493Q-24.298-59.493-24.298-59.282L-24.298-55.481Q-24.298-55.272-23.543-55.272L-23.543-54.992M-20.706-54.992L-22.811-54.992L-22.811-55.272Q-22.090-55.272-22.090-55.481L-22.090-59.282Q-22.090-59.493-22.811-59.493L-22.811-59.774L-20.473-59.774Q-20.162-59.774-19.819-59.700Q-19.475-59.627-19.154-59.471Q-18.833-59.316-18.631-59.070Q-18.429-58.824-18.429-58.499Q-18.429-58.212-18.617-57.981Q-18.805-57.750-19.082-57.602Q-19.359-57.453-19.650-57.371Q-19.315-57.268-19.080-57.036Q-18.846-56.804-18.802-56.475L-18.716-55.867Q-18.689-55.655-18.643-55.486Q-18.597-55.317-18.493-55.197Q-18.388-55.077-18.200-55.077Q-17.985-55.077-17.869-55.262Q-17.753-55.447-17.753-55.679Q-17.735-55.744-17.660-55.761L-17.568-55.761Q-17.486-55.741-17.486-55.659Q-17.486-55.453-17.577-55.267Q-17.667-55.081-17.833-54.966Q-17.999-54.852-18.200-54.852Q-18.539-54.852-18.833-54.953Q-19.127-55.054-19.311-55.276Q-19.496-55.498-19.496-55.846L-19.496-56.455Q-19.496-56.704-19.639-56.891Q-19.783-57.077-20.007-57.176Q-20.231-57.275-20.480-57.275L-21.427-57.275L-21.427-55.481Q-21.427-55.272-20.706-55.272L-20.706-54.992M-21.427-59.282L-21.427-57.497L-20.572-57.497Q-20.285-57.497-20.046-57.540Q-19.807-57.583-19.619-57.692Q-19.431-57.802-19.320-58Q-19.209-58.198-19.209-58.499Q-19.209-59.076-19.576-59.285Q-19.943-59.493-20.572-59.493L-21.061-59.493Q-21.249-59.493-21.338-59.459Q-21.427-59.425-21.427-59.282M-13.053-54.992L-17.021-54.992L-17.021-55.272Q-16.300-55.272-16.300-55.481L-16.300-59.282Q-16.300-59.493-17.021-59.493L-17.021-59.774L-14.707-59.774L-14.707-59.493Q-15.025-59.493-15.317-59.458Q-15.610-59.422-15.610-59.282L-15.610-55.481Q-15.610-55.341-15.521-55.306Q-15.432-55.272-15.244-55.272L-14.622-55.272Q-14.208-55.272-13.930-55.375Q-13.651-55.477-13.485-55.679Q-13.319-55.881-13.237-56.168Q-13.155-56.455-13.111-56.862L-12.844-56.862\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-warn)\" stroke=\"none\" d=\"M241.04-54.992a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg transform=\"translate(286.137 -7.8)\">\u003Cpath d=\"M-54.963-54.992L-56.553-54.992L-56.553-55.272Q-55.910-55.272-55.753-55.672L-54.109-59.887Q-54.075-59.982-53.962-59.982L-53.880-59.982Q-53.770-59.982-53.729-59.887L-52.010-55.481Q-51.942-55.341-51.752-55.306Q-51.562-55.272-51.289-55.272L-51.289-54.992L-53.288-54.992L-53.288-55.272Q-52.724-55.272-52.724-55.447Q-52.724-55.464-52.726-55.471Q-52.728-55.477-52.731-55.481L-53.152-56.547L-55.110-56.547L-55.452-55.672Q-55.466-55.672-55.466-55.594Q-55.466-55.433-55.303-55.353Q-55.141-55.272-54.963-55.272L-54.963-54.992M-54.129-59.066L-54.997-56.827L-53.254-56.827L-54.129-59.066M-48.421-54.992L-50.626-54.992L-50.626-55.272Q-49.867-55.272-49.867-55.481L-49.867-59.282Q-49.867-59.493-50.626-59.493L-50.626-59.774L-48.421-59.774L-48.421-59.493Q-49.177-59.493-49.177-59.282L-49.177-55.481Q-49.177-55.272-48.421-55.272L-48.421-54.992M-45.584-54.992L-47.690-54.992L-47.690-55.272Q-46.969-55.272-46.969-55.481L-46.969-59.282Q-46.969-59.493-47.690-59.493L-47.690-59.774L-45.352-59.774Q-45.041-59.774-44.697-59.700Q-44.354-59.627-44.033-59.471Q-43.711-59.316-43.510-59.070Q-43.308-58.824-43.308-58.499Q-43.308-58.212-43.496-57.981Q-43.684-57.750-43.961-57.602Q-44.238-57.453-44.528-57.371Q-44.193-57.268-43.959-57.036Q-43.725-56.804-43.680-56.475L-43.595-55.867Q-43.568-55.655-43.522-55.486Q-43.475-55.317-43.371-55.197Q-43.267-55.077-43.079-55.077Q-42.864-55.077-42.747-55.262Q-42.631-55.447-42.631-55.679Q-42.614-55.744-42.539-55.761L-42.447-55.761Q-42.365-55.741-42.365-55.659Q-42.365-55.453-42.455-55.267Q-42.546-55.081-42.711-54.966Q-42.877-54.852-43.079-54.852Q-43.417-54.852-43.711-54.953Q-44.005-55.054-44.190-55.276Q-44.374-55.498-44.374-55.846L-44.374-56.455Q-44.374-56.704-44.518-56.891Q-44.661-57.077-44.885-57.176Q-45.109-57.275-45.359-57.275L-46.305-57.275L-46.305-55.481Q-46.305-55.272-45.584-55.272L-45.584-54.992M-46.305-59.282L-46.305-57.497L-45.451-57.497Q-45.164-57.497-44.925-57.540Q-44.685-57.583-44.497-57.692Q-44.309-57.802-44.198-58Q-44.087-58.198-44.087-58.499Q-44.087-59.076-44.455-59.285Q-44.822-59.493-45.451-59.493L-45.940-59.493Q-46.128-59.493-46.217-59.459Q-46.305-59.425-46.305-59.282M-37.931-54.992L-41.900-54.992L-41.900-55.272Q-41.179-55.272-41.179-55.481L-41.179-59.282Q-41.179-59.493-41.900-59.493L-41.900-59.774L-39.586-59.774L-39.586-59.493Q-39.904-59.493-40.196-59.458Q-40.488-59.422-40.488-59.282L-40.488-55.481Q-40.488-55.341-40.399-55.306Q-40.310-55.272-40.122-55.272L-39.500-55.272Q-39.087-55.272-38.808-55.375Q-38.530-55.477-38.364-55.679Q-38.198-55.881-38.116-56.168Q-38.034-56.455-37.990-56.862L-37.723-56.862\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The imitation-learning family as a single spectrum. Behavioral cloning copies actions; DAgger copies actions on the learner's own states; GAIL matches occupancy without a reward; MaxEnt IRL, Guided Cost Learning, and AIRL recover an explicit reward, trading more computation for a transferable object.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:451.071px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 338.303 117.724\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-37.936 25.667H227.52\"\u002F>\u003Cpath stroke=\"none\" d=\"m229.52 25.667-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(234.585 8.898)\">\u003Cpath d=\"M-31.964 25.659L-31.964 24.437Q-31.964 24.409-31.932 24.378Q-31.901 24.347-31.878 24.347L-31.772 24.347Q-31.702 24.347-31.686 24.409Q-31.624 24.730-31.485 24.970Q-31.347 25.210-31.114 25.351Q-30.882 25.491-30.573 25.491Q-30.335 25.491-30.126 25.431Q-29.917 25.370-29.780 25.222Q-29.643 25.073-29.643 24.827Q-29.643 24.573-29.854 24.407Q-30.065 24.241-30.335 24.187L-30.956 24.073Q-31.362 23.995-31.663 23.739Q-31.964 23.483-31.964 23.108Q-31.964 22.741-31.763 22.519Q-31.561 22.296-31.237 22.198Q-30.913 22.101-30.573 22.101Q-30.108 22.101-29.811 22.308L-29.589 22.124Q-29.565 22.101-29.534 22.101L-29.483 22.101Q-29.452 22.101-29.425 22.128Q-29.397 22.155-29.397 22.187L-29.397 23.171Q-29.397 23.202-29.423 23.231Q-29.448 23.261-29.483 23.261L-29.589 23.261Q-29.624 23.261-29.651 23.233Q-29.679 23.206-29.679 23.171Q-29.679 22.772-29.931 22.552Q-30.182 22.331-30.581 22.331Q-30.936 22.331-31.220 22.454Q-31.503 22.577-31.503 22.882Q-31.503 23.101-31.302 23.233Q-31.100 23.366-30.854 23.409L-30.229 23.522Q-29.800 23.612-29.491 23.909Q-29.182 24.206-29.182 24.620Q-29.182 25.190-29.581 25.468Q-29.979 25.745-30.573 25.745Q-31.124 25.745-31.475 25.409L-31.772 25.722Q-31.796 25.745-31.831 25.745L-31.878 25.745Q-31.901 25.745-31.932 25.714Q-31.964 25.683-31.964 25.659M-28.030 24.706L-28.030 22.515L-28.733 22.515L-28.733 22.261Q-28.378 22.261-28.136 22.028Q-27.893 21.796-27.782 21.448Q-27.671 21.101-27.671 20.745L-27.390 20.745L-27.390 22.218L-26.214 22.218L-26.214 22.515L-27.390 22.515L-27.390 24.690Q-27.390 25.011-27.270 25.239Q-27.151 25.468-26.870 25.468Q-26.690 25.468-26.573 25.345Q-26.456 25.222-26.403 25.042Q-26.350 24.862-26.350 24.690L-26.350 24.218L-26.069 24.218L-26.069 24.706Q-26.069 24.960-26.175 25.200Q-26.280 25.440-26.477 25.593Q-26.675 25.745-26.932 25.745Q-27.249 25.745-27.501 25.622Q-27.753 25.499-27.891 25.265Q-28.030 25.030-28.030 24.706M-25.350 23.913Q-25.350 23.433-25.118 23.017Q-24.886 22.601-24.475 22.351Q-24.065 22.101-23.589 22.101Q-22.858 22.101-22.460 22.542Q-22.061 22.983-22.061 23.714Q-22.061 23.819-22.155 23.843L-24.604 23.843L-24.604 23.913Q-24.604 24.323-24.483 24.679Q-24.362 25.034-24.091 25.251Q-23.819 25.468-23.390 25.468Q-23.026 25.468-22.729 25.239Q-22.432 25.011-22.331 24.659Q-22.323 24.612-22.237 24.597L-22.155 24.597Q-22.061 24.624-22.061 24.706Q-22.061 24.714-22.069 24.745Q-22.132 24.972-22.270 25.155Q-22.409 25.339-22.600 25.472Q-22.792 25.605-23.011 25.675Q-23.229 25.745-23.468 25.745Q-23.839 25.745-24.177 25.608Q-24.515 25.472-24.782 25.220Q-25.050 24.968-25.200 24.628Q-25.350 24.288-25.350 23.913M-24.597 23.605L-22.636 23.605Q-22.636 23.300-22.737 23.009Q-22.839 22.718-23.056 22.536Q-23.272 22.355-23.589 22.355Q-23.890 22.355-24.120 22.542Q-24.350 22.730-24.474 23.021Q-24.597 23.312-24.597 23.605M-21.573 23.913Q-21.573 23.433-21.341 23.017Q-21.108 22.601-20.698 22.351Q-20.288 22.101-19.811 22.101Q-19.081 22.101-18.682 22.542Q-18.284 22.983-18.284 23.714Q-18.284 23.819-18.378 23.843L-20.827 23.843L-20.827 23.913Q-20.827 24.323-20.706 24.679Q-20.585 25.034-20.313 25.251Q-20.042 25.468-19.612 25.468Q-19.249 25.468-18.952 25.239Q-18.655 25.011-18.554 24.659Q-18.546 24.612-18.460 24.597L-18.378 24.597Q-18.284 24.624-18.284 24.706Q-18.284 24.714-18.292 24.745Q-18.354 24.972-18.493 25.155Q-18.632 25.339-18.823 25.472Q-19.015 25.605-19.233 25.675Q-19.452 25.745-19.690 25.745Q-20.061 25.745-20.399 25.608Q-20.737 25.472-21.005 25.220Q-21.272 24.968-21.423 24.628Q-21.573 24.288-21.573 23.913M-20.819 23.605L-18.858 23.605Q-18.858 23.300-18.960 23.009Q-19.061 22.718-19.278 22.536Q-19.495 22.355-19.811 22.355Q-20.112 22.355-20.343 22.542Q-20.573 22.730-20.696 23.021Q-20.819 23.312-20.819 23.605M-15.788 25.667L-17.768 25.667L-17.768 25.370Q-17.499 25.370-17.331 25.325Q-17.163 25.280-17.163 25.108L-17.163 22.972Q-17.163 22.757-17.225 22.661Q-17.288 22.565-17.405 22.544Q-17.522 22.522-17.768 22.522L-17.768 22.226L-16.600 22.140L-16.600 22.925Q-16.522 22.714-16.370 22.528Q-16.218 22.343-16.018 22.241Q-15.819 22.140-15.593 22.140Q-15.347 22.140-15.155 22.284Q-14.964 22.429-14.964 22.659Q-14.964 22.815-15.069 22.925Q-15.175 23.034-15.331 23.034Q-15.487 23.034-15.597 22.925Q-15.706 22.815-15.706 22.659Q-15.706 22.499-15.600 22.394Q-15.925 22.394-16.140 22.622Q-16.354 22.851-16.450 23.190Q-16.546 23.530-16.546 23.835L-16.546 25.108Q-16.546 25.276-16.319 25.323Q-16.093 25.370-15.788 25.370L-15.788 25.667M-12.624 25.667L-14.401 25.667L-14.401 25.370Q-14.128 25.370-13.960 25.323Q-13.792 25.276-13.792 25.108L-13.792 22.972Q-13.792 22.757-13.849 22.661Q-13.905 22.565-14.018 22.544Q-14.132 22.522-14.378 22.522L-14.378 22.226L-13.179 22.140L-13.179 25.108Q-13.179 25.276-13.032 25.323Q-12.886 25.370-12.624 25.370L-12.624 25.667M-14.065 20.745Q-14.065 20.554-13.931 20.423Q-13.796 20.292-13.600 20.292Q-13.479 20.292-13.376 20.355Q-13.272 20.417-13.210 20.521Q-13.147 20.624-13.147 20.745Q-13.147 20.940-13.278 21.075Q-13.409 21.210-13.600 21.210Q-13.800 21.210-13.932 21.077Q-14.065 20.944-14.065 20.745M-10.194 25.667L-12.050 25.667L-12.050 25.370Q-11.776 25.370-11.608 25.323Q-11.440 25.276-11.440 25.108L-11.440 22.972Q-11.440 22.757-11.503 22.661Q-11.565 22.565-11.684 22.544Q-11.804 22.522-12.050 22.522L-12.050 22.226L-10.858 22.140L-10.858 22.874Q-10.745 22.659-10.552 22.491Q-10.358 22.323-10.120 22.231Q-9.882 22.140-9.628 22.140Q-8.460 22.140-8.460 23.218L-8.460 25.108Q-8.460 25.276-8.290 25.323Q-8.120 25.370-7.850 25.370L-7.850 25.667L-9.706 25.667L-9.706 25.370Q-9.432 25.370-9.265 25.323Q-9.097 25.276-9.097 25.108L-9.097 23.233Q-9.097 22.851-9.218 22.622Q-9.339 22.394-9.690 22.394Q-10.003 22.394-10.257 22.556Q-10.511 22.718-10.657 22.987Q-10.804 23.257-10.804 23.554L-10.804 25.108Q-10.804 25.276-10.634 25.323Q-10.464 25.370-10.194 25.370L-10.194 25.667M-7.405 26.276Q-7.405 25.995-7.194 25.784Q-6.983 25.573-6.698 25.483Q-6.854 25.358-6.932 25.169Q-7.011 24.980-7.011 24.780Q-7.011 24.425-6.780 24.132Q-7.147 23.792-7.147 23.323Q-7.147 22.972-6.944 22.702Q-6.741 22.433-6.421 22.286Q-6.100 22.140-5.757 22.140Q-5.237 22.140-4.866 22.421Q-4.503 22.050-3.956 22.050Q-3.776 22.050-3.649 22.177Q-3.522 22.304-3.522 22.483Q-3.522 22.589-3.600 22.667Q-3.679 22.745-3.788 22.745Q-3.897 22.745-3.974 22.669Q-4.050 22.593-4.050 22.483Q-4.050 22.382-4.011 22.331Q-4.003 22.323-3.999 22.317Q-3.995 22.312-3.995 22.308Q-4.370 22.308-4.690 22.562Q-4.370 22.901-4.370 23.323Q-4.370 23.593-4.487 23.810Q-4.604 24.026-4.809 24.185Q-5.015 24.343-5.257 24.425Q-5.499 24.507-5.757 24.507Q-5.975 24.507-6.188 24.448Q-6.401 24.390-6.597 24.269Q-6.690 24.409-6.690 24.589Q-6.690 24.796-6.554 24.948Q-6.417 25.101-6.210 25.101L-5.515 25.101Q-5.026 25.101-4.614 25.185Q-4.202 25.269-3.923 25.526Q-3.643 25.784-3.643 26.276Q-3.643 26.640-3.964 26.872Q-4.284 27.105-4.725 27.206Q-5.167 27.308-5.522 27.308Q-5.878 27.308-6.321 27.206Q-6.765 27.105-7.085 26.872Q-7.405 26.640-7.405 26.276M-6.901 26.276Q-6.901 26.472-6.757 26.620Q-6.612 26.769-6.399 26.858Q-6.186 26.948-5.946 26.995Q-5.706 27.042-5.522 27.042Q-5.280 27.042-4.950 26.964Q-4.620 26.886-4.384 26.712Q-4.147 26.538-4.147 26.276Q-4.147 25.870-4.557 25.761Q-4.968 25.651-5.530 25.651L-6.210 25.651Q-6.479 25.651-6.690 25.829Q-6.901 26.007-6.901 26.276M-5.757 24.241Q-5.034 24.241-5.034 23.323Q-5.034 22.401-5.757 22.401Q-6.483 22.401-6.483 23.323Q-6.483 24.241-5.757 24.241\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(234.585 8.898)\">\u003Cpath d=\"M-0.216 24.835Q-0.216 24.351 0.186 24.056Q0.589 23.761 1.139 23.642Q1.690 23.522 2.182 23.522L2.182 23.233Q2.182 23.007 2.067 22.800Q1.952 22.593 1.755 22.474Q1.557 22.355 1.327 22.355Q0.901 22.355 0.616 22.460Q0.686 22.487 0.733 22.542Q0.780 22.597 0.805 22.667Q0.831 22.737 0.831 22.812Q0.831 22.917 0.780 23.009Q0.729 23.101 0.637 23.151Q0.546 23.202 0.440 23.202Q0.335 23.202 0.243 23.151Q0.151 23.101 0.100 23.009Q0.050 22.917 0.050 22.812Q0.050 22.394 0.438 22.247Q0.827 22.101 1.327 22.101Q1.659 22.101 2.012 22.231Q2.366 22.362 2.594 22.616Q2.823 22.870 2.823 23.218L2.823 25.019Q2.823 25.151 2.895 25.261Q2.968 25.370 3.096 25.370Q3.221 25.370 3.290 25.265Q3.358 25.159 3.358 25.019L3.358 24.507L3.639 24.507L3.639 25.019Q3.639 25.222 3.522 25.380Q3.405 25.538 3.223 25.622Q3.042 25.706 2.839 25.706Q2.608 25.706 2.456 25.534Q2.303 25.362 2.272 25.132Q2.112 25.413 1.803 25.579Q1.495 25.745 1.143 25.745Q0.632 25.745 0.208 25.522Q-0.216 25.300-0.216 24.835M0.471 24.835Q0.471 25.120 0.698 25.306Q0.925 25.491 1.218 25.491Q1.464 25.491 1.688 25.374Q1.913 25.257 2.048 25.054Q2.182 24.851 2.182 24.597L2.182 23.765Q1.917 23.765 1.632 23.819Q1.346 23.874 1.075 24.003Q0.803 24.132 0.637 24.339Q0.471 24.546 0.471 24.835M3.975 23.940Q3.975 23.444 4.225 23.019Q4.475 22.593 4.895 22.347Q5.315 22.101 5.815 22.101Q6.354 22.101 6.745 22.226Q7.136 22.351 7.136 22.765Q7.136 22.870 7.085 22.962Q7.034 23.054 6.942 23.105Q6.850 23.155 6.741 23.155Q6.636 23.155 6.544 23.105Q6.452 23.054 6.401 22.962Q6.350 22.870 6.350 22.765Q6.350 22.542 6.518 22.437Q6.296 22.378 5.823 22.378Q5.526 22.378 5.311 22.517Q5.096 22.655 4.966 22.886Q4.835 23.116 4.776 23.386Q4.718 23.655 4.718 23.940Q4.718 24.335 4.850 24.685Q4.983 25.034 5.255 25.251Q5.526 25.468 5.925 25.468Q6.300 25.468 6.575 25.251Q6.850 25.034 6.952 24.675Q6.968 24.612 7.030 24.612L7.136 24.612Q7.171 24.612 7.196 24.640Q7.221 24.667 7.221 24.706L7.221 24.730Q7.089 25.210 6.704 25.478Q6.319 25.745 5.815 25.745Q5.452 25.745 5.118 25.608Q4.784 25.472 4.524 25.222Q4.264 24.972 4.120 24.636Q3.975 24.300 3.975 23.940M8.335 24.706L8.335 22.515L7.632 22.515L7.632 22.261Q7.987 22.261 8.229 22.028Q8.471 21.796 8.583 21.448Q8.694 21.101 8.694 20.745L8.975 20.745L8.975 22.218L10.151 22.218L10.151 22.515L8.975 22.515L8.975 24.690Q8.975 25.011 9.094 25.239Q9.214 25.468 9.495 25.468Q9.675 25.468 9.792 25.345Q9.909 25.222 9.962 25.042Q10.014 24.862 10.014 24.690L10.014 24.218L10.296 24.218L10.296 24.706Q10.296 24.960 10.190 25.200Q10.085 25.440 9.887 25.593Q9.690 25.745 9.432 25.745Q9.116 25.745 8.864 25.622Q8.612 25.499 8.473 25.265Q8.335 25.030 8.335 24.706M12.874 25.667L11.096 25.667L11.096 25.370Q11.370 25.370 11.538 25.323Q11.706 25.276 11.706 25.108L11.706 22.972Q11.706 22.757 11.649 22.661Q11.593 22.565 11.479 22.544Q11.366 22.522 11.120 22.522L11.120 22.226L12.319 22.140L12.319 25.108Q12.319 25.276 12.466 25.323Q12.612 25.370 12.874 25.370L12.874 25.667M11.432 20.745Q11.432 20.554 11.567 20.423Q11.702 20.292 11.897 20.292Q12.018 20.292 12.122 20.355Q12.225 20.417 12.288 20.521Q12.350 20.624 12.350 20.745Q12.350 20.940 12.219 21.075Q12.089 21.210 11.897 21.210Q11.698 21.210 11.565 21.077Q11.432 20.944 11.432 20.745M13.374 23.972Q13.374 23.468 13.630 23.036Q13.886 22.605 14.321 22.353Q14.757 22.101 15.257 22.101Q15.643 22.101 15.985 22.245Q16.327 22.390 16.589 22.651Q16.850 22.913 16.993 23.249Q17.136 23.585 17.136 23.972Q17.136 24.464 16.872 24.874Q16.608 25.284 16.178 25.515Q15.749 25.745 15.257 25.745Q14.764 25.745 14.331 25.513Q13.897 25.280 13.636 24.872Q13.374 24.464 13.374 23.972M15.257 25.468Q15.714 25.468 15.966 25.245Q16.218 25.022 16.305 24.671Q16.393 24.319 16.393 23.874Q16.393 23.444 16.300 23.106Q16.206 22.769 15.952 22.562Q15.698 22.355 15.257 22.355Q14.608 22.355 14.364 22.771Q14.120 23.187 14.120 23.874Q14.120 24.319 14.208 24.671Q14.296 25.022 14.548 25.245Q14.800 25.468 15.257 25.468M19.550 25.667L17.694 25.667L17.694 25.370Q17.968 25.370 18.136 25.323Q18.303 25.276 18.303 25.108L18.303 22.972Q18.303 22.757 18.241 22.661Q18.178 22.565 18.059 22.544Q17.940 22.522 17.694 22.522L17.694 22.226L18.886 22.140L18.886 22.874Q18.999 22.659 19.192 22.491Q19.386 22.323 19.624 22.231Q19.862 22.140 20.116 22.140Q21.284 22.140 21.284 23.218L21.284 25.108Q21.284 25.276 21.454 25.323Q21.624 25.370 21.893 25.370L21.893 25.667L20.038 25.667L20.038 25.370Q20.311 25.370 20.479 25.323Q20.647 25.276 20.647 25.108L20.647 23.233Q20.647 22.851 20.526 22.622Q20.405 22.394 20.053 22.394Q19.741 22.394 19.487 22.556Q19.233 22.718 19.087 22.987Q18.940 23.257 18.940 23.554L18.940 25.108Q18.940 25.276 19.110 25.323Q19.280 25.370 19.550 25.370\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-32.245 31.358v-94.74\"\u002F>\u003Cpath stroke=\"none\" d=\"m-32.245-65.381-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-30.025 -89.049)\">\u003Cpath d=\"M-30.190 25.745Q-30.671 25.745-31.079 25.501Q-31.487 25.257-31.725 24.843Q-31.964 24.429-31.964 23.940Q-31.964 23.448-31.706 23.032Q-31.448 22.616-31.016 22.378Q-30.585 22.140-30.093 22.140Q-29.472 22.140-29.022 22.577L-29.022 20.948Q-29.022 20.733-29.085 20.638Q-29.147 20.542-29.265 20.521Q-29.382 20.499-29.628 20.499L-29.628 20.202L-28.405 20.116L-28.405 24.925Q-28.405 25.136-28.343 25.231Q-28.280 25.327-28.163 25.349Q-28.046 25.370-27.796 25.370L-27.796 25.667L-29.046 25.745L-29.046 25.261Q-29.511 25.745-30.190 25.745M-30.124 25.491Q-29.784 25.491-29.491 25.300Q-29.198 25.108-29.046 24.812L-29.046 22.980Q-29.194 22.706-29.456 22.550Q-29.718 22.394-30.030 22.394Q-30.655 22.394-30.938 22.841Q-31.222 23.288-31.222 23.948Q-31.222 24.593-30.970 25.042Q-30.718 25.491-30.124 25.491M-27.288 23.913Q-27.288 23.433-27.056 23.017Q-26.823 22.601-26.413 22.351Q-26.003 22.101-25.526 22.101Q-24.796 22.101-24.397 22.542Q-23.999 22.983-23.999 23.714Q-23.999 23.819-24.093 23.843L-26.542 23.843L-26.542 23.913Q-26.542 24.323-26.421 24.679Q-26.300 25.034-26.028 25.251Q-25.757 25.468-25.327 25.468Q-24.964 25.468-24.667 25.239Q-24.370 25.011-24.268 24.659Q-24.261 24.612-24.175 24.597L-24.093 24.597Q-23.999 24.624-23.999 24.706Q-23.999 24.714-24.007 24.745Q-24.069 24.972-24.208 25.155Q-24.347 25.339-24.538 25.472Q-24.729 25.605-24.948 25.675Q-25.167 25.745-25.405 25.745Q-25.776 25.745-26.114 25.608Q-26.452 25.472-26.720 25.220Q-26.987 24.968-27.138 24.628Q-27.288 24.288-27.288 23.913M-26.534 23.605L-24.573 23.605Q-24.573 23.300-24.675 23.009Q-24.776 22.718-24.993 22.536Q-25.210 22.355-25.526 22.355Q-25.827 22.355-26.057 22.542Q-26.288 22.730-26.411 23.021Q-26.534 23.312-26.534 23.605M-21.581 25.667L-23.436 25.667L-23.436 25.370Q-23.163 25.370-22.995 25.323Q-22.827 25.276-22.827 25.108L-22.827 22.972Q-22.827 22.757-22.890 22.661Q-22.952 22.565-23.071 22.544Q-23.190 22.522-23.436 22.522L-23.436 22.226L-22.245 22.140L-22.245 22.874Q-22.132 22.659-21.938 22.491Q-21.745 22.323-21.507 22.231Q-21.268 22.140-21.015 22.140Q-19.847 22.140-19.847 23.218L-19.847 25.108Q-19.847 25.276-19.677 25.323Q-19.507 25.370-19.237 25.370L-19.237 25.667L-21.093 25.667L-21.093 25.370Q-20.819 25.370-20.651 25.323Q-20.483 25.276-20.483 25.108L-20.483 23.233Q-20.483 22.851-20.604 22.622Q-20.725 22.394-21.077 22.394Q-21.390 22.394-21.643 22.556Q-21.897 22.718-22.044 22.987Q-22.190 23.257-22.190 23.554L-22.190 25.108Q-22.190 25.276-22.020 25.323Q-21.850 25.370-21.581 25.370L-21.581 25.667M-18.749 25.659L-18.749 24.437Q-18.749 24.409-18.718 24.378Q-18.686 24.347-18.663 24.347L-18.557 24.347Q-18.487 24.347-18.472 24.409Q-18.409 24.730-18.270 24.970Q-18.132 25.210-17.899 25.351Q-17.667 25.491-17.358 25.491Q-17.120 25.491-16.911 25.431Q-16.702 25.370-16.565 25.222Q-16.429 25.073-16.429 24.827Q-16.429 24.573-16.640 24.407Q-16.850 24.241-17.120 24.187L-17.741 24.073Q-18.147 23.995-18.448 23.739Q-18.749 23.483-18.749 23.108Q-18.749 22.741-18.548 22.519Q-18.347 22.296-18.022 22.198Q-17.698 22.101-17.358 22.101Q-16.893 22.101-16.597 22.308L-16.374 22.124Q-16.350 22.101-16.319 22.101L-16.268 22.101Q-16.237 22.101-16.210 22.128Q-16.182 22.155-16.182 22.187L-16.182 23.171Q-16.182 23.202-16.208 23.231Q-16.233 23.261-16.268 23.261L-16.374 23.261Q-16.409 23.261-16.436 23.233Q-16.464 23.206-16.464 23.171Q-16.464 22.772-16.716 22.552Q-16.968 22.331-17.366 22.331Q-17.722 22.331-18.005 22.454Q-18.288 22.577-18.288 22.882Q-18.288 23.101-18.087 23.233Q-17.886 23.366-17.640 23.409L-17.015 23.522Q-16.585 23.612-16.276 23.909Q-15.968 24.206-15.968 24.620Q-15.968 25.190-16.366 25.468Q-16.765 25.745-17.358 25.745Q-17.909 25.745-18.261 25.409L-18.557 25.722Q-18.581 25.745-18.616 25.745L-18.663 25.745Q-18.686 25.745-18.718 25.714Q-18.749 25.683-18.749 25.659M-13.581 25.667L-15.358 25.667L-15.358 25.370Q-15.085 25.370-14.917 25.323Q-14.749 25.276-14.749 25.108L-14.749 22.972Q-14.749 22.757-14.806 22.661Q-14.862 22.565-14.975 22.544Q-15.089 22.522-15.335 22.522L-15.335 22.226L-14.136 22.140L-14.136 25.108Q-14.136 25.276-13.989 25.323Q-13.843 25.370-13.581 25.370L-13.581 25.667M-15.022 20.745Q-15.022 20.554-14.888 20.423Q-14.753 20.292-14.557 20.292Q-14.436 20.292-14.333 20.355Q-14.229 20.417-14.167 20.521Q-14.104 20.624-14.104 20.745Q-14.104 20.940-14.235 21.075Q-14.366 21.210-14.557 21.210Q-14.757 21.210-14.890 21.077Q-15.022 20.944-15.022 20.745M-12.456 24.706L-12.456 22.515L-13.159 22.515L-13.159 22.261Q-12.804 22.261-12.561 22.028Q-12.319 21.796-12.208 21.448Q-12.097 21.101-12.097 20.745L-11.815 20.745L-11.815 22.218L-10.640 22.218L-10.640 22.515L-11.815 22.515L-11.815 24.690Q-11.815 25.011-11.696 25.239Q-11.577 25.468-11.296 25.468Q-11.116 25.468-10.999 25.345Q-10.882 25.222-10.829 25.042Q-10.776 24.862-10.776 24.690L-10.776 24.218L-10.495 24.218L-10.495 24.706Q-10.495 24.960-10.600 25.200Q-10.706 25.440-10.903 25.593Q-11.100 25.745-11.358 25.745Q-11.675 25.745-11.927 25.622Q-12.179 25.499-12.317 25.265Q-12.456 25.030-12.456 24.706\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-30.025 -89.049)\">\u003Cpath d=\"M-9.583 26.964Q-9.469 27.042-9.294 27.042Q-9.005 27.042-8.784 26.829Q-8.563 26.616-8.438 26.315L-8.149 25.667L-9.423 22.780Q-9.505 22.605-9.649 22.560Q-9.794 22.515-10.063 22.515L-10.063 22.218L-8.344 22.218L-8.344 22.515Q-8.766 22.515-8.766 22.698Q-8.766 22.710-8.751 22.780L-7.813 24.905L-6.981 22.995Q-6.942 22.905-6.942 22.827Q-6.942 22.687-7.044 22.601Q-7.145 22.515-7.286 22.515L-7.286 22.218L-5.934 22.218L-5.934 22.515Q-6.188 22.515-6.382 22.640Q-6.575 22.765-6.680 22.995L-8.126 26.315Q-8.239 26.569-8.405 26.792Q-8.571 27.015-8.800 27.157Q-9.028 27.300-9.294 27.300Q-9.591 27.300-9.831 27.108Q-10.071 26.917-10.071 26.628Q-10.071 26.472-9.966 26.370Q-9.860 26.269-9.712 26.269Q-9.606 26.269-9.526 26.315Q-9.446 26.362-9.399 26.440Q-9.352 26.519-9.352 26.628Q-9.352 26.749-9.413 26.837Q-9.473 26.925-9.583 26.964\" 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-18.019 22.822S5.778 20.52 13.279 11.44s17.235-53.665 22.762-54.06S47.586-.287 53.113 8.595C58.64 17.478 69.559 21.4 75.875 21.4c6.317 0 15.656-3.921 22.762-12.804 7.106-8.882 21.347-51.609 28.453-51.214s15.656 44.98 22.762 54.06 28.453 11.38 28.453 11.38\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(62.575 -71.82)\">\u003Cpath d=\"M-30.263 25.667L-31.866 25.667L-31.866 25.387Q-31.640 25.387-31.491 25.353Q-31.343 25.318-31.343 25.178L-31.343 21.559Q-31.343 21.289-31.450 21.227Q-31.558 21.166-31.866 21.166L-31.866 20.885L-30.789 20.810L-30.789 25.178Q-30.789 25.315-30.639 25.351Q-30.488 25.387-30.263 25.387L-30.263 25.667M-29.709 24.132Q-29.709 23.811-29.584 23.522Q-29.459 23.233-29.234 23.010Q-29.008 22.786-28.713 22.666Q-28.417 22.546-28.099 22.546Q-27.771 22.546-27.509 22.646Q-27.248 22.745-27.072 22.927Q-26.896 23.110-26.802 23.368Q-26.708 23.626-26.708 23.958Q-26.708 24.050-26.790 24.071L-29.046 24.071L-29.046 24.132Q-29.046 24.720-28.762 25.103Q-28.478 25.486-27.911 25.486Q-27.590 25.486-27.321 25.293Q-27.053 25.100-26.964 24.785Q-26.957 24.744-26.882 24.730L-26.790 24.730Q-26.708 24.754-26.708 24.826Q-26.708 24.833-26.715 24.860Q-26.828 25.257-27.198 25.496Q-27.569 25.735-27.993 25.735Q-28.431 25.735-28.830 25.527Q-29.230 25.318-29.470 24.951Q-29.709 24.584-29.709 24.132M-29.039 23.862L-27.224 23.862Q-27.224 23.585-27.321 23.333Q-27.419 23.080-27.617 22.924Q-27.815 22.769-28.099 22.769Q-28.376 22.769-28.589 22.927Q-28.803 23.086-28.921 23.341Q-29.039 23.596-29.039 23.862M-24.322 25.667L-26.055 25.667L-26.055 25.387Q-25.829 25.387-25.681 25.353Q-25.532 25.318-25.532 25.178L-25.532 22.929L-26.120 22.929L-26.120 22.649L-25.532 22.649L-25.532 21.832Q-25.532 21.514-25.354 21.266Q-25.177 21.019-24.886 20.878Q-24.596 20.738-24.285 20.738Q-24.028 20.738-23.825 20.880Q-23.621 21.022-23.621 21.265Q-23.621 21.401-23.721 21.500Q-23.820 21.600-23.956 21.600Q-24.093 21.600-24.192 21.500Q-24.291 21.401-24.291 21.265Q-24.291 21.084-24.151 20.991Q-24.230 20.964-24.329 20.964Q-24.537 20.964-24.691 21.097Q-24.845 21.230-24.925 21.434Q-25.006 21.637-25.006 21.846L-25.006 22.649L-24.117 22.649L-24.117 22.929L-24.978 22.929L-24.978 25.178Q-24.978 25.387-24.322 25.387L-24.322 25.667M-23.116 24.826L-23.116 22.929L-23.755 22.929L-23.755 22.707Q-23.437 22.707-23.220 22.497Q-23.003 22.287-22.902 21.977Q-22.801 21.668-22.801 21.360L-22.535 21.360L-22.535 22.649L-21.458 22.649L-21.458 22.929L-22.535 22.929L-22.535 24.813Q-22.535 25.089-22.430 25.288Q-22.326 25.486-22.066 25.486Q-21.909 25.486-21.803 25.382Q-21.697 25.277-21.648 25.124Q-21.598 24.970-21.598 24.813L-21.598 24.399L-21.331 24.399L-21.331 24.826Q-21.331 25.052-21.431 25.262Q-21.530 25.472-21.714 25.604Q-21.899 25.735-22.128 25.735Q-22.565 25.735-22.840 25.498Q-23.116 25.260-23.116 24.826\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(150.985 -73.18)\">\u003Cpath d=\"M-30.181 25.667L-31.917 25.667L-31.917 25.387Q-31.688 25.387-31.539 25.353Q-31.391 25.318-31.391 25.178L-31.391 23.329Q-31.391 23.059-31.498 22.998Q-31.606 22.936-31.917 22.936L-31.917 22.656L-30.888 22.581L-30.888 23.288Q-30.758 22.980-30.516 22.781Q-30.273 22.581-29.955 22.581Q-29.736 22.581-29.565 22.705Q-29.394 22.830-29.394 23.042Q-29.394 23.179-29.494 23.278Q-29.593 23.377-29.726 23.377Q-29.863 23.377-29.962 23.278Q-30.061 23.179-30.061 23.042Q-30.061 22.902-29.962 22.803Q-30.252 22.803-30.452 22.999Q-30.652 23.196-30.745 23.490Q-30.837 23.784-30.837 24.064L-30.837 25.178Q-30.837 25.387-30.181 25.387L-30.181 25.667M-27.193 25.667L-28.745 25.667L-28.745 25.387Q-28.519 25.387-28.371 25.353Q-28.222 25.318-28.222 25.178L-28.222 23.329Q-28.222 23.141-28.270 23.057Q-28.318 22.974-28.415 22.955Q-28.513 22.936-28.724 22.936L-28.724 22.656L-27.668 22.581L-27.668 25.178Q-27.668 25.318-27.537 25.353Q-27.405 25.387-27.193 25.387L-27.193 25.667M-28.465 21.360Q-28.465 21.189-28.342 21.070Q-28.219 20.950-28.048 20.950Q-27.880 20.950-27.757 21.070Q-27.634 21.189-27.634 21.360Q-27.634 21.535-27.757 21.658Q-27.880 21.781-28.048 21.781Q-28.219 21.781-28.342 21.658Q-28.465 21.535-28.465 21.360M-26.588 26.200Q-26.588 25.954-26.392 25.770Q-26.195 25.585-25.939 25.506Q-26.076 25.394-26.147 25.233Q-26.219 25.072-26.219 24.891Q-26.219 24.570-26.007 24.324Q-26.342 24.026-26.342 23.616Q-26.342 23.155-25.953 22.868Q-25.563 22.581-25.084 22.581Q-24.613 22.581-24.278 22.827Q-24.103 22.673-23.893 22.591Q-23.683 22.509-23.454 22.509Q-23.290 22.509-23.169 22.616Q-23.047 22.724-23.047 22.888Q-23.047 22.984-23.119 23.056Q-23.191 23.127-23.283 23.127Q-23.382 23.127-23.452 23.054Q-23.522 22.980-23.522 22.881Q-23.522 22.827-23.509 22.796L-23.502 22.782Q-23.495 22.762-23.486 22.751Q-23.478 22.741-23.474 22.734Q-23.830 22.734-24.117 22.957Q-23.830 23.250-23.830 23.616Q-23.830 23.931-24.015 24.163Q-24.199 24.396-24.488 24.524Q-24.777 24.652-25.084 24.652Q-25.286 24.652-25.477 24.602Q-25.669 24.553-25.847 24.443Q-25.939 24.570-25.939 24.713Q-25.939 24.895-25.811 25.030Q-25.682 25.165-25.498 25.165L-24.866 25.165Q-24.418 25.165-24.049 25.236Q-23.680 25.308-23.420 25.537Q-23.160 25.766-23.160 26.200Q-23.160 26.521-23.456 26.723Q-23.751 26.925-24.155 27.014Q-24.558 27.103-24.872 27.103Q-25.190 27.103-25.594 27.014Q-25.997 26.925-26.293 26.723Q-26.588 26.521-26.588 26.200M-26.134 26.200Q-26.134 26.429-25.915 26.578Q-25.696 26.727-25.404 26.795Q-25.112 26.863-24.872 26.863Q-24.708 26.863-24.500 26.827Q-24.291 26.792-24.085 26.711Q-23.878 26.631-23.746 26.503Q-23.615 26.375-23.615 26.200Q-23.615 25.848-23.996 25.754Q-24.377 25.660-24.879 25.660L-25.498 25.660Q-25.737 25.660-25.935 25.811Q-26.134 25.961-26.134 26.200M-25.084 24.413Q-24.418 24.413-24.418 23.616Q-24.418 22.816-25.084 22.816Q-25.754 22.816-25.754 23.616Q-25.754 24.413-25.084 24.413M-20.884 25.667L-22.517 25.667L-22.517 25.387Q-22.288 25.387-22.140 25.353Q-21.991 25.318-21.991 25.178L-21.991 21.559Q-21.991 21.289-22.099 21.227Q-22.206 21.166-22.517 21.166L-22.517 20.885L-21.437 20.810L-21.437 23.196Q-21.331 23.011-21.154 22.869Q-20.976 22.728-20.767 22.654Q-20.559 22.581-20.333 22.581Q-19.828 22.581-19.544 22.804Q-19.260 23.028-19.260 23.524L-19.260 25.178Q-19.260 25.315-19.111 25.351Q-18.963 25.387-18.737 25.387L-18.737 25.667L-20.368 25.667L-20.368 25.387Q-20.139 25.387-19.990 25.353Q-19.841 25.318-19.841 25.178L-19.841 23.538Q-19.841 23.203-19.961 23.003Q-20.080 22.803-20.395 22.803Q-20.665 22.803-20.899 22.939Q-21.133 23.076-21.272 23.310Q-21.410 23.544-21.410 23.818L-21.410 25.178Q-21.410 25.315-21.260 25.351Q-21.109 25.387-20.884 25.387\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(150.985 -73.18)\">\u003Cpath d=\"M-17.828 24.826L-17.828 22.929L-18.467 22.929L-18.467 22.707Q-18.149 22.707-17.932 22.497Q-17.715 22.287-17.615 21.977Q-17.514 21.668-17.514 21.360L-17.247 21.360L-17.247 22.649L-16.170 22.649L-16.170 22.929L-17.247 22.929L-17.247 24.813Q-17.247 25.089-17.143 25.288Q-17.039 25.486-16.779 25.486Q-16.622 25.486-16.516 25.382Q-16.410 25.277-16.360 25.124Q-16.311 24.970-16.311 24.813L-16.311 24.399L-16.044 24.399L-16.044 24.826Q-16.044 25.052-16.143 25.262Q-16.242 25.472-16.427 25.604Q-16.611 25.735-16.840 25.735Q-17.278 25.735-17.553 25.498Q-17.828 25.260-17.828 24.826\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(191.321 -37.403)\">\u003Cpath d=\"M-31.931 24.156Q-31.931 23.818-31.790 23.527Q-31.650 23.237-31.406 23.023Q-31.162 22.810-30.857 22.695Q-30.553 22.581-30.228 22.581Q-29.958 22.581-29.695 22.680Q-29.432 22.779-29.241 22.957L-29.241 21.559Q-29.241 21.289-29.348 21.227Q-29.456 21.166-29.767 21.166L-29.767 20.885L-28.690 20.810L-28.690 24.994Q-28.690 25.182-28.636 25.265Q-28.581 25.349-28.480 25.368Q-28.379 25.387-28.164 25.387L-28.164 25.667L-29.271 25.735L-29.271 25.318Q-29.688 25.735-30.314 25.735Q-30.745 25.735-31.117 25.523Q-31.490 25.312-31.710 24.951Q-31.931 24.590-31.931 24.156M-30.256 25.513Q-30.047 25.513-29.861 25.441Q-29.675 25.370-29.521 25.233Q-29.367 25.096-29.271 24.918L-29.271 23.309Q-29.357 23.162-29.502 23.042Q-29.647 22.922-29.817 22.863Q-29.986 22.803-30.167 22.803Q-30.727 22.803-30.996 23.192Q-31.264 23.582-31.264 24.163Q-31.264 24.734-31.030 25.124Q-30.796 25.513-30.256 25.513M-25.898 25.667L-27.450 25.667L-27.450 25.387Q-27.224 25.387-27.075 25.353Q-26.927 25.318-26.927 25.178L-26.927 23.329Q-26.927 23.141-26.974 23.057Q-27.022 22.974-27.120 22.955Q-27.217 22.936-27.429 22.936L-27.429 22.656L-26.373 22.581L-26.373 25.178Q-26.373 25.318-26.241 25.353Q-26.110 25.387-25.898 25.387L-25.898 25.667M-27.169 21.360Q-27.169 21.189-27.046 21.070Q-26.923 20.950-26.752 20.950Q-26.585 20.950-26.462 21.070Q-26.339 21.189-26.339 21.360Q-26.339 21.535-26.462 21.658Q-26.585 21.781-26.752 21.781Q-26.923 21.781-27.046 21.658Q-27.169 21.535-27.169 21.360M-23.454 25.667L-25.187 25.667L-25.187 25.387Q-24.961 25.387-24.813 25.353Q-24.664 25.318-24.664 25.178L-24.664 22.929L-25.252 22.929L-25.252 22.649L-24.664 22.649L-24.664 21.832Q-24.664 21.514-24.486 21.266Q-24.308 21.019-24.018 20.878Q-23.727 20.738-23.416 20.738Q-23.160 20.738-22.957 20.880Q-22.753 21.022-22.753 21.265Q-22.753 21.401-22.852 21.500Q-22.952 21.600-23.088 21.600Q-23.225 21.600-23.324 21.500Q-23.423 21.401-23.423 21.265Q-23.423 21.084-23.283 20.991Q-23.362 20.964-23.461 20.964Q-23.669 20.964-23.823 21.097Q-23.977 21.230-24.057 21.434Q-24.138 21.637-24.138 21.846L-24.138 22.649L-23.249 22.649L-23.249 22.929L-24.110 22.929L-24.110 25.178Q-24.110 25.387-23.454 25.387\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.321 -37.403)\">\u003Cpath d=\"M-20.415 25.667L-22.148 25.667L-22.148 25.387Q-21.922 25.387-21.773 25.353Q-21.625 25.318-21.625 25.178L-21.625 22.929L-22.213 22.929L-22.213 22.649L-21.625 22.649L-21.625 21.832Q-21.625 21.514-21.447 21.266Q-21.269 21.019-20.979 20.878Q-20.688 20.738-20.377 20.738Q-20.121 20.738-19.917 20.880Q-19.714 21.022-19.714 21.265Q-19.714 21.401-19.813 21.500Q-19.912 21.600-20.049 21.600Q-20.186 21.600-20.285 21.500Q-20.384 21.401-20.384 21.265Q-20.384 21.084-20.244 20.991Q-20.322 20.964-20.422 20.964Q-20.630 20.964-20.784 21.097Q-20.938 21.230-21.018 21.434Q-21.098 21.637-21.098 21.846L-21.098 22.649L-20.210 22.649L-20.210 22.929L-21.071 22.929L-21.071 25.178Q-21.071 25.387-20.415 25.387L-20.415 25.667M-19.160 24.833L-19.160 23.329Q-19.160 23.059-19.268 22.998Q-19.376 22.936-19.687 22.936L-19.687 22.656L-18.579 22.581L-18.579 24.813L-18.579 24.833Q-18.579 25.113-18.528 25.257Q-18.477 25.400-18.335 25.457Q-18.193 25.513-17.906 25.513Q-17.653 25.513-17.448 25.373Q-17.243 25.233-17.127 25.007Q-17.010 24.782-17.010 24.532L-17.010 23.329Q-17.010 23.059-17.118 22.998Q-17.226 22.936-17.537 22.936L-17.537 22.656L-16.429 22.581L-16.429 24.994Q-16.429 25.185-16.376 25.267Q-16.323 25.349-16.223 25.368Q-16.122 25.387-15.906 25.387L-15.906 25.667L-16.983 25.735L-16.983 25.171Q-17.092 25.353-17.238 25.476Q-17.383 25.599-17.569 25.667Q-17.756 25.735-17.957 25.735Q-19.160 25.735-19.160 24.833M-15.319 25.660L-15.319 24.597Q-15.319 24.573-15.291 24.546Q-15.264 24.519-15.240 24.519L-15.131 24.519Q-15.066 24.519-15.052 24.577Q-14.956 25.011-14.710 25.262Q-14.464 25.513-14.050 25.513Q-13.709 25.513-13.456 25.380Q-13.203 25.247-13.203 24.939Q-13.203 24.782-13.297 24.667Q-13.391 24.553-13.529 24.484Q-13.668 24.416-13.835 24.378L-14.416 24.279Q-14.772 24.211-15.045 23.990Q-15.319 23.770-15.319 23.428Q-15.319 23.179-15.207 23.004Q-15.096 22.830-14.910 22.731Q-14.724 22.632-14.508 22.589Q-14.293 22.546-14.050 22.546Q-13.637 22.546-13.357 22.728L-13.141 22.553Q-13.131 22.550-13.124 22.548Q-13.117 22.546-13.107 22.546L-13.056 22.546Q-13.028 22.546-13.005 22.570Q-12.981 22.594-12.981 22.622L-12.981 23.469Q-12.981 23.490-13.005 23.517Q-13.028 23.544-13.056 23.544L-13.169 23.544Q-13.196 23.544-13.222 23.519Q-13.247 23.493-13.247 23.469Q-13.247 23.233-13.353 23.069Q-13.459 22.905-13.642 22.823Q-13.825 22.741-14.057 22.741Q-14.385 22.741-14.642 22.844Q-14.898 22.946-14.898 23.223Q-14.898 23.418-14.715 23.527Q-14.532 23.637-14.303 23.678L-13.729 23.784Q-13.483 23.832-13.269 23.960Q-13.056 24.088-12.919 24.291Q-12.782 24.495-12.782 24.744Q-12.782 25.257-13.148 25.496Q-13.514 25.735-14.050 25.735Q-14.546 25.735-14.878 25.441L-15.144 25.715Q-15.165 25.735-15.192 25.735L-15.240 25.735Q-15.264 25.735-15.291 25.708Q-15.319 25.681-15.319 25.660M-10.537 25.667L-12.089 25.667L-12.089 25.387Q-11.863 25.387-11.714 25.353Q-11.566 25.318-11.566 25.178L-11.566 23.329Q-11.566 23.141-11.613 23.057Q-11.661 22.974-11.759 22.955Q-11.856 22.936-12.068 22.936L-12.068 22.656L-11.012 22.581L-11.012 25.178Q-11.012 25.318-10.880 25.353Q-10.749 25.387-10.537 25.387L-10.537 25.667M-11.808 21.360Q-11.808 21.189-11.685 21.070Q-11.562 20.950-11.391 20.950Q-11.224 20.950-11.101 21.070Q-10.978 21.189-10.978 21.360Q-10.978 21.535-11.101 21.658Q-11.224 21.781-11.391 21.781Q-11.562 21.781-11.685 21.658Q-11.808 21.535-11.808 21.360M-9.932 24.184Q-9.932 23.842-9.797 23.543Q-9.662 23.244-9.423 23.020Q-9.183 22.796-8.865 22.671Q-8.548 22.546-8.216 22.546Q-7.772 22.546-7.372 22.762Q-6.972 22.977-6.738 23.355Q-6.504 23.732-6.504 24.184Q-6.504 24.525-6.645 24.809Q-6.787 25.093-7.032 25.300Q-7.276 25.506-7.585 25.621Q-7.895 25.735-8.216 25.735Q-8.647 25.735-9.048 25.534Q-9.450 25.332-9.691 24.980Q-9.932 24.628-9.932 24.184M-8.216 25.486Q-7.614 25.486-7.391 25.108Q-7.167 24.730-7.167 24.098Q-7.167 23.486-7.401 23.127Q-7.635 22.769-8.216 22.769Q-9.269 22.769-9.269 24.098Q-9.269 24.730-9.043 25.108Q-8.818 25.486-8.216 25.486M-4.227 25.667L-5.861 25.667L-5.861 25.387Q-5.632 25.387-5.483 25.353Q-5.335 25.318-5.335 25.178L-5.335 23.329Q-5.335 23.059-5.442 22.998Q-5.550 22.936-5.861 22.936L-5.861 22.656L-4.801 22.581L-4.801 23.230Q-4.631 22.922-4.326 22.751Q-4.022 22.581-3.677 22.581Q-3.171 22.581-2.887 22.804Q-2.604 23.028-2.604 23.524L-2.604 25.178Q-2.604 25.315-2.455 25.351Q-2.306 25.387-2.081 25.387L-2.081 25.667L-3.711 25.667L-3.711 25.387Q-3.482 25.387-3.333 25.353Q-3.185 25.318-3.185 25.178L-3.185 23.538Q-3.185 23.203-3.304 23.003Q-3.424 22.803-3.738 22.803Q-4.008 22.803-4.243 22.939Q-4.477 23.076-4.615 23.310Q-4.754 23.544-4.754 23.818L-4.754 25.178Q-4.754 25.315-4.603 25.351Q-4.453 25.387-4.227 25.387L-4.227 25.667M-1.093 25.247Q-1.093 25.079-0.970 24.956Q-0.847 24.833-0.673 24.833Q-0.505 24.833-0.382 24.956Q-0.259 25.079-0.259 25.247Q-0.259 25.421-0.382 25.544Q-0.505 25.667-0.673 25.667Q-0.847 25.667-0.970 25.544Q-1.093 25.421-1.093 25.247M-1.093 23.063Q-1.093 22.895-0.970 22.772Q-0.847 22.649-0.673 22.649Q-0.505 22.649-0.382 22.772Q-0.259 22.895-0.259 23.063Q-0.259 23.237-0.382 23.360Q-0.505 23.483-0.673 23.483Q-0.847 23.483-0.970 23.360Q-1.093 23.237-1.093 23.063\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.321 -37.403)\">\u003Cpath d=\"M5.145 25.667L4.878 25.667L4.878 21.559Q4.878 21.289 4.771 21.227Q4.663 21.166 4.352 21.166L4.352 20.885L5.432 20.810L5.432 22.980Q5.641 22.789 5.926 22.685Q6.212 22.581 6.509 22.581Q6.827 22.581 7.124 22.702Q7.421 22.823 7.644 23.039Q7.866 23.254 7.992 23.539Q8.119 23.825 8.119 24.156Q8.119 24.601 7.879 24.965Q7.640 25.329 7.247 25.532Q6.854 25.735 6.410 25.735Q6.215 25.735 6.025 25.679Q5.836 25.623 5.675 25.518Q5.514 25.414 5.374 25.253L5.145 25.667M5.460 23.322L5.460 24.939Q5.596 25.199 5.837 25.356Q6.078 25.513 6.355 25.513Q6.649 25.513 6.861 25.406Q7.073 25.298 7.206 25.106Q7.339 24.915 7.398 24.676Q7.456 24.437 7.456 24.156Q7.456 23.797 7.362 23.493Q7.268 23.189 7.040 22.996Q6.813 22.803 6.447 22.803Q6.147 22.803 5.880 22.939Q5.613 23.076 5.460 23.322\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.321 -37.403)\">\u003Cpath d=\"M8.929 24.184Q8.929 23.842 9.064 23.543Q9.199 23.244 9.439 23.020Q9.678 22.796 9.996 22.671Q10.314 22.546 10.645 22.546Q11.090 22.546 11.489 22.762Q11.889 22.977 12.124 23.355Q12.358 23.732 12.358 24.184Q12.358 24.525 12.216 24.809Q12.074 25.093 11.830 25.300Q11.585 25.506 11.276 25.621Q10.967 25.735 10.645 25.735Q10.215 25.735 9.813 25.534Q9.411 25.332 9.170 24.980Q8.929 24.628 8.929 24.184M10.645 25.486Q11.247 25.486 11.471 25.108Q11.695 24.730 11.695 24.098Q11.695 23.486 11.460 23.127Q11.226 22.769 10.645 22.769Q9.593 22.769 9.593 24.098Q9.593 24.730 9.818 25.108Q10.044 25.486 10.645 25.486M13.479 24.826L13.479 22.929L12.840 22.929L12.840 22.707Q13.157 22.707 13.375 22.497Q13.592 22.287 13.692 21.977Q13.793 21.668 13.793 21.360L14.060 21.360L14.060 22.649L15.136 22.649L15.136 22.929L14.060 22.929L14.060 24.813Q14.060 25.089 14.164 25.288Q14.268 25.486 14.528 25.486Q14.685 25.486 14.791 25.382Q14.897 25.277 14.947 25.124Q14.996 24.970 14.996 24.813L14.996 24.399L15.263 24.399L15.263 24.826Q15.263 25.052 15.164 25.262Q15.065 25.472 14.880 25.604Q14.696 25.735 14.467 25.735Q14.029 25.735 13.754 25.498Q13.479 25.260 13.479 24.826M17.755 25.667L16.121 25.667L16.121 25.387Q16.350 25.387 16.499 25.353Q16.647 25.318 16.647 25.178L16.647 21.559Q16.647 21.289 16.540 21.227Q16.432 21.166 16.121 21.166L16.121 20.885L17.201 20.810L17.201 23.196Q17.307 23.011 17.485 22.869Q17.662 22.728 17.871 22.654Q18.079 22.581 18.305 22.581Q18.811 22.581 19.094 22.804Q19.378 23.028 19.378 23.524L19.378 25.178Q19.378 25.315 19.527 25.351Q19.676 25.387 19.901 25.387L19.901 25.667L18.271 25.667L18.271 25.387Q18.500 25.387 18.648 25.353Q18.797 25.318 18.797 25.178L18.797 23.538Q18.797 23.203 18.677 23.003Q18.558 22.803 18.243 22.803Q17.973 22.803 17.739 22.939Q17.505 23.076 17.367 23.310Q17.228 23.544 17.228 23.818L17.228 25.178Q17.228 25.315 17.379 25.351Q17.529 25.387 17.755 25.387\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.321 -37.403)\">\u003Cpath d=\"M24.874 25.667L23.240 25.667L23.240 25.387Q23.469 25.387 23.618 25.353Q23.767 25.318 23.767 25.178L23.767 23.329Q23.767 23.059 23.659 22.998Q23.551 22.936 23.240 22.936L23.240 22.656L24.300 22.581L24.300 23.230Q24.471 22.922 24.775 22.751Q25.079 22.581 25.424 22.581Q25.824 22.581 26.101 22.721Q26.378 22.861 26.463 23.209Q26.631 22.916 26.930 22.748Q27.229 22.581 27.574 22.581Q28.080 22.581 28.364 22.804Q28.648 23.028 28.648 23.524L28.648 25.178Q28.648 25.315 28.796 25.351Q28.945 25.387 29.170 25.387L29.170 25.667L27.540 25.667L27.540 25.387Q27.766 25.387 27.916 25.351Q28.066 25.315 28.066 25.178L28.066 23.538Q28.066 23.203 27.947 23.003Q27.827 22.803 27.513 22.803Q27.243 22.803 27.009 22.939Q26.774 23.076 26.636 23.310Q26.498 23.544 26.498 23.818L26.498 25.178Q26.498 25.315 26.646 25.351Q26.795 25.387 27.021 25.387L27.021 25.667L25.390 25.667L25.390 25.387Q25.619 25.387 25.768 25.353Q25.917 25.318 25.917 25.178L25.917 23.538Q25.917 23.203 25.797 23.003Q25.677 22.803 25.363 22.803Q25.093 22.803 24.859 22.939Q24.625 23.076 24.486 23.310Q24.348 23.544 24.348 23.818L24.348 25.178Q24.348 25.315 24.498 25.351Q24.649 25.387 24.874 25.387L24.874 25.667M29.717 24.184Q29.717 23.842 29.852 23.543Q29.987 23.244 30.227 23.020Q30.466 22.796 30.784 22.671Q31.102 22.546 31.433 22.546Q31.878 22.546 32.277 22.762Q32.677 22.977 32.911 23.355Q33.146 23.732 33.146 24.184Q33.146 24.525 33.004 24.809Q32.862 25.093 32.618 25.300Q32.373 25.506 32.064 25.621Q31.754 25.735 31.433 25.735Q31.003 25.735 30.601 25.534Q30.199 25.332 29.958 24.980Q29.717 24.628 29.717 24.184M31.433 25.486Q32.035 25.486 32.259 25.108Q32.482 24.730 32.482 24.098Q32.482 23.486 32.248 23.127Q32.014 22.769 31.433 22.769Q30.380 22.769 30.380 24.098Q30.380 24.730 30.606 25.108Q30.832 25.486 31.433 25.486\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.321 -37.403)\">\u003Cpath d=\"M33.963 24.156Q33.963 23.818 34.104 23.527Q34.244 23.237 34.488 23.023Q34.732 22.810 35.037 22.695Q35.341 22.581 35.666 22.581Q35.936 22.581 36.199 22.680Q36.462 22.779 36.653 22.957L36.653 21.559Q36.653 21.289 36.546 21.227Q36.438 21.166 36.127 21.166L36.127 20.885L37.204 20.810L37.204 24.994Q37.204 25.182 37.258 25.265Q37.313 25.349 37.414 25.368Q37.515 25.387 37.730 25.387L37.730 25.667L36.623 25.735L36.623 25.318Q36.206 25.735 35.580 25.735Q35.149 25.735 34.777 25.523Q34.404 25.312 34.184 24.951Q33.963 24.590 33.963 24.156M35.638 25.513Q35.847 25.513 36.033 25.441Q36.219 25.370 36.373 25.233Q36.527 25.096 36.623 24.918L36.623 23.309Q36.537 23.162 36.392 23.042Q36.247 22.922 36.077 22.863Q35.908 22.803 35.727 22.803Q35.167 22.803 34.898 23.192Q34.630 23.582 34.630 24.163Q34.630 24.734 34.864 25.124Q35.098 25.513 35.638 25.513M38.338 24.132Q38.338 23.811 38.463 23.522Q38.588 23.233 38.814 23.010Q39.039 22.786 39.335 22.666Q39.630 22.546 39.948 22.546Q40.276 22.546 40.538 22.646Q40.799 22.745 40.975 22.927Q41.151 23.110 41.245 23.368Q41.339 23.626 41.339 23.958Q41.339 24.050 41.257 24.071L39.002 24.071L39.002 24.132Q39.002 24.720 39.285 25.103Q39.569 25.486 40.136 25.486Q40.458 25.486 40.726 25.293Q40.994 25.100 41.083 24.785Q41.090 24.744 41.165 24.730L41.257 24.730Q41.339 24.754 41.339 24.826Q41.339 24.833 41.333 24.860Q41.220 25.257 40.849 25.496Q40.478 25.735 40.054 25.735Q39.617 25.735 39.217 25.527Q38.817 25.318 38.578 24.951Q38.338 24.584 38.338 24.132M39.008 23.862L40.823 23.862Q40.823 23.585 40.726 23.333Q40.628 23.080 40.430 22.924Q40.232 22.769 39.948 22.769Q39.671 22.769 39.458 22.927Q39.244 23.086 39.126 23.341Q39.008 23.596 39.008 23.862M41.927 25.660L41.927 24.597Q41.927 24.573 41.955 24.546Q41.982 24.519 42.006 24.519L42.115 24.519Q42.180 24.519 42.194 24.577Q42.290 25.011 42.536 25.262Q42.782 25.513 43.195 25.513Q43.537 25.513 43.790 25.380Q44.043 25.247 44.043 24.939Q44.043 24.782 43.949 24.667Q43.855 24.553 43.717 24.484Q43.578 24.416 43.411 24.378L42.830 24.279Q42.474 24.211 42.201 23.990Q41.927 23.770 41.927 23.428Q41.927 23.179 42.038 23.004Q42.149 22.830 42.336 22.731Q42.522 22.632 42.737 22.589Q42.953 22.546 43.195 22.546Q43.609 22.546 43.889 22.728L44.105 22.553Q44.115 22.550 44.122 22.548Q44.128 22.546 44.139 22.546L44.190 22.546Q44.217 22.546 44.241 22.570Q44.265 22.594 44.265 22.622L44.265 23.469Q44.265 23.490 44.241 23.517Q44.217 23.544 44.190 23.544L44.077 23.544Q44.050 23.544 44.024 23.519Q43.999 23.493 43.999 23.469Q43.999 23.233 43.893 23.069Q43.787 22.905 43.604 22.823Q43.421 22.741 43.189 22.741Q42.860 22.741 42.604 22.844Q42.348 22.946 42.348 23.223Q42.348 23.418 42.531 23.527Q42.713 23.637 42.942 23.678L43.517 23.784Q43.763 23.832 43.976 23.960Q44.190 24.088 44.327 24.291Q44.463 24.495 44.463 24.744Q44.463 25.257 44.098 25.496Q43.732 25.735 43.195 25.735Q42.700 25.735 42.368 25.441L42.102 25.715Q42.081 25.735 42.054 25.735L42.006 25.735Q41.982 25.735 41.955 25.708Q41.927 25.681 41.927 25.660\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-warn)\" d=\"M41.732 22.822S58.967 8.432 64.494 2.905s12.334-19.917 17.072-19.917S93.11-2.622 98.637 2.905 121.4 22.822 121.4 22.822\" style=\"stroke-dasharray:3.0,3.0;stroke-width:.8\"\u002F>\u003Cpath fill=\"var(--tk-warn)\" stroke=\"none\" d=\"M83.566-17.012a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(12.069 -19.59)\">\u003Cpath d=\"M-31.931 24.156Q-31.931 23.828-31.796 23.527Q-31.661 23.227-31.425 23.006Q-31.189 22.786-30.885 22.666Q-30.580 22.546-30.256 22.546Q-29.750 22.546-29.401 22.649Q-29.053 22.751-29.053 23.127Q-29.053 23.274-29.150 23.375Q-29.247 23.476-29.394 23.476Q-29.548 23.476-29.647 23.377Q-29.746 23.278-29.746 23.127Q-29.746 22.939-29.606 22.847Q-29.808 22.796-30.249 22.796Q-30.604 22.796-30.833 22.992Q-31.062 23.189-31.163 23.498Q-31.264 23.808-31.264 24.156Q-31.264 24.505-31.138 24.811Q-31.011 25.117-30.756 25.301Q-30.502 25.486-30.146 25.486Q-29.924 25.486-29.740 25.402Q-29.555 25.318-29.420 25.163Q-29.285 25.007-29.227 24.799Q-29.213 24.744-29.159 24.744L-29.046 24.744Q-29.015 24.744-28.993 24.768Q-28.971 24.792-28.971 24.826L-28.971 24.847Q-29.056 25.134-29.244 25.332Q-29.432 25.530-29.697 25.633Q-29.962 25.735-30.256 25.735Q-30.686 25.735-31.074 25.529Q-31.462 25.322-31.696 24.959Q-31.931 24.597-31.931 24.156M-26.715 25.667L-28.318 25.667L-28.318 25.387Q-28.092 25.387-27.943 25.353Q-27.795 25.318-27.795 25.178L-27.795 21.559Q-27.795 21.289-27.902 21.227Q-28.010 21.166-28.318 21.166L-28.318 20.885L-27.241 20.810L-27.241 25.178Q-27.241 25.315-27.091 25.351Q-26.940 25.387-26.715 25.387L-26.715 25.667M-26.161 24.184Q-26.161 23.842-26.026 23.543Q-25.891 23.244-25.652 23.020Q-25.412 22.796-25.095 22.671Q-24.777 22.546-24.445 22.546Q-24.001 22.546-23.601 22.762Q-23.201 22.977-22.967 23.355Q-22.733 23.732-22.733 24.184Q-22.733 24.525-22.875 24.809Q-23.016 25.093-23.261 25.300Q-23.505 25.506-23.815 25.621Q-24.124 25.735-24.445 25.735Q-24.876 25.735-25.277 25.534Q-25.679 25.332-25.920 24.980Q-26.161 24.628-26.161 24.184M-24.445 25.486Q-23.844 25.486-23.620 25.108Q-23.396 24.730-23.396 24.098Q-23.396 23.486-23.630 23.127Q-23.864 22.769-24.445 22.769Q-25.498 22.769-25.498 24.098Q-25.498 24.730-25.272 25.108Q-25.047 25.486-24.445 25.486M-20.456 25.667L-22.090 25.667L-22.090 25.387Q-21.861 25.387-21.713 25.353Q-21.564 25.318-21.564 25.178L-21.564 23.329Q-21.564 23.059-21.672 22.998Q-21.779 22.936-22.090 22.936L-22.090 22.656L-21.031 22.581L-21.031 23.230Q-20.860 22.922-20.556 22.751Q-20.251 22.581-19.906 22.581Q-19.400 22.581-19.117 22.804Q-18.833 23.028-18.833 23.524L-18.833 25.178Q-18.833 25.315-18.684 25.351Q-18.536 25.387-18.310 25.387L-18.310 25.667L-19.940 25.667L-19.940 25.387Q-19.711 25.387-19.563 25.353Q-19.414 25.318-19.414 25.178L-19.414 23.538Q-19.414 23.203-19.534 23.003Q-19.653 22.803-19.968 22.803Q-20.238 22.803-20.472 22.939Q-20.706 23.076-20.844 23.310Q-20.983 23.544-20.983 23.818L-20.983 25.178Q-20.983 25.315-20.832 25.351Q-20.682 25.387-20.456 25.387L-20.456 25.667M-17.763 24.132Q-17.763 23.811-17.638 23.522Q-17.514 23.233-17.288 23.010Q-17.062 22.786-16.767 22.666Q-16.471 22.546-16.153 22.546Q-15.825 22.546-15.564 22.646Q-15.302 22.745-15.126 22.927Q-14.950 23.110-14.856 23.368Q-14.762 23.626-14.762 23.958Q-14.762 24.050-14.844 24.071L-17.100 24.071L-17.100 24.132Q-17.100 24.720-16.816 25.103Q-16.533 25.486-15.965 25.486Q-15.644 25.486-15.376 25.293Q-15.107 25.100-15.018 24.785Q-15.012 24.744-14.936 24.730L-14.844 24.730Q-14.762 24.754-14.762 24.826Q-14.762 24.833-14.769 24.860Q-14.882 25.257-15.253 25.496Q-15.623 25.735-16.047 25.735Q-16.485 25.735-16.885 25.527Q-17.285 25.318-17.524 24.951Q-17.763 24.584-17.763 24.132M-17.093 23.862L-15.278 23.862Q-15.278 23.585-15.376 23.333Q-15.473 23.080-15.671 22.924Q-15.870 22.769-16.153 22.769Q-16.430 22.769-16.644 22.927Q-16.857 23.086-16.975 23.341Q-17.093 23.596-17.093 23.862\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(12.069 -19.59)\">\u003Cpath d=\"M-11.400 24.939Q-11.400 24.607-11.177 24.380Q-10.953 24.153-10.609 24.025Q-10.266 23.896-9.893 23.844Q-9.521 23.791-9.216 23.791L-9.216 23.538Q-9.216 23.333-9.324 23.153Q-9.432 22.974-9.613 22.871Q-9.794 22.769-10.002 22.769Q-10.409 22.769-10.645 22.861Q-10.556 22.898-10.510 22.982Q-10.464 23.066-10.464 23.168Q-10.464 23.264-10.510 23.343Q-10.556 23.421-10.637 23.466Q-10.717 23.510-10.806 23.510Q-10.956 23.510-11.057 23.413Q-11.158 23.315-11.158 23.168Q-11.158 22.546-10.002 22.546Q-9.791 22.546-9.541 22.610Q-9.292 22.673-9.090 22.792Q-8.888 22.912-8.762 23.097Q-8.635 23.281-8.635 23.524L-8.635 25.100Q-8.635 25.216-8.574 25.312Q-8.512 25.407-8.399 25.407Q-8.290 25.407-8.225 25.313Q-8.160 25.219-8.160 25.100L-8.160 24.652L-7.894 24.652L-7.894 25.100Q-7.894 25.370-8.121 25.535Q-8.348 25.701-8.628 25.701Q-8.837 25.701-8.974 25.547Q-9.110 25.394-9.134 25.178Q-9.281 25.445-9.563 25.590Q-9.845 25.735-10.170 25.735Q-10.447 25.735-10.731 25.660Q-11.014 25.585-11.207 25.406Q-11.400 25.226-11.400 24.939M-10.785 24.939Q-10.785 25.113-10.684 25.243Q-10.584 25.373-10.428 25.443Q-10.273 25.513-10.108 25.513Q-9.890 25.513-9.681 25.416Q-9.473 25.318-9.345 25.137Q-9.216 24.956-9.216 24.730L-9.216 24.002Q-9.541 24.002-9.907 24.093Q-10.273 24.184-10.529 24.396Q-10.785 24.607-10.785 24.939\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(12.069 -19.59)\">\u003Cpath d=\"M-6.098 25.640L-7.226 23.141Q-7.298 22.994-7.428 22.962Q-7.558 22.929-7.787 22.929L-7.787 22.649L-6.273 22.649L-6.273 22.929Q-6.625 22.929-6.625 23.076Q-6.625 23.121-6.614 23.141L-5.750 25.059L-4.970 23.329Q-4.936 23.261-4.936 23.182Q-4.936 23.069-5.020 22.999Q-5.104 22.929-5.223 22.929L-5.223 22.649L-4.027 22.649L-4.027 22.929Q-4.246 22.929-4.417 23.032Q-4.587 23.134-4.676 23.329L-5.712 25.640Q-5.760 25.735-5.866 25.735L-5.944 25.735Q-6.050 25.735-6.098 25.640\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(12.069 -19.59)\">\u003Cpath d=\"M-3.743 24.132Q-3.743 23.811-3.618 23.522Q-3.493 23.233-3.267 23.010Q-3.042 22.786-2.746 22.666Q-2.451 22.546-2.133 22.546Q-1.805 22.546-1.543 22.646Q-1.282 22.745-1.106 22.927Q-0.930 23.110-0.836 23.368Q-0.742 23.626-0.742 23.958Q-0.742 24.050-0.824 24.071L-3.079 24.071L-3.079 24.132Q-3.079 24.720-2.796 25.103Q-2.512 25.486-1.945 25.486Q-1.623 25.486-1.355 25.293Q-1.087 25.100-0.998 24.785Q-0.991 24.744-0.916 24.730L-0.824 24.730Q-0.742 24.754-0.742 24.826Q-0.742 24.833-0.748 24.860Q-0.861 25.257-1.232 25.496Q-1.603 25.735-2.027 25.735Q-2.464 25.735-2.864 25.527Q-3.264 25.318-3.503 24.951Q-3.743 24.584-3.743 24.132M-3.073 23.862L-1.258 23.862Q-1.258 23.585-1.355 23.333Q-1.453 23.080-1.651 22.924Q-1.849 22.769-2.133 22.769Q-2.410 22.769-2.623 22.927Q-2.837 23.086-2.955 23.341Q-3.073 23.596-3.073 23.862M1.596 25.667L-0.140 25.667L-0.140 25.387Q0.089 25.387 0.238 25.353Q0.386 25.318 0.386 25.178L0.386 23.329Q0.386 23.059 0.279 22.998Q0.171 22.936-0.140 22.936L-0.140 22.656L0.889 22.581L0.889 23.288Q1.019 22.980 1.261 22.781Q1.504 22.581 1.822 22.581Q2.041 22.581 2.212 22.705Q2.382 22.830 2.382 23.042Q2.382 23.179 2.283 23.278Q2.184 23.377 2.051 23.377Q1.914 23.377 1.815 23.278Q1.716 23.179 1.716 23.042Q1.716 22.902 1.815 22.803Q1.525 22.803 1.325 22.999Q1.125 23.196 1.032 23.490Q0.940 23.784 0.940 24.064L0.940 25.178Q0.940 25.387 1.596 25.387L1.596 25.667M3.025 24.939Q3.025 24.607 3.249 24.380Q3.473 24.153 3.816 24.025Q4.160 23.896 4.532 23.844Q4.905 23.791 5.209 23.791L5.209 23.538Q5.209 23.333 5.101 23.153Q4.994 22.974 4.813 22.871Q4.631 22.769 4.423 22.769Q4.016 22.769 3.780 22.861Q3.869 22.898 3.915 22.982Q3.962 23.066 3.962 23.168Q3.962 23.264 3.915 23.343Q3.869 23.421 3.789 23.466Q3.709 23.510 3.620 23.510Q3.469 23.510 3.369 23.413Q3.268 23.315 3.268 23.168Q3.268 22.546 4.423 22.546Q4.635 22.546 4.884 22.610Q5.134 22.673 5.336 22.792Q5.537 22.912 5.664 23.097Q5.790 23.281 5.790 23.524L5.790 25.100Q5.790 25.216 5.852 25.312Q5.913 25.407 6.026 25.407Q6.135 25.407 6.200 25.313Q6.265 25.219 6.265 25.100L6.265 24.652L6.532 24.652L6.532 25.100Q6.532 25.370 6.305 25.535Q6.077 25.701 5.797 25.701Q5.588 25.701 5.452 25.547Q5.315 25.394 5.291 25.178Q5.144 25.445 4.862 25.590Q4.580 25.735 4.255 25.735Q3.979 25.735 3.695 25.660Q3.411 25.585 3.218 25.406Q3.025 25.226 3.025 24.939M3.640 24.939Q3.640 25.113 3.741 25.243Q3.842 25.373 3.997 25.443Q4.153 25.513 4.317 25.513Q4.536 25.513 4.744 25.416Q4.953 25.318 5.081 25.137Q5.209 24.956 5.209 24.730L5.209 24.002Q4.884 24.002 4.519 24.093Q4.153 24.184 3.897 24.396Q3.640 24.607 3.640 24.939M6.908 26.200Q6.908 25.954 7.104 25.770Q7.301 25.585 7.557 25.506Q7.421 25.394 7.349 25.233Q7.277 25.072 7.277 24.891Q7.277 24.570 7.489 24.324Q7.154 24.026 7.154 23.616Q7.154 23.155 7.544 22.868Q7.933 22.581 8.412 22.581Q8.883 22.581 9.218 22.827Q9.393 22.673 9.603 22.591Q9.813 22.509 10.042 22.509Q10.206 22.509 10.328 22.616Q10.449 22.724 10.449 22.888Q10.449 22.984 10.377 23.056Q10.305 23.127 10.213 23.127Q10.114 23.127 10.044 23.054Q9.974 22.980 9.974 22.881Q9.974 22.827 9.987 22.796L9.994 22.782Q10.001 22.762 10.010 22.751Q10.018 22.741 10.022 22.734Q9.666 22.734 9.379 22.957Q9.666 23.250 9.666 23.616Q9.666 23.931 9.482 24.163Q9.297 24.396 9.008 24.524Q8.719 24.652 8.412 24.652Q8.210 24.652 8.019 24.602Q7.827 24.553 7.650 24.443Q7.557 24.570 7.557 24.713Q7.557 24.895 7.685 25.030Q7.814 25.165 7.998 25.165L8.630 25.165Q9.078 25.165 9.447 25.236Q9.817 25.308 10.076 25.537Q10.336 25.766 10.336 26.200Q10.336 26.521 10.040 26.723Q9.745 26.925 9.341 27.014Q8.938 27.103 8.624 27.103Q8.306 27.103 7.902 27.014Q7.499 26.925 7.203 26.723Q6.908 26.521 6.908 26.200M7.362 26.200Q7.362 26.429 7.581 26.578Q7.800 26.727 8.092 26.795Q8.384 26.863 8.624 26.863Q8.788 26.863 8.996 26.827Q9.205 26.792 9.411 26.711Q9.618 26.631 9.750 26.503Q9.881 26.375 9.881 26.200Q9.881 25.848 9.500 25.754Q9.119 25.660 8.617 25.660L7.998 25.660Q7.759 25.660 7.561 25.811Q7.362 25.961 7.362 26.200M8.412 24.413Q9.078 24.413 9.078 23.616Q9.078 22.816 8.412 22.816Q7.742 22.816 7.742 23.616Q7.742 24.413 8.412 24.413M10.890 24.132Q10.890 23.811 11.015 23.522Q11.139 23.233 11.365 23.010Q11.590 22.786 11.886 22.666Q12.182 22.546 12.500 22.546Q12.828 22.546 13.089 22.646Q13.351 22.745 13.527 22.927Q13.703 23.110 13.797 23.368Q13.891 23.626 13.891 23.958Q13.891 24.050 13.809 24.071L11.553 24.071L11.553 24.132Q11.553 24.720 11.837 25.103Q12.120 25.486 12.688 25.486Q13.009 25.486 13.277 25.293Q13.546 25.100 13.634 24.785Q13.641 24.744 13.716 24.730L13.809 24.730Q13.891 24.754 13.891 24.826Q13.891 24.833 13.884 24.860Q13.771 25.257 13.400 25.496Q13.029 25.735 12.606 25.735Q12.168 25.735 11.768 25.527Q11.368 25.318 11.129 24.951Q10.890 24.584 10.890 24.132M11.560 23.862L13.375 23.862Q13.375 23.585 13.277 23.333Q13.180 23.080 12.982 22.924Q12.783 22.769 12.500 22.769Q12.223 22.769 12.009 22.927Q11.796 23.086 11.678 23.341Q11.560 23.596 11.560 23.862M14.479 25.660L14.479 24.597Q14.479 24.573 14.506 24.546Q14.533 24.519 14.557 24.519L14.667 24.519Q14.732 24.519 14.745 24.577Q14.841 25.011 15.087 25.262Q15.333 25.513 15.747 25.513Q16.088 25.513 16.341 25.380Q16.594 25.247 16.594 24.939Q16.594 24.782 16.500 24.667Q16.406 24.553 16.268 24.484Q16.130 24.416 15.962 24.378L15.381 24.279Q15.026 24.211 14.752 23.990Q14.479 23.770 14.479 23.428Q14.479 23.179 14.590 23.004Q14.701 22.830 14.887 22.731Q15.073 22.632 15.289 22.589Q15.504 22.546 15.747 22.546Q16.160 22.546 16.441 22.728L16.656 22.553Q16.666 22.550 16.673 22.548Q16.680 22.546 16.690 22.546L16.741 22.546Q16.769 22.546 16.793 22.570Q16.817 22.594 16.817 22.622L16.817 23.469Q16.817 23.490 16.793 23.517Q16.769 23.544 16.741 23.544L16.629 23.544Q16.601 23.544 16.576 23.519Q16.550 23.493 16.550 23.469Q16.550 23.233 16.444 23.069Q16.338 22.905 16.155 22.823Q15.972 22.741 15.740 22.741Q15.412 22.741 15.155 22.844Q14.899 22.946 14.899 23.223Q14.899 23.418 15.082 23.527Q15.265 23.637 15.494 23.678L16.068 23.784Q16.314 23.832 16.528 23.960Q16.741 24.088 16.878 24.291Q17.015 24.495 17.015 24.744Q17.015 25.257 16.649 25.496Q16.283 25.735 15.747 25.735Q15.251 25.735 14.920 25.441L14.653 25.715Q14.632 25.735 14.605 25.735L14.557 25.735Q14.533 25.735 14.506 25.708Q14.479 25.681 14.479 25.660M18.044 25.247Q18.044 25.079 18.167 24.956Q18.290 24.833 18.464 24.833Q18.631 24.833 18.755 24.956Q18.878 25.079 18.878 25.247Q18.878 25.421 18.755 25.544Q18.631 25.667 18.464 25.667Q18.290 25.667 18.167 25.544Q18.044 25.421 18.044 25.247M18.044 23.063Q18.044 22.895 18.167 22.772Q18.290 22.649 18.464 22.649Q18.631 22.649 18.755 22.772Q18.878 22.895 18.878 23.063Q18.878 23.237 18.755 23.360Q18.631 23.483 18.464 23.483Q18.290 23.483 18.167 23.360Q18.044 23.237 18.044 23.063\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(12.069 -19.59)\">\u003Cpath d=\"M25.176 25.667L23.542 25.667L23.542 25.387Q23.771 25.387 23.920 25.353Q24.069 25.318 24.069 25.178L24.069 21.559Q24.069 21.289 23.961 21.227Q23.853 21.166 23.542 21.166L23.542 20.885L24.622 20.810L24.622 23.196Q24.728 23.011 24.906 22.869Q25.084 22.728 25.292 22.654Q25.501 22.581 25.726 22.581Q26.232 22.581 26.516 22.804Q26.800 23.028 26.800 23.524L26.800 25.178Q26.800 25.315 26.948 25.351Q27.097 25.387 27.323 25.387L27.323 25.667L25.692 25.667L25.692 25.387Q25.921 25.387 26.070 25.353Q26.219 25.318 26.219 25.178L26.219 23.538Q26.219 23.203 26.099 23.003Q25.979 22.803 25.665 22.803Q25.395 22.803 25.161 22.939Q24.927 23.076 24.788 23.310Q24.650 23.544 24.650 23.818L24.650 25.178Q24.650 25.315 24.800 25.351Q24.951 25.387 25.176 25.387L25.176 25.667M29.527 25.667L27.975 25.667L27.975 25.387Q28.201 25.387 28.350 25.353Q28.498 25.318 28.498 25.178L28.498 23.329Q28.498 23.141 28.451 23.057Q28.403 22.974 28.305 22.955Q28.208 22.936 27.996 22.936L27.996 22.656L29.052 22.581L29.052 25.178Q29.052 25.318 29.184 25.353Q29.315 25.387 29.527 25.387L29.527 25.667M28.256 21.360Q28.256 21.189 28.379 21.070Q28.502 20.950 28.673 20.950Q28.840 20.950 28.963 21.070Q29.086 21.189 29.086 21.360Q29.086 21.535 28.963 21.658Q28.840 21.781 28.673 21.781Q28.502 21.781 28.379 21.658Q28.256 21.535 28.256 21.360M30.700 24.826L30.700 22.929L30.060 22.929L30.060 22.707Q30.378 22.707 30.595 22.497Q30.812 22.287 30.913 21.977Q31.014 21.668 31.014 21.360L31.281 21.360L31.281 22.649L32.357 22.649L32.357 22.929L31.281 22.929L31.281 24.813Q31.281 25.089 31.385 25.288Q31.489 25.486 31.749 25.486Q31.906 25.486 32.012 25.382Q32.118 25.277 32.168 25.124Q32.217 24.970 32.217 24.813L32.217 24.399L32.484 24.399L32.484 24.826Q32.484 25.052 32.385 25.262Q32.285 25.472 32.101 25.604Q31.916 25.735 31.687 25.735Q31.250 25.735 30.975 25.498Q30.700 25.260 30.700 24.826M33.294 25.660L33.294 24.597Q33.294 24.573 33.321 24.546Q33.348 24.519 33.372 24.519L33.482 24.519Q33.547 24.519 33.560 24.577Q33.656 25.011 33.902 25.262Q34.148 25.513 34.562 25.513Q34.904 25.513 35.157 25.380Q35.409 25.247 35.409 24.939Q35.409 24.782 35.315 24.667Q35.222 24.553 35.083 24.484Q34.945 24.416 34.777 24.378L34.196 24.279Q33.841 24.211 33.567 23.990Q33.294 23.770 33.294 23.428Q33.294 23.179 33.405 23.004Q33.516 22.830 33.702 22.731Q33.888 22.632 34.104 22.589Q34.319 22.546 34.562 22.546Q34.975 22.546 35.256 22.728L35.471 22.553Q35.481 22.550 35.488 22.548Q35.495 22.546 35.505 22.546L35.556 22.546Q35.584 22.546 35.608 22.570Q35.632 22.594 35.632 22.622L35.632 23.469Q35.632 23.490 35.608 23.517Q35.584 23.544 35.556 23.544L35.444 23.544Q35.416 23.544 35.391 23.519Q35.365 23.493 35.365 23.469Q35.365 23.233 35.259 23.069Q35.153 22.905 34.970 22.823Q34.787 22.741 34.555 22.741Q34.227 22.741 33.971 22.844Q33.714 22.946 33.714 23.223Q33.714 23.418 33.897 23.527Q34.080 23.637 34.309 23.678L34.883 23.784Q35.129 23.832 35.343 23.960Q35.556 24.088 35.693 24.291Q35.830 24.495 35.830 24.744Q35.830 25.257 35.464 25.496Q35.098 25.735 34.562 25.735Q34.066 25.735 33.735 25.441L33.468 25.715Q33.448 25.735 33.420 25.735L33.372 25.735Q33.348 25.735 33.321 25.708Q33.294 25.681 33.294 25.660\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(12.069 -19.59)\">\u003Cpath d=\"M39.121 24.184Q39.121 23.842 39.256 23.543Q39.391 23.244 39.631 23.020Q39.870 22.796 40.188 22.671Q40.506 22.546 40.837 22.546Q41.282 22.546 41.681 22.762Q42.081 22.977 42.316 23.355Q42.550 23.732 42.550 24.184Q42.550 24.525 42.408 24.809Q42.266 25.093 42.022 25.300Q41.777 25.506 41.468 25.621Q41.159 25.735 40.837 25.735Q40.407 25.735 40.005 25.534Q39.603 25.332 39.362 24.980Q39.121 24.628 39.121 24.184M40.837 25.486Q41.439 25.486 41.663 25.108Q41.887 24.730 41.887 24.098Q41.887 23.486 41.652 23.127Q41.418 22.769 40.837 22.769Q39.785 22.769 39.785 24.098Q39.785 24.730 40.010 25.108Q40.236 25.486 40.837 25.486M43.951 25.667L43.684 25.667L43.684 21.559Q43.684 21.289 43.577 21.227Q43.469 21.166 43.158 21.166L43.158 20.885L44.238 20.810L44.238 22.980Q44.447 22.789 44.732 22.685Q45.017 22.581 45.315 22.581Q45.633 22.581 45.930 22.702Q46.227 22.823 46.450 23.039Q46.672 23.254 46.798 23.539Q46.925 23.825 46.925 24.156Q46.925 24.601 46.685 24.965Q46.446 25.329 46.053 25.532Q45.660 25.735 45.216 25.735Q45.021 25.735 44.831 25.679Q44.641 25.623 44.481 25.518Q44.320 25.414 44.180 25.253L43.951 25.667M44.265 23.322L44.265 24.939Q44.402 25.199 44.643 25.356Q44.884 25.513 45.161 25.513Q45.455 25.513 45.667 25.406Q45.879 25.298 46.012 25.106Q46.145 24.915 46.203 24.676Q46.262 24.437 46.262 24.156Q46.262 23.797 46.168 23.493Q46.074 23.189 45.846 22.996Q45.619 22.803 45.253 22.803Q44.952 22.803 44.686 22.939Q44.419 23.076 44.265 23.322M47.560 25.660L47.560 24.597Q47.560 24.573 47.588 24.546Q47.615 24.519 47.639 24.519L47.748 24.519Q47.813 24.519 47.827 24.577Q47.923 25.011 48.169 25.262Q48.415 25.513 48.828 25.513Q49.170 25.513 49.423 25.380Q49.676 25.247 49.676 24.939Q49.676 24.782 49.582 24.667Q49.488 24.553 49.350 24.484Q49.211 24.416 49.044 24.378L48.463 24.279Q48.107 24.211 47.834 23.990Q47.560 23.770 47.560 23.428Q47.560 23.179 47.671 23.004Q47.783 22.830 47.969 22.731Q48.155 22.632 48.370 22.589Q48.586 22.546 48.828 22.546Q49.242 22.546 49.522 22.728L49.738 22.553Q49.748 22.550 49.755 22.548Q49.762 22.546 49.772 22.546L49.823 22.546Q49.850 22.546 49.874 22.570Q49.898 22.594 49.898 22.622L49.898 23.469Q49.898 23.490 49.874 23.517Q49.850 23.544 49.823 23.544L49.710 23.544Q49.683 23.544 49.657 23.519Q49.632 23.493 49.632 23.469Q49.632 23.233 49.526 23.069Q49.420 22.905 49.237 22.823Q49.054 22.741 48.822 22.741Q48.494 22.741 48.237 22.844Q47.981 22.946 47.981 23.223Q47.981 23.418 48.164 23.527Q48.347 23.637 48.576 23.678L49.150 23.784Q49.396 23.832 49.609 23.960Q49.823 24.088 49.960 24.291Q50.097 24.495 50.097 24.744Q50.097 25.257 49.731 25.496Q49.365 25.735 48.828 25.735Q48.333 25.735 48.001 25.441L47.735 25.715Q47.714 25.735 47.687 25.735L47.639 25.735Q47.615 25.735 47.588 25.708Q47.560 25.681 47.560 25.660M51.252 24.826L51.252 22.929L50.613 22.929L50.613 22.707Q50.931 22.707 51.148 22.497Q51.365 22.287 51.465 21.977Q51.566 21.668 51.566 21.360L51.833 21.360L51.833 22.649L52.910 22.649L52.910 22.929L51.833 22.929L51.833 24.813Q51.833 25.089 51.937 25.288Q52.041 25.486 52.301 25.486Q52.458 25.486 52.564 25.382Q52.670 25.277 52.720 25.124Q52.769 24.970 52.769 24.813L52.769 24.399L53.036 24.399L53.036 24.826Q53.036 25.052 52.937 25.262Q52.838 25.472 52.653 25.604Q52.469 25.735 52.240 25.735Q51.802 25.735 51.527 25.498Q51.252 25.260 51.252 24.826M53.904 24.939Q53.904 24.607 54.128 24.380Q54.352 24.153 54.695 24.025Q55.039 23.896 55.411 23.844Q55.784 23.791 56.088 23.791L56.088 23.538Q56.088 23.333 55.981 23.153Q55.873 22.974 55.692 22.871Q55.511 22.769 55.302 22.769Q54.895 22.769 54.660 22.861Q54.748 22.898 54.795 22.982Q54.841 23.066 54.841 23.168Q54.841 23.264 54.795 23.343Q54.748 23.421 54.668 23.466Q54.588 23.510 54.499 23.510Q54.348 23.510 54.248 23.413Q54.147 23.315 54.147 23.168Q54.147 22.546 55.302 22.546Q55.514 22.546 55.764 22.610Q56.013 22.673 56.215 22.792Q56.416 22.912 56.543 23.097Q56.669 23.281 56.669 23.524L56.669 25.100Q56.669 25.216 56.731 25.312Q56.792 25.407 56.905 25.407Q57.015 25.407 57.079 25.313Q57.144 25.219 57.144 25.100L57.144 24.652L57.411 24.652L57.411 25.100Q57.411 25.370 57.184 25.535Q56.956 25.701 56.676 25.701Q56.468 25.701 56.331 25.547Q56.194 25.394 56.170 25.178Q56.023 25.445 55.741 25.590Q55.459 25.735 55.135 25.735Q54.858 25.735 54.574 25.660Q54.290 25.585 54.097 25.406Q53.904 25.226 53.904 24.939M54.519 24.939Q54.519 25.113 54.620 25.243Q54.721 25.373 54.877 25.443Q55.032 25.513 55.196 25.513Q55.415 25.513 55.623 25.416Q55.832 25.318 55.960 25.137Q56.088 24.956 56.088 24.730L56.088 24.002Q55.764 24.002 55.398 24.093Q55.032 24.184 54.776 24.396Q54.519 24.607 54.519 24.939M57.828 24.156Q57.828 23.828 57.963 23.527Q58.098 23.227 58.334 23.006Q58.570 22.786 58.874 22.666Q59.178 22.546 59.503 22.546Q60.009 22.546 60.357 22.649Q60.706 22.751 60.706 23.127Q60.706 23.274 60.608 23.375Q60.511 23.476 60.364 23.476Q60.210 23.476 60.111 23.377Q60.012 23.278 60.012 23.127Q60.012 22.939 60.152 22.847Q59.951 22.796 59.510 22.796Q59.154 22.796 58.925 22.992Q58.696 23.189 58.595 23.498Q58.494 23.808 58.494 24.156Q58.494 24.505 58.621 24.811Q58.747 25.117 59.002 25.301Q59.257 25.486 59.612 25.486Q59.834 25.486 60.019 25.402Q60.203 25.318 60.338 25.163Q60.473 25.007 60.532 24.799Q60.545 24.744 60.600 24.744L60.713 24.744Q60.744 24.744 60.766 24.768Q60.788 24.792 60.788 24.826L60.788 24.847Q60.702 25.134 60.515 25.332Q60.327 25.530 60.062 25.633Q59.797 25.735 59.503 25.735Q59.072 25.735 58.684 25.529Q58.296 25.322 58.062 24.959Q57.828 24.597 57.828 24.156M63.044 25.667L61.441 25.667L61.441 25.387Q61.666 25.387 61.815 25.353Q61.964 25.318 61.964 25.178L61.964 21.559Q61.964 21.289 61.856 21.227Q61.748 21.166 61.441 21.166L61.441 20.885L62.517 20.810L62.517 25.178Q62.517 25.315 62.668 25.351Q62.818 25.387 63.044 25.387L63.044 25.667M63.598 24.132Q63.598 23.811 63.722 23.522Q63.847 23.233 64.073 23.010Q64.298 22.786 64.594 22.666Q64.890 22.546 65.207 22.546Q65.535 22.546 65.797 22.646Q66.058 22.745 66.234 22.927Q66.410 23.110 66.504 23.368Q66.598 23.626 66.598 23.958Q66.598 24.050 66.516 24.071L64.261 24.071L64.261 24.132Q64.261 24.720 64.544 25.103Q64.828 25.486 65.395 25.486Q65.717 25.486 65.985 25.293Q66.253 25.100 66.342 24.785Q66.349 24.744 66.424 24.730L66.516 24.730Q66.598 24.754 66.598 24.826Q66.598 24.833 66.592 24.860Q66.479 25.257 66.108 25.496Q65.737 25.735 65.313 25.735Q64.876 25.735 64.476 25.527Q64.076 25.318 63.837 24.951Q63.598 24.584 63.598 24.132M64.267 23.862L66.082 23.862Q66.082 23.585 65.985 23.333Q65.888 23.080 65.689 22.924Q65.491 22.769 65.207 22.769Q64.931 22.769 64.717 22.927Q64.503 23.086 64.385 23.341Q64.267 23.596 64.267 23.862\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Why expressive action distributions matter for cloning. Human demonstrations are multi-modal: at an obstacle, experts go left OR right. A unimodal (Gaussian) clone fits the mean of the two modes and drives straight into the obstacle; a diffusion policy captures both modes and commits to one.\u003C\u002Ffigcaption>",1785117798432]