[{"data":1,"prerenderedAt":9447},["ShallowReactive",2],{"lesson:\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":3,"course-wordcounts":3674,"ref-card-index":4586,"nav:reinforcement-learning":9269,"tikz:01c4f9b08938906b53b3007bd7e6562d3d9754d4060187165d56cdb18dd25906":9442,"tikz:50a0e79092fc766c44491b4e7657ef5a3b9b6e5335e199c32057980fa10e0a9f":9443,"tikz:0a28a1e71498539c2ed91b61e36e5c4bc16a0fb7711f6b38459fae208dc65a55":9444,"tikz:94835db9a61a842efcfd9132fa262139480bf93474cc901240cf79961215b3a9":9445,"tikz:9bef88c62f1b876cf1f2ef0354f832d48974920701407c7f3ad25dd37e7b1509":9446},{"id":4,"title":5,"blurb":6,"body":7,"brief":3644,"category":3645,"description":3646,"draft":3647,"extension":3648,"meta":3649,"module":3652,"navigation":3653,"path":3654,"practice":3655,"rawbody":3656,"readingTime":3657,"seo":3662,"sources":3663,"status":3668,"stem":3669,"summary":3670,"topics":3671,"__hash__":3673},"course\u002F07.reinforcement-learning\u002F02.tabular-methods\u002F11.decision-time-planning.md","Decision-Time Planning","",{"type":8,"value":9,"toc":3634},"minimark",[10,106,307,312,323,442,505,509,633,640,644,668,671,1062,1106,1109,1132,1149,1156,1159,1186,1218,1223,1294,1400,1470,1474,1713,1716,1779,1783,1963,1966,1993,2064,2124,2128,2155,2289,2292,2958,3300,3307,3377,3385,3630],[11,12,13,14,19,20,24,25,105],"p",{},"The ",[15,16,18],"a",{"href":17},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning","planning-and-learning","\nlesson built Dyna: a model generates simulated experience, and the same backups\nthat learn from real experience improve a global value function state by state.\nThat is ",[21,22,23],"strong",{},"background planning",". When a state ",[26,27,30],"span",{"className":28},[29],"katex",[26,31,35],{"className":32,"ariaHidden":34},[33],"katex-html","true",[26,36,39,44],{"className":37},[38],"base",[26,40],{"className":41,"style":43},[42],"strut","height:0.8333em;vertical-align:-0.15em;",[26,45,48,54],{"className":46},[47],"mord",[26,49,53],{"className":50,"style":52},[47,51],"mathnormal","margin-right:0.0576em;","S",[26,55,58],{"className":56},[57],"msupsub",[26,59,63,96],{"className":60},[61,62],"vlist-t","vlist-t2",[26,64,67,91],{"className":65},[66],"vlist-r",[26,68,72],{"className":69,"style":71},[70],"vlist","height:0.2806em;",[26,73,75,80],{"style":74},"top:-2.55em;margin-left:-0.0576em;margin-right:0.05em;",[26,76],{"className":77,"style":79},[78],"pstrut","height:2.7em;",[26,81,87],{"className":82},[83,84,85,86],"sizing","reset-size6","size3","mtight",[26,88,90],{"className":89},[47,51,86],"t",[26,92,95],{"className":93},[94],"vlist-s","​",[26,97,99],{"className":98},[66],[26,100,103],{"className":101,"style":102},[70],"height:0.15em;",[26,104],{}," finally arrives, its action is\nalready stored in the table; reading it off is a lookup. All the computation\nhappened earlier, spread across the whole state space.",[11,107,108,109,161,162,166,167,221,222,225,226,293,294,297,298],{},"There is a second way to use a model. Wait until ",[26,110,112],{"className":111},[29],[26,113,115],{"className":114,"ariaHidden":34},[33],[26,116,118,121],{"className":117},[38],[26,119],{"className":120,"style":43},[42],[26,122,124,127],{"className":123},[47],[26,125,53],{"className":126,"style":52},[47,51],[26,128,130],{"className":129},[57],[26,131,133,153],{"className":132},[61,62],[26,134,136,150],{"className":135},[66],[26,137,139],{"className":138,"style":71},[70],[26,140,141,144],{"style":74},[26,142],{"className":143,"style":79},[78],[26,145,147],{"className":146},[83,84,85,86],[26,148,90],{"className":149},[47,51,86],[26,151,95],{"className":152},[94],[26,154,156],{"className":155},[66],[26,157,159],{"className":158,"style":102},[70],[26,160],{}," arrives, then run a\ncomputation whose ",[163,164,165],"em",{},"only"," output is the single action ",[26,168,170],{"className":169},[29],[26,171,173],{"className":172,"ariaHidden":34},[33],[26,174,176,179],{"className":175},[38],[26,177],{"className":178,"style":43},[42],[26,180,182,186],{"className":181},[47],[26,183,185],{"className":184},[47,51],"A",[26,187,189],{"className":188},[57],[26,190,192,213],{"className":191},[61,62],[26,193,195,210],{"className":194},[66],[26,196,198],{"className":197,"style":71},[70],[26,199,201,204],{"style":200},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[26,202],{"className":203,"style":79},[78],[26,205,207],{"className":206},[83,84,85,86],[26,208,90],{"className":209},[47,51,86],[26,211,95],{"className":212},[94],[26,214,216],{"className":215},[66],[26,217,219],{"className":218,"style":102},[70],[26,220],{}," — a deep, focused\nlookahead from ",[163,223,224],{},"this"," state — and discard everything the moment you have played.\nThe next state ",[26,227,229],{"className":228},[29],[26,230,232],{"className":231,"ariaHidden":34},[33],[26,233,235,239],{"className":234},[38],[26,236],{"className":237,"style":238},[42],"height:0.8917em;vertical-align:-0.2083em;",[26,240,242,245],{"className":241},[47],[26,243,53],{"className":244,"style":52},[47,51],[26,246,248],{"className":247},[57],[26,249,251,284],{"className":250},[61,62],[26,252,254,281],{"className":253},[66],[26,255,258],{"className":256,"style":257},[70],"height:0.3011em;",[26,259,260,263],{"style":74},[26,261],{"className":262,"style":79},[78],[26,264,266],{"className":265},[83,84,85,86],[26,267,269,272,277],{"className":268},[47,86],[26,270,90],{"className":271},[47,51,86],[26,273,276],{"className":274},[275,86],"mbin","+",[26,278,280],{"className":279},[47,86],"1",[26,282,95],{"className":283},[94],[26,285,287],{"className":286},[66],[26,288,291],{"className":289,"style":290},[70],"height:0.2083em;",[26,292],{}," starts the computation over. This is ",[21,295,296],{},"decision-time\nplanning",", and it is how a chess engine spends its clock: not on a policy for all\nof chess, but on the best move in the position on the board right now. This lesson\ntakes the compressed treatment from the planning lesson and works it out in full —\nreal-time DP, heuristic search, and rollout algorithms — building toward Monte Carlo\nTree Search, the search behind AlphaZero, which the next lesson develops.",[299,300,301],"sup",{},[15,302,280],{"href":303,"ariaDescribedBy":304,"dataFootnoteRef":6,"id":306},"#user-content-fn-sb-decision",[305],"footnote-label","user-content-fnref-sb-decision",[308,309,311],"h2",{"id":310},"background-versus-decision-time-planning","Background versus decision-time planning",[11,313,314,315,318,319,322],{},"The distinction is ",[163,316,317],{},"when"," the planning happens relative to the moment of action,\nand ",[163,320,321],{},"what it produces",".",[11,324,325,328,329,335,336,388,389,441],{},[21,326,327],{},"Background planning"," improves the value function or policy over many states,\nahead of demand, so that action selection is cheap.",[299,330,331],{},[15,332,280],{"href":303,"ariaDescribedBy":333,"dataFootnoteRef":6,"id":334},[305],"user-content-fnref-sb-decision-2"," Dyna and\nprioritized sweeping are background planners: their updates are not aimed at the\ncurrent state in particular. By the time ",[26,337,339],{"className":338},[29],[26,340,342],{"className":341,"ariaHidden":34},[33],[26,343,345,348],{"className":344},[38],[26,346],{"className":347,"style":43},[42],[26,349,351,354],{"className":350},[47],[26,352,53],{"className":353,"style":52},[47,51],[26,355,357],{"className":356},[57],[26,358,360,380],{"className":359},[61,62],[26,361,363,377],{"className":362},[66],[26,364,366],{"className":365,"style":71},[70],[26,367,368,371],{"style":74},[26,369],{"className":370,"style":79},[78],[26,372,374],{"className":373},[83,84,85,86],[26,375,90],{"className":376},[47,51,86],[26,378,95],{"className":379},[94],[26,381,383],{"className":382},[66],[26,384,386],{"className":385,"style":102},[70],[26,387],{}," is encountered, planning has already\nshaped the table entries used to choose ",[26,390,392],{"className":391},[29],[26,393,395],{"className":394,"ariaHidden":34},[33],[26,396,398,401],{"className":397},[38],[26,399],{"className":400,"style":43},[42],[26,402,404,407],{"className":403},[47],[26,405,185],{"className":406},[47,51],[26,408,410],{"className":409},[57],[26,411,413,433],{"className":412},[61,62],[26,414,416,430],{"className":415},[66],[26,417,419],{"className":418,"style":71},[70],[26,420,421,424],{"style":200},[26,422],{"className":423,"style":79},[78],[26,425,427],{"className":426},[83,84,85,86],[26,428,90],{"className":429},[47,51,86],[26,431,95],{"className":432},[94],[26,434,436],{"className":435},[66],[26,437,439],{"className":438,"style":102},[70],[26,440],{},", and possibly the entries for a great\nmany other states too.",[11,443,444,447,448,451,452,504],{},[21,445,446],{},"Decision-time planning"," begins and completes ",[163,449,450],{},"after"," encountering each new state,\nas a computation whose output is one action. The values and policy it produces are\nspecific to ",[26,453,455],{"className":454},[29],[26,456,458],{"className":457,"ariaHidden":34},[33],[26,459,461,464],{"className":460},[38],[26,462],{"className":463,"style":43},[42],[26,465,467,470],{"className":466},[47],[26,468,53],{"className":469,"style":52},[47,51],[26,471,473],{"className":472},[57],[26,474,476,496],{"className":475},[61,62],[26,477,479,493],{"className":478},[66],[26,480,482],{"className":481,"style":71},[70],[26,483,484,487],{"style":74},[26,485],{"className":486,"style":79},[78],[26,488,490],{"className":489},[83,84,85,86],[26,491,90],{"className":492},[47,51,86],[26,494,95],{"className":495},[94],[26,497,499],{"className":498},[66],[26,500,502],{"className":501,"style":102},[70],[26,503],{}," and its likely successors, and they are usually discarded once the\naction is chosen — you rarely return to the exact same state soon enough for saved\nvalues to help. In exchange, every unit of computation\nis spent on the decision immediately at hand.",[506,507],"tikz-figure",{"hash":508},"01c4f9b08938906b53b3007bd7e6562d3d9754d4060187165d56cdb18dd25906",[510,511,513],"callout",{"type":512},"definition",[11,514,515,518,519,522,523,526,527,579,580,632],{},[21,516,517],{},"Definition (Background vs. decision-time planning)."," ",[21,520,521],{},"Background"," planning\nuses simulated experience to improve a global value function or policy ahead of\ntime, so choosing an action is a cheap table lookup. ",[21,524,525],{},"Decision-time"," planning\nruns on demand for the current state ",[26,528,530],{"className":529},[29],[26,531,533],{"className":532,"ariaHidden":34},[33],[26,534,536,539],{"className":535},[38],[26,537],{"className":538,"style":43},[42],[26,540,542,545],{"className":541},[47],[26,543,53],{"className":544,"style":52},[47,51],[26,546,548],{"className":547},[57],[26,549,551,571],{"className":550},[61,62],[26,552,554,568],{"className":553},[66],[26,555,557],{"className":556,"style":71},[70],[26,558,559,562],{"style":74},[26,560],{"className":561,"style":79},[78],[26,563,565],{"className":564},[83,84,85,86],[26,566,90],{"className":567},[47,51,86],[26,569,95],{"className":570},[94],[26,572,574],{"className":573},[66],[26,575,577],{"className":576,"style":102},[70],[26,578],{},", producing one action ",[26,581,583],{"className":582},[29],[26,584,586],{"className":585,"ariaHidden":34},[33],[26,587,589,592],{"className":588},[38],[26,590],{"className":591,"style":43},[42],[26,593,595,598],{"className":594},[47],[26,596,185],{"className":597},[47,51],[26,599,601],{"className":600},[57],[26,602,604,624],{"className":603},[61,62],[26,605,607,621],{"className":606},[66],[26,608,610],{"className":609,"style":71},[70],[26,611,612,615],{"style":200},[26,613],{"className":614,"style":79},[78],[26,616,618],{"className":617},[83,84,85,86],[26,619,90],{"className":620},[47,51,86],[26,622,95],{"className":623},[94],[26,625,627],{"className":626},[66],[26,628,630],{"className":629,"style":102},[70],[26,631],{}," from a\nfocused, often deep lookahead, then throwing the intermediate values and policy\naway.",[11,634,635,636,639],{},"The two blend in practice — you can focus planning on the current state ",[163,637,638],{},"and"," save\na little of it so a later return is cheaper — but they are cleanest understood\napart. The trade is latency against depth: background planning suits control that\nmust respond in milliseconds; decision-time planning suits settings where you can\nafford seconds or minutes per move, and a deep lookahead buys a much better action.",[308,641,643],{"id":642},"real-time-dynamic-programming","Real-time dynamic programming",[11,645,646,647,650,651,654,655,659,660],{},"Before decision-time planning proper, there is a method between the\ntwo categories, and it illustrates\nwhy ",[163,648,649],{},"focusing on the states the agent actually visits"," helps. ",[21,652,653],{},"Real-time\ndynamic programming"," (RTDP) is an on-policy trajectory-sampling version of the\n",[15,656,658],{"href":657},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming","value-iteration","\nalgorithm of dynamic programming.",[299,661,662],{},[15,663,667],{"href":664,"ariaDescribedBy":665,"dataFootnoteRef":6,"id":666},"#user-content-fn-sb-rtdp",[305],"user-content-fnref-sb-rtdp","2",[11,669,670],{},"Conventional value iteration sweeps the entire state set, applying the expected\nvalue-iteration update",[26,672,675],{"className":673},[674],"katex-display",[26,676,678],{"className":677},[29],[26,679,681,720,952,997],{"className":680,"ariaHidden":34},[33],[26,682,684,688,693,698,702,707,712,717],{"className":683},[38],[26,685],{"className":686,"style":687},[42],"height:1em;vertical-align:-0.25em;",[26,689,692],{"className":690,"style":691},[47,51],"margin-right:0.2222em;","V",[26,694,697],{"className":695},[696],"mopen","(",[26,699,701],{"className":700},[47,51],"s",[26,703,706],{"className":704},[705],"mclose",")",[26,708],{"className":709,"style":711},[710],"mspace","margin-right:0.2778em;",[26,713,716],{"className":714},[715],"mrel","←",[26,718],{"className":719,"style":711},[710],[26,721,723,727,786,790,890,893,896,899,933,936,939,942,945,949],{"className":722},[38],[26,724],{"className":725,"style":726},[42],"height:2.4801em;vertical-align:-1.4301em;",[26,728,732],{"className":729},[730,731],"mop","op-limits",[26,733,735,777],{"className":734},[61,62],[26,736,738,774],{"className":737},[66],[26,739,742,758],{"className":740,"style":741},[70],"height:0.4306em;",[26,743,745,749],{"style":744},"top:-2.4em;margin-left:0em;",[26,746],{"className":747,"style":748},[78],"height:3em;",[26,750,752],{"className":751},[83,84,85,86],[26,753,755],{"className":754},[47,86],[26,756,15],{"className":757},[47,51,86],[26,759,761,764],{"style":760},"top:-3em;",[26,762],{"className":763,"style":748},[78],[26,765,766],{},[26,767,769],{"className":768},[730],[26,770,773],{"className":771},[47,772],"mathrm","max",[26,775,95],{"className":776},[94],[26,778,780],{"className":779},[66],[26,781,784],{"className":782,"style":783},[70],"height:0.7em;",[26,785],{},[26,787],{"className":788,"style":789},[710],"margin-right:0.1667em;",[26,791,793],{"className":792},[730,731],[26,794,796,881],{"className":795},[61,62],[26,797,799,878],{"className":798},[66],[26,800,803,864],{"className":801,"style":802},[70],"height:1.05em;",[26,804,806,810],{"style":805},"top:-1.856em;margin-left:0em;",[26,807],{"className":808,"style":809},[78],"height:3.05em;",[26,811,813],{"className":812},[83,84,85,86],[26,814,816,854,859],{"className":815},[47,86],[26,817,819,822],{"className":818},[47,86],[26,820,701],{"className":821},[47,51,86],[26,823,825],{"className":824},[57],[26,826,828],{"className":827},[61],[26,829,831],{"className":830},[66],[26,832,835],{"className":833,"style":834},[70],"height:0.6828em;",[26,836,838,842],{"style":837},"top:-2.786em;margin-right:0.0714em;",[26,839],{"className":840,"style":841},[78],"height:2.5em;",[26,843,847],{"className":844},[83,845,846,86],"reset-size3","size1",[26,848,850],{"className":849},[47,86],[26,851,853],{"className":852},[47,86],"′",[26,855,858],{"className":856},[857,86],"mpunct",",",[26,860,863],{"className":861,"style":862},[47,51,86],"margin-right:0.0278em;","r",[26,865,867,870],{"style":866},"top:-3.05em;",[26,868],{"className":869,"style":809},[78],[26,871,872],{},[26,873,877],{"className":874},[730,875,876],"op-symbol","large-op","∑",[26,879,95],{"className":880},[94],[26,882,884],{"className":883},[66],[26,885,888],{"className":886,"style":887},[70],"height:1.4301em;",[26,889],{},[26,891],{"className":892,"style":789},[710],[26,894,11],{"className":895},[47,51],[26,897,697],{"className":898},[696],[26,900,902,905],{"className":901},[47],[26,903,701],{"className":904},[47,51],[26,906,908],{"className":907},[57],[26,909,911],{"className":910},[61],[26,912,914],{"className":913},[66],[26,915,918],{"className":916,"style":917},[70],"height:0.8019em;",[26,919,921,924],{"style":920},"top:-3.113em;margin-right:0.05em;",[26,922],{"className":923,"style":79},[78],[26,925,927],{"className":926},[83,84,85,86],[26,928,930],{"className":929},[47,86],[26,931,853],{"className":932},[47,86],[26,934,858],{"className":935},[857],[26,937],{"className":938,"style":789},[710],[26,940,863],{"className":941,"style":862},[47,51],[26,943],{"className":944,"style":711},[710],[26,946,948],{"className":947},[715],"∣",[26,950],{"className":951,"style":711},[710],[26,953,955,959,962,965,968,971,974,982,985,988,991,994],{"className":954},[38],[26,956],{"className":957,"style":958},[42],"height:1.2em;vertical-align:-0.35em;",[26,960,701],{"className":961},[47,51],[26,963,858],{"className":964},[857],[26,966],{"className":967,"style":789},[710],[26,969,15],{"className":970},[47,51],[26,972,706],{"className":973},[705],[26,975,977],{"className":976},[696],[26,978,981],{"className":979},[980,846],"delimsizing","[",[26,983],{"className":984,"style":789},[710],[26,986,863],{"className":987,"style":862},[47,51],[26,989],{"className":990,"style":691},[710],[26,992,276],{"className":993},[275],[26,995],{"className":996,"style":691},[710],[26,998,1000,1003,1008,1011,1014,1017,1049,1052,1055],{"className":999},[38],[26,1001],{"className":1002,"style":958},[42],[26,1004,1007],{"className":1005,"style":1006},[47,51],"margin-right:0.0556em;","γ",[26,1009],{"className":1010,"style":789},[710],[26,1012,692],{"className":1013,"style":691},[47,51],[26,1015,697],{"className":1016},[696],[26,1018,1020,1023],{"className":1019},[47],[26,1021,701],{"className":1022},[47,51],[26,1024,1026],{"className":1025},[57],[26,1027,1029],{"className":1028},[61],[26,1030,1032],{"className":1031},[66],[26,1033,1035],{"className":1034,"style":917},[70],[26,1036,1037,1040],{"style":920},[26,1038],{"className":1039,"style":79},[78],[26,1041,1043],{"className":1042},[83,84,85,86],[26,1044,1046],{"className":1045},[47,86],[26,1047,853],{"className":1048},[47,86],[26,1050,706],{"className":1051},[705],[26,1053],{"className":1054,"style":789},[710],[26,1056,1058],{"className":1057},[705],[26,1059,1061],{"className":1060},[980,846],"]",[11,1063,1064,1065,1068,1069,1072,1073,1089,1090,1105],{},"to every state, over and over, until the values stop changing. RTDP applies the\n",[163,1066,1067],{},"same"," update, but not in systematic sweeps. It is an instance of ",[21,1070,1071],{},"asynchronous\ndynamic programming",": the update order is dictated by the order in which states are\nvisited along real or simulated trajectories. At each step of a trajectory, the\nagent is in some state ",[26,1074,1076],{"className":1075},[29],[26,1077,1079],{"className":1078,"ariaHidden":34},[33],[26,1080,1082,1086],{"className":1081},[38],[26,1083],{"className":1084,"style":1085},[42],"height:0.6833em;",[26,1087,53],{"className":1088,"style":52},[47,51],"; it applies the value-iteration update to ",[26,1091,1093],{"className":1092},[29],[26,1094,1096],{"className":1095,"ariaHidden":34},[33],[26,1097,1099,1102],{"className":1098},[38],[26,1100],{"className":1101,"style":1085},[42],[26,1103,53],{"className":1104,"style":52},[47,51]," (and\noptionally to a few other states, such as those in a limited look-ahead search),\ntakes a greedy action, and moves on. States that the agent never visits are never\nupdated.",[506,1107],{"hash":1108},"50a0e79092fc766c44491b4e7657ef5a3b9b6e5335e199c32057980fa10e0a9f",[11,1110,1111,1112,1115,1116,1119,1120,1123,1124,1127,1128,1131],{},"The close tie to conventional DP lets convergence results carry over. If\ntrajectories can start only from a designated set of ",[21,1113,1114],{},"start states",", then for a\nprediction problem, on-policy trajectory sampling lets RTDP skip every state that\nthe given policy cannot reach from any start — those states are ",[21,1117,1118],{},"irrelevant"," to\nthe prediction problem. For control, the goal is an ",[21,1121,1122],{},"optimal partial policy",": one\nthat is optimal on the ",[21,1125,1126],{},"relevant"," states (reachable from some start under ",[163,1129,1130],{},"some","\noptimal policy) but may be arbitrary, or even undefined, on the irrelevant ones.\nThere is no need to specify optimal actions where an optimal policy never goes.",[510,1133,1134],{"type":512},[11,1135,1136,1139,1140,1142,1143,1145,1146,1148],{},[21,1137,1138],{},"Definition (Relevant and irrelevant states)."," A state is ",[21,1141,1126],{}," if it\nis reachable from some start state under some optimal policy. A state is\n",[21,1144,1118],{}," if no optimal policy reaches it from any start state. An\n",[21,1147,1122],{}," is optimal on the relevant states and unconstrained\non the irrelevant ones.",[11,1150,1151,1152,1155],{},"The key result: for a class of problems, RTDP converges to a policy optimal on\nthe relevant states ",[163,1153,1154],{},"without"," visiting every state infinitely often — sometimes\nwithout visiting some states at all. When only a small fraction of a very large\nstate set is relevant, that is decisive; even a single full sweep may be infeasible,\nyet RTDP never needs one.",[11,1157,1158],{},"In plain terms: as long as the agent can always reach the goal, every step costs\nsomething, and the values start out optimistic, RTDP will settle on the right action\nfor every state that matters — even though it never updates the states that do\nnot. The formal statement lists exactly those conditions.",[510,1160,1162],{"type":1161},"theorem",[11,1163,1164,1167,1168,1185],{},[21,1165,1166],{},"Theorem (RTDP convergence, Barto–Bradtke–Singh 1995)."," For undiscounted\nepisodic tasks with absorbing goal states of zero reward, RTDP converges to a\npolicy optimal on all the relevant states — with probability one — provided:\n(1) the initial value of every goal state is zero; (2) at least one policy\nreaches a goal with probability one from every start state; (3) all rewards for\ntransitions from non-goal states are strictly negative; and (4) all initial\nvalues are ",[26,1169,1171],{"className":1170},[29],[26,1172,1174],{"className":1173,"ariaHidden":34},[33],[26,1175,1177,1181],{"className":1176},[38],[26,1178],{"className":1179,"style":1180},[42],"height:0.7719em;vertical-align:-0.136em;",[26,1182,1184],{"className":1183},[715],"≥"," their optimal values (satisfied by initializing every state to\nzero). At each step RTDP selects a greedy action, breaking ties randomly.",[11,1187,1188,1189,1192,1193,1213,1214,1217],{},"These are the ",[21,1190,1191],{},"stochastic optimal-path problems"," — cost-minimization tasks such\nas minimum-time control, where each step costs ",[26,1194,1196],{"className":1195},[29],[26,1197,1199],{"className":1198,"ariaHidden":34},[33],[26,1200,1202,1206,1210],{"className":1201},[38],[26,1203],{"className":1204,"style":1205},[42],"height:0.7278em;vertical-align:-0.0833em;",[26,1207,1209],{"className":1208},[47],"−",[26,1211,280],{"className":1212},[47]," and the objective is to reach\nthe goal as cheaply as possible. The convergence proof combines asynchronous-DP\nresults with results on ",[163,1215,1216],{},"learning real-time A*"," (Korf, 1990), the heuristic-search\nalgorithm RTDP generalizes.",[1219,1220,1222],"h3",{"id":1221},"rtdp-on-the-racetrack","RTDP on the racetrack",[11,1224,1225,1226,1244,1245,1272,1273,1290,1291,1293],{},"Sutton and Barto compare RTDP against conventional (sweep-based, Gauss–Seidel)\nvalue iteration on a racetrack: an agent must drive around a turn and cross the\nfinish line in as few steps as possible, ",[26,1227,1229],{"className":1228},[29],[26,1230,1232],{"className":1231,"ariaHidden":34},[33],[26,1233,1235,1238,1241],{"className":1234},[38],[26,1236],{"className":1237,"style":1205},[42],[26,1239,1209],{"className":1240},[47],[26,1242,280],{"className":1243},[47]," per step, restarting from a random\nstart state on a crash. A small racetrack has ",[26,1246,1248],{"className":1247},[29],[26,1249,1251],{"className":1250,"ariaHidden":34},[33],[26,1252,1254,1258,1262,1268],{"className":1253},[38],[26,1255],{"className":1256,"style":1257},[42],"height:0.8389em;vertical-align:-0.1944em;",[26,1259,1261],{"className":1260},[47],"9",[26,1263,1265],{"className":1264},[47],[26,1266,858],{"className":1267},[857],[26,1269,1271],{"className":1270},[47],"115"," states reachable from the\nstart states, but only about ",[26,1274,1276],{"className":1275},[29],[26,1277,1279],{"className":1278,"ariaHidden":34},[33],[26,1280,1282,1286],{"className":1281},[38],[26,1283],{"className":1284,"style":1285},[42],"height:0.6444em;",[26,1287,1289],{"className":1288},[47],"599"," of them are ",[163,1292,1126],{}," — reachable under some\noptimal policy. That gap is where RTDP wins.",[1295,1296,1297,1313],"table",{},[1298,1299,1300],"thead",{},[1301,1302,1303,1307,1310],"tr",{},[1304,1305,1306],"th",{},"Measure",[1304,1308,1309],{},"conventional DP",[1304,1311,1312],{},"RTDP",[1314,1315,1316,1328,1339,1350,1390],"tbody",{},[1301,1317,1318,1322,1325],{},[1319,1320,1321],"td",{},"Computation to convergence",[1319,1323,1324],{},"28 sweeps",[1319,1326,1327],{},"4000 episodes",[1301,1329,1330,1333,1336],{},[1319,1331,1332],{},"Total value updates",[1319,1334,1335],{},"252{,}784",[1319,1337,1338],{},"127{,}600",[1301,1340,1341,1344,1347],{},[1319,1342,1343],{},"Updates per episode",[1319,1345,1346],{},"—",[1319,1348,1349],{},"31.9",[1301,1351,1352,1385,1387],{},[1319,1353,1354,1355,1384],{},"% of states updated ",[26,1356,1358],{"className":1357},[29],[26,1359,1361,1374],{"className":1360,"ariaHidden":34},[33],[26,1362,1364,1367,1371],{"className":1363},[38],[26,1365],{"className":1366,"style":1180},[42],[26,1368,1370],{"className":1369},[715],"≤",[26,1372],{"className":1373,"style":711},[710],[26,1375,1377,1380],{"className":1376},[38],[26,1378],{"className":1379,"style":1285},[42],[26,1381,1383],{"className":1382},[47],"100"," times",[1319,1386,1346],{},[1319,1388,1389],{},"98.45",[1301,1391,1392,1395,1397],{},[1319,1393,1394],{},"% of states updated 0 times",[1319,1396,1346],{},[1319,1398,1399],{},"3.18",[11,1401,1402,1403,1406,1407,1465,1466,1469],{},"Both methods reach policies averaging 14–15 steps to the finish, but RTDP does it\nwith roughly ",[163,1404,1405],{},"half"," the updates. Conventional value iteration updates every state on\nevery sweep; RTDP focuses updates on the states relevant to the objective, and that\nfocus narrows as learning continues. There is a second, subtler advantage: because\nRTDP is always greedy with respect to its current values, the policy it uses to\ngenerate trajectories approaches an optimal policy as the values approach ",[26,1408,1410],{"className":1409},[29],[26,1411,1413],{"className":1412,"ariaHidden":34},[33],[26,1414,1416,1420],{"className":1415},[38],[26,1417],{"className":1418,"style":1419},[42],"height:0.5806em;vertical-align:-0.15em;",[26,1421,1423,1428],{"className":1422},[47],[26,1424,1427],{"className":1425,"style":1426},[47,51],"margin-right:0.0359em;","v",[26,1429,1431],{"className":1430},[57],[26,1432,1434,1457],{"className":1433},[61,62],[26,1435,1437,1454],{"className":1436},[66],[26,1438,1441],{"className":1439,"style":1440},[70],"height:0.1757em;",[26,1442,1444,1447],{"style":1443},"top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;",[26,1445],{"className":1446,"style":79},[78],[26,1448,1450],{"className":1449},[83,84,85,86],[26,1451,1453],{"className":1452},[275,86],"∗",[26,1455,95],{"className":1456},[94],[26,1458,1460],{"className":1459},[66],[26,1461,1463],{"className":1462,"style":102},[70],[26,1464],{}," —\nwhereas conventional value iteration keeps updating ",[163,1467,1468],{},"every"," state right up to\ntermination and only checks the policy afterward.",[308,1471,1473],{"id":1472},"planning-at-decision-time","Planning at decision time",[11,1475,1476,1477,1529,1530,1582,1583,1644,1645,1706,1707],{},"RTDP still improves values it might revisit; it leans toward background. Genuine\ndecision-time planning discards its work. On encountering ",[26,1478,1480],{"className":1479},[29],[26,1481,1483],{"className":1482,"ariaHidden":34},[33],[26,1484,1486,1489],{"className":1485},[38],[26,1487],{"className":1488,"style":43},[42],[26,1490,1492,1495],{"className":1491},[47],[26,1493,53],{"className":1494,"style":52},[47,51],[26,1496,1498],{"className":1497},[57],[26,1499,1501,1521],{"className":1500},[61,62],[26,1502,1504,1518],{"className":1503},[66],[26,1505,1507],{"className":1506,"style":71},[70],[26,1508,1509,1512],{"style":74},[26,1510],{"className":1511,"style":79},[78],[26,1513,1515],{"className":1514},[83,84,85,86],[26,1516,90],{"className":1517},[47,51,86],[26,1519,95],{"className":1520},[94],[26,1522,1524],{"className":1523},[66],[26,1525,1527],{"className":1526,"style":102},[70],[26,1528],{},", it begins and\ncompletes a planning computation whose output is the single action ",[26,1531,1533],{"className":1532},[29],[26,1534,1536],{"className":1535,"ariaHidden":34},[33],[26,1537,1539,1542],{"className":1538},[38],[26,1540],{"className":1541,"style":43},[42],[26,1543,1545,1548],{"className":1544},[47],[26,1546,185],{"className":1547},[47,51],[26,1549,1551],{"className":1550},[57],[26,1552,1554,1574],{"className":1553},[61,62],[26,1555,1557,1571],{"className":1556},[66],[26,1558,1560],{"className":1559,"style":71},[70],[26,1561,1562,1565],{"style":200},[26,1563],{"className":1564,"style":79},[78],[26,1566,1568],{"className":1567},[83,84,85,86],[26,1569,90],{"className":1570},[47,51,86],[26,1572,95],{"className":1573},[94],[26,1575,1577],{"className":1576},[66],[26,1578,1580],{"className":1579,"style":102},[70],[26,1581],{},"; on the\nnext step it begins anew with ",[26,1584,1586],{"className":1585},[29],[26,1587,1589],{"className":1588,"ariaHidden":34},[33],[26,1590,1592,1595],{"className":1591},[38],[26,1593],{"className":1594,"style":238},[42],[26,1596,1598,1601],{"className":1597},[47],[26,1599,53],{"className":1600,"style":52},[47,51],[26,1602,1604],{"className":1603},[57],[26,1605,1607,1636],{"className":1606},[61,62],[26,1608,1610,1633],{"className":1609},[66],[26,1611,1613],{"className":1612,"style":257},[70],[26,1614,1615,1618],{"style":74},[26,1616],{"className":1617,"style":79},[78],[26,1619,1621],{"className":1620},[83,84,85,86],[26,1622,1624,1627,1630],{"className":1623},[47,86],[26,1625,90],{"className":1626},[47,51,86],[26,1628,276],{"className":1629},[275,86],[26,1631,280],{"className":1632},[47,86],[26,1634,95],{"className":1635},[94],[26,1637,1639],{"className":1638},[66],[26,1640,1642],{"className":1641,"style":290},[70],[26,1643],{}," to produce ",[26,1646,1648],{"className":1647},[29],[26,1649,1651],{"className":1650,"ariaHidden":34},[33],[26,1652,1654,1657],{"className":1653},[38],[26,1655],{"className":1656,"style":238},[42],[26,1658,1660,1663],{"className":1659},[47],[26,1661,185],{"className":1662},[47,51],[26,1664,1666],{"className":1665},[57],[26,1667,1669,1698],{"className":1668},[61,62],[26,1670,1672,1695],{"className":1671},[66],[26,1673,1675],{"className":1674,"style":257},[70],[26,1676,1677,1680],{"style":200},[26,1678],{"className":1679,"style":79},[78],[26,1681,1683],{"className":1682},[83,84,85,86],[26,1684,1686,1689,1692],{"className":1685},[47,86],[26,1687,90],{"className":1688},[47,51,86],[26,1690,276],{"className":1691},[275,86],[26,1693,280],{"className":1694},[47,86],[26,1696,95],{"className":1697},[94],[26,1699,1701],{"className":1700},[66],[26,1702,1704],{"className":1703,"style":290},[70],[26,1705],{},", and so on.",[299,1708,1709],{},[15,1710,280],{"href":303,"ariaDescribedBy":1711,"dataFootnoteRef":6,"id":1712},[305],"user-content-fnref-sb-decision-3",[506,1714],{"hash":1715},"0a28a1e71498539c2ed91b61e36e5c4bc16a0fb7711f6b38459fae208dc65a55",[11,1717,1718,1719,1771,1772,1774,1775,1778],{},"Even done only at decision time, planning is still what it always was — computing\nupdates and values from simulated experience, and ultimately a policy — except the\nvalues and the policy are now specific to ",[26,1720,1722],{"className":1721},[29],[26,1723,1725],{"className":1724,"ariaHidden":34},[33],[26,1726,1728,1731],{"className":1727},[38],[26,1729],{"className":1730,"style":43},[42],[26,1732,1734,1737],{"className":1733},[47],[26,1735,53],{"className":1736,"style":52},[47,51],[26,1738,1740],{"className":1739},[57],[26,1741,1743,1763],{"className":1742},[61,62],[26,1744,1746,1760],{"className":1745},[66],[26,1747,1749],{"className":1748,"style":71},[70],[26,1750,1751,1754],{"style":74},[26,1752],{"className":1753,"style":79},[78],[26,1755,1757],{"className":1756},[83,84,85,86],[26,1758,90],{"className":1759},[47,51,86],[26,1761,95],{"className":1762},[94],[26,1764,1766],{"className":1765},[66],[26,1767,1769],{"className":1768,"style":102},[70],[26,1770],{}," and thrown away after selecting the\naction. In many applications that is no great loss: the state space is huge and you\nare unlikely to return to the same state soon. You can mix the two (focus on the\ncurrent state ",[163,1773,638],{}," store some of the result), but decision-time planning is most\nuseful when fast responses are ",[163,1776,1777],{},"not"," required. A chess engine may take minutes per\nmove and plan dozens of moves ahead in that time; if low-latency selection is the\npriority, background planning is the better choice.",[308,1780,1782],{"id":1781},"heuristic-search","Heuristic search",[11,1784,1785,1786,322,1789,1797,1798,1801,1802,1854,1855,1909,1910,1962],{},"The classical state-space planners of artificial intelligence — game-tree search\nand its relatives — are decision-time planning methods, collectively ",[21,1787,1788],{},"heuristic\nsearch",[299,1790,1791],{},[15,1792,1796],{"href":1793,"ariaDescribedBy":1794,"dataFootnoteRef":6,"id":1795},"#user-content-fn-sb-heuristic",[305],"user-content-fnref-sb-heuristic","3"," For each state encountered, heuristic search considers a\nlarge tree of possible continuations. It applies an approximate value function to\nthe ",[21,1799,1800],{},"leaf"," nodes and backs those values up toward the current state at the root.\nThe backing-up reuses the expected updates with maxes (the ones for ",[26,1803,1805],{"className":1804},[29],[26,1806,1808],{"className":1807,"ariaHidden":34},[33],[26,1809,1811,1814],{"className":1810},[38],[26,1812],{"className":1813,"style":1419},[42],[26,1815,1817,1820],{"className":1816},[47],[26,1818,1427],{"className":1819,"style":1426},[47,51],[26,1821,1823],{"className":1822},[57],[26,1824,1826,1846],{"className":1825},[61,62],[26,1827,1829,1843],{"className":1828},[66],[26,1830,1832],{"className":1831,"style":1440},[70],[26,1833,1834,1837],{"style":1443},[26,1835],{"className":1836,"style":79},[78],[26,1838,1840],{"className":1839},[83,84,85,86],[26,1841,1453],{"className":1842},[275,86],[26,1844,95],{"className":1845},[94],[26,1847,1849],{"className":1848},[66],[26,1850,1852],{"className":1851,"style":102},[70],[26,1853],{}," and\n",[26,1856,1858],{"className":1857},[29],[26,1859,1861],{"className":1860,"ariaHidden":34},[33],[26,1862,1864,1868],{"className":1863},[38],[26,1865],{"className":1866,"style":1867},[42],"height:0.625em;vertical-align:-0.1944em;",[26,1869,1871,1875],{"className":1870},[47],[26,1872,1874],{"className":1873,"style":1426},[47,51],"q",[26,1876,1878],{"className":1877},[57],[26,1879,1881,1901],{"className":1880},[61,62],[26,1882,1884,1898],{"className":1883},[66],[26,1885,1887],{"className":1886,"style":1440},[70],[26,1888,1889,1892],{"style":1443},[26,1890],{"className":1891,"style":79},[78],[26,1893,1895],{"className":1894},[83,84,85,86],[26,1896,1453],{"className":1897},[275,86],[26,1899,95],{"className":1900},[94],[26,1902,1904],{"className":1903},[66],[26,1905,1907],{"className":1906,"style":102},[70],[26,1908],{},") from throughout this course — nothing new. The backup stops at the\nstate–action nodes for the current state; the best of those is chosen as ",[26,1911,1913],{"className":1912},[29],[26,1914,1916],{"className":1915,"ariaHidden":34},[33],[26,1917,1919,1922],{"className":1918},[38],[26,1920],{"className":1921,"style":43},[42],[26,1923,1925,1928],{"className":1924},[47],[26,1926,185],{"className":1927},[47,51],[26,1929,1931],{"className":1930},[57],[26,1932,1934,1954],{"className":1933},[61,62],[26,1935,1937,1951],{"className":1936},[66],[26,1938,1940],{"className":1939,"style":71},[70],[26,1941,1942,1945],{"style":200},[26,1943],{"className":1944,"style":79},[78],[26,1946,1948],{"className":1947},[83,84,85,86],[26,1949,90],{"className":1950},[47,51,86],[26,1952,95],{"className":1953},[94],[26,1955,1957],{"className":1956},[66],[26,1958,1960],{"className":1959,"style":102},[70],[26,1961],{},", and\nall the backed-up values are then discarded.",[506,1964],{"hash":1965},"94835db9a61a842efcfd9132fa262139480bf93474cc901240cf79961215b3a9",[11,1967,1968,1969,1972,1973,1989,1990,322],{},"In conventional heuristic search no effort is made to ",[163,1970,1971],{},"save"," the backed-up values;\nthe value function is designed by people and left unchanged. (One can allow it to\nlearn — that is essentially what we have been doing all along.) The one-step greedy,\n",[26,1974,1976],{"className":1975},[29],[26,1977,1979],{"className":1978,"ariaHidden":34},[33],[26,1980,1982,1985],{"className":1981},[38],[26,1983],{"className":1984,"style":741},[42],[26,1986,1988],{"className":1987},[47,51],"ε","-greedy, and UCB action-selection rules are heuristic search on a\nsmaller scale: to pick the greedy action given a model and a state-value function,\nyou look ahead one step to each possible next state, add rewards and estimated\nvalues, and take the best. Heuristic search is that greedy computation extended\n",[21,1991,1992],{},"beyond a single step",[11,1994,1995,1996,1999,2000,2018,2019,2063],{},"Why does deeper search help? With a perfect model and an ",[163,1997,1998],{},"imperfect"," value function,\ndeeper search yields better policies. Search all the way to the end of the episode\nand the imperfect value function is eliminated entirely — the action is optimal.\nSearch to depth ",[26,2001,2003],{"className":2002},[29],[26,2004,2006],{"className":2005,"ariaHidden":34},[33],[26,2007,2009,2013],{"className":2008},[38],[26,2010],{"className":2011,"style":2012},[42],"height:0.6944em;",[26,2014,2017],{"className":2015,"style":2016},[47,51],"margin-right:0.0315em;","k"," with ",[26,2020,2022],{"className":2021},[29],[26,2023,2025],{"className":2024,"ariaHidden":34},[33],[26,2026,2028,2032],{"className":2027},[38],[26,2029],{"className":2030,"style":2031},[42],"height:1.0435em;vertical-align:-0.1944em;",[26,2033,2035,2038],{"className":2034},[47],[26,2036,1007],{"className":2037,"style":1006},[47,51],[26,2039,2041],{"className":2040},[57],[26,2042,2044],{"className":2043},[61],[26,2045,2047],{"className":2046},[66],[26,2048,2051],{"className":2049,"style":2050},[70],"height:0.8491em;",[26,2052,2054,2057],{"style":2053},"top:-3.063em;margin-right:0.05em;",[26,2055],{"className":2056,"style":79},[78],[26,2058,2060],{"className":2059},[83,84,85,86],[26,2061,2017],{"className":2062,"style":2016},[47,51,86]," small and the actions are near-optimal, because\nthe leftover value-function error is discounted away. The cost is compute: deeper\nsearch means a slower response. Tesauro's grandmaster-level backgammon player,\nTD-Gammon, illustrated the trade — the deeper its heuristic search, the better its\nmoves, but the longer each took.",[11,2065,2066,2067,2070,2071,2123],{},"The most important effect of heuristic search is not depth but ",[21,2068,2069],{},"focus",". Its search\ntree is tightly concentrated on the states and actions that might immediately follow\n",[26,2072,2074],{"className":2073},[29],[26,2075,2077],{"className":2076,"ariaHidden":34},[33],[26,2078,2080,2083],{"className":2079},[38],[26,2081],{"className":2082,"style":43},[42],[26,2084,2086,2089],{"className":2085},[47],[26,2087,53],{"className":2088,"style":52},[47,51],[26,2090,2092],{"className":2091},[57],[26,2093,2095,2115],{"className":2094},[61,62],[26,2096,2098,2112],{"className":2097},[66],[26,2099,2101],{"className":2100,"style":71},[70],[26,2102,2103,2106],{"style":74},[26,2104],{"className":2105,"style":79},[78],[26,2107,2109],{"className":2108},[83,84,85,86],[26,2110,90],{"className":2111},[47,51,86],[26,2113,95],{"className":2114},[94],[26,2116,2118],{"className":2117},[66],[26,2119,2121],{"className":2120,"style":102},[70],[26,2122],{},". Those states are the ones where you most want the value function to be\naccurate, and where updates matter most for the imminent decision. In chess there\nare far too many positions to store a value for each, but a program can easily store\ndistinct estimates for the millions it encounters while looking ahead from a single\nposition. Any state-space search can be viewed as piecing together a large number of\nindividual one-step updates, ordered to concentrate on states downstream of the\ncurrent one — which is where the performance gain of deeper search actually comes\nfrom.",[308,2125,2127],{"id":2126},"rollout-algorithms","Rollout algorithms",[11,2129,2130,2132,2133,2137,2138,2146,2147,2150,2151,2154],{},[21,2131,2127],{}," are decision-time planners built on\n",[15,2134,2136],{"href":2135},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods","Monte Carlo"," control,\napplied to simulated trajectories that all begin at the current state.",[299,2139,2140],{},[15,2141,2145],{"href":2142,"ariaDescribedBy":2143,"dataFootnoteRef":6,"id":2144},"#user-content-fn-sb-rollout",[305],"user-content-fnref-sb-rollout","4","\nThey estimate action values for a given policy by averaging the returns of many\nsimulated trajectories that start with each possible action and thereafter follow\nthat policy — the ",[21,2148,2149],{},"rollout policy",". When the estimates are good enough, the action\nwith the highest value is played, and the whole process repeats from the resulting\nnext state. The name comes from backgammon: ",[1874,2152,2153],{},"rolling out"," a position means playing\nit out to the end many times with random dice.",[11,2156,2157,2158,2161,2162,2164,2165,2217,2218,2272,2273,2288],{},"Unlike the Monte Carlo control of the\n",[15,2159,2160],{"href":2135},"Monte Carlo lesson",",\na rollout algorithm does ",[21,2163,1777],{}," aim to estimate a complete optimal action-value\nfunction ",[26,2166,2168],{"className":2167},[29],[26,2169,2171],{"className":2170,"ariaHidden":34},[33],[26,2172,2174,2177],{"className":2173},[38],[26,2175],{"className":2176,"style":1867},[42],[26,2178,2180,2183],{"className":2179},[47],[26,2181,1874],{"className":2182,"style":1426},[47,51],[26,2184,2186],{"className":2185},[57],[26,2187,2189,2209],{"className":2188},[61,62],[26,2190,2192,2206],{"className":2191},[66],[26,2193,2195],{"className":2194,"style":1440},[70],[26,2196,2197,2200],{"style":1443},[26,2198],{"className":2199,"style":79},[78],[26,2201,2203],{"className":2202},[83,84,85,86],[26,2204,1453],{"className":2205},[275,86],[26,2207,95],{"className":2208},[94],[26,2210,2212],{"className":2211},[66],[26,2213,2215],{"className":2214,"style":102},[70],[26,2216],{},", nor even a complete ",[26,2219,2221],{"className":2220},[29],[26,2222,2224],{"className":2223,"ariaHidden":34},[33],[26,2225,2227,2230],{"className":2226},[38],[26,2228],{"className":2229,"style":1867},[42],[26,2231,2233,2236],{"className":2232},[47],[26,2234,1874],{"className":2235,"style":1426},[47,51],[26,2237,2239],{"className":2238},[57],[26,2240,2242,2264],{"className":2241},[61,62],[26,2243,2245,2261],{"className":2244},[66],[26,2246,2249],{"className":2247,"style":2248},[70],"height:0.1514em;",[26,2250,2251,2254],{"style":1443},[26,2252],{"className":2253,"style":79},[78],[26,2255,2257],{"className":2256},[83,84,85,86],[26,2258,2260],{"className":2259,"style":1426},[47,51,86],"π",[26,2262,95],{"className":2263},[94],[26,2265,2267],{"className":2266},[66],[26,2268,2270],{"className":2269,"style":102},[70],[26,2271],{},". It produces Monte Carlo estimates of\naction values only for the current state and a given rollout policy ",[26,2274,2276],{"className":2275},[29],[26,2277,2279],{"className":2278,"ariaHidden":34},[33],[26,2280,2282,2285],{"className":2281},[38],[26,2283],{"className":2284,"style":741},[42],[26,2286,2260],{"className":2287,"style":1426},[47,51],". That is\nwhat makes rollouts simple: no need to sample every state–action pair, and no need\nto approximate a function over the whole space.",[506,2290],{"hash":2291},"9bef88c62f1b876cf1f2ef0354f832d48974920701407c7f3ad25dd37e7b1509",[11,2293,2294,2295,2298,2299,2314,2315,2360,2361,2502,2503,2518,2519,2653,2654,2698,2699,2714,2715,2730,2731,2746,2747,2846,2847,2921,2922,2937,2938,2953,2954,2957],{},"What does that accomplish? The\n",[15,2296,2297],{"href":657},"policy-improvement theorem","\ntells us that if two policies ",[26,2300,2302],{"className":2301},[29],[26,2303,2305],{"className":2304,"ariaHidden":34},[33],[26,2306,2308,2311],{"className":2307},[38],[26,2309],{"className":2310,"style":741},[42],[26,2312,2260],{"className":2313,"style":1426},[47,51]," and ",[26,2316,2318],{"className":2317},[29],[26,2319,2321],{"className":2320,"ariaHidden":34},[33],[26,2322,2324,2328],{"className":2323},[38],[26,2325],{"className":2326,"style":2327},[42],"height:0.7519em;",[26,2329,2331,2334],{"className":2330},[47],[26,2332,2260],{"className":2333,"style":1426},[47,51],[26,2335,2337],{"className":2336},[57],[26,2338,2340],{"className":2339},[61],[26,2341,2343],{"className":2342},[66],[26,2344,2346],{"className":2345,"style":2327},[70],[26,2347,2348,2351],{"style":2053},[26,2349],{"className":2350,"style":79},[78],[26,2352,2354],{"className":2353},[83,84,85,86],[26,2355,2357],{"className":2356},[47,86],[26,2358,853],{"className":2359},[47,86]," are identical except that\n",[26,2362,2364],{"className":2363},[29],[26,2365,2367,2425,2484],{"className":2366,"ariaHidden":34},[33],[26,2368,2370,2374,2406,2409,2412,2415,2418,2422],{"className":2369},[38],[26,2371],{"className":2372,"style":2373},[42],"height:1.0019em;vertical-align:-0.25em;",[26,2375,2377,2380],{"className":2376},[47],[26,2378,2260],{"className":2379,"style":1426},[47,51],[26,2381,2383],{"className":2382},[57],[26,2384,2386],{"className":2385},[61],[26,2387,2389],{"className":2388},[66],[26,2390,2392],{"className":2391,"style":2327},[70],[26,2393,2394,2397],{"style":2053},[26,2395],{"className":2396,"style":79},[78],[26,2398,2400],{"className":2399},[83,84,85,86],[26,2401,2403],{"className":2402},[47,86],[26,2404,853],{"className":2405},[47,86],[26,2407,697],{"className":2408},[696],[26,2410,701],{"className":2411},[47,51],[26,2413,706],{"className":2414},[705],[26,2416],{"className":2417,"style":711},[710],[26,2419,2421],{"className":2420},[715],"=",[26,2423],{"className":2424,"style":711},[710],[26,2426,2428,2432,2435,2438,2481],{"className":2427},[38],[26,2429],{"className":2430,"style":2431},[42],"height:0.8889em;vertical-align:-0.1944em;",[26,2433,15],{"className":2434},[47,51],[26,2436],{"className":2437,"style":711},[710],[26,2439,2441,2474,2478],{"className":2440},[715],[26,2442,2444],{"className":2443},[715],[26,2445,2448],{"className":2446},[47,2447],"vbox",[26,2449,2452],{"className":2450},[2451],"thinbox",[26,2453,2456,2459,2470],{"className":2454},[2455],"rlap",[26,2457],{"className":2458,"style":2431},[42],[26,2460,2463],{"className":2461},[2462],"inner",[26,2464,2466],{"className":2465},[47],[26,2467,2469],{"className":2468},[715],"",[26,2471],{"className":2472},[2473],"fix",[26,2475],{"className":2476},[710,2477],"nobreak",[26,2479,2421],{"className":2480},[715],[26,2482],{"className":2483,"style":711},[710],[26,2485,2487,2490,2493,2496,2499],{"className":2486},[38],[26,2488],{"className":2489,"style":687},[42],[26,2491,2260],{"className":2492,"style":1426},[47,51],[26,2494,697],{"className":2495},[696],[26,2497,701],{"className":2498},[47,51],[26,2500,706],{"className":2501},[705]," for one state ",[26,2504,2506],{"className":2505},[29],[26,2507,2509],{"className":2508,"ariaHidden":34},[33],[26,2510,2512,2515],{"className":2511},[38],[26,2513],{"className":2514,"style":741},[42],[26,2516,701],{"className":2517},[47,51],", and ",[26,2520,2522],{"className":2521},[29],[26,2523,2525,2598],{"className":2524,"ariaHidden":34},[33],[26,2526,2528,2531,2571,2574,2577,2580,2583,2586,2589,2592,2595],{"className":2527},[38],[26,2529],{"className":2530,"style":687},[42],[26,2532,2534,2537],{"className":2533},[47],[26,2535,1874],{"className":2536,"style":1426},[47,51],[26,2538,2540],{"className":2539},[57],[26,2541,2543,2563],{"className":2542},[61,62],[26,2544,2546,2560],{"className":2545},[66],[26,2547,2549],{"className":2548,"style":2248},[70],[26,2550,2551,2554],{"style":1443},[26,2552],{"className":2553,"style":79},[78],[26,2555,2557],{"className":2556},[83,84,85,86],[26,2558,2260],{"className":2559,"style":1426},[47,51,86],[26,2561,95],{"className":2562},[94],[26,2564,2566],{"className":2565},[66],[26,2567,2569],{"className":2568,"style":102},[70],[26,2570],{},[26,2572,697],{"className":2573},[696],[26,2575,701],{"className":2576},[47,51],[26,2578,858],{"className":2579},[857],[26,2581],{"className":2582,"style":789},[710],[26,2584,15],{"className":2585},[47,51],[26,2587,706],{"className":2588},[705],[26,2590],{"className":2591,"style":711},[710],[26,2593,1184],{"className":2594},[715],[26,2596],{"className":2597,"style":711},[710],[26,2599,2601,2604,2644,2647,2650],{"className":2600},[38],[26,2602],{"className":2603,"style":687},[42],[26,2605,2607,2610],{"className":2606},[47],[26,2608,1427],{"className":2609,"style":1426},[47,51],[26,2611,2613],{"className":2612},[57],[26,2614,2616,2636],{"className":2615},[61,62],[26,2617,2619,2633],{"className":2618},[66],[26,2620,2622],{"className":2621,"style":2248},[70],[26,2623,2624,2627],{"style":1443},[26,2625],{"className":2626,"style":79},[78],[26,2628,2630],{"className":2629},[83,84,85,86],[26,2631,2260],{"className":2632,"style":1426},[47,51,86],[26,2634,95],{"className":2635},[94],[26,2637,2639],{"className":2638},[66],[26,2640,2642],{"className":2641,"style":102},[70],[26,2643],{},[26,2645,697],{"className":2646},[696],[26,2648,701],{"className":2649},[47,51],[26,2651,706],{"className":2652},[705],", then\n",[26,2655,2657],{"className":2656},[29],[26,2658,2660],{"className":2659,"ariaHidden":34},[33],[26,2661,2663,2666],{"className":2662},[38],[26,2664],{"className":2665,"style":2327},[42],[26,2667,2669,2672],{"className":2668},[47],[26,2670,2260],{"className":2671,"style":1426},[47,51],[26,2673,2675],{"className":2674},[57],[26,2676,2678],{"className":2677},[61],[26,2679,2681],{"className":2680},[66],[26,2682,2684],{"className":2683,"style":2327},[70],[26,2685,2686,2689],{"style":2053},[26,2687],{"className":2688,"style":79},[78],[26,2690,2692],{"className":2691},[83,84,85,86],[26,2693,2695],{"className":2694},[47,86],[26,2696,853],{"className":2697},[47,86]," is at least as good as ",[26,2700,2702],{"className":2701},[29],[26,2703,2705],{"className":2704,"ariaHidden":34},[33],[26,2706,2708,2711],{"className":2707},[38],[26,2709],{"className":2710,"style":741},[42],[26,2712,2260],{"className":2713,"style":1426},[47,51]," — strictly better if the inequality is strict.\nTake ",[26,2716,2718],{"className":2717},[29],[26,2719,2721],{"className":2720,"ariaHidden":34},[33],[26,2722,2724,2727],{"className":2723},[38],[26,2725],{"className":2726,"style":741},[42],[26,2728,701],{"className":2729},[47,51]," to be the current state and ",[26,2732,2734],{"className":2733},[29],[26,2735,2737],{"className":2736,"ariaHidden":34},[33],[26,2738,2740,2743],{"className":2739},[38],[26,2741],{"className":2742,"style":741},[42],[26,2744,2260],{"className":2745,"style":1426},[47,51]," the rollout policy. Averaging the\nsimulated returns estimates ",[26,2748,2750],{"className":2749},[29],[26,2751,2753],{"className":2752,"ariaHidden":34},[33],[26,2754,2756,2759,2799,2802,2805,2808,2811,2843],{"className":2755},[38],[26,2757],{"className":2758,"style":2373},[42],[26,2760,2762,2765],{"className":2761},[47],[26,2763,1874],{"className":2764,"style":1426},[47,51],[26,2766,2768],{"className":2767},[57],[26,2769,2771,2791],{"className":2770},[61,62],[26,2772,2774,2788],{"className":2773},[66],[26,2775,2777],{"className":2776,"style":2248},[70],[26,2778,2779,2782],{"style":1443},[26,2780],{"className":2781,"style":79},[78],[26,2783,2785],{"className":2784},[83,84,85,86],[26,2786,2260],{"className":2787,"style":1426},[47,51,86],[26,2789,95],{"className":2790},[94],[26,2792,2794],{"className":2793},[66],[26,2795,2797],{"className":2796,"style":102},[70],[26,2798],{},[26,2800,697],{"className":2801},[696],[26,2803,701],{"className":2804},[47,51],[26,2806,858],{"className":2807},[857],[26,2809],{"className":2810,"style":789},[710],[26,2812,2814,2817],{"className":2813},[47],[26,2815,15],{"className":2816},[47,51],[26,2818,2820],{"className":2819},[57],[26,2821,2823],{"className":2822},[61],[26,2824,2826],{"className":2825},[66],[26,2827,2829],{"className":2828,"style":2327},[70],[26,2830,2831,2834],{"style":2053},[26,2832],{"className":2833,"style":79},[78],[26,2835,2837],{"className":2836},[83,84,85,86],[26,2838,2840],{"className":2839},[47,86],[26,2841,853],{"className":2842},[47,86],[26,2844,706],{"className":2845},[705]," for each ",[26,2848,2850],{"className":2849},[29],[26,2851,2853,2902],{"className":2852,"ariaHidden":34},[33],[26,2854,2856,2860,2892,2895,2899],{"className":2855},[38],[26,2857],{"className":2858,"style":2859},[42],"height:0.791em;vertical-align:-0.0391em;",[26,2861,2863,2866],{"className":2862},[47],[26,2864,15],{"className":2865},[47,51],[26,2867,2869],{"className":2868},[57],[26,2870,2872],{"className":2871},[61],[26,2873,2875],{"className":2874},[66],[26,2876,2878],{"className":2877,"style":2327},[70],[26,2879,2880,2883],{"style":2053},[26,2881],{"className":2882,"style":79},[78],[26,2884,2886],{"className":2885},[83,84,85,86],[26,2887,2889],{"className":2888},[47,86],[26,2890,853],{"className":2891},[47,86],[26,2893],{"className":2894,"style":711},[710],[26,2896,2898],{"className":2897},[715],"∈",[26,2900],{"className":2901,"style":711},[710],[26,2903,2905,2908,2912,2915,2918],{"className":2904},[38],[26,2906],{"className":2907,"style":687},[42],[26,2909,185],{"className":2910},[47,2911],"mathcal",[26,2913,697],{"className":2914},[696],[26,2916,701],{"className":2917},[47,51],[26,2919,706],{"className":2920},[705],"; the\npolicy that plays the best of these and then follows ",[26,2923,2925],{"className":2924},[29],[26,2926,2928],{"className":2927,"ariaHidden":34},[33],[26,2929,2931,2934],{"className":2930},[38],[26,2932],{"className":2933,"style":741},[42],[26,2935,2260],{"className":2936,"style":1426},[47,51]," improves on ",[26,2939,2941],{"className":2940},[29],[26,2942,2944],{"className":2943,"ariaHidden":34},[33],[26,2945,2947,2950],{"className":2946},[38],[26,2948],{"className":2949,"style":741},[42],[26,2951,2260],{"className":2952,"style":1426},[47,51],". A\nrollout is therefore one step of policy improvement, applied on the fly to the\ncurrent state and then discarded — like one step of\n",[15,2955,2956],{"href":17},"asynchronous"," value\niteration that changes the action for a single state.",[510,2959,2960],{"type":512},[11,2961,2962,2965,2966,2981,2982,518,2984,2999,3000,3070,3071,3086,3087,3215,3216,3231,3232,3247,3248,322],{},[21,2963,2964],{},"Definition (Rollout algorithm)."," A decision-time planner that, at the current\nstate ",[26,2967,2969],{"className":2968},[29],[26,2970,2972],{"className":2971,"ariaHidden":34},[33],[26,2973,2975,2978],{"className":2974},[38],[26,2976],{"className":2977,"style":741},[42],[26,2979,701],{"className":2980},[47,51],", uses Monte Carlo simulations under a fixed ",[21,2983,2149],{},[26,2985,2987],{"className":2986},[29],[26,2988,2990],{"className":2989,"ariaHidden":34},[33],[26,2991,2993,2996],{"className":2992},[38],[26,2994],{"className":2995,"style":741},[42],[26,2997,2260],{"className":2998,"style":1426},[47,51]," to\nestimate ",[26,3001,3003],{"className":3002},[29],[26,3004,3006],{"className":3005,"ariaHidden":34},[33],[26,3007,3009,3012,3052,3055,3058,3061,3064,3067],{"className":3008},[38],[26,3010],{"className":3011,"style":687},[42],[26,3013,3015,3018],{"className":3014},[47],[26,3016,1874],{"className":3017,"style":1426},[47,51],[26,3019,3021],{"className":3020},[57],[26,3022,3024,3044],{"className":3023},[61,62],[26,3025,3027,3041],{"className":3026},[66],[26,3028,3030],{"className":3029,"style":2248},[70],[26,3031,3032,3035],{"style":1443},[26,3033],{"className":3034,"style":79},[78],[26,3036,3038],{"className":3037},[83,84,85,86],[26,3039,2260],{"className":3040,"style":1426},[47,51,86],[26,3042,95],{"className":3043},[94],[26,3045,3047],{"className":3046},[66],[26,3048,3050],{"className":3049,"style":102},[70],[26,3051],{},[26,3053,697],{"className":3054},[696],[26,3056,701],{"className":3057},[47,51],[26,3059,858],{"className":3060},[857],[26,3062],{"className":3063,"style":789},[710],[26,3065,15],{"className":3066},[47,51],[26,3068,706],{"className":3069},[705]," for each action ",[26,3072,3074],{"className":3073},[29],[26,3075,3077],{"className":3076,"ariaHidden":34},[33],[26,3078,3080,3083],{"className":3079},[38],[26,3081],{"className":3082,"style":741},[42],[26,3084,15],{"className":3085},[47,51],", plays ",[26,3088,3090],{"className":3089},[29],[26,3091,3093],{"className":3092,"ariaHidden":34},[33],[26,3094,3096,3099,3107,3110,3154,3157,3197,3200,3203,3206,3209,3212],{"className":3095},[38],[26,3097],{"className":3098,"style":687},[42],[26,3100,3102,3103],{"className":3101},[730],"ar",[26,3104,3106],{"style":3105},"margin-right:0.0139em;","g",[26,3108],{"className":3109,"style":789},[710],[26,3111,3113,3119],{"className":3112},[730],[26,3114,3116],{"className":3115},[730],[26,3117,773],{"className":3118},[47,772],[26,3120,3122],{"className":3121},[57],[26,3123,3125,3146],{"className":3124},[61,62],[26,3126,3128,3143],{"className":3127},[66],[26,3129,3131],{"className":3130,"style":2248},[70],[26,3132,3134,3137],{"style":3133},"top:-2.55em;margin-right:0.05em;",[26,3135],{"className":3136,"style":79},[78],[26,3138,3140],{"className":3139},[83,84,85,86],[26,3141,15],{"className":3142},[47,51,86],[26,3144,95],{"className":3145},[94],[26,3147,3149],{"className":3148},[66],[26,3150,3152],{"className":3151,"style":102},[70],[26,3153],{},[26,3155],{"className":3156,"style":789},[710],[26,3158,3160,3163],{"className":3159},[47],[26,3161,1874],{"className":3162,"style":1426},[47,51],[26,3164,3166],{"className":3165},[57],[26,3167,3169,3189],{"className":3168},[61,62],[26,3170,3172,3186],{"className":3171},[66],[26,3173,3175],{"className":3174,"style":2248},[70],[26,3176,3177,3180],{"style":1443},[26,3178],{"className":3179,"style":79},[78],[26,3181,3183],{"className":3182},[83,84,85,86],[26,3184,2260],{"className":3185,"style":1426},[47,51,86],[26,3187,95],{"className":3188},[94],[26,3190,3192],{"className":3191},[66],[26,3193,3195],{"className":3194,"style":102},[70],[26,3196],{},[26,3198,697],{"className":3199},[696],[26,3201,701],{"className":3202},[47,51],[26,3204,858],{"className":3205},[857],[26,3207],{"className":3208,"style":789},[710],[26,3210,15],{"className":3211},[47,51],[26,3213,706],{"className":3214},[705],", and\ndiscards the estimates. It performs one step of policy improvement over ",[26,3217,3219],{"className":3218},[29],[26,3220,3222],{"className":3221,"ariaHidden":34},[33],[26,3223,3225,3228],{"className":3224},[38],[26,3226],{"className":3227,"style":741},[42],[26,3229,2260],{"className":3230,"style":1426},[47,51]," at\n",[26,3233,3235],{"className":3234},[29],[26,3236,3238],{"className":3237,"ariaHidden":34},[33],[26,3239,3241,3244],{"className":3240},[38],[26,3242],{"className":3243,"style":741},[42],[26,3245,701],{"className":3246},[47,51],"; it does not try to learn ",[26,3249,3251],{"className":3250},[29],[26,3252,3254],{"className":3253,"ariaHidden":34},[33],[26,3255,3257,3260],{"className":3256},[38],[26,3258],{"className":3259,"style":1867},[42],[26,3261,3263,3266],{"className":3262},[47],[26,3264,1874],{"className":3265,"style":1426},[47,51],[26,3267,3269],{"className":3268},[57],[26,3270,3272,3292],{"className":3271},[61,62],[26,3273,3275,3289],{"className":3274},[66],[26,3276,3278],{"className":3277,"style":1440},[70],[26,3279,3280,3283],{"style":1443},[26,3281],{"className":3282,"style":79},[78],[26,3284,3286],{"className":3285},[83,84,85,86],[26,3287,1453],{"className":3288},[275,86],[26,3290,95],{"className":3291},[94],[26,3293,3295],{"className":3294},[66],[26,3296,3298],{"className":3297,"style":102},[70],[26,3299],{},[11,3301,3302,3303,3306],{},"The aim is to improve ",[163,3304,3305],{},"over"," the rollout policy, not to find an optimal policy. The\nbetter the rollout policy and the more accurate the value estimates, the better the\nresulting decision (though better rollout policies also take longer to simulate).\nBecause the Monte Carlo trials are independent, they parallelize trivially across\nprocessors; and one can truncate trajectories short of termination, correcting the\ntruncated return with a stored evaluation function — which brings the whole\napparatus of truncated returns back into play.",[3308,3309,3313],"pre",{"className":3310,"code":3311,"language":3312,"meta":6,"style":6},"language-algorithm shiki shiki-themes Vesper Light - Orange Boost (Quick Open Adjusted) vesper","caption: $\\textsc{Rollout}(s, \\pi, m)$ — choose an action at state $s$ by one step of policy improvement over $\\pi$\ninput: current state $s$, rollout policy $\\pi$, simulations per action $m$\nfor each action $a \\in \\mathcal{A}(s)$ do\n  $G_a \\gets 0$\n  repeat $m$ times\n    simulate a trajectory from $s$: take $a$, then follow $\\pi$ to termination\n    $G \\gets$ return of that trajectory\n    $G_a \\gets G_a + G$\n  $Q(s,a) \\gets G_a \u002F m$ \u002F\u002F Monte Carlo estimate of $q_\\pi(s,a)$\nreturn $\\arg\\max_a Q(s,a)$ \u002F\u002F best over the candidates; then discard $Q$\n","algorithm",[3314,3315,3316,3323,3329,3335,3341,3347,3353,3359,3365,3371],"code",{"__ignoreMap":6},[26,3317,3320],{"class":3318,"line":3319},"line",1,[26,3321,3322],{},"caption: $\\textsc{Rollout}(s, \\pi, m)$ — choose an action at state $s$ by one step of policy improvement over $\\pi$\n",[26,3324,3326],{"class":3318,"line":3325},2,[26,3327,3328],{},"input: current state $s$, rollout policy $\\pi$, simulations per action $m$\n",[26,3330,3332],{"class":3318,"line":3331},3,[26,3333,3334],{},"for each action $a \\in \\mathcal{A}(s)$ do\n",[26,3336,3338],{"class":3318,"line":3337},4,[26,3339,3340],{},"  $G_a \\gets 0$\n",[26,3342,3344],{"class":3318,"line":3343},5,[26,3345,3346],{},"  repeat $m$ times\n",[26,3348,3350],{"class":3318,"line":3349},6,[26,3351,3352],{},"    simulate a trajectory from $s$: take $a$, then follow $\\pi$ to termination\n",[26,3354,3356],{"class":3318,"line":3355},7,[26,3357,3358],{},"    $G \\gets$ return of that trajectory\n",[26,3360,3362],{"class":3318,"line":3361},8,[26,3363,3364],{},"    $G_a \\gets G_a + G$\n",[26,3366,3368],{"class":3318,"line":3367},9,[26,3369,3370],{},"  $Q(s,a) \\gets G_a \u002F m$ \u002F\u002F Monte Carlo estimate of $q_\\pi(s,a)$\n",[26,3372,3374],{"class":3318,"line":3373},10,[26,3375,3376],{},"return $\\arg\\max_a Q(s,a)$ \u002F\u002F best over the candidates; then discard $Q$\n",[11,3378,3379,3380,3384],{},"This continues in ",[15,3381,3383],{"href":3382},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search","Monte Carlo Tree Search",", which turns the rollout algorithm into a planner with memory: it accumulates value estimates across simulations, steers later ones with the UCT rule, and — combined with a deep network — becomes the search behind AlphaGo, AlphaZero, and MuZero.",[3386,3387,3390,3395],"section",{"className":3388,"dataFootnotes":6},[3389],"footnotes",[308,3391,3394],{"className":3392,"id":305},[3393],"sr-only","Footnotes",[3396,3397,3398,3484,3495,3548],"ol",{},[3399,3400,3402,3405,3406,3409,3410,3462,3463,518,3470,518,3477],"li",{"id":3401},"user-content-fn-sb-decision",[21,3403,3404],{},"Sutton & Barto",", ",[163,3407,3408],{},"Reinforcement Learning: An Introduction"," (2nd ed.), §8.8 — Planning at Decision Time: the background-vs.-decision-time distinction, planning as a computation whose output is a single action for ",[26,3411,3413],{"className":3412},[29],[26,3414,3416],{"className":3415,"ariaHidden":34},[33],[26,3417,3419,3422],{"className":3418},[38],[26,3420],{"className":3421,"style":43},[42],[26,3423,3425,3428],{"className":3424},[47],[26,3426,53],{"className":3427,"style":52},[47,51],[26,3429,3431],{"className":3430},[57],[26,3432,3434,3454],{"className":3433},[61,62],[26,3435,3437,3451],{"className":3436},[66],[26,3438,3440],{"className":3439,"style":71},[70],[26,3441,3442,3445],{"style":74},[26,3443],{"className":3444,"style":79},[78],[26,3446,3448],{"className":3447},[83,84,85,86],[26,3449,90],{"className":3450},[47,51,86],[26,3452,95],{"className":3453},[94],[26,3455,3457],{"className":3456},[66],[26,3458,3460],{"className":3459,"style":102},[70],[26,3461],{},", and the latency\u002Fdepth trade-off (chess programs planning dozens of moves ahead per move). ",[15,3464,3469],{"href":3465,"ariaLabel":3466,"className":3467,"dataFootnoteBackref":6},"#user-content-fnref-sb-decision","Back to reference 1",[3468],"data-footnote-backref","↩",[15,3471,3469,3475],{"href":3472,"ariaLabel":3473,"className":3474,"dataFootnoteBackref":6},"#user-content-fnref-sb-decision-2","Back to reference 1-2",[3468],[299,3476,667],{},[15,3478,3469,3482],{"href":3479,"ariaLabel":3480,"className":3481,"dataFootnoteBackref":6},"#user-content-fnref-sb-decision-3","Back to reference 1-3",[3468],[299,3483,1796],{},[3399,3485,3487,3489,3490],{"id":3486},"user-content-fn-sb-rtdp",[21,3488,3404],{},", §8.7 — Real-time Dynamic Programming: RTDP as on-policy trajectory-sampling \u002F asynchronous value iteration, relevant vs. irrelevant states, the optimal-partial-policy convergence result of Barto, Bradtke, and Singh (1995) for stochastic optimal-path problems (its four conditions), and the racetrack comparison (Example 8.6) showing ~half the updates of sweep-based value iteration. ",[15,3491,3469],{"href":3492,"ariaLabel":3493,"className":3494,"dataFootnoteBackref":6},"#user-content-fnref-sb-rtdp","Back to reference 2",[3468],[3399,3496,3498,3500,3501,3542,3543],{"id":3497},"user-content-fn-sb-heuristic",[21,3499,3404],{},", §8.9 — Heuristic Search: classical state-space search as decision-time planning, applying an approximate value function at the leaves and backing up with expected max updates toward the root, deeper search reducing the effect of value-function error (",[26,3502,3504],{"className":3503},[29],[26,3505,3507],{"className":3506,"ariaHidden":34},[33],[26,3508,3510,3513],{"className":3509},[38],[26,3511],{"className":3512,"style":2031},[42],[26,3514,3516,3519],{"className":3515},[47],[26,3517,1007],{"className":3518,"style":1006},[47,51],[26,3520,3522],{"className":3521},[57],[26,3523,3525],{"className":3524},[61],[26,3526,3528],{"className":3527},[66],[26,3529,3531],{"className":3530,"style":2050},[70],[26,3532,3533,3536],{"style":2053},[26,3534],{"className":3535,"style":79},[78],[26,3537,3539],{"className":3538},[83,84,85,86],[26,3540,2017],{"className":3541,"style":2016},[47,51,86],"), and the focusing of updates on states downstream of the current one (Figure 8.9). ",[15,3544,3469],{"href":3545,"ariaLabel":3546,"className":3547,"dataFootnoteBackref":6},"#user-content-fnref-sb-heuristic","Back to reference 3",[3468],[3399,3549,3551,3553,3554,3624,3625],{"id":3550},"user-content-fn-sb-rollout",[21,3552,3404],{},", §8.10 — Rollout Algorithms: Monte Carlo estimates of ",[26,3555,3557],{"className":3556},[29],[26,3558,3560],{"className":3559,"ariaHidden":34},[33],[26,3561,3563,3566,3606,3609,3612,3615,3618,3621],{"className":3562},[38],[26,3564],{"className":3565,"style":687},[42],[26,3567,3569,3572],{"className":3568},[47],[26,3570,1874],{"className":3571,"style":1426},[47,51],[26,3573,3575],{"className":3574},[57],[26,3576,3578,3598],{"className":3577},[61,62],[26,3579,3581,3595],{"className":3580},[66],[26,3582,3584],{"className":3583,"style":2248},[70],[26,3585,3586,3589],{"style":1443},[26,3587],{"className":3588,"style":79},[78],[26,3590,3592],{"className":3591},[83,84,85,86],[26,3593,2260],{"className":3594,"style":1426},[47,51,86],[26,3596,95],{"className":3597},[94],[26,3599,3601],{"className":3600},[66],[26,3602,3604],{"className":3603,"style":102},[70],[26,3605],{},[26,3607,697],{"className":3608},[696],[26,3610,701],{"className":3611},[47,51],[26,3613,858],{"className":3614},[857],[26,3616],{"className":3617,"style":789},[710],[26,3619,15],{"className":3620},[47,51],[26,3622,706],{"className":3623},[705]," under a rollout policy at the current state, rollout as one step of the policy-improvement theorem, the backgammon origin (Tesauro & Galperin, 1997), and the time trade-offs of simulation count and rollout-policy quality. ",[15,3626,3469],{"href":3627,"ariaLabel":3628,"className":3629,"dataFootnoteBackref":6},"#user-content-fnref-sb-rollout","Back to reference 4",[3468],[3631,3632,3633],"style",{},"html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark-mode .shiki span {color: var(--shiki-dark-mode);background: var(--shiki-dark-mode-bg);font-style: var(--shiki-dark-mode-font-style);font-weight: var(--shiki-dark-mode-font-weight);text-decoration: var(--shiki-dark-mode-text-decoration);}html.dark-mode .shiki span {color: var(--shiki-dark-mode);background: var(--shiki-dark-mode-bg);font-style: var(--shiki-dark-mode-font-style);font-weight: var(--shiki-dark-mode-font-weight);text-decoration: var(--shiki-dark-mode-text-decoration);}",{"title":6,"searchDepth":3325,"depth":3325,"links":3635},[3636,3637,3640,3641,3642,3643],{"id":310,"depth":3325,"text":311},{"id":642,"depth":3325,"text":643,"children":3638},[3639],{"id":1221,"depth":3331,"text":1222},{"id":1472,"depth":3325,"text":1473},{"id":1781,"depth":3325,"text":1782},{"id":2126,"depth":3325,"text":2127},{"id":305,"depth":3325,"text":3394},[],"computer-science","The planning-and-learning\nlesson built Dyna: a model generates simulated experience, and the same backups\nthat learn from real experience improve a global value function state by state.\nThat is background planning. When a state St​ finally arrives, its action is\nalready stored in the table; reading it off is a lookup. All the computation\nhappened earlier, spread across the whole state space.",false,"md",{"moduleNumber":3325,"lessonNumber":3650,"order":3651},11,211,"Tabular Solution Methods",true,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning",[],"---\ntitle: Decision-Time Planning\nmodule: Tabular Solution Methods\nmoduleNumber: 2\nlessonNumber: 11\norder: 211\nsummary: >\n  Planning need not build a global policy. Decision-time planning runs a fresh\n  lookahead every time a state arrives and returns just one action, then throws\n  the work away. We start from real-time dynamic programming — asynchronous value\n  iteration on the states the agent actually visits — then move through heuristic\n  search and rollout algorithms, each a one-step policy improvement applied on the\n  fly to the current state.\ntopics: [Tabular Methods]\nsources:\n  - book: Sutton & Barto\n    ref: \"Ch. 8 — Planning and Learning with Tabular Methods; §8.7 Real-time Dynamic Programming; §8.8 Planning at Decision Time\"\n  - book: Sutton & Barto\n    ref: \"§8.9 Heuristic Search; §8.10 Rollout Algorithms\"\n---\n\nThe [planning-and-learning](\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning)\nlesson built Dyna: a model generates simulated experience, and the same backups\nthat learn from real experience improve a global value function state by state.\nThat is **background planning**. When a state $S_t$ finally arrives, its action is\nalready stored in the table; reading it off is a lookup. All the computation\nhappened earlier, spread across the whole state space.\n\nThere is a second way to use a model. Wait until $S_t$ arrives, then run a\ncomputation whose _only_ output is the single action $A_t$ — a deep, focused\nlookahead from _this_ state — and discard everything the moment you have played.\nThe next state $S_{t+1}$ starts the computation over. This is **decision-time\nplanning**, and it is how a chess engine spends its clock: not on a policy for all\nof chess, but on the best move in the position on the board right now. This lesson\ntakes the compressed treatment from the planning lesson and works it out in full —\nreal-time DP, heuristic search, and rollout algorithms — building toward Monte Carlo\nTree Search, the search behind AlphaZero, which the next lesson develops.[^sb-decision]\n\n## Background versus decision-time planning\n\nThe distinction is _when_ the planning happens relative to the moment of action,\nand _what it produces_.\n\n**Background planning** improves the value function or policy over many states,\nahead of demand, so that action selection is cheap.[^sb-decision] Dyna and\nprioritized sweeping are background planners: their updates are not aimed at the\ncurrent state in particular. By the time $S_t$ is encountered, planning has already\nshaped the table entries used to choose $A_t$, and possibly the entries for a great\nmany other states too.\n\n**Decision-time planning** begins and completes _after_ encountering each new state,\nas a computation whose output is one action. The values and policy it produces are\nspecific to $S_t$ and its likely successors, and they are usually discarded once the\naction is chosen — you rarely return to the exact same state soon enough for saved\nvalues to help. In exchange, every unit of computation\nis spent on the decision immediately at hand.\n\n$$\n% caption: Two ways to spend a model. Background planning (top) improves a global\n% policy over many states ahead of time, so selecting $A_t$ is a table lookup.\n% Decision-time planning (bottom) runs a fresh lookahead from $S_t$ and returns\n% one action, then discards the work.\n\\begin{tikzpicture}[>=stealth, font=\\small,\n  box\u002F.style={draw, minimum width=26mm, minimum height=10mm, align=center, font=\\footnotesize},\n  small\u002F.style={circle, draw, minimum size=4mm, inner sep=0pt}]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  % --- background planning (top row) ---\n  \\node[font=\\footnotesize, anchor=west] at (-4.6,3.5) {background planning};\n  \\node[box] (model) at (0,3.0) {model};\n  \\node[box] (table) at (3.6,3.0) {global policy\\\\(table)};\n  \\node[box, draw=acc, text=acc] (act1) at (7.6,3.0) {select $A_t$\\\\(lookup)};\n  \\draw[->, acc, thick] (model) -- (table) node[midway, above, font=\\scriptsize] {sim.};\n  \\draw[->, acc, thick] (table) -- (act1) node[midway, above, font=\\scriptsize] {cheap};\n  \\node[font=\\scriptsize, black, align=center] at (1.8,2.2) {ahead of time,\\\\for all states};\n  % --- decision-time planning (bottom row) ---\n  \\node[font=\\footnotesize, anchor=west] at (-4.6,0.4) {decision-time planning};\n  \\node[box] (st) at (0,-0.1) {state $S_t$};\n  \\node[box, draw=red, text=red] (look) at (3.6,-0.1) {lookahead\\\\from $S_t$};\n  \\node[box, draw=acc, text=acc] (act2) at (7.6,-0.1) {select $A_t$};\n  \\draw[->, red, thick] (st) -- (look) node[midway, above, font=\\scriptsize] {on demand};\n  \\draw[->, acc, thick] (look) -- (act2);\n  \\draw[->, black, dashed] (act2.south) .. controls (5.5,-1.6) and (2.0,-1.6) .. (look.south)\n    node[midway, below, font=\\scriptsize] {discard, repeat at $S_{t+1}$};\n\\end{tikzpicture}\n$$\n\n> **Definition (Background vs. decision-time planning).** **Background** planning\n> uses simulated experience to improve a global value function or policy ahead of\n> time, so choosing an action is a cheap table lookup. **Decision-time** planning\n> runs on demand for the current state $S_t$, producing one action $A_t$ from a\n> focused, often deep lookahead, then throwing the intermediate values and policy\n> away.\n\nThe two blend in practice — you can focus planning on the current state _and_ save\na little of it so a later return is cheaper — but they are cleanest understood\napart. The trade is latency against depth: background planning suits control that\nmust respond in milliseconds; decision-time planning suits settings where you can\nafford seconds or minutes per move, and a deep lookahead buys a much better action.\n\n## Real-time dynamic programming\n\nBefore decision-time planning proper, there is a method between the\ntwo categories, and it illustrates\nwhy _focusing on the states the agent actually visits_ helps. **Real-time\ndynamic programming** (RTDP) is an on-policy trajectory-sampling version of the\n[value-iteration](\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming)\nalgorithm of dynamic programming.[^sb-rtdp]\n\nConventional value iteration sweeps the entire state set, applying the expected\nvalue-iteration update\n\n$$\nV(s) \\gets \\max_{a} \\sum_{s', r} p(s', r \\mid s, a)\\bigl[\\,r + \\gamma\\,V(s')\\,\\bigr]\n$$\n\nto every state, over and over, until the values stop changing. RTDP applies the\n_same_ update, but not in systematic sweeps. It is an instance of **asynchronous\ndynamic programming**: the update order is dictated by the order in which states are\nvisited along real or simulated trajectories. At each step of a trajectory, the\nagent is in some state $S$; it applies the value-iteration update to $S$ (and\noptionally to a few other states, such as those in a limited look-ahead search),\ntakes a greedy action, and moves on. States that the agent never visits are never\nupdated.\n\n$$\n% caption: RTDP updates only states the agent reaches. From the start states, an\n% optimal policy visits the relevant states; irrelevant states are unreachable\n% under any optimal policy from any start, and RTDP can skip them entirely.\n\\begin{tikzpicture}[>=stealth, font=\\small]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  % outer ellipse: all states\n  \\draw[black] (0,0) ellipse (5.0 and 2.7);\n  \\node[black, anchor=north east, font=\\footnotesize] at (4.9,2.55) {all states};\n  % inner ellipse: relevant states\n  \\draw[acc, thick] (-1.0,-0.1) ellipse (2.7 and 1.7);\n  \\node[acc, anchor=south, font=\\footnotesize] at (-1.0,1.55) {relevant states};\n  % start states blob\n  \\fill[acc!18] (-2.1,-0.1) circle (0.55);\n  \\draw[acc] (-2.1,-0.1) circle (0.55);\n  \\node[acc, font=\\scriptsize] at (-2.1,-0.1) {start};\n  % an optimal trajectory through relevant states\n  \\draw[acc, thick, ->] (-1.7,0.2) .. controls (-0.6,0.9) and (0.4,0.4) .. (1.0,-0.5);\n  \\node[acc, anchor=west, font=\\scriptsize] at (1.05,-0.6) {optimal path};\n  % irrelevant region marker\n  \\node[red, font=\\scriptsize, align=center] at (3.4,0.4) {irrelevant\\\\(never visited)};\n  \\fill[black] (3.4,-0.5) circle (2.2pt);\n  \\fill[black] (2.9,-0.9) circle (2.2pt);\n  \\fill[black] (3.9,-1.0) circle (2.2pt);\n\\end{tikzpicture}\n$$\n\nThe close tie to conventional DP lets convergence results carry over. If\ntrajectories can start only from a designated set of **start states**, then for a\nprediction problem, on-policy trajectory sampling lets RTDP skip every state that\nthe given policy cannot reach from any start — those states are **irrelevant** to\nthe prediction problem. For control, the goal is an **optimal partial policy**: one\nthat is optimal on the **relevant** states (reachable from some start under _some_\noptimal policy) but may be arbitrary, or even undefined, on the irrelevant ones.\nThere is no need to specify optimal actions where an optimal policy never goes.\n\n> **Definition (Relevant and irrelevant states).** A state is **relevant** if it\n> is reachable from some start state under some optimal policy. A state is\n> **irrelevant** if no optimal policy reaches it from any start state. An\n> **optimal partial policy** is optimal on the relevant states and unconstrained\n> on the irrelevant ones.\n\nThe key result: for a class of problems, RTDP converges to a policy optimal on\nthe relevant states _without_ visiting every state infinitely often — sometimes\nwithout visiting some states at all. When only a small fraction of a very large\nstate set is relevant, that is decisive; even a single full sweep may be infeasible,\nyet RTDP never needs one.\n\nIn plain terms: as long as the agent can always reach the goal, every step costs\nsomething, and the values start out optimistic, RTDP will settle on the right action\nfor every state that matters — even though it never updates the states that do\nnot. The formal statement lists exactly those conditions.\n\n> **Theorem (RTDP convergence, Barto–Bradtke–Singh 1995).** For undiscounted\n> episodic tasks with absorbing goal states of zero reward, RTDP converges to a\n> policy optimal on all the relevant states — with probability one — provided:\n> (1) the initial value of every goal state is zero; (2) at least one policy\n> reaches a goal with probability one from every start state; (3) all rewards for\n> transitions from non-goal states are strictly negative; and (4) all initial\n> values are $\\ge$ their optimal values (satisfied by initializing every state to\n> zero). At each step RTDP selects a greedy action, breaking ties randomly.\n\nThese are the **stochastic optimal-path problems** — cost-minimization tasks such\nas minimum-time control, where each step costs $-1$ and the objective is to reach\nthe goal as cheaply as possible. The convergence proof combines asynchronous-DP\nresults with results on _learning real-time A\\*_ (Korf, 1990), the heuristic-search\nalgorithm RTDP generalizes.\n\n### RTDP on the racetrack\n\nSutton and Barto compare RTDP against conventional (sweep-based, Gauss–Seidel)\nvalue iteration on a racetrack: an agent must drive around a turn and cross the\nfinish line in as few steps as possible, $-1$ per step, restarting from a random\nstart state on a crash. A small racetrack has $9{,}115$ states reachable from the\nstart states, but only about $599$ of them are _relevant_ — reachable under some\noptimal policy. That gap is where RTDP wins.\n\n| Measure | conventional DP | RTDP |\n| --- | --- | --- |\n| Computation to convergence | 28 sweeps | 4000 episodes |\n| Total value updates | 252{,}784 | 127{,}600 |\n| Updates per episode | — | 31.9 |\n| % of states updated $\\le 100$ times | — | 98.45 |\n| % of states updated 0 times | — | 3.18 |\n\nBoth methods reach policies averaging 14–15 steps to the finish, but RTDP does it\nwith roughly _half_ the updates. Conventional value iteration updates every state on\nevery sweep; RTDP focuses updates on the states relevant to the objective, and that\nfocus narrows as learning continues. There is a second, subtler advantage: because\nRTDP is always greedy with respect to its current values, the policy it uses to\ngenerate trajectories approaches an optimal policy as the values approach $v_\\ast$ —\nwhereas conventional value iteration keeps updating _every_ state right up to\ntermination and only checks the policy afterward.\n\n## Planning at decision time\n\nRTDP still improves values it might revisit; it leans toward background. Genuine\ndecision-time planning discards its work. On encountering $S_t$, it begins and\ncompletes a planning computation whose output is the single action $A_t$; on the\nnext step it begins anew with $S_{t+1}$ to produce $A_{t+1}$, and so on.[^sb-decision]\n\n$$\n% caption: The decision-time loop. Encounter a state, plan a lookahead from it,\n% emit one action, act, and discard the plan; the next state restarts the\n% computation. Planning output is an action, not a stored policy.\n\\begin{tikzpicture}[>=stealth, font=\\small,\n  box\u002F.style={draw, minimum width=22mm, minimum height=10mm, align=center, font=\\footnotesize}]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\node[box] (s) at (0,0) {encounter $S_t$};\n  \\node[box, draw=acc, text=acc] (p) at (3.4,0) {plan from $S_t$};\n  \\node[box] (a) at (6.8,0) {emit $A_t$};\n  \\node[box] (e) at (10.2,0) {act,\\\\observe $S_{t+1}$};\n  \\draw[->, acc, thick] (s) -- (p);\n  \\draw[->, acc, thick] (p) -- (a);\n  \\draw[->, black, thick] (a) -- (e);\n  \\draw[->, red, thick] (e.south) .. controls (10.2,-1.7) and (0,-1.7) .. (s.south)\n    node[midway, below, font=\\scriptsize] {discard plan, restart with $S_{t+1}$};\n\\end{tikzpicture}\n$$\n\nEven done only at decision time, planning is still what it always was — computing\nupdates and values from simulated experience, and ultimately a policy — except the\nvalues and the policy are now specific to $S_t$ and thrown away after selecting the\naction. In many applications that is no great loss: the state space is huge and you\nare unlikely to return to the same state soon. You can mix the two (focus on the\ncurrent state _and_ store some of the result), but decision-time planning is most\nuseful when fast responses are _not_ required. A chess engine may take minutes per\nmove and plan dozens of moves ahead in that time; if low-latency selection is the\npriority, background planning is the better choice.\n\n## Heuristic search\n\nThe classical state-space planners of artificial intelligence — game-tree search\nand its relatives — are decision-time planning methods, collectively **heuristic\nsearch**.[^sb-heuristic] For each state encountered, heuristic search considers a\nlarge tree of possible continuations. It applies an approximate value function to\nthe **leaf** nodes and backs those values up toward the current state at the root.\nThe backing-up reuses the expected updates with maxes (the ones for $v_\\ast$ and\n$q_\\ast$) from throughout this course — nothing new. The backup stops at the\nstate–action nodes for the current state; the best of those is chosen as $A_t$, and\nall the backed-up values are then discarded.\n\n$$\n% caption: Heuristic search as decision-time planning. A lookahead tree is grown\n% from the root ($S_t$); an approximate value $\\tilde v$ is applied at the leaves\n% and backed up with expected max updates toward the root, where the best action\n% is chosen. Backed-up values are then discarded.\n\\begin{tikzpicture}[>=stealth, font=\\small,\n  nd\u002F.style={circle, draw, fill=white, minimum size=5mm, inner sep=0pt},\n  lf\u002F.style={circle, draw, fill=black!8, minimum size=4.5mm, inner sep=0pt}]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  % root\n  \\node[nd, draw=acc, thick] (r) at (0,3.0) {};\n  \\node[acc, anchor=east, font=\\scriptsize] at (-0.25,3.0) {root $S_t$};\n  % level 1\n  \\node[nd] (a) at (-2.4,1.6) {};\n  \\node[nd] (b) at (0,1.6) {};\n  \\node[nd] (c) at (2.4,1.6) {};\n  \\draw[acc, thick] (r) -- (a);\n  \\draw[black] (r) -- (b);\n  \\draw[black] (r) -- (c);\n  % level 2 leaves\n  \\node[lf] (la1) at (-3.2,0.1) {};\n  \\node[lf] (la2) at (-1.6,0.1) {};\n  \\node[lf] (lb1) at (-0.7,0.1) {};\n  \\node[lf] (lb2) at (0.7,0.1) {};\n  \\node[lf] (lc1) at (1.6,0.1) {};\n  \\node[lf] (lc2) at (3.2,0.1) {};\n  \\draw[black] (a) -- (la1); \\draw[black] (a) -- (la2);\n  \\draw[black] (b) -- (lb1); \\draw[black] (b) -- (lb2);\n  \\draw[black] (c) -- (lc1); \\draw[black] (c) -- (lc2);\n  % leaf value label\n  \\node[black, font=\\scriptsize, anchor=north] at (0,-0.35) {leaves: apply approximate value $v$-tilde};\n  % backup arrow (red, upward)\n  \\draw[red, thick, ->] (-1.7,1.75) -- (-0.7,2.6);\n  \\node[red, anchor=west, font=\\scriptsize] at (0.65,2.55) {back up (max)};\n  % chosen action marker\n  \\node[acc, anchor=west, font=\\scriptsize] at (-2.3,1.15) {best action};\n\\end{tikzpicture}\n$$\n\nIn conventional heuristic search no effort is made to _save_ the backed-up values;\nthe value function is designed by people and left unchanged. (One can allow it to\nlearn — that is essentially what we have been doing all along.) The one-step greedy,\n$\\varepsilon$-greedy, and UCB action-selection rules are heuristic search on a\nsmaller scale: to pick the greedy action given a model and a state-value function,\nyou look ahead one step to each possible next state, add rewards and estimated\nvalues, and take the best. Heuristic search is that greedy computation extended\n**beyond a single step**.\n\nWhy does deeper search help? With a perfect model and an _imperfect_ value function,\ndeeper search yields better policies. Search all the way to the end of the episode\nand the imperfect value function is eliminated entirely — the action is optimal.\nSearch to depth $k$ with $\\gamma^k$ small and the actions are near-optimal, because\nthe leftover value-function error is discounted away. The cost is compute: deeper\nsearch means a slower response. Tesauro's grandmaster-level backgammon player,\nTD-Gammon, illustrated the trade — the deeper its heuristic search, the better its\nmoves, but the longer each took.\n\nThe most important effect of heuristic search is not depth but **focus**. Its search\ntree is tightly concentrated on the states and actions that might immediately follow\n$S_t$. Those states are the ones where you most want the value function to be\naccurate, and where updates matter most for the imminent decision. In chess there\nare far too many positions to store a value for each, but a program can easily store\ndistinct estimates for the millions it encounters while looking ahead from a single\nposition. Any state-space search can be viewed as piecing together a large number of\nindividual one-step updates, ordered to concentrate on states downstream of the\ncurrent one — which is where the performance gain of deeper search actually comes\nfrom.\n\n## Rollout algorithms\n\n**Rollout algorithms** are decision-time planners built on\n[Monte Carlo](\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods) control,\napplied to simulated trajectories that all begin at the current state.[^sb-rollout]\nThey estimate action values for a given policy by averaging the returns of many\nsimulated trajectories that start with each possible action and thereafter follow\nthat policy — the **rollout policy**. When the estimates are good enough, the action\nwith the highest value is played, and the whole process repeats from the resulting\nnext state. The name comes from backgammon: \"rolling out\" a position means playing\nit out to the end many times with random dice.\n\nUnlike the Monte Carlo control of the\n[Monte Carlo lesson](\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods),\na rollout algorithm does **not** aim to estimate a complete optimal action-value\nfunction $q_\\ast$, nor even a complete $q_\\pi$. It produces Monte Carlo estimates of\naction values only for the current state and a given rollout policy $\\pi$. That is\nwhat makes rollouts simple: no need to sample every state–action pair, and no need\nto approximate a function over the whole space.\n\n$$\n% caption: A rollout at state $s$. For each candidate action $a$, simulate many\n% trajectories that take $a$ then follow the rollout policy to termination;\n% average their returns to estimate $Q(s,a)$; play the best. Estimates are then\n% discarded.\n\\begin{tikzpicture}[>=stealth, font=\\small,\n  nd\u002F.style={circle, draw, fill=white, minimum size=6mm, inner sep=0pt},\n  term\u002F.style={draw, fill=black!12, minimum size=4mm, inner sep=0pt}]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\node[nd, draw=acc, thick] (s) at (0,2.4) {};\n  \\node[acc, anchor=east, font=\\scriptsize] at (-0.25,2.4) {state $s$};\n  % candidate actions\n  \\node[nd] (a1) at (-2.6,1.2) {};\n  \\node[nd] (a2) at (0,1.2) {};\n  \\node[nd] (a3) at (2.6,1.2) {};\n  \\draw[acc, thick] (s) -- (a1);\n  \\draw[black] (s) -- (a2);\n  \\draw[black] (s) -- (a3);\n  \\node[font=\\scriptsize, anchor=south east] at (-1.5,1.9) {a1};\n  \\node[font=\\scriptsize, anchor=west] at (0.15,2.0) {a2};\n  \\node[font=\\scriptsize, anchor=south west] at (1.5,1.9) {a3};\n  % Q estimates beside each action node\n  \\node[font=\\scriptsize, anchor=east] at (-2.95,1.2) {Q=0.7};\n  \\node[acc, font=\\scriptsize, anchor=east] at (-0.35,1.2) {Q=0.9};\n  \\node[font=\\scriptsize, anchor=west] at (2.95,1.2) {Q=0.5};\n  % rollouts to terminal (dashed) under rollout policy\n  \\node[term] (ta1) at (-2.6,-0.9) {};\n  \\node[term] (ta2) at (0,-0.9) {};\n  \\node[term] (ta3) at (2.6,-0.9) {};\n  \\draw[black, dashed, ->] (a1) -- (ta1);\n  \\draw[black, dashed, ->] (a2) -- (ta2);\n  \\draw[black, dashed, ->] (a3) -- (ta3);\n  \\node[black, anchor=west, font=\\scriptsize] at (0.35,-0.1) {follow rollout policy};\n  \\node[anchor=north, font=\\scriptsize] at (0,-1.25) {terminal};\n  \\node[acc, anchor=west, font=\\scriptsize] at (0.35,2.4) {pick best action};\n\\end{tikzpicture}\n$$\n\nWhat does that accomplish? The\n[policy-improvement theorem](\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming)\ntells us that if two policies $\\pi$ and $\\pi'$ are identical except that\n$\\pi'(s) = a \\ne \\pi(s)$ for one state $s$, and $q_\\pi(s,a) \\ge v_\\pi(s)$, then\n$\\pi'$ is at least as good as $\\pi$ — strictly better if the inequality is strict.\nTake $s$ to be the current state and $\\pi$ the rollout policy. Averaging the\nsimulated returns estimates $q_\\pi(s,a')$ for each $a' \\in \\mathcal{A}(s)$; the\npolicy that plays the best of these and then follows $\\pi$ improves on $\\pi$. A\nrollout is therefore one step of policy improvement, applied on the fly to the\ncurrent state and then discarded — like one step of\n[asynchronous](\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning) value\niteration that changes the action for a single state.\n\n> **Definition (Rollout algorithm).** A decision-time planner that, at the current\n> state $s$, uses Monte Carlo simulations under a fixed **rollout policy** $\\pi$ to\n> estimate $q_\\pi(s,a)$ for each action $a$, plays $\\arg\\max_a q_\\pi(s,a)$, and\n> discards the estimates. It performs one step of policy improvement over $\\pi$ at\n> $s$; it does not try to learn $q_\\ast$.\n\nThe aim is to improve _over_ the rollout policy, not to find an optimal policy. The\nbetter the rollout policy and the more accurate the value estimates, the better the\nresulting decision (though better rollout policies also take longer to simulate).\nBecause the Monte Carlo trials are independent, they parallelize trivially across\nprocessors; and one can truncate trajectories short of termination, correcting the\ntruncated return with a stored evaluation function — which brings the whole\napparatus of truncated returns back into play.\n\n```algorithm\ncaption: $\\textsc{Rollout}(s, \\pi, m)$ — choose an action at state $s$ by one step of policy improvement over $\\pi$\ninput: current state $s$, rollout policy $\\pi$, simulations per action $m$\nfor each action $a \\in \\mathcal{A}(s)$ do\n  $G_a \\gets 0$\n  repeat $m$ times\n    simulate a trajectory from $s$: take $a$, then follow $\\pi$ to termination\n    $G \\gets$ return of that trajectory\n    $G_a \\gets G_a + G$\n  $Q(s,a) \\gets G_a \u002F m$ \u002F\u002F Monte Carlo estimate of $q_\\pi(s,a)$\nreturn $\\arg\\max_a Q(s,a)$ \u002F\u002F best over the candidates; then discard $Q$\n```\n\nThis continues in [Monte Carlo Tree Search](\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search), which turns the rollout algorithm into a planner with memory: it accumulates value estimates across simulations, steers later ones with the UCT rule, and — combined with a deep network — becomes the search behind AlphaGo, AlphaZero, and MuZero.\n\n[^sb-decision]: **Sutton & Barto**, _Reinforcement Learning: An Introduction_ (2nd ed.), §8.8 — Planning at Decision Time: the background-vs.-decision-time distinction, planning as a computation whose output is a single action for $S_t$, and the latency\u002Fdepth trade-off (chess programs planning dozens of moves ahead per move).\n[^sb-rtdp]: **Sutton & Barto**, §8.7 — Real-time Dynamic Programming: RTDP as on-policy trajectory-sampling \u002F asynchronous value iteration, relevant vs. irrelevant states, the optimal-partial-policy convergence result of Barto, Bradtke, and Singh (1995) for stochastic optimal-path problems (its four conditions), and the racetrack comparison (Example 8.6) showing ~half the updates of sweep-based value iteration.\n[^sb-heuristic]: **Sutton & Barto**, §8.9 — Heuristic Search: classical state-space search as decision-time planning, applying an approximate value function at the leaves and backing up with expected max updates toward the root, deeper search reducing the effect of value-function error ($\\gamma^k$), and the focusing of updates on states downstream of the current one (Figure 8.9).\n[^sb-rollout]: **Sutton & Barto**, §8.10 — Rollout Algorithms: Monte Carlo estimates of $q_\\pi(s,a)$ under a rollout policy at the current state, rollout as one step of the policy-improvement theorem, the backgammon origin (Tesauro & Galperin, 1997), and the time trade-offs of simulation count and rollout-policy quality.\n",{"text":3658,"minutes":3659,"time":3660,"words":3661},"13 min read",12.58,754800,2516,{"title":5,"description":3646},[3664,3666],{"book":3404,"ref":3665},"Ch. 8 — Planning and Learning with Tabular Methods; §8.7 Real-time Dynamic Programming; §8.8 Planning at Decision Time",{"book":3404,"ref":3667},"§8.9 Heuristic Search; §8.10 Rollout Algorithms","available","07.reinforcement-learning\u002F02.tabular-methods\u002F11.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",[3672],"Tabular Methods","MxxKeciVuNaQBZeJvN8SHW7Kb94IYJ8XyDnFfrPcYBY",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":3675,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":3676,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":3677,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":3678,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":3679,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":3680,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":3681,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":3682,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":3683,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":3684,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":3685,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":3686,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":3687,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":3688,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":3689,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":3690,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":3691,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":3692,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":3693,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":3694,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":3695,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":3696,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":3697,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":3698,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":3699,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":3700,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":3701,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":3702,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":3703,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":3704,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":3705,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":3706,"\u002Falgorithms\u002Fsequences\u002Ftries":3707,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":3708,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":3709,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":3710,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":3711,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":3712,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":3713,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":3714,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":3715,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":3716,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":3717,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":3718,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":3719,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":3720,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":3721,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":3722,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":3723,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":3724,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":3725,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":3726,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":3727,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":3728,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":3729,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":3730,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":3731,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":3732,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":3733,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":3734,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":3735,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":3736,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":3737,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":3738,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":3739,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":3740,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":3741,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":3742,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":3743,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":3744,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":3745,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":3746,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":3747,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":3748,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":3749,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":3750,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":3751,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":3752,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":3753,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":3754,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":3755,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":3756,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":3757,"\u002Falgorithms":3758,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":3759,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":3760,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":3761,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":3762,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":3763,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":3764,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":3765,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":3766,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":3767,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":3768,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":3769,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":3770,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":3771,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":3772,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":3773,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":3774,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":3775,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":3776,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":3777,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":3778,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":3779,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":3780,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":3781,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":3782,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":3783,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":3784,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":3785,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":3786,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":3787,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":3788,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":3789,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":3790,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":3791,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":3792,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":3773,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":3793,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":3794,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":3795,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":3763,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":3796,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":3797,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":3798,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":3799,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":3800,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":3801,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":3802,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":3803,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":3804,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":3805,"\u002Fcalculus":3806,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":3807,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":3808,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":3809,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":3810,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":3811,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":3812,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":3813,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":3814,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":3815,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":3816,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":3817,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":3818,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":3819,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":3820,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":3821,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":3822,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":3823,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":3824,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":3825,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":3826,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":3827,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":3828,"\u002Fmechanics\u002Frotation\u002Frolling-motion":3829,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":3830,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":3831,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":3832,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":3833,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":3834,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":3835,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":3836,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":3837,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":3838,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":3839,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":3840,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":3841,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":3842,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":3843,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":3844,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":3845,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":3846,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":3847,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":3848,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":3849,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":3850,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":3851,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":3852,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":3853,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":3854,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":3855,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":3856,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":3857,"\u002Fmechanics":3858,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":3859,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":3860,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":3861,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":3862,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":3863,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":3864,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":3865,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":3866,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":3867,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":3868,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":3869,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":3870,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":3847,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":3871,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":3872,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":3873,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":3843,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":3708,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":3874,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":3834,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":3875,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":3876,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":3877,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":3878,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":3879,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":3880,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":3881,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":3882,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":3883,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":3808,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":3884,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":3885,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":3886,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":3887,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":3888,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":3889,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":3890,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":3891,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":3826,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":3825,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":3892,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":3893,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":3894,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":3895,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":3896,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":3897,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":3898,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":3899,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":3900,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":3852,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":3850,"\u002Felectricity-and-magnetism":3901,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":3902,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":3903,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":3904,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":3905,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":3906,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":3907,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":3908,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":3909,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":3910,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":3760,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":3911,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":3912,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":3764,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":3913,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":3914,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":3915,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":3916,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":3917,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":3918,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":3919,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":3920,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":3921,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":3922,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":3923,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":3924,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":3925,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":3926,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":3927,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":3928,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":3929,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":3930,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":3931,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":3932,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":3799,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":3933,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":3934,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":3935,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":3936,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":3937,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":3938,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":3939,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":3940,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":3941,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":3942,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":3943,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":3944,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":3945,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":3946,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":3947,"\u002Flinear-algebra":3948,"\u002Ftheory-of-computation":3949,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":3950,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":3951,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":3952,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":3953,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":3954,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":3955,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":3956,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":3957,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":3958,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":3959,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":3960,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":3961,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":3962,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":3963,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":3964,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":3965,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":3966,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":3967,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":3968,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":3969,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":3970,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":3971,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":3972,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":3973,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":3974,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":3975,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":3976,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":3977,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":3978,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":3979,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":3980,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":3981,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":3982,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":3983,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":3984,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":3985,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":3986,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":3987,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":3988,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":3989,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":3990,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":3991,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":3992,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":3993,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":3994,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":3995,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":3996,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":3997,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":3998,"\u002Fcomputer-architecture":3949,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":3999,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":4000,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":4001,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":3764,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":4002,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":3763,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":3770,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":4003,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":4004,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":3804,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":4005,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":4006,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":4007,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":4008,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":4009,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":4010,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":4011,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":4012,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":4013,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":4014,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":4015,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":4016,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":4011,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":4017,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":4018,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":4019,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":4020,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":4021,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":4022,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":4023,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":4024,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":4025,"\u002Fdifferential-equations":4026,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":4027,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":4028,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":4029,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":4030,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":3909,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":4031,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":4032,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":4033,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":4034,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":4035,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":4036,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":3779,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":4037,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":4038,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":4039,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":4040,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":4041,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":4042,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":4043,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":4044,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":4045,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":4046,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":4001,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":4047,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":4048,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":4049,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":4050,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":4051,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":3930,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":4052,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":4053,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":3940,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":4054,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":4055,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":4056,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":4057,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":4058,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":4059,"\u002Frelativity":4060,"\u002Fphysical-computing":3949,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":4061,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":4040,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":4062,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":4063,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":4064,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":4065,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":4066,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":4067,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":4068,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":4016,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":3940,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":4069,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":4070,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":4071,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":4072,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":4068,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":4073,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":4048,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":3801,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":4074,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":4075,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":3781,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":4076,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":4077,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":4078,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":4079,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":4080,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":4081,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":4082,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":4083,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":4084,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":4040,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":4085,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":4086,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":4087,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":4074,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":3762,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":4088,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":4089,"\u002Fquantum-mechanics":4090,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":4024,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":4091,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":4092,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":3913,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":4093,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":3799,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":4094,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":4095,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":3936,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":4046,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":4096,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":4097,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":4098,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":4099,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":4100,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":4073,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":4101,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":3906,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":4102,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":4103,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":3760,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":4104,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":4105,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":4062,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":3789,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":3940,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":4106,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":4107,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":3925,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":4050,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":4108,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":4109,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":4110,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":3945,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":4111,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":4112,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":4113,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":4113,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":4114,"\u002Freal-analysis":4115,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":4116,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":4117,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":4118,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":4119,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":4120,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":4121,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":4122,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":4123,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":4124,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":4125,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":4089,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":4126,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":4118,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":4035,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":4127,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":4128,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":4129,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":4130,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":4131,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":4132,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":4133,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":4134,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":4128,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":4135,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":4104,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":4136,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":4137,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":4138,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":4139,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":4140,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":4141,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":4142,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":4143,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":4144,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":4145,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":3778,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":4146,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":4147,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":4020,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":4148,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":4149,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":4077,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":4149,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":4150,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":4151,"\u002Fabstract-algebra":4152,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":4153,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":4154,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":4155,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":4156,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":4157,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":4069,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":4158,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":4159,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":4160,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":4161,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":4162,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":4163,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":4164,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":3903,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":4032,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":3778,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":4165,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":3762,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":4166,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":4167,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":3800,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":4094,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":4168,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":4169,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":4170,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":4171,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":4172,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":4173,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":4174,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":4175,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":4176,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":4177,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":4178,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":4179,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":4180,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":4181,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":4125,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":4182,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":4183,"\u002Fatomic-physics":4184,"\u002Fdatabases":3949,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":4185,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":4186,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":4187,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":4116,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":4188,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":4189,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":4190,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":4191,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":4192,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":4193,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":4194,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":4195,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":4196,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":4197,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":4198,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":4199,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":4200,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":4201,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":4202,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":4203,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":4204,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":4205,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":4206,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":4207,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":4198,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":4208,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":4209,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":4210,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":4211,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":4212,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":4157,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":4213,"\u002Fcategory-theory":4214,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":4215,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":4216,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":4217,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":4218,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":4219,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":4220,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":4179,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":4221,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":4222,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":4223,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":4224,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":4225,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":4226,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":4227,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":4228,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":4229,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":4230,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":4231,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":4232,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":4233,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":4234,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":4235,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":4236,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":4237,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":4238,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":4239,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":4240,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":4241,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":4242,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":4243,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":4244,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":4245,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":4246,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":4247,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":4191,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":4248,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":4249,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":4250,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":4251,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":4252,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":4253,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":4254,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":3743,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":4255,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":4256,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":3979,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":4257,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":4258,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":4259,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":4260,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":4261,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":4262,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":4263,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":4264,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":4265,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":4266,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":4267,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":4268,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":3952,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":4269,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":4270,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":4271,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":4272,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":3989,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":4273,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":4274,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":4275,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":4276,"\u002Fdeep-learning":3949,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":4277,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":4074,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":4278,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":4279,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":4280,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":4281,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":4282,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":4283,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":4284,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":4285,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":4121,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":4286,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":4287,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":4288,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":4008,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":3801,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":4289,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":4290,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":4291,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":3935,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":4292,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":4293,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":4013,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":3940,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":4294,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":3909,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":3779,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":3795,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":4295,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":4296,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":4297,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":3927,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":4298,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":3789,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":4299,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":4300,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":4301,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":4302,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":4123,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":4303,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":4304,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":4305,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":4306,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":4069,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":4307,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":4047,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":4308,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":3908,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":4309,"\u002Fstatistical-mechanics":4310,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":4311,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":3774,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":4034,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":4312,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":4313,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":4314,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":4315,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":4316,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":4317,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":3907,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":4318,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":4319,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":4320,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":4321,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":4050,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":4322,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":4323,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":4324,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":4325,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":4326,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":4105,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":4049,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":4327,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":4328,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":4329,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":4330,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":4040,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":4331,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":4332,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":4277,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":4177,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":3904,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":4333,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":3770,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":4334,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":4335,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":3915,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":4336,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":4170,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":4337,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":3762,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":4338,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":3773,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":4339,"\u002Fcondensed-matter":4090,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":4340,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":4341,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":4342,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":4343,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":3787,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":4344,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":4345,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":3787,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":4346,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":4200,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":4347,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":4348,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":4349,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":4347,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":4350,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":4351,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":4352,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":4353,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":4354,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":4355,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":4356,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":4357,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":4278,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":4358,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":4351,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":4359,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":4360,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":3993,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":4361,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":4178,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":4362,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":4363,"\u002Flogic":4364,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":4365,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":4366,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":3979,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":4367,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":4368,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":4369,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":4370,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":4360,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":4371,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":4372,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":4373,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":4271,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":4374,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":4375,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":4376,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":4377,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":3661,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":3996,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":4378,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":4379,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":4380,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":4381,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":4187,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":4382,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":4359,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":4383,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":4384,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":4385,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":4007,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":4386,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":4137,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":4387,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":4388,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":3969,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":4389,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":4390,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":4391,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":4392,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":4393,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":4247,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":4394,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":4395,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":4396,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":4282,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":4397,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":4398,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":4399,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":3996,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":4063,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":4400,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":4401,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":4402,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":4403,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":4404,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":4405,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":4406,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":4407,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":4408,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":4409,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":4410,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":4411,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":4412,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":4413,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":4414,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":4415,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":4416,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":4417,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":4418,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":4419,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":4420,"\u002Freinforcement-learning":3949,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":4421,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":4422,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":4423,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":4424,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":4425,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":4426,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":4427,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":4428,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":4429,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":4430,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":4431,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":4432,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":4433,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":4276,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":4131,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":4434,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":4435,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":4436,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":4437,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":4438,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":4439,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":4258,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":4440,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":4441,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":4442,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":4443,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":4444,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":4445,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":4446,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":4447,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":4448,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":4449,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":4450,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":4451,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":4190,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":4441,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":4452,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":3730,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":4453,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":4454,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":4455,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":4456,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":4457,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":4239,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":4458,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":4459,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":4460,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":4461,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":4462,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":4463,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":4464,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":4465,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":4466,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":4467,"\u002Fartificial-intelligence":3949,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":4206,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":4468,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":3766,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":3764,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":4300,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":4469,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":3792,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":4102,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":4470,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":4471,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":4472,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":4162,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":4473,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":4474,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":4475,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":4361,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":4476,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":4477,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":3776,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":4005,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":4478,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":4106,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":4479,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":4480,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":4001,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":4089,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":4481,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":4482,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":4483,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":3771,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":4146,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":4008,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":4484,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":4056,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":4120,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":4485,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":4486,"\u002Fnuclear-physics":4487,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":4488,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":4489,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":4127,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":4490,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":4491,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":4492,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":3975,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":4493,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":4494,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":4272,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":4495,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":4440,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":4496,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":4497,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":4498,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":4499,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":4500,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":4501,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":4502,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":3953,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":4503,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":4504,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":4446,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":4505,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":4506,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":4507,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":4508,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":4509,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":4510,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":4511,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":4512,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":4371,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":4513,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":4514,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":4515,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":4516,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":4517,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":4518,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":4519,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":4520,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":4521,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":4522,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":4523,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":4524,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":4225,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":4391,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":3981,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":4525,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":4526,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":4527,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":4528,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":4239,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":4529,"\u002Fnatural-language-processing":3949,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":4530,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":4147,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":4531,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":4292,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":4532,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":4533,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":4481,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":4534,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":4535,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":4097,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":3799,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":4536,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":4051,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":4537,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":4084,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":4538,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":4338,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":4539,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":4540,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":4307,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":4541,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":3770,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":4542,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":4543,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":4544,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":4088,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":4304,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":4545,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":4546,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":4163,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":4547,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":4208,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":4548,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":4549,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":4097,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":4130,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":4550,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":4551,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":4552,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":4186,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":4553,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":3927,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":4554,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":4030,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":4555,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":4556,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":4354,"\u002Fparticle-physics":4557,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":4148,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":4302,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":4558,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":4087,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":4559,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":4147,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":4059,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":4560,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":4561,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":4562,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":4563,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":4564,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":4353,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":4284,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":4565,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":4566,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":4567,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":4568,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":4480,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":4569,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":4043,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":4106,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":4088,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":4570,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":4172,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":3788,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":4571,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":4572,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":4303,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":4573,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":4574,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":4575,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":4576,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":3769,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":4577,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":4578,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":4030,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":4579,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":4580,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":4296,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":3951,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":4581,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":4582,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":4208,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":4194,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":4206,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":4303,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":4583,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":3768,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":3960,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":4584,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":4047,"\u002Fastrophysics-cosmology":4152,"\u002Fcolophon":4585,"\u002F":3949},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,2842,1690,1904,2346,3146,1386,2607,1966,2668,1665,2885,1606,2577,3074,2869,2403,2433,2082,1939,1587,2460,2747,2032,2642,1619,3123,1993,2090,2339,3829,1737,2622,2340,2322,3828,4409,2305,3411,2510,4527,3030,3569,3043,2457,1946,2277,2044,2909,1693,1945,2093,2399,2115,2898,2742,2242,3895,3378,3376,2769,2223,3062,3262,2651,2949,2768,3128,2423,1977,2087,2866,3388,2830,2210,2489,2884,3945,2099,2713,3402,1692,2931,4195,3989,3206,4391,3004,3704,3494,2902,999,881,901,919,748,869,1018,1045,1049,1333,954,1092,1019,976,1771,1480,1396,953,1026,161,3533,2495,1818,3007,2595,3427,3537,2216,1895,2304,3396,1739,2073,1962,2203,1767,2666,2264,2276,2852,1807,3735,1560,4144,1669,1676,1972,2418,3291,1525,2040,2766,2337,2220,2800,3001,2078,1759,2836,1896,2026,1758,1543,1047,896,946,1060,1384,1482,815,1414,1322,1440,1240,1468,1098,1133,847,1009,1381,1052,1191,1258,1370,1712,1441,1199,957,1079,150,1262,1417,1368,1219,1136,1064,1463,1636,1059,931,1115,1736,1174,1376,1363,1411,1247,1746,1313,1299,1617,1102,1076,1495,1265,1193,1263,80,{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":4587,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":4592,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":4596,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":4600,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":4604,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":4608,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":4612,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":4617,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":4621,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":4625,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":4629,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":4634,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":4638,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":4642,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":4646,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":4651,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":4655,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":4659,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":4663,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":4667,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":4671,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":4675,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":4679,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":4683,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":4687,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":4691,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":4695,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":4700,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":4704,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":4708,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":4712,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":4716,"\u002Falgorithms\u002Fsequences\u002Ftries":4720,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":4724,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":4728,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":4733,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":4737,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":4741,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":4745,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":4749,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":4753,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":4757,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":4761,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":4765,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":4769,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":4773,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":4777,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":4781,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":4785,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":4790,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":4794,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":4798,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":4802,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":4806,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":4811,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":4815,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":4819,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":4823,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":4827,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":4831,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":4835,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":4839,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":4843,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":4847,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":4851,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":4856,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":4860,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":4864,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":4868,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":4873,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":4877,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":4881,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":4885,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":4889,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":4893,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":4897,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":4902,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":4906,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":4910,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":4914,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":4919,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":4923,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":4927,"\u002Falgorithms":4931,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":4934,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":4939,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":4943,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":4947,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":4951,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":4956,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":4960,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":4964,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":4968,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":4973,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":4977,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":4981,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":4985,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":4990,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":4994,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":4998,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":5003,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":5007,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":5011,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":5016,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":5020,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":5024,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":5029,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":5033,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":5037,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":5041,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":5046,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":5050,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":5054,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":5059,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":5063,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":5067,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":5071,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":5075,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":5080,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":5084,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":5088,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":5092,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":5096,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":5101,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":5104,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":5108,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":5112,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":5116,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":5121,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":5125,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":5129,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":5133,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":5137,"\u002Fcalculus":5141,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":5144,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":5148,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":5152,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":5157,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":5161,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":5165,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":5169,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":5173,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":5178,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":5182,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":5186,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":5190,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":5194,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":5199,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":5203,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":5207,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":5211,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":5215,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":5220,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":5224,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":5228,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":5233,"\u002Fmechanics\u002Frotation\u002Frolling-motion":5237,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":5241,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":5245,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":5249,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":5253,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":5258,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":5262,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":5266,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":5270,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":5274,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":5278,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":5282,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":5287,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":5291,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":5295,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":5299,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":5303,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":5307,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":5311,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":5315,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":5319,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":5323,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":5327,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":5331,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":5336,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":5340,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":5344,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":5348,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":5352,"\u002Fmechanics":5356,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":5359,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":5364,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":5368,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":5372,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":5376,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":5380,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":5385,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":5389,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":5394,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":5398,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":5402,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":5406,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":5410,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":5415,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":5419,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":5423,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":5427,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":5432,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":5436,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":5440,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":5445,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":5449,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":5453,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":5457,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":5461,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":5466,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":5470,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":5474,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":5478,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":5482,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":5486,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":5491,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":5495,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":5499,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":5503,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":5507,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":5511,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":5515,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":5519,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":5524,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":5528,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":5532,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":5536,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":5540,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":5545,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":5549,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":5553,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":5557,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":5561,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":5566,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":5570,"\u002Felectricity-and-magnetism":5574,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":5577,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":5582,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":5586,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":5590,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":5594,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":5598,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":5603,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":5607,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":5611,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":5615,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":5619,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":5624,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":5628,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":5632,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":5637,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":5641,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":5645,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":5649,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":5653,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":5657,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":5661,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":5666,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":5670,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":5674,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":5678,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":5682,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":5686,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":5690,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":5695,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":5699,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":5703,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":5707,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":5711,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":5715,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":5720,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":5724,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":5728,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":5732,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":5736,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":5741,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":5745,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":5749,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":5753,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":5757,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":5761,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":5766,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":5770,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":5774,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":5778,"\u002Flinear-algebra":5782,"\u002Ftheory-of-computation":5785,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":5788,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":5792,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":5796,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":5800,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":5804,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":5808,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":5813,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":5817,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":5821,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":5825,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":5829,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":5833,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":5837,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":5842,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":5846,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":5850,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":5854,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":5858,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":5863,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":5867,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":5871,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":5875,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":5879,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":5884,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":5888,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":5892,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":5896,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":5900,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":5905,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":5909,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":5913,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":5917,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":5921,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":5926,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":5930,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":5934,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":5938,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":5942,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":5947,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":5951,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":5955,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":5960,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":5964,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":5969,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":5973,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":5977,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":5981,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":5985,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":5990,"\u002Fcomputer-architecture":5994,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":5997,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":6001,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":6005,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":6010,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":6014,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":6018,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":6022,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":6026,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":6030,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":6035,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":6039,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":6043,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":6047,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":6051,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":6055,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":6060,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":6064,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":6068,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":6073,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":6077,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":6082,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":6086,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":6090,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":6095,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":6099,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":6104,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":6108,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":6112,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":6117,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":6121,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":6125,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":6130,"\u002Fdifferential-equations":6134,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":6137,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":6142,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":6146,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":6150,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":6154,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":6158,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":6163,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":6167,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":6171,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":6175,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":6180,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":6184,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":6188,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":6192,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":6197,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":6201,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":6205,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":6209,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":6214,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":6218,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":6222,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":6226,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":6230,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":6234,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":6239,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":6243,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":6247,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":6252,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":6256,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":6260,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":6264,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":6269,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":6273,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":6277,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":6282,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":6286,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":6290,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":6295,"\u002Frelativity":6299,"\u002Fphysical-computing":6302,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":6305,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":6310,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":6314,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":6318,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":6322,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":6327,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":6331,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":6335,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":6340,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":6344,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":6348,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":6352,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":6356,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":6360,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":6365,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":6369,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":6373,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":6377,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":6381,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":6385,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":6390,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":6394,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":6398,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":6402,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":6406,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":6410,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":6414,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":6419,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":6423,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":6427,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":6432,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":6436,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":6440,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":6445,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":6449,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":6454,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":6458,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":6462,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":6466,"\u002Fquantum-mechanics":6470,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":6473,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":6478,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":6482,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":6486,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":6490,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":6495,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":6499,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":6503,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":6507,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":6511,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":6515,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":6520,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":6524,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":6528,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":6532,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":6536,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":6540,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":6544,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":6548,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":6552,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":6556,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":6560,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":6565,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":6569,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":6573,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":6577,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":6582,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":6586,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":6590,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":6593,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":6597,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":6602,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":6606,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":6610,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":6614,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":6619,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":6623,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":6627,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":6631,"\u002Freal-analysis":6635,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":6638,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":6642,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":6646,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":6651,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":6655,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":6659,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":6663,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":6668,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":6672,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":6676,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":6680,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":6684,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":6688,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":6693,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":6697,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":6701,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":6705,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":6710,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":6714,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":6718,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":6722,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":6727,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":6731,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":6735,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":6740,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":6744,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":6748,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":6752,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":6757,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":6761,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":6765,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":6769,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":6774,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":6778,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":6782,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":6787,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":6791,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":6795,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":6799,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":6804,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":6808,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":6812,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":6816,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":6820,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":6825,"\u002Fabstract-algebra":6829,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":6832,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":6837,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":6841,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":6845,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":6849,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":6853,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":6858,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":6862,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":6866,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":6870,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":6874,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":6878,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":6882,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":6887,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":6891,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":6895,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":6899,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":6904,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":6908,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":6912,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":6917,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":6921,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":6925,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":6929,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":6933,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":6937,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":6942,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":6946,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":6950,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":6955,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":6959,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":6963,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":6967,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":6972,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":6976,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":6980,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":6985,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":6989,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":6993,"\u002Fatomic-physics":6997,"\u002Fdatabases":7000,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":7003,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":7007,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":7011,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":7015,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":7019,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":7023,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":7027,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":7032,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":7036,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":7040,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":7045,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":7049,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":7053,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":7058,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":7062,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":7066,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":7070,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":7074,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":7079,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":7083,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":7087,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":7091,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":7096,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":7100,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":7104,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":7108,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":7113,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":7117,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":7121,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":7125,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":7130,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":7134,"\u002Fcategory-theory":7138,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":7141,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":7145,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":7149,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":7153,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":7156,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":7160,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":7164,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":7168,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":7173,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":7177,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":7181,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":7185,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":7189,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":7194,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":7198,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":7202,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":7206,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":7210,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":7215,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":7219,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":7223,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":7227,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":7232,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":7236,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":7240,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":7244,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":7248,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":7252,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":7256,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":7260,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":7264,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":7269,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":7273,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":7277,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":7281,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":7285,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":7290,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":7294,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":7298,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":7302,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":7306,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":7310,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":7314,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":7319,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":7323,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":7327,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":7332,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":7336,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":7340,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":7344,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":7348,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":7352,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":7356,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":7361,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":7365,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":7369,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":7373,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":7377,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":7381,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":7385,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":7389,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":7393,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":7397,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":7401,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":7406,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":7410,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":7414,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":7418,"\u002Fdeep-learning":7422,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":7425,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":7429,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":7433,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":7437,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":7441,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":7445,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":7450,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":7454,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":7458,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":7462,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":7467,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":7471,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":7475,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":7479,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":7484,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":7488,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":7492,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":7496,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":7500,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":7505,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":7509,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":7513,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":7518,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":7522,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":7526,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":7531,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":7535,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":7539,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":7543,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":7548,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":7552,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":7556,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":7560,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":7564,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":7568,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":7573,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":7577,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":7581,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":7585,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":7590,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":7594,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":7598,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":7603,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":7607,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":7611,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":7615,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":7619,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":7624,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":7628,"\u002Fstatistical-mechanics":7632,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":7635,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":7640,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":7644,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":7648,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":7652,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":7657,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":7661,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":7665,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":7669,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":7674,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":7678,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":7682,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":7686,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":7691,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":7695,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":7699,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":7703,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":7708,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":7712,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":7716,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":7720,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":7725,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":7729,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":7733,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":7737,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":7742,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":7746,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":7750,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":7754,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":7758,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":7763,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":7767,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":7772,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":7776,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":7780,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":7784,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":7789,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":7793,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":7797,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":7801,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":7805,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":7810,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":7814,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":7818,"\u002Fcondensed-matter":7822,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":7825,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":7829,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":7834,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":7838,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":7842,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":7846,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":7850,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":7854,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":7858,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":7863,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":7867,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":7871,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":7875,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":7880,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":7884,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":7888,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":7892,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":7897,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":7901,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":7905,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":7909,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":7914,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":7918,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":7922,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":7926,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":7931,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":7935,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":7939,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":7944,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":7948,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":7953,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":7957,"\u002Flogic":7961,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":7964,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":7968,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":7972,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":7976,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":7980,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":7984,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":7988,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":7990,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":7994,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":7997,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":8001,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":8005,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":8009,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":8013,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":8017,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":8020,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":8024,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":8025,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":8027,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":8032,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":8036,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":8040,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":8044,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":8048,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":8052,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":8056,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":8060,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":8064,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":8068,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":8072,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":8076,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":8080,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":8084,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":8088,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":8092,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":8096,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":8100,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":8104,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":8108,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":8112,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":8116,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":8121,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":8125,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":8129,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":8133,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":8137,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":8141,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":8145,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":8149,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":8153,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":8157,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":8161,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":8165,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":8169,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":8173,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":8177,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":8181,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":8185,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":8189,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":8193,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":8197,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":8201,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":8205,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":8210,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":8214,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":8218,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":8222,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":8226,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":8230,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":8234,"\u002Freinforcement-learning":8238,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":8240,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":8244,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":8248,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":8252,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":8256,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":8261,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":8265,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":8269,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":8273,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":8277,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":8281,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":8285,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":8289,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":8293,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":8297,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":8301,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":8305,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":8310,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":8314,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":8318,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":8322,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":8326,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":8330,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":8334,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":8338,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":8342,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":8346,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":8350,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":8354,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":8359,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":8363,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":8367,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":8371,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":8375,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":8379,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":8383,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":8386,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":8390,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":8394,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":8399,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":8403,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":8407,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":8411,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":8414,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":8418,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":8422,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":8426,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":8431,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":8435,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":8439,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":8443,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":8447,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":8451,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":8455,"\u002Fartificial-intelligence":8459,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":8462,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":8467,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":8471,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":8475,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":8479,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":8483,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":8488,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":8492,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":8496,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":8500,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":8505,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":8509,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":8513,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":8517,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":8522,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":8526,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":8531,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":8535,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":8540,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":8544,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":8548,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":8552,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":8557,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":8561,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":8565,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":8570,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":8574,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":8578,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":8583,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":8587,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":8592,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":8596,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":8600,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":8605,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":8609,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":8613,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":8617,"\u002Fnuclear-physics":8621,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":8624,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":8628,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":8632,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":8636,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":8640,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":8644,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":8649,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":8653,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":8657,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":8661,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":8666,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":8670,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":8674,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":8678,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":8682,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":8686,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":8690,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":8693,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":8696,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":8700,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":8704,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":8708,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":8713,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":8717,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":8721,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":8725,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":8729,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":8733,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":8737,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":8741,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":8745,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":8749,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":8753,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":8757,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":8761,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":8765,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":8769,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":8773,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":8777,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":8781,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":8785,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":8789,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":8793,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":8797,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":8801,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":8805,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":8809,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":8813,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":8817,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":8821,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":8826,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":8830,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":8834,"\u002Fnatural-language-processing":8838,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":8841,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":8845,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":8849,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":8853,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":8858,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":8862,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":8866,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":8870,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":8875,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":8879,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":8883,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":8887,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":8892,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":8896,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":8900,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":8904,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":8909,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":8913,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":8917,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":8922,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":8926,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":8930,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":8934,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":8939,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":8943,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":8947,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":8951,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":8956,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":8960,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":8964,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":8968,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":8973,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":8977,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":8981,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":8985,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":8989,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":8994,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":8998,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":9002,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":9007,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":9011,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":9015,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":9019,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":9023,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":9027,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":9031,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":9035,"\u002Fparticle-physics":9039,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":9042,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":9047,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":9051,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":9055,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":9060,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":9064,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":9068,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":9072,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":9077,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":9081,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":9085,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":9089,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":9094,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":9098,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":9102,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":9106,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":9111,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":9115,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":9119,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":9123,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":9128,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":9132,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":9136,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":9141,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":9145,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":9149,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":9153,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":9157,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":9161,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":9165,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":9169,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":9173,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":9178,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":9182,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":9186,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":9190,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":9195,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":9199,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":9203,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":9207,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":9211,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":9216,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":9220,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":9223,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":9227,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":9231,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":9236,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":9240,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":9244,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":9248,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":9252,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":9256,"\u002Fastrophysics-cosmology":9260,"\u002Fcolophon":9263,"\u002F":9266},{"path":4588,"title":4589,"module":4590,"summary":4591},"\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":4593,"title":4594,"module":4590,"summary":4595},"\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":4597,"title":4598,"module":4590,"summary":4599},"\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":4601,"title":4602,"module":4590,"summary":4603},"\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":4605,"title":4606,"module":4590,"summary":4607},"\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":4609,"title":4610,"module":4590,"summary":4611},"\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":4613,"title":4614,"module":4615,"summary":4616},"\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":4618,"title":4619,"module":4615,"summary":4620},"\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":4622,"title":4623,"module":4615,"summary":4624},"\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":4626,"title":4627,"module":4615,"summary":4628},"\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":4630,"title":4631,"module":4632,"summary":4633},"\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":4635,"title":4636,"module":4632,"summary":4637},"\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":4639,"title":4640,"module":4632,"summary":4641},"\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":4643,"title":4644,"module":4632,"summary":4645},"\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":4647,"title":4648,"module":4649,"summary":4650},"\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":4652,"title":4653,"module":4649,"summary":4654},"\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":4656,"title":4657,"module":4649,"summary":4658},"\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":4660,"title":4661,"module":4649,"summary":4662},"\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":4664,"title":4665,"module":4649,"summary":4666},"\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":4668,"title":4669,"module":4649,"summary":4670},"\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":4672,"title":4673,"module":4649,"summary":4674},"\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":4676,"title":4677,"module":4649,"summary":4678},"\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":4680,"title":4681,"module":4649,"summary":4682},"\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":4684,"title":4685,"module":4649,"summary":4686},"\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":4688,"title":4689,"module":4649,"summary":4690},"\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":4692,"title":4693,"module":4649,"summary":4694},"\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":4696,"title":4697,"module":4698,"summary":4699},"\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":4701,"title":4702,"module":4698,"summary":4703},"\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":4705,"title":4706,"module":4698,"summary":4707},"\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":4709,"title":4710,"module":4698,"summary":4711},"\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":4713,"title":4714,"module":4698,"summary":4715},"\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":4717,"title":4718,"module":4698,"summary":4719},"\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":4721,"title":4722,"module":4698,"summary":4723},"\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":4725,"title":4726,"module":4698,"summary":4727},"\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":4729,"title":4730,"module":4731,"summary":4732},"\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":4734,"title":4735,"module":4731,"summary":4736},"\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":4738,"title":4739,"module":4731,"summary":4740},"\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":4742,"title":4743,"module":4731,"summary":4744},"\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":4746,"title":4747,"module":4731,"summary":4748},"\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":4750,"title":4751,"module":4731,"summary":4752},"\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":4754,"title":4755,"module":4731,"summary":4756},"\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":4758,"title":4759,"module":4731,"summary":4760},"\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":4762,"title":4763,"module":4731,"summary":4764},"\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":4766,"title":4767,"module":4731,"summary":4768},"\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":4770,"title":4771,"module":4731,"summary":4772},"\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":4774,"title":4775,"module":4731,"summary":4776},"\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":4778,"title":4779,"module":4731,"summary":4780},"\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":4782,"title":4783,"module":4731,"summary":4784},"\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":4786,"title":4787,"module":4788,"summary":4789},"\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":4791,"title":4792,"module":4788,"summary":4793},"\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":4795,"title":4796,"module":4788,"summary":4797},"\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":4799,"title":4800,"module":4788,"summary":4801},"\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":4803,"title":4804,"module":4788,"summary":4805},"\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":4807,"title":4808,"module":4809,"summary":4810},"\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":4812,"title":4813,"module":4809,"summary":4814},"\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":4816,"title":4817,"module":4809,"summary":4818},"\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":4820,"title":4821,"module":4809,"summary":4822},"\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":4824,"title":4825,"module":4809,"summary":4826},"\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":4828,"title":4829,"module":4809,"summary":4830},"\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":4832,"title":4833,"module":4809,"summary":4834},"\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":4836,"title":4837,"module":4809,"summary":4838},"\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":4840,"title":4841,"module":4809,"summary":4842},"\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":4844,"title":4845,"module":4809,"summary":4846},"\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":4848,"title":4849,"module":4809,"summary":4850},"\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":4852,"title":4853,"module":4854,"summary":4855},"\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":4857,"title":4858,"module":4854,"summary":4859},"\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":4861,"title":4862,"module":4854,"summary":4863},"\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":4865,"title":4866,"module":4854,"summary":4867},"\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":4869,"title":4870,"module":4871,"summary":4872},"\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":4874,"title":4875,"module":4871,"summary":4876},"\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":4878,"title":4879,"module":4871,"summary":4880},"\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":4882,"title":4883,"module":4871,"summary":4884},"\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":4886,"title":4887,"module":4871,"summary":4888},"\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":4890,"title":4891,"module":4871,"summary":4892},"\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":4894,"title":4895,"module":4871,"summary":4896},"\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":4898,"title":4899,"module":4900,"summary":4901},"\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":4903,"title":4904,"module":4900,"summary":4905},"\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":4907,"title":4908,"module":4900,"summary":4909},"\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":4911,"title":4912,"module":4900,"summary":4913},"\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":4915,"title":4916,"module":4917,"summary":4918},"\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":4920,"title":4921,"module":4917,"summary":4922},"\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":4924,"title":4925,"module":4917,"summary":4926},"\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":4928,"title":4929,"module":4917,"summary":4930},"\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":4932,"title":4933,"module":6,"summary":6},"\u002Falgorithms","Algorithms",{"path":4935,"title":4936,"module":4937,"summary":4938},"\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":4940,"title":4941,"module":4937,"summary":4942},"\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":4944,"title":4945,"module":4937,"summary":4946},"\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":4948,"title":4949,"module":4937,"summary":4950},"\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":4952,"title":4953,"module":4954,"summary":4955},"\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":4957,"title":4958,"module":4954,"summary":4959},"\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":4961,"title":4962,"module":4954,"summary":4963},"\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":4965,"title":4966,"module":4954,"summary":4967},"\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":4969,"title":4970,"module":4971,"summary":4972},"\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":4974,"title":4975,"module":4971,"summary":4976},"\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":4978,"title":4979,"module":4971,"summary":4980},"\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":4982,"title":4983,"module":4971,"summary":4984},"\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":4986,"title":4987,"module":4988,"summary":4989},"\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":4991,"title":4992,"module":4988,"summary":4993},"\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":4995,"title":4996,"module":4988,"summary":4997},"\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":4999,"title":5000,"module":5001,"summary":5002},"\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":5004,"title":5005,"module":5001,"summary":5006},"\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":5008,"title":5009,"module":5001,"summary":5010},"\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":5012,"title":5013,"module":5014,"summary":5015},"\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":5017,"title":5018,"module":5014,"summary":5019},"\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":5021,"title":5022,"module":5014,"summary":5023},"\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":5025,"title":5026,"module":5027,"summary":5028},"\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":5030,"title":5031,"module":5027,"summary":5032},"\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":5034,"title":5035,"module":5027,"summary":5036},"\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":5038,"title":5039,"module":5027,"summary":5040},"\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":5042,"title":5043,"module":5044,"summary":5045},"\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":5047,"title":5048,"module":5044,"summary":5049},"\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":5051,"title":5052,"module":5044,"summary":5053},"\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":5055,"title":5056,"module":5057,"summary":5058},"\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":5060,"title":5061,"module":5057,"summary":5062},"\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":5064,"title":5065,"module":5057,"summary":5066},"\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":5068,"title":5069,"module":5057,"summary":5070},"\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":5072,"title":5073,"module":5057,"summary":5074},"\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":5076,"title":5077,"module":5078,"summary":5079},"\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":5081,"title":5082,"module":5078,"summary":5083},"\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":5085,"title":5086,"module":5078,"summary":5087},"\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":5089,"title":5090,"module":5078,"summary":5091},"\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":5093,"title":5094,"module":5078,"summary":5095},"\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":5097,"title":5098,"module":5099,"summary":5100},"\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":5102,"title":5099,"module":5099,"summary":5103},"\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":5105,"title":5106,"module":5099,"summary":5107},"\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":5109,"title":5110,"module":5099,"summary":5111},"\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":5113,"title":5114,"module":5099,"summary":5115},"\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":5117,"title":5118,"module":5119,"summary":5120},"\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":5122,"title":5123,"module":5119,"summary":5124},"\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":5126,"title":5127,"module":5119,"summary":5128},"\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":5130,"title":5131,"module":5119,"summary":5132},"\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":5134,"title":5135,"module":5119,"summary":5136},"\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":5138,"title":5139,"module":5119,"summary":5140},"\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":5142,"title":5143,"module":6,"summary":6},"\u002Fcalculus","Calculus",{"path":5145,"title":5146,"module":4590,"summary":5147},"\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":5149,"title":5150,"module":4590,"summary":5151},"\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":5153,"title":5154,"module":5155,"summary":5156},"\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":5158,"title":5159,"module":5155,"summary":5160},"\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":5162,"title":5163,"module":5155,"summary":5164},"\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":5166,"title":5167,"module":5155,"summary":5168},"\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":5170,"title":5171,"module":5155,"summary":5172},"\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":5174,"title":5175,"module":5176,"summary":5177},"\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":5179,"title":5180,"module":5176,"summary":5181},"\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":5183,"title":5184,"module":5176,"summary":5185},"\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":5187,"title":5188,"module":5176,"summary":5189},"\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":5191,"title":5192,"module":5176,"summary":5193},"\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":5195,"title":5196,"module":5197,"summary":5198},"\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":5200,"title":5201,"module":5197,"summary":5202},"\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":5204,"title":5205,"module":5197,"summary":5206},"\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":5208,"title":5209,"module":5197,"summary":5210},"\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":5212,"title":5213,"module":5197,"summary":5214},"\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":5216,"title":5217,"module":5218,"summary":5219},"\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":5221,"title":5222,"module":5218,"summary":5223},"\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":5225,"title":5226,"module":5218,"summary":5227},"\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":5229,"title":5230,"module":5231,"summary":5232},"\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":5234,"title":5235,"module":5231,"summary":5236},"\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":5238,"title":5239,"module":5231,"summary":5240},"\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":5242,"title":5243,"module":5231,"summary":5244},"\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":5246,"title":5247,"module":5231,"summary":5248},"\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":5250,"title":5251,"module":5231,"summary":5252},"\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":5254,"title":5255,"module":5256,"summary":5257},"\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":5259,"title":5260,"module":5256,"summary":5261},"\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":5263,"title":5264,"module":5256,"summary":5265},"\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":5267,"title":5268,"module":5256,"summary":5269},"\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":5271,"title":5272,"module":5256,"summary":5273},"\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":5275,"title":5276,"module":5256,"summary":5277},"\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":5279,"title":5280,"module":5256,"summary":5281},"\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":5283,"title":5284,"module":5285,"summary":5286},"\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":5288,"title":5289,"module":5285,"summary":5290},"\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":5292,"title":5293,"module":5285,"summary":5294},"\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":5296,"title":5297,"module":5285,"summary":5298},"\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":5300,"title":5301,"module":5285,"summary":5302},"\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":5304,"title":5305,"module":5285,"summary":5306},"\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":5308,"title":5309,"module":5285,"summary":5310},"\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":5312,"title":5313,"module":5285,"summary":5314},"\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":5316,"title":5317,"module":5285,"summary":5318},"\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":5320,"title":5321,"module":5285,"summary":5322},"\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":5324,"title":5325,"module":5285,"summary":5326},"\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":5328,"title":5329,"module":5285,"summary":5330},"\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":5332,"title":5333,"module":5334,"summary":5335},"\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":5337,"title":5338,"module":5334,"summary":5339},"\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":5341,"title":5342,"module":5334,"summary":5343},"\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":5345,"title":5346,"module":5334,"summary":5347},"\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":5349,"title":5350,"module":5334,"summary":5351},"\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":5353,"title":5354,"module":5334,"summary":5355},"\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":5357,"title":5358,"module":6,"summary":6},"\u002Fmechanics","Mechanics & Dynamics",{"path":5360,"title":5361,"module":5362,"summary":5363},"\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":5365,"title":5366,"module":5362,"summary":5367},"\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":5369,"title":5370,"module":5362,"summary":5371},"\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":5373,"title":5374,"module":5362,"summary":5375},"\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":5377,"title":5378,"module":5362,"summary":5379},"\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":5381,"title":5382,"module":5383,"summary":5384},"\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":5386,"title":5387,"module":5383,"summary":5388},"\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":5390,"title":5391,"module":5392,"summary":5393},"\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":5395,"title":5396,"module":5392,"summary":5397},"\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":5399,"title":5400,"module":5392,"summary":5401},"\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":5403,"title":5404,"module":5392,"summary":5405},"\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":5407,"title":5408,"module":5392,"summary":5409},"\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":5411,"title":5412,"module":5413,"summary":5414},"\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":5416,"title":5417,"module":5413,"summary":5418},"\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":5420,"title":5421,"module":5413,"summary":5422},"\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":5424,"title":5425,"module":5413,"summary":5426},"\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":5428,"title":5429,"module":5430,"summary":5431},"\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":5433,"title":5434,"module":5430,"summary":5435},"\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":5437,"title":5438,"module":5430,"summary":5439},"\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":5441,"title":5442,"module":5443,"summary":5444},"\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":5446,"title":5447,"module":5443,"summary":5448},"\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":5450,"title":5451,"module":5443,"summary":5452},"\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":5454,"title":5455,"module":5443,"summary":5456},"\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":5458,"title":5459,"module":5443,"summary":5460},"\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":5462,"title":5463,"module":5464,"summary":5465},"\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":5467,"title":5468,"module":5464,"summary":5469},"\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":5471,"title":5472,"module":5464,"summary":5473},"\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":5475,"title":5476,"module":5464,"summary":5477},"\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":5479,"title":5480,"module":5464,"summary":5481},"\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":5483,"title":5484,"module":5464,"summary":5485},"\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":5487,"title":5488,"module":5489,"summary":5490},"\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":5492,"title":5493,"module":5489,"summary":5494},"\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":5496,"title":5497,"module":5489,"summary":5498},"\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":5500,"title":5501,"module":5489,"summary":5502},"\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":5504,"title":5505,"module":5489,"summary":5506},"\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":5508,"title":5509,"module":5489,"summary":5510},"\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":5512,"title":5513,"module":5489,"summary":5514},"\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":5516,"title":5517,"module":5489,"summary":5518},"\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":5520,"title":5521,"module":5522,"summary":5523},"\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":5525,"title":5526,"module":5522,"summary":5527},"\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":5529,"title":5530,"module":5522,"summary":5531},"\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":5533,"title":5534,"module":5522,"summary":5535},"\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":5537,"title":5538,"module":5522,"summary":5539},"\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":5541,"title":5542,"module":5543,"summary":5544},"\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":5546,"title":5547,"module":5543,"summary":5548},"\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":5550,"title":5551,"module":5543,"summary":5552},"\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":5554,"title":5555,"module":5543,"summary":5556},"\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":5558,"title":5559,"module":5543,"summary":5560},"\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":5562,"title":5563,"module":5564,"summary":5565},"\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":5567,"title":5568,"module":5564,"summary":5569},"\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":5571,"title":5572,"module":5564,"summary":5573},"\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":5575,"title":5576,"module":6,"summary":6},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":5578,"title":5579,"module":5580,"summary":5581},"\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":5583,"title":5584,"module":5580,"summary":5585},"\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":5587,"title":5588,"module":5580,"summary":5589},"\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":5591,"title":5592,"module":5580,"summary":5593},"\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":5595,"title":5596,"module":5580,"summary":5597},"\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":5599,"title":5600,"module":5601,"summary":5602},"\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":5604,"title":5605,"module":5601,"summary":5606},"\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":5608,"title":5609,"module":5601,"summary":5610},"\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":5612,"title":5613,"module":5601,"summary":5614},"\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":5616,"title":5617,"module":5601,"summary":5618},"\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":5620,"title":5621,"module":5622,"summary":5623},"\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":5625,"title":5626,"module":5622,"summary":5627},"\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":5629,"title":5630,"module":5622,"summary":5631},"\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":5633,"title":5634,"module":5635,"summary":5636},"\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":5638,"title":5639,"module":5635,"summary":5640},"\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":5642,"title":5643,"module":5635,"summary":5644},"\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":5646,"title":5647,"module":5635,"summary":5648},"\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":5650,"title":5651,"module":5635,"summary":5652},"\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":5654,"title":5655,"module":5635,"summary":5656},"\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":5658,"title":5659,"module":5635,"summary":5660},"\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":5662,"title":5663,"module":5664,"summary":5665},"\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":5667,"title":5668,"module":5664,"summary":5669},"\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":5671,"title":5672,"module":5664,"summary":5673},"\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":5675,"title":5676,"module":5664,"summary":5677},"\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":5679,"title":5680,"module":5664,"summary":5681},"\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":5683,"title":5684,"module":5664,"summary":5685},"\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":5687,"title":5688,"module":5664,"summary":5689},"\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":5691,"title":5692,"module":5693,"summary":5694},"\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":5696,"title":5697,"module":5693,"summary":5698},"\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":5700,"title":5701,"module":5693,"summary":5702},"\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":5704,"title":5705,"module":5693,"summary":5706},"\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":5708,"title":5709,"module":5693,"summary":5710},"\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":5712,"title":5713,"module":5693,"summary":5714},"\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":5716,"title":5717,"module":5718,"summary":5719},"\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":5721,"title":5722,"module":5718,"summary":5723},"\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":5725,"title":5726,"module":5718,"summary":5727},"\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":5729,"title":5730,"module":5718,"summary":5731},"\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":5733,"title":5734,"module":5718,"summary":5735},"\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":5737,"title":5738,"module":5739,"summary":5740},"\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":5742,"title":5743,"module":5739,"summary":5744},"\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":5746,"title":5747,"module":5739,"summary":5748},"\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":5750,"title":5751,"module":5739,"summary":5752},"\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":5754,"title":5755,"module":5739,"summary":5756},"\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":5758,"title":5759,"module":5739,"summary":5760},"\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":5762,"title":5763,"module":5764,"summary":5765},"\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":5767,"title":5768,"module":5764,"summary":5769},"\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":5771,"title":5772,"module":5764,"summary":5773},"\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":5775,"title":5776,"module":5764,"summary":5777},"\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":5779,"title":5780,"module":5764,"summary":5781},"\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":5783,"title":5784,"module":6,"summary":6},"\u002Flinear-algebra","Linear Algebra",{"path":5786,"title":5787,"module":6,"summary":6},"\u002Ftheory-of-computation","Theory of Computation",{"path":5789,"title":5790,"module":4590,"summary":5791},"\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":5793,"title":5794,"module":4590,"summary":5795},"\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":5797,"title":5798,"module":4590,"summary":5799},"\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":5801,"title":5802,"module":4590,"summary":5803},"\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":5805,"title":5806,"module":4590,"summary":5807},"\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":5809,"title":5810,"module":5811,"summary":5812},"\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":5814,"title":5815,"module":5811,"summary":5816},"\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":5818,"title":5819,"module":5811,"summary":5820},"\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":5822,"title":5823,"module":5811,"summary":5824},"\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":5826,"title":5827,"module":5811,"summary":5828},"\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":5830,"title":5831,"module":5811,"summary":5832},"\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":5834,"title":5835,"module":5811,"summary":5836},"\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":5838,"title":5839,"module":5840,"summary":5841},"\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":5843,"title":5844,"module":5840,"summary":5845},"\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":5847,"title":5848,"module":5840,"summary":5849},"\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":5851,"title":5852,"module":5840,"summary":5853},"\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":5855,"title":5856,"module":5840,"summary":5857},"\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":5859,"title":5860,"module":5861,"summary":5862},"\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":5864,"title":5865,"module":5861,"summary":5866},"\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":5868,"title":5869,"module":5861,"summary":5870},"\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":5872,"title":5873,"module":5861,"summary":5874},"\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":5876,"title":5877,"module":5861,"summary":5878},"\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":5880,"title":5881,"module":5882,"summary":5883},"\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":5885,"title":5886,"module":5882,"summary":5887},"\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":5889,"title":5890,"module":5882,"summary":5891},"\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":5893,"title":5894,"module":5882,"summary":5895},"\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":5897,"title":5898,"module":5882,"summary":5899},"\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":5901,"title":5902,"module":5903,"summary":5904},"\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":5906,"title":5907,"module":5903,"summary":5908},"\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":5910,"title":5911,"module":5903,"summary":5912},"\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":5914,"title":5915,"module":5903,"summary":5916},"\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":5918,"title":5919,"module":5903,"summary":5920},"\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":5922,"title":5923,"module":5924,"summary":5925},"\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":5927,"title":5928,"module":5924,"summary":5929},"\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":5931,"title":5932,"module":5924,"summary":5933},"\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":5935,"title":5936,"module":5924,"summary":5937},"\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":5939,"title":5940,"module":5924,"summary":5941},"\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":5943,"title":5944,"module":5945,"summary":5946},"\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":5948,"title":5949,"module":5945,"summary":5950},"\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":5952,"title":5953,"module":5945,"summary":5954},"\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":5956,"title":5957,"module":5958,"summary":5959},"\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":5961,"title":5962,"module":5958,"summary":5963},"\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":5965,"title":5966,"module":5967,"summary":5968},"\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":5970,"title":5971,"module":5967,"summary":5972},"\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":5974,"title":5975,"module":5967,"summary":5976},"\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":5978,"title":5979,"module":5967,"summary":5980},"\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":5982,"title":5983,"module":5967,"summary":5984},"\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":5986,"title":5987,"module":5988,"summary":5989},"\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":5991,"title":5992,"module":5988,"summary":5993},"\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":5995,"title":5996,"module":6,"summary":6},"\u002Fcomputer-architecture","Computer Architecture",{"path":5998,"title":5999,"module":4590,"summary":6000},"\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":6002,"title":6003,"module":4590,"summary":6004},"\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":6006,"title":6007,"module":6008,"summary":6009},"\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":6011,"title":6012,"module":6008,"summary":6013},"\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":6015,"title":6016,"module":6008,"summary":6017},"\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":6019,"title":6020,"module":6008,"summary":6021},"\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":6023,"title":6024,"module":6008,"summary":6025},"\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":6027,"title":6028,"module":6008,"summary":6029},"\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":6031,"title":6032,"module":6033,"summary":6034},"\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":6036,"title":6037,"module":6033,"summary":6038},"\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":6040,"title":6041,"module":6033,"summary":6042},"\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":6044,"title":6045,"module":6033,"summary":6046},"\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":6048,"title":6049,"module":6033,"summary":6050},"\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":6052,"title":6053,"module":6033,"summary":6054},"\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":6056,"title":6057,"module":6058,"summary":6059},"\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":6061,"title":6062,"module":6058,"summary":6063},"\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":6065,"title":6066,"module":6058,"summary":6067},"\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":6069,"title":6070,"module":6071,"summary":6072},"\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":6074,"title":6075,"module":6071,"summary":6076},"\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":6078,"title":6079,"module":6080,"summary":6081},"\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":6083,"title":6084,"module":6080,"summary":6085},"\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":6087,"title":6088,"module":6080,"summary":6089},"\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":6091,"title":6092,"module":6093,"summary":6094},"\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":6096,"title":6097,"module":6093,"summary":6098},"\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":6100,"title":6101,"module":6102,"summary":6103},"\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":6105,"title":6106,"module":6102,"summary":6107},"\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":6109,"title":6110,"module":6102,"summary":6111},"\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":6113,"title":6114,"module":6115,"summary":6116},"\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":6118,"title":6119,"module":6115,"summary":6120},"\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":6122,"title":6123,"module":6115,"summary":6124},"\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":6126,"title":6127,"module":6128,"summary":6129},"\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":6131,"title":6132,"module":6128,"summary":6133},"\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":6135,"title":6136,"module":6,"summary":6},"\u002Fdifferential-equations","Differential Equations",{"path":6138,"title":6139,"module":6140,"summary":6141},"\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":6143,"title":6144,"module":6140,"summary":6145},"\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":6147,"title":6148,"module":6140,"summary":6149},"\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":6151,"title":6152,"module":6140,"summary":6153},"\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":6155,"title":6156,"module":6140,"summary":6157},"\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":6159,"title":6160,"module":6161,"summary":6162},"\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":6164,"title":6165,"module":6161,"summary":6166},"\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":6168,"title":6169,"module":6161,"summary":6170},"\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":6172,"title":6173,"module":6161,"summary":6174},"\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":6176,"title":6177,"module":6178,"summary":6179},"\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":6181,"title":6182,"module":6178,"summary":6183},"\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":6185,"title":6186,"module":6178,"summary":6187},"\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":6189,"title":6190,"module":6178,"summary":6191},"\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":6193,"title":6194,"module":6195,"summary":6196},"\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":6198,"title":6199,"module":6195,"summary":6200},"\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":6202,"title":6203,"module":6195,"summary":6204},"\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":6206,"title":6207,"module":6195,"summary":6208},"\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":6210,"title":6211,"module":6212,"summary":6213},"\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":6215,"title":6216,"module":6212,"summary":6217},"\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":6219,"title":6220,"module":6212,"summary":6221},"\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":6223,"title":6224,"module":6212,"summary":6225},"\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":6227,"title":6228,"module":6212,"summary":6229},"\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":6231,"title":6232,"module":6212,"summary":6233},"\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":6235,"title":6236,"module":6237,"summary":6238},"\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":6240,"title":6241,"module":6237,"summary":6242},"\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":6244,"title":6245,"module":6237,"summary":6246},"\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":6248,"title":6249,"module":6250,"summary":6251},"\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":6253,"title":6254,"module":6250,"summary":6255},"\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":6257,"title":6258,"module":6250,"summary":6259},"\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":6261,"title":6262,"module":6250,"summary":6263},"\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":6265,"title":6266,"module":6267,"summary":6268},"\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":6270,"title":6271,"module":6267,"summary":6272},"\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":6274,"title":6275,"module":6267,"summary":6276},"\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":6278,"title":6279,"module":6280,"summary":6281},"\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":6283,"title":6284,"module":6280,"summary":6285},"\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":6287,"title":6288,"module":6280,"summary":6289},"\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":6291,"title":6292,"module":6293,"summary":6294},"\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":6296,"title":6297,"module":6293,"summary":6298},"\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":6300,"title":6301,"module":6,"summary":6},"\u002Frelativity","Relativity",{"path":6303,"title":6304,"module":6,"summary":6},"\u002Fphysical-computing","Physical Computing",{"path":6306,"title":6307,"module":6308,"summary":6309},"\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":6311,"title":6312,"module":6308,"summary":6313},"\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":6315,"title":6316,"module":6308,"summary":6317},"\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":6319,"title":6320,"module":6308,"summary":6321},"\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":6323,"title":6324,"module":6325,"summary":6326},"\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":6328,"title":6329,"module":6325,"summary":6330},"\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":6332,"title":6333,"module":6325,"summary":6334},"\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":6336,"title":6337,"module":6338,"summary":6339},"\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":6341,"title":6342,"module":6338,"summary":6343},"\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":6345,"title":6346,"module":6338,"summary":6347},"\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":6349,"title":6350,"module":6338,"summary":6351},"\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":6353,"title":6354,"module":6338,"summary":6355},"\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":6357,"title":6358,"module":6338,"summary":6359},"\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":6361,"title":6362,"module":6363,"summary":6364},"\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":6366,"title":6367,"module":6363,"summary":6368},"\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":6370,"title":6371,"module":6363,"summary":6372},"\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":6374,"title":6375,"module":6363,"summary":6376},"\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":6378,"title":6379,"module":6363,"summary":6380},"\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":6382,"title":6383,"module":6363,"summary":6384},"\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":6386,"title":6387,"module":6388,"summary":6389},"\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":6391,"title":6392,"module":6388,"summary":6393},"\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":6395,"title":6396,"module":6388,"summary":6397},"\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":6399,"title":6400,"module":6388,"summary":6401},"\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":6403,"title":6404,"module":5243,"summary":6405},"\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":6407,"title":6408,"module":5243,"summary":6409},"\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":6411,"title":6412,"module":5243,"summary":6413},"\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":6415,"title":6416,"module":6417,"summary":6418},"\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":6420,"title":6421,"module":6417,"summary":6422},"\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":6424,"title":6425,"module":6417,"summary":6426},"\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":6428,"title":6429,"module":6430,"summary":6431},"\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":6433,"title":6434,"module":6430,"summary":6435},"\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":6437,"title":6438,"module":6430,"summary":6439},"\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":6441,"title":6442,"module":6443,"summary":6444},"\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":6446,"title":6447,"module":6443,"summary":6448},"\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":6450,"title":6451,"module":6452,"summary":6453},"\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":6455,"title":6456,"module":6452,"summary":6457},"\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":6459,"title":6460,"module":6452,"summary":6461},"\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":6463,"title":6464,"module":6452,"summary":6465},"\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":6467,"title":6468,"module":6452,"summary":6469},"\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":6471,"title":6472,"module":6,"summary":6},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":6474,"title":6475,"module":6476,"summary":6477},"\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":6479,"title":6480,"module":6476,"summary":6481},"\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":6483,"title":6484,"module":6476,"summary":6485},"\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":6487,"title":6488,"module":6476,"summary":6489},"\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":6491,"title":6492,"module":6493,"summary":6494},"\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":6496,"title":6497,"module":6493,"summary":6498},"\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":6500,"title":6501,"module":6493,"summary":6502},"\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":6504,"title":6505,"module":6493,"summary":6506},"\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":6508,"title":6509,"module":6493,"summary":6510},"\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":6512,"title":6513,"module":6493,"summary":6514},"\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":6516,"title":6517,"module":6518,"summary":6519},"\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":6521,"title":6522,"module":6518,"summary":6523},"\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":6525,"title":6526,"module":6518,"summary":6527},"\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":6529,"title":6530,"module":6518,"summary":6531},"\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":6533,"title":6534,"module":6518,"summary":6535},"\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":6537,"title":6538,"module":4937,"summary":6539},"\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":6541,"title":6542,"module":4937,"summary":6543},"\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":6545,"title":6546,"module":4937,"summary":6547},"\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":6549,"title":6550,"module":4937,"summary":6551},"\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":6553,"title":6554,"module":4937,"summary":6555},"\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":6557,"title":6558,"module":4937,"summary":6559},"\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":6561,"title":6562,"module":6563,"summary":6564},"\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":6566,"title":6567,"module":6563,"summary":6568},"\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":6570,"title":6571,"module":6563,"summary":6572},"\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":6574,"title":6575,"module":6563,"summary":6576},"\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":6578,"title":6579,"module":6580,"summary":6581},"\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":6583,"title":6584,"module":6580,"summary":6585},"\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":6587,"title":6588,"module":6580,"summary":6589},"\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":6591,"title":4992,"module":6580,"summary":6592},"\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":6594,"title":6595,"module":6580,"summary":6596},"\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":6598,"title":6599,"module":6600,"summary":6601},"\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":6603,"title":6604,"module":6600,"summary":6605},"\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":6607,"title":6608,"module":6600,"summary":6609},"\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":6611,"title":6612,"module":6600,"summary":6613},"\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":6615,"title":6616,"module":6617,"summary":6618},"\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":6620,"title":6621,"module":6617,"summary":6622},"\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":6624,"title":6625,"module":6617,"summary":6626},"\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":6628,"title":6629,"module":6617,"summary":6630},"\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":6632,"title":6633,"module":6617,"summary":6634},"\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":6636,"title":6637,"module":6,"summary":6},"\u002Freal-analysis","Real Analysis",{"path":6639,"title":6640,"module":4590,"summary":6641},"\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":6643,"title":6644,"module":4590,"summary":6645},"\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":6647,"title":6648,"module":6649,"summary":6650},"\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":6652,"title":6653,"module":6649,"summary":6654},"\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":6656,"title":6657,"module":6649,"summary":6658},"\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":6660,"title":6661,"module":6649,"summary":6662},"\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":6664,"title":6665,"module":6666,"summary":6667},"\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":6669,"title":6670,"module":6666,"summary":6671},"\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":6673,"title":6674,"module":6666,"summary":6675},"\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":6677,"title":6678,"module":6666,"summary":6679},"\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":6681,"title":6682,"module":6666,"summary":6683},"\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":6685,"title":6686,"module":6666,"summary":6687},"\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":6689,"title":6690,"module":6691,"summary":6692},"\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":6694,"title":6695,"module":6691,"summary":6696},"\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":6698,"title":6699,"module":6691,"summary":6700},"\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":6702,"title":6703,"module":6691,"summary":6704},"\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":6706,"title":6707,"module":6708,"summary":6709},"\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":6711,"title":6712,"module":6708,"summary":6713},"\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":6715,"title":6716,"module":6708,"summary":6717},"\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":6719,"title":6720,"module":6708,"summary":6721},"\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":6723,"title":6724,"module":6725,"summary":6726},"\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":6728,"title":6729,"module":6725,"summary":6730},"\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":6732,"title":6733,"module":6725,"summary":6734},"\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":6736,"title":6737,"module":6738,"summary":6739},"\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":6741,"title":6742,"module":6738,"summary":6743},"\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":6745,"title":6746,"module":6738,"summary":6747},"\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":6749,"title":6750,"module":6738,"summary":6751},"\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":6753,"title":6754,"module":6755,"summary":6756},"\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":6758,"title":6759,"module":6755,"summary":6760},"\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":6762,"title":6763,"module":6755,"summary":6764},"\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":6766,"title":6767,"module":6755,"summary":6768},"\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":6770,"title":6771,"module":6772,"summary":6773},"\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":6775,"title":6776,"module":6772,"summary":6777},"\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":6779,"title":6780,"module":6772,"summary":6781},"\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":6783,"title":6784,"module":6785,"summary":6786},"\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":6788,"title":6789,"module":6785,"summary":6790},"\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":6792,"title":6793,"module":6785,"summary":6794},"\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":6796,"title":6797,"module":6785,"summary":6798},"\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":6800,"title":6801,"module":6802,"summary":6803},"\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":6805,"title":6806,"module":6802,"summary":6807},"\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":6809,"title":6810,"module":6802,"summary":6811},"\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":6813,"title":6814,"module":6802,"summary":6815},"\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":6817,"title":6818,"module":6802,"summary":6819},"\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":6821,"title":6822,"module":6823,"summary":6824},"\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":6826,"title":6827,"module":6823,"summary":6828},"\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":6830,"title":6831,"module":6,"summary":6},"\u002Fabstract-algebra","Abstract Algebra",{"path":6833,"title":6834,"module":6835,"summary":6836},"\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":6838,"title":6839,"module":6835,"summary":6840},"\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":6842,"title":6843,"module":6835,"summary":6844},"\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":6846,"title":6847,"module":6835,"summary":6848},"\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":6850,"title":6851,"module":6835,"summary":6852},"\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":6854,"title":6855,"module":6856,"summary":6857},"\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":6859,"title":6860,"module":6856,"summary":6861},"\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":6863,"title":6864,"module":6856,"summary":6865},"\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":6867,"title":6868,"module":6856,"summary":6869},"\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":6871,"title":6872,"module":6856,"summary":6873},"\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":6875,"title":6876,"module":6856,"summary":6877},"\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":6879,"title":6880,"module":6856,"summary":6881},"\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":6883,"title":6884,"module":6885,"summary":6886},"\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":6888,"title":6889,"module":6885,"summary":6890},"\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":6892,"title":6893,"module":6885,"summary":6894},"\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":6896,"title":6897,"module":6885,"summary":6898},"\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":6900,"title":6901,"module":6902,"summary":6903},"\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":6905,"title":6906,"module":6902,"summary":6907},"\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":6909,"title":6910,"module":6902,"summary":6911},"\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":6913,"title":6914,"module":6915,"summary":6916},"\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":6918,"title":6919,"module":6915,"summary":6920},"\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":6922,"title":6923,"module":6915,"summary":6924},"\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":6926,"title":6927,"module":6915,"summary":6928},"\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":6930,"title":6931,"module":6915,"summary":6932},"\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":6934,"title":6935,"module":6915,"summary":6936},"\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":6938,"title":6939,"module":6940,"summary":6941},"\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":6943,"title":6944,"module":6940,"summary":6945},"\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":6947,"title":6948,"module":6940,"summary":6949},"\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":6951,"title":6952,"module":6953,"summary":6954},"\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":6956,"title":6957,"module":6953,"summary":6958},"\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":6960,"title":6961,"module":6953,"summary":6962},"\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":6964,"title":6965,"module":6953,"summary":6966},"\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":6968,"title":6969,"module":6970,"summary":6971},"\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":6973,"title":6974,"module":6970,"summary":6975},"\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":6977,"title":6978,"module":6970,"summary":6979},"\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":6981,"title":6982,"module":6983,"summary":6984},"\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":6986,"title":6987,"module":6983,"summary":6988},"\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":6990,"title":6991,"module":6983,"summary":6992},"\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":6994,"title":6995,"module":6983,"summary":6996},"\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":6998,"title":6999,"module":6,"summary":6},"\u002Fatomic-physics","Atomic Physics",{"path":7001,"title":7002,"module":6,"summary":6},"\u002Fdatabases","Databases",{"path":7004,"title":7005,"module":4590,"summary":7006},"\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":7008,"title":7009,"module":4590,"summary":7010},"\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":7012,"title":7013,"module":4590,"summary":7014},"\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":7016,"title":7017,"module":4590,"summary":7018},"\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":7020,"title":7021,"module":4590,"summary":7022},"\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":7024,"title":7025,"module":4590,"summary":7026},"\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":7028,"title":7029,"module":7030,"summary":7031},"\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":7033,"title":7034,"module":7030,"summary":7035},"\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":7037,"title":7038,"module":7030,"summary":7039},"\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":7041,"title":7042,"module":7043,"summary":7044},"\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":7046,"title":7047,"module":7043,"summary":7048},"\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":7050,"title":7051,"module":7043,"summary":7052},"\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":7054,"title":7055,"module":7056,"summary":7057},"\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":7059,"title":7060,"module":7056,"summary":7061},"\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":7063,"title":7064,"module":7056,"summary":7065},"\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":7067,"title":7068,"module":7056,"summary":7069},"\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":7071,"title":7072,"module":7056,"summary":7073},"\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":7075,"title":7076,"module":7077,"summary":7078},"\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":7080,"title":7081,"module":7077,"summary":7082},"\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":7084,"title":7085,"module":7077,"summary":7086},"\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":7088,"title":7089,"module":7077,"summary":7090},"\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":7092,"title":7093,"module":7094,"summary":7095},"\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":7097,"title":7098,"module":7094,"summary":7099},"\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":7101,"title":7102,"module":7094,"summary":7103},"\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":7105,"title":7106,"module":7094,"summary":7107},"\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":7109,"title":7110,"module":7111,"summary":7112},"\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":7114,"title":7115,"module":7111,"summary":7116},"\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":7118,"title":7119,"module":7111,"summary":7120},"\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":7122,"title":7123,"module":7111,"summary":7124},"\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":7126,"title":7127,"module":7128,"summary":7129},"\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":7131,"title":7132,"module":7128,"summary":7133},"\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":7135,"title":7136,"module":7128,"summary":7137},"\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":7139,"title":7140,"module":6,"summary":6},"\u002Fcategory-theory","Category Theory",{"path":7142,"title":5784,"module":7143,"summary":7144},"\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":7146,"title":7147,"module":7143,"summary":7148},"\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":7150,"title":7151,"module":7143,"summary":7152},"\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":7154,"title":5143,"module":7143,"summary":7155},"\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":7157,"title":7158,"module":4590,"summary":7159},"\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":7161,"title":7162,"module":4590,"summary":7163},"\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":7165,"title":7166,"module":4590,"summary":7167},"\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":7169,"title":7170,"module":7171,"summary":7172},"\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":7174,"title":7175,"module":7171,"summary":7176},"\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":7178,"title":7179,"module":7171,"summary":7180},"\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":7182,"title":7183,"module":7171,"summary":7184},"\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":7186,"title":7187,"module":7171,"summary":7188},"\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":7190,"title":7191,"module":7192,"summary":7193},"\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":7195,"title":7196,"module":7192,"summary":7197},"\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":7199,"title":7200,"module":7192,"summary":7201},"\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":7203,"title":7204,"module":7192,"summary":7205},"\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":7207,"title":7208,"module":7192,"summary":7209},"\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":7211,"title":7212,"module":7213,"summary":7214},"\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":7216,"title":7217,"module":7213,"summary":7218},"\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":7220,"title":7221,"module":7213,"summary":7222},"\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":7224,"title":7225,"module":7213,"summary":7226},"\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":7228,"title":7229,"module":7230,"summary":7231},"\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":7233,"title":7234,"module":7230,"summary":7235},"\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":7237,"title":7238,"module":7230,"summary":7239},"\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":7241,"title":7242,"module":7230,"summary":7243},"\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":7245,"title":7246,"module":7230,"summary":7247},"\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":7249,"title":7250,"module":7230,"summary":7251},"\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":7253,"title":7254,"module":7230,"summary":7255},"\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":7257,"title":7258,"module":7230,"summary":7259},"\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":7261,"title":7262,"module":7230,"summary":7263},"\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":7265,"title":7266,"module":7267,"summary":7268},"\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":7270,"title":7271,"module":7267,"summary":7272},"\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":7274,"title":7275,"module":7267,"summary":7276},"\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":7278,"title":7279,"module":7267,"summary":7280},"\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":7282,"title":7283,"module":7267,"summary":7284},"\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":7286,"title":7287,"module":7288,"summary":7289},"\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":7291,"title":7292,"module":7288,"summary":7293},"\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":7295,"title":7296,"module":7288,"summary":7297},"\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":7299,"title":7300,"module":7288,"summary":7301},"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks","Generative Adversarial Networks","A generative adversarial network trains two networks against each other: a generator that turns noise into samples, and a discriminator that tries to tell real data from forgeries. The game has a clean theory: the optimal discriminator is a likelihood ratio, and at equilibrium the generator minimizes the Jensen–Shannon divergence to the data, with a global optimum exactly when its distribution matches the data. We derive that result, fix the saturating loss that breaks training, and catalogue the failure modes (mode collapse, instability, vanishing gradients) and the architectural fixes.\n",{"path":7303,"title":7304,"module":7288,"summary":7305},"\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":7307,"title":7308,"module":7288,"summary":7309},"\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":7311,"title":7312,"module":7288,"summary":7313},"\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":7315,"title":7316,"module":7317,"summary":7318},"\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":7320,"title":7321,"module":7317,"summary":7322},"\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":7324,"title":7325,"module":7317,"summary":7326},"\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":7328,"title":7329,"module":7330,"summary":7331},"\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":7333,"title":7334,"module":7330,"summary":7335},"\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":7337,"title":7338,"module":7330,"summary":7339},"\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":7341,"title":7342,"module":7330,"summary":7343},"\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":7345,"title":7346,"module":7330,"summary":7347},"\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":7349,"title":7350,"module":7330,"summary":7351},"\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":7353,"title":7354,"module":7330,"summary":7355},"\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":7357,"title":7358,"module":7359,"summary":7360},"\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":7362,"title":7363,"module":7359,"summary":7364},"\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":7366,"title":7367,"module":7359,"summary":7368},"\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":7370,"title":7371,"module":7359,"summary":7372},"\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":7374,"title":7375,"module":7359,"summary":7376},"\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":7378,"title":7379,"module":7359,"summary":7380},"\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":7382,"title":7383,"module":7359,"summary":7384},"\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":7386,"title":7387,"module":7359,"summary":7388},"\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":7390,"title":7391,"module":7359,"summary":7392},"\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":7394,"title":7395,"module":7359,"summary":7396},"\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":7398,"title":7399,"module":7359,"summary":7400},"\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":7402,"title":7403,"module":7404,"summary":7405},"\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":7407,"title":7408,"module":7404,"summary":7409},"\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":7411,"title":7412,"module":7404,"summary":7413},"\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":7415,"title":7416,"module":7404,"summary":7417},"\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":7419,"title":7420,"module":7404,"summary":7421},"\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":7423,"title":7424,"module":6,"summary":6},"\u002Fdeep-learning","Deep Learning",{"path":7426,"title":7427,"module":5334,"summary":7428},"\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":7430,"title":7431,"module":5334,"summary":7432},"\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":7434,"title":7435,"module":5334,"summary":7436},"\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":7438,"title":7439,"module":5334,"summary":7440},"\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":7442,"title":7443,"module":5334,"summary":7444},"\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":7446,"title":7447,"module":7448,"summary":7449},"\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":7451,"title":7452,"module":7448,"summary":7453},"\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":7455,"title":7456,"module":7448,"summary":7457},"\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":7459,"title":7460,"module":7448,"summary":7461},"\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":7463,"title":7464,"module":7465,"summary":7466},"\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":7468,"title":7469,"module":7465,"summary":7470},"\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":7472,"title":7473,"module":7465,"summary":7474},"\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":7476,"title":7477,"module":7465,"summary":7478},"\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":7480,"title":7481,"module":7482,"summary":7483},"\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":7485,"title":7486,"module":7482,"summary":7487},"\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":7489,"title":7490,"module":7482,"summary":7491},"\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":7493,"title":7494,"module":7482,"summary":7495},"\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":7497,"title":7498,"module":7482,"summary":7499},"\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":7501,"title":7502,"module":7503,"summary":7504},"\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":7506,"title":7507,"module":7503,"summary":7508},"\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":7510,"title":7511,"module":7503,"summary":7512},"\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":7514,"title":7515,"module":7516,"summary":7517},"\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":7519,"title":7520,"module":7516,"summary":7521},"\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":7523,"title":7524,"module":7516,"summary":7525},"\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":7527,"title":7528,"module":7529,"summary":7530},"\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":7532,"title":7533,"module":7529,"summary":7534},"\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":7536,"title":7537,"module":7529,"summary":7538},"\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":7540,"title":7541,"module":7529,"summary":7542},"\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":7544,"title":7545,"module":7546,"summary":7547},"\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":7549,"title":7550,"module":7546,"summary":7551},"\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":7553,"title":7554,"module":7546,"summary":7555},"\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":7557,"title":7558,"module":7546,"summary":7559},"\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":7561,"title":7562,"module":7546,"summary":7563},"\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":7565,"title":7566,"module":7546,"summary":7567},"\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":7569,"title":7570,"module":7571,"summary":7572},"\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":7574,"title":7575,"module":7571,"summary":7576},"\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":7578,"title":7579,"module":7571,"summary":7580},"\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":7582,"title":7583,"module":7571,"summary":7584},"\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":7586,"title":7587,"module":7588,"summary":7589},"\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":7591,"title":7592,"module":7588,"summary":7593},"\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":7595,"title":7596,"module":7588,"summary":7597},"\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":7599,"title":7600,"module":7601,"summary":7602},"\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":7604,"title":7605,"module":7601,"summary":7606},"\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":7608,"title":7609,"module":7601,"summary":7610},"\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":7612,"title":7613,"module":7601,"summary":7614},"\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":7616,"title":7617,"module":7601,"summary":7618},"\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":7620,"title":7621,"module":7622,"summary":7623},"\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":7625,"title":7626,"module":7622,"summary":7627},"\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":7629,"title":7630,"module":7622,"summary":7631},"\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":7633,"title":7634,"module":6,"summary":6},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":7636,"title":7637,"module":7638,"summary":7639},"\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":7641,"title":7642,"module":7638,"summary":7643},"\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":7645,"title":7646,"module":7638,"summary":7647},"\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":7649,"title":7650,"module":7638,"summary":7651},"\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":7653,"title":7654,"module":7655,"summary":7656},"\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":7658,"title":7659,"module":7655,"summary":7660},"\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":7662,"title":7663,"module":7655,"summary":7664},"\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":7666,"title":7667,"module":7655,"summary":7668},"\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":7670,"title":7671,"module":7672,"summary":7673},"\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":7675,"title":7676,"module":7672,"summary":7677},"\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":7679,"title":7680,"module":7672,"summary":7681},"\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":7683,"title":7684,"module":7672,"summary":7685},"\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":7687,"title":7688,"module":7689,"summary":7690},"\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":7692,"title":7693,"module":7689,"summary":7694},"\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":7696,"title":7697,"module":7689,"summary":7698},"\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":7700,"title":7701,"module":7689,"summary":7702},"\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":7704,"title":7705,"module":7706,"summary":7707},"\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":7709,"title":7710,"module":7706,"summary":7711},"\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":7713,"title":7714,"module":7706,"summary":7715},"\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":7717,"title":7718,"module":7706,"summary":7719},"\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":7721,"title":7722,"module":7723,"summary":7724},"\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":7726,"title":7727,"module":7723,"summary":7728},"\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":7730,"title":7731,"module":7723,"summary":7732},"\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":7734,"title":7735,"module":7723,"summary":7736},"\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":7738,"title":7739,"module":7740,"summary":7741},"\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":7743,"title":7744,"module":7740,"summary":7745},"\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":7747,"title":7748,"module":7740,"summary":7749},"\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":7751,"title":7752,"module":7740,"summary":7753},"\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":7755,"title":7756,"module":7740,"summary":7757},"\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":7759,"title":7760,"module":7761,"summary":7762},"\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":7764,"title":7765,"module":7761,"summary":7766},"\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":7768,"title":7769,"module":7770,"summary":7771},"\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":7773,"title":7774,"module":7770,"summary":7775},"\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":7777,"title":7778,"module":7770,"summary":7779},"\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":7781,"title":7782,"module":7770,"summary":7783},"\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":7785,"title":7786,"module":7787,"summary":7788},"\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":7790,"title":7791,"module":7787,"summary":7792},"\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":7794,"title":7795,"module":7787,"summary":7796},"\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":7798,"title":7799,"module":7787,"summary":7800},"\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":7802,"title":7803,"module":7787,"summary":7804},"\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":7806,"title":7807,"module":7808,"summary":7809},"\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":7811,"title":7812,"module":7808,"summary":7813},"\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":7815,"title":7816,"module":7808,"summary":7817},"\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":7819,"title":7820,"module":7808,"summary":7821},"\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":7823,"title":7824,"module":6,"summary":6},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":7826,"title":7827,"module":4590,"summary":7828},"\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":7830,"title":7831,"module":7832,"summary":7833},"\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":7835,"title":7836,"module":7832,"summary":7837},"\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":7839,"title":7840,"module":7832,"summary":7841},"\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":7843,"title":7844,"module":7832,"summary":7845},"\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":7847,"title":7848,"module":7832,"summary":7849},"\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":7851,"title":7852,"module":7832,"summary":7853},"\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":7855,"title":7856,"module":7832,"summary":7857},"\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":7859,"title":7860,"module":7861,"summary":7862},"\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":7864,"title":7865,"module":7861,"summary":7866},"\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":7868,"title":7869,"module":7861,"summary":7870},"\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":7872,"title":7873,"module":7861,"summary":7874},"\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":7876,"title":7877,"module":7878,"summary":7879},"\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":7881,"title":7882,"module":7878,"summary":7883},"\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":7885,"title":7886,"module":7878,"summary":7887},"\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":7889,"title":7890,"module":7878,"summary":7891},"\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":7893,"title":7894,"module":7895,"summary":7896},"\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":7898,"title":7899,"module":7895,"summary":7900},"\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":7902,"title":7903,"module":7895,"summary":7904},"\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":7906,"title":7907,"module":7895,"summary":7908},"\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":7910,"title":7911,"module":7912,"summary":7913},"\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":7915,"title":7916,"module":7912,"summary":7917},"\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":7919,"title":7920,"module":7912,"summary":7921},"\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":7923,"title":7924,"module":7912,"summary":7925},"\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":7927,"title":7928,"module":7929,"summary":7930},"\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":7932,"title":7933,"module":7929,"summary":7934},"\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":7936,"title":7937,"module":7929,"summary":7938},"\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":7940,"title":7941,"module":7942,"summary":7943},"\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":7945,"title":7946,"module":7942,"summary":7947},"\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":7949,"title":7950,"module":7951,"summary":7952},"\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":7954,"title":7955,"module":7951,"summary":7956},"\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":7958,"title":7959,"module":7951,"summary":7960},"\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":7962,"title":7963,"module":6,"summary":6},"\u002Flogic","Logic",{"path":7965,"title":7966,"module":4590,"summary":7967},"\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":7969,"title":7970,"module":4590,"summary":7971},"\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":7973,"title":7974,"module":4590,"summary":7975},"\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":7977,"title":7978,"module":4590,"summary":7979},"\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":7981,"title":7982,"module":4590,"summary":7983},"\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":7985,"title":7986,"module":4590,"summary":7987},"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality","Value Functions and Optimality","A value function scores how good a state (or state–action pair) is under a policy: the expected return from there onward. Its defining property is the Bellman equation, a self-consistency condition linking a state's value to its successors' values, which we derive from the return and the dynamics. Pushing the same idea to the best-achievable value gives the Bellman optimality equations, whose solution yields an optimal policy — and whose intractability is what the rest of the course is about.\n",{"path":657,"title":4809,"module":3652,"summary":7989},"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":7991,"title":7992,"module":3652,"summary":7993},"\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":2135,"title":7995,"module":3652,"summary":7996},"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":7998,"title":7999,"module":3652,"summary":8000},"\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":8002,"title":8003,"module":3652,"summary":8004},"\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":8006,"title":8007,"module":3652,"summary":8008},"\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":8010,"title":8011,"module":3652,"summary":8012},"\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":8014,"title":8015,"module":3652,"summary":8016},"\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":17,"title":8018,"module":3652,"summary":8019},"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":8021,"title":8022,"module":3652,"summary":8023},"\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":3654,"title":5,"module":3652,"summary":3670},{"path":3382,"title":3383,"module":3652,"summary":8026},"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":8028,"title":8029,"module":8030,"summary":8031},"\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":8033,"title":8034,"module":8030,"summary":8035},"\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":8037,"title":8038,"module":8030,"summary":8039},"\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":8041,"title":8042,"module":8030,"summary":8043},"\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":8045,"title":8046,"module":8030,"summary":8047},"\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":8049,"title":8050,"module":8030,"summary":8051},"\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":8053,"title":8054,"module":8030,"summary":8055},"\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":8057,"title":8058,"module":8030,"summary":8059},"\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":8061,"title":8062,"module":8030,"summary":8063},"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods","Policy Gradient Methods","Every method so far learned values and read a policy off them. Policy gradient methods drop the intermediary: parameterize the policy directly and climb the performance gradient. We build the softmax-in-preferences parameterization, prove the policy gradient theorem that makes the gradient computable without the unknown state distribution, and derive REINFORCE and its variance-cutting state-value baseline — the launch point for the bootstrapping actor-critic that follows.\n",{"path":8065,"title":8066,"module":8030,"summary":8067},"\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":8069,"title":8070,"module":8030,"summary":8071},"\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":8073,"title":8074,"module":8030,"summary":8075},"\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":8077,"title":8078,"module":8030,"summary":8079},"\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":8081,"title":8082,"module":8030,"summary":8083},"\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":8085,"title":7412,"module":8086,"summary":8087},"\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":8089,"title":8090,"module":8086,"summary":8091},"\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":8093,"title":8094,"module":8086,"summary":8095},"\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":8097,"title":8098,"module":8086,"summary":8099},"\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":8101,"title":8102,"module":8086,"summary":8103},"\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":8105,"title":8106,"module":8086,"summary":8107},"\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":8109,"title":8110,"module":8086,"summary":8111},"\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":8113,"title":8114,"module":8086,"summary":8115},"\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":8117,"title":8118,"module":8119,"summary":8120},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow","Sharpening DQN: Improvements and the Distributional Idea","Modern Deep Reinforcement Learning","In the years after the 2015 DQN paper, a stream of focused improvements each fixed one weakness of the baseline without disturbing its frame. This lesson recaps five that keep the scalar $Q$-value — Double DQN, multi-step returns, dueling networks, prioritized replay, and NoisyNets, each changing a different slot of the same Q-learning loop — then develops the sixth, distributional RL, which changes the objective itself: learn the whole return distribution $Z(s,a)$. We build the distributional Bellman equation and the C51 categorical algorithm, projection step and all, worked end to end on real numbers. A companion lesson takes up QR-DQN, Rainbow, and the modern distributional line.\n",{"path":8122,"title":8123,"module":8119,"summary":8124},"\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":8126,"title":8127,"module":8119,"summary":8128},"\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":8130,"title":8131,"module":8119,"summary":8132},"\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":8134,"title":8135,"module":8119,"summary":8136},"\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":8138,"title":8139,"module":8119,"summary":8140},"\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":8142,"title":8143,"module":8119,"summary":8144},"\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":8146,"title":8147,"module":8119,"summary":8148},"\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":8150,"title":8151,"module":8119,"summary":8152},"\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":8154,"title":8155,"module":8119,"summary":8156},"\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":8158,"title":8159,"module":8119,"summary":8160},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl","Imitation Learning: Cloning, DAgger, and Inverse RL","When a reward is hard to specify but an expert is easy to watch, learn from demonstrations instead. Behavioral cloning treats control as supervised learning of the expert's state-to-action map, and fails through compounding error: small mistakes carry the agent off the expert's distribution, where it was never trained. DAgger fixes the mismatch by querying the expert on the learner's own states. Inverse RL instead recovers the reward the expert seems to optimize — an ill-posed problem that maximum-entropy IRL disambiguates. A companion lesson casts imitation as adversarial occupancy matching (GAIL, AIRL).\n",{"path":8162,"title":8163,"module":8119,"summary":8164},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2","Imitation as Adversarial Matching: GAIL and AIRL","A companion to the imitation-learning lesson. If the point of recovering a reward is only to re-run RL and match the expert, you can skip the reward and match the behavior directly. GAIL casts imitation as a GAN — a discriminator separating expert from learner state-action pairs supplies the reward a policy-gradient method optimizes — matching occupancy measures without ever naming a reward. AIRL reads a transferable reward back out of the discriminator. We compare all four methods and close with reward models in RLHF, scaled cloning, and diffusion policies.\n",{"path":8166,"title":8167,"module":8119,"summary":8168},"\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":8170,"title":8171,"module":8119,"summary":8172},"\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":8174,"title":8175,"module":8119,"summary":8176},"\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":8178,"title":8179,"module":8119,"summary":8180},"\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":8182,"title":8183,"module":8119,"summary":8184},"\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":8186,"title":8187,"module":8119,"summary":8188},"\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":8190,"title":8191,"module":8119,"summary":8192},"\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":8194,"title":8195,"module":8119,"summary":8196},"\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":8198,"title":8199,"module":8119,"summary":8200},"\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":8202,"title":8203,"module":8119,"summary":8204},"\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":8206,"title":8207,"module":8208,"summary":8209},"\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":8211,"title":8212,"module":8208,"summary":8213},"\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":8215,"title":8216,"module":8208,"summary":8217},"\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":8219,"title":8220,"module":8208,"summary":8221},"\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":8223,"title":8224,"module":8208,"summary":8225},"\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":8227,"title":8228,"module":8208,"summary":8229},"\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":8231,"title":8232,"module":8208,"summary":8233},"\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":8235,"title":8236,"module":8208,"summary":8237},"\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":8239,"title":7404,"module":6,"summary":6},"\u002Freinforcement-learning",{"path":8241,"title":8242,"module":4590,"summary":8243},"\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":8245,"title":8246,"module":4590,"summary":8247},"\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":8249,"title":8250,"module":4590,"summary":8251},"\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":8253,"title":8254,"module":4590,"summary":8255},"\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":8257,"title":8258,"module":8259,"summary":8260},"\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":8262,"title":8263,"module":8259,"summary":8264},"\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":8266,"title":8267,"module":8259,"summary":8268},"\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":8270,"title":8271,"module":8259,"summary":8272},"\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":8274,"title":8275,"module":8259,"summary":8276},"\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":8278,"title":8279,"module":8259,"summary":8280},"\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":8282,"title":8283,"module":8259,"summary":8284},"\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":8286,"title":8287,"module":8259,"summary":8288},"\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":8290,"title":8291,"module":8259,"summary":8292},"\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":8294,"title":8295,"module":8259,"summary":8296},"\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":8298,"title":8299,"module":8259,"summary":8300},"\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":8302,"title":8303,"module":8259,"summary":8304},"\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":8306,"title":8307,"module":8308,"summary":8309},"\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":8311,"title":8312,"module":8308,"summary":8313},"\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":8315,"title":8316,"module":8308,"summary":8317},"\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":8319,"title":8320,"module":8308,"summary":8321},"\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":8323,"title":8324,"module":8308,"summary":8325},"\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":8327,"title":8328,"module":8308,"summary":8329},"\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":8331,"title":8332,"module":8308,"summary":8333},"\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":8335,"title":8336,"module":8308,"summary":8337},"\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":8339,"title":8340,"module":8308,"summary":8341},"\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":8343,"title":8344,"module":8308,"summary":8345},"\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":8347,"title":8348,"module":8308,"summary":8349},"\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":8351,"title":8352,"module":8308,"summary":8353},"\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":8355,"title":8356,"module":8357,"summary":8358},"\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":8360,"title":8361,"module":8357,"summary":8362},"\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":8364,"title":8365,"module":8357,"summary":8366},"\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":8368,"title":8369,"module":8357,"summary":8370},"\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":8372,"title":8373,"module":8357,"summary":8374},"\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":8376,"title":8377,"module":8357,"summary":8378},"\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":8380,"title":8381,"module":8357,"summary":8382},"\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":8384,"title":7982,"module":8357,"summary":8385},"\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":8387,"title":8388,"module":8357,"summary":8389},"\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":8391,"title":8392,"module":8357,"summary":8393},"\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":8395,"title":8396,"module":8397,"summary":8398},"\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":8400,"title":8401,"module":8397,"summary":8402},"\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":8404,"title":8405,"module":8397,"summary":8406},"\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":8408,"title":8409,"module":8397,"summary":8410},"\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":8412,"title":7404,"module":8397,"summary":8413},"\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":8415,"title":8416,"module":8397,"summary":8417},"\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":8419,"title":8420,"module":8397,"summary":8421},"\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":8423,"title":8424,"module":8397,"summary":8425},"\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":8427,"title":8428,"module":8429,"summary":8430},"\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":8432,"title":8433,"module":8429,"summary":8434},"\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":8436,"title":8437,"module":8429,"summary":8438},"\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":8440,"title":8441,"module":8429,"summary":8442},"\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":8444,"title":8445,"module":8429,"summary":8446},"\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":8448,"title":8449,"module":8429,"summary":8450},"\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":8452,"title":8453,"module":8429,"summary":8454},"\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":8456,"title":8457,"module":8429,"summary":8458},"\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":8460,"title":8461,"module":6,"summary":6},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":8463,"title":8464,"module":8465,"summary":8466},"\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":8468,"title":8469,"module":8465,"summary":8470},"\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":8472,"title":8473,"module":8465,"summary":8474},"\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":8476,"title":8477,"module":8465,"summary":8478},"\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":8480,"title":8481,"module":8465,"summary":8482},"\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":8484,"title":8485,"module":8486,"summary":8487},"\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":8489,"title":8490,"module":8486,"summary":8491},"\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":8493,"title":8494,"module":8486,"summary":8495},"\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":8497,"title":8498,"module":8486,"summary":8499},"\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":8501,"title":8502,"module":8503,"summary":8504},"\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":8506,"title":8507,"module":8503,"summary":8508},"\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":8510,"title":8511,"module":8503,"summary":8512},"\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":8514,"title":8515,"module":8503,"summary":8516},"\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":8518,"title":8519,"module":8520,"summary":8521},"\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":8523,"title":8524,"module":8520,"summary":8525},"\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":8527,"title":8528,"module":8529,"summary":8530},"\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":8532,"title":8533,"module":8529,"summary":8534},"\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":8536,"title":8537,"module":8538,"summary":8539},"\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":8541,"title":8542,"module":8538,"summary":8543},"\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":8545,"title":8546,"module":8538,"summary":8547},"\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":8549,"title":8550,"module":8538,"summary":8551},"\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":8553,"title":8554,"module":8555,"summary":8556},"\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":8558,"title":8559,"module":8555,"summary":8560},"\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":8562,"title":8563,"module":8555,"summary":8564},"\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":8566,"title":8567,"module":8568,"summary":8569},"\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":8571,"title":8572,"module":8568,"summary":8573},"\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":8575,"title":8576,"module":8568,"summary":8577},"\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":8579,"title":8580,"module":8581,"summary":8582},"\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":8584,"title":8585,"module":8581,"summary":8586},"\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":8588,"title":8589,"module":8590,"summary":8591},"\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":8593,"title":8594,"module":8590,"summary":8595},"\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":8597,"title":8598,"module":8590,"summary":8599},"\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":8601,"title":8602,"module":8603,"summary":8604},"\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":8606,"title":8607,"module":8603,"summary":8608},"\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":8610,"title":8611,"module":8603,"summary":8612},"\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":8614,"title":8615,"module":8603,"summary":8616},"\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":8618,"title":8619,"module":8603,"summary":8620},"\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":8622,"title":8623,"module":6,"summary":6},"\u002Fnuclear-physics","Nuclear Physics",{"path":8625,"title":8626,"module":4590,"summary":8627},"\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":8629,"title":8630,"module":4590,"summary":8631},"\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":8633,"title":8634,"module":4590,"summary":8635},"\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":8637,"title":8638,"module":4590,"summary":8639},"\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":8641,"title":8642,"module":4590,"summary":8643},"\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":8645,"title":8646,"module":8647,"summary":8648},"\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":8650,"title":8651,"module":8647,"summary":8652},"\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":8654,"title":8655,"module":8647,"summary":8656},"\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":8658,"title":8659,"module":8647,"summary":8660},"\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":8662,"title":8663,"module":8664,"summary":8665},"\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":8667,"title":8668,"module":8664,"summary":8669},"\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":8671,"title":8672,"module":8664,"summary":8673},"\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":8675,"title":8676,"module":5056,"summary":8677},"\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":8679,"title":8680,"module":5056,"summary":8681},"\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":8683,"title":8684,"module":5056,"summary":8685},"\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":8687,"title":8688,"module":5538,"summary":8689},"\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":8691,"title":7250,"module":5538,"summary":8692},"\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":8694,"title":7358,"module":5538,"summary":8695},"\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":8697,"title":8698,"module":5538,"summary":8699},"\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":8701,"title":8702,"module":5538,"summary":8703},"\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":8705,"title":8706,"module":5538,"summary":8707},"\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":8709,"title":8710,"module":8711,"summary":8712},"\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":8714,"title":8715,"module":8711,"summary":8716},"\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":8718,"title":8719,"module":8711,"summary":8720},"\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":8722,"title":8723,"module":8711,"summary":8724},"\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":8726,"title":8727,"module":8711,"summary":8728},"\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":8730,"title":8731,"module":8711,"summary":8732},"\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":8734,"title":8735,"module":8711,"summary":8736},"\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":8738,"title":8739,"module":8711,"summary":8740},"\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":8742,"title":8743,"module":8711,"summary":8744},"\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":8746,"title":8747,"module":8711,"summary":8748},"\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":8750,"title":8751,"module":8711,"summary":8752},"\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":8754,"title":8755,"module":8711,"summary":8756},"\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":8758,"title":8759,"module":8711,"summary":8760},"\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":8762,"title":8763,"module":8711,"summary":8764},"\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":8766,"title":8767,"module":8711,"summary":8768},"\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":8770,"title":8771,"module":8711,"summary":8772},"\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":8774,"title":8775,"module":8711,"summary":8776},"\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":8778,"title":8779,"module":8711,"summary":8780},"\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":8782,"title":8783,"module":8711,"summary":8784},"\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":8786,"title":8787,"module":8711,"summary":8788},"\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":8790,"title":8791,"module":7346,"summary":8792},"\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":8794,"title":8795,"module":7346,"summary":8796},"\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":8798,"title":8799,"module":7346,"summary":8800},"\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":8802,"title":8803,"module":7346,"summary":8804},"\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":8806,"title":8807,"module":7346,"summary":8808},"\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":8810,"title":8811,"module":7346,"summary":8812},"\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":8814,"title":8815,"module":7346,"summary":8816},"\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":8818,"title":8819,"module":7346,"summary":8820},"\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":8822,"title":8823,"module":8824,"summary":8825},"\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":8827,"title":8828,"module":8824,"summary":8829},"\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":8831,"title":8832,"module":8824,"summary":8833},"\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":8835,"title":8836,"module":8824,"summary":8837},"\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":8839,"title":8840,"module":6,"summary":6},"\u002Fnatural-language-processing","Natural Language Processing",{"path":8842,"title":8843,"module":4590,"summary":8844},"\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":8846,"title":8847,"module":4590,"summary":8848},"\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":8850,"title":8851,"module":4590,"summary":8852},"\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":8854,"title":8855,"module":8856,"summary":8857},"\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":8859,"title":8860,"module":8856,"summary":8861},"\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":8863,"title":8864,"module":8856,"summary":8865},"\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":8867,"title":8868,"module":8856,"summary":8869},"\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":8871,"title":8872,"module":8873,"summary":8874},"\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":8876,"title":8877,"module":8873,"summary":8878},"\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":8880,"title":8881,"module":8873,"summary":8882},"\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":8884,"title":8885,"module":8873,"summary":8886},"\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":8888,"title":8889,"module":8890,"summary":8891},"\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":8893,"title":8894,"module":8890,"summary":8895},"\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":8897,"title":8898,"module":8890,"summary":8899},"\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":8901,"title":8902,"module":8890,"summary":8903},"\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":8905,"title":8906,"module":8907,"summary":8908},"\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":8910,"title":8911,"module":8907,"summary":8912},"\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":8914,"title":8915,"module":8907,"summary":8916},"\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":8918,"title":8919,"module":8920,"summary":8921},"\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":8923,"title":8924,"module":8920,"summary":8925},"\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":8927,"title":8928,"module":8920,"summary":8929},"\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":8931,"title":8932,"module":8920,"summary":8933},"\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":8935,"title":8936,"module":8937,"summary":8938},"\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":8940,"title":8941,"module":8937,"summary":8942},"\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":8944,"title":8945,"module":8937,"summary":8946},"\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":8948,"title":8949,"module":8937,"summary":8950},"\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":8952,"title":8953,"module":8954,"summary":8955},"\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":8957,"title":8958,"module":8954,"summary":8959},"\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":8961,"title":8962,"module":8954,"summary":8963},"\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":8965,"title":8966,"module":8954,"summary":8967},"\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":8969,"title":8970,"module":8971,"summary":8972},"\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":8974,"title":8975,"module":8971,"summary":8976},"\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":8978,"title":8979,"module":8971,"summary":8980},"\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":8982,"title":8983,"module":8971,"summary":8984},"\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":8986,"title":8987,"module":8971,"summary":8988},"\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":8990,"title":8991,"module":8992,"summary":8993},"\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":8995,"title":8996,"module":8992,"summary":8997},"\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":8999,"title":9000,"module":8992,"summary":9001},"\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":9003,"title":9004,"module":9005,"summary":9006},"\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":9008,"title":9009,"module":9005,"summary":9010},"\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":9012,"title":9013,"module":9005,"summary":9014},"\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":9016,"title":9017,"module":9017,"summary":9018},"\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":9020,"title":9021,"module":9017,"summary":9022},"\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":9024,"title":9025,"module":9017,"summary":9026},"\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":9028,"title":9029,"module":9017,"summary":9030},"\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":9032,"title":9033,"module":9017,"summary":9034},"\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":9036,"title":9037,"module":9017,"summary":9038},"\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":9040,"title":9041,"module":6,"summary":6},"\u002Fparticle-physics","Particle Physics",{"path":9043,"title":9044,"module":9045,"summary":9046},"\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":9048,"title":9049,"module":9045,"summary":9050},"\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":9052,"title":9053,"module":9045,"summary":9054},"\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":9056,"title":9057,"module":9058,"summary":9059},"\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":9061,"title":9062,"module":9058,"summary":9063},"\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":9065,"title":9066,"module":9058,"summary":9067},"\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":9069,"title":9070,"module":9058,"summary":9071},"\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":9073,"title":9074,"module":9075,"summary":9076},"\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":9078,"title":9079,"module":9075,"summary":9080},"\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":9082,"title":9083,"module":9075,"summary":9084},"\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":9086,"title":9087,"module":9075,"summary":9088},"\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":9090,"title":9091,"module":9092,"summary":9093},"\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":9095,"title":9096,"module":9092,"summary":9097},"\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":9099,"title":9100,"module":9092,"summary":9101},"\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":9103,"title":9104,"module":9092,"summary":9105},"\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":9107,"title":9108,"module":9109,"summary":9110},"\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":9112,"title":9113,"module":9109,"summary":9114},"\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":9116,"title":9117,"module":9109,"summary":9118},"\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":9120,"title":9121,"module":9109,"summary":9122},"\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":9124,"title":9125,"module":9126,"summary":9127},"\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":9129,"title":9130,"module":9126,"summary":9131},"\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":9133,"title":9134,"module":9126,"summary":9135},"\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":9137,"title":9138,"module":9139,"summary":9140},"\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":9142,"title":9143,"module":9139,"summary":9144},"\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":9146,"title":9147,"module":9139,"summary":9148},"\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":9150,"title":9151,"module":9139,"summary":9152},"\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":9154,"title":7579,"module":9155,"summary":9156},"\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":9158,"title":9159,"module":9155,"summary":9160},"\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":9162,"title":9163,"module":9155,"summary":9164},"\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":9166,"title":9167,"module":9155,"summary":9168},"\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":9170,"title":9171,"module":9155,"summary":9172},"\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":9174,"title":9175,"module":9176,"summary":9177},"\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":9179,"title":9180,"module":9176,"summary":9181},"\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":9183,"title":9184,"module":9176,"summary":9185},"\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":9187,"title":9188,"module":9176,"summary":9189},"\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":9191,"title":9192,"module":9193,"summary":9194},"\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":9196,"title":9197,"module":9193,"summary":9198},"\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":9200,"title":9201,"module":9193,"summary":9202},"\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":9204,"title":9205,"module":9193,"summary":9206},"\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":9208,"title":9209,"module":9193,"summary":9210},"\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":9212,"title":9213,"module":9214,"summary":9215},"\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":9217,"title":9218,"module":9214,"summary":9219},"\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":9221,"title":6297,"module":9214,"summary":9222},"\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":9224,"title":9225,"module":9214,"summary":9226},"\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":9228,"title":9229,"module":9214,"summary":9230},"\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":9232,"title":9233,"module":9234,"summary":9235},"\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":9237,"title":9238,"module":9234,"summary":9239},"\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":9241,"title":9242,"module":9234,"summary":9243},"\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":9245,"title":9246,"module":9234,"summary":9247},"\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":9249,"title":9250,"module":9234,"summary":9251},"\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":9253,"title":9254,"module":9234,"summary":9255},"\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":9257,"title":9258,"module":9234,"summary":9259},"\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":9261,"title":9262,"module":6,"summary":6},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":9264,"title":9265,"module":6,"summary":6},"\u002Fcolophon","Colophon",{"path":9267,"title":9268,"module":6,"summary":6},"\u002F","Study Notes",[9270,9285,9313,9347,9367,9422],{"module":4590,"moduleNumber":3319,"slug":9271,"lessons":9272},"foundations",[9273,9275,9277,9279,9281,9283],{"title":7966,"path":7965,"lessonNumber":3319,"topics":9274,"summary":7967},[4590],{"title":7970,"path":7969,"lessonNumber":3325,"topics":9276,"summary":7971},[4590],{"title":7974,"path":7973,"lessonNumber":3331,"topics":9278,"summary":7975},[4590],{"title":7978,"path":7977,"lessonNumber":3337,"topics":9280,"summary":7979},[4590],{"title":7982,"path":7981,"lessonNumber":3343,"topics":9282,"summary":7983},[4590],{"title":7986,"path":7985,"lessonNumber":3349,"topics":9284,"summary":7987},[4590],{"module":3652,"moduleNumber":3325,"slug":9286,"lessons":9287},"tabular-methods",[9288,9290,9292,9294,9296,9298,9300,9302,9304,9306,9308,9310],{"title":4809,"path":657,"lessonNumber":3319,"topics":9289,"summary":7989},[3672],{"title":7992,"path":7991,"lessonNumber":3325,"topics":9291,"summary":7993},[3672],{"title":7995,"path":2135,"lessonNumber":3331,"topics":9293,"summary":7996},[3672],{"title":7999,"path":7998,"lessonNumber":3337,"topics":9295,"summary":8000},[3672],{"title":8003,"path":8002,"lessonNumber":3343,"topics":9297,"summary":8004},[3672],{"title":8007,"path":8006,"lessonNumber":3349,"topics":9299,"summary":8008},[3672],{"title":8011,"path":8010,"lessonNumber":3355,"topics":9301,"summary":8012},[3672],{"title":8015,"path":8014,"lessonNumber":3361,"topics":9303,"summary":8016},[3672],{"title":8018,"path":17,"lessonNumber":3367,"topics":9305,"summary":8019},[3672],{"title":8022,"path":8021,"lessonNumber":3373,"topics":9307,"summary":8023},[3672],{"title":5,"path":3654,"lessonNumber":3650,"topics":9309,"summary":3670},[3672],{"title":3383,"path":3382,"lessonNumber":9311,"topics":9312,"summary":8026},12,[3672],{"module":8030,"moduleNumber":3331,"slug":9314,"lessons":9315},"approximation",[9316,9319,9321,9323,9325,9327,9329,9331,9333,9335,9337,9339,9341,9344],{"title":8029,"path":8028,"lessonNumber":3319,"topics":9317,"summary":8031},[9318],"Approximation",{"title":8034,"path":8033,"lessonNumber":3325,"topics":9320,"summary":8035},[9318],{"title":8038,"path":8037,"lessonNumber":3331,"topics":9322,"summary":8039},[9318],{"title":8042,"path":8041,"lessonNumber":3337,"topics":9324,"summary":8043},[9318],{"title":8046,"path":8045,"lessonNumber":3343,"topics":9326,"summary":8047},[9318],{"title":8050,"path":8049,"lessonNumber":3349,"topics":9328,"summary":8051},[9318],{"title":8054,"path":8053,"lessonNumber":3355,"topics":9330,"summary":8055},[9318],{"title":8058,"path":8057,"lessonNumber":3361,"topics":9332,"summary":8059},[9318],{"title":8062,"path":8061,"lessonNumber":3367,"topics":9334,"summary":8063},[9318],{"title":8066,"path":8065,"lessonNumber":3373,"topics":9336,"summary":8067},[9318],{"title":8070,"path":8069,"lessonNumber":3650,"topics":9338,"summary":8071},[9318],{"title":8074,"path":8073,"lessonNumber":9311,"topics":9340,"summary":8075},[9318],{"title":8078,"path":8077,"lessonNumber":9342,"topics":9343,"summary":8079},13,[9318],{"title":8082,"path":8081,"lessonNumber":9345,"topics":9346,"summary":8083},14,[9318],{"module":8086,"moduleNumber":3337,"slug":9348,"lessons":9349},"deep-rl",[9350,9353,9355,9357,9359,9361,9363,9365],{"title":7412,"path":8085,"lessonNumber":3319,"topics":9351,"summary":8087},[9352],"Deep RL",{"title":8090,"path":8089,"lessonNumber":3325,"topics":9354,"summary":8091},[9352],{"title":8094,"path":8093,"lessonNumber":3331,"topics":9356,"summary":8095},[9352],{"title":8098,"path":8097,"lessonNumber":3337,"topics":9358,"summary":8099},[9352],{"title":8102,"path":8101,"lessonNumber":3343,"topics":9360,"summary":8103},[9352],{"title":8106,"path":8105,"lessonNumber":3349,"topics":9362,"summary":8107},[9352],{"title":8110,"path":8109,"lessonNumber":3355,"topics":9364,"summary":8111},[9352],{"title":8114,"path":8113,"lessonNumber":3361,"topics":9366,"summary":8115},[9352],{"module":8119,"moduleNumber":3343,"slug":9368,"lessons":9369},"modern-deep-rl",[9370,9372,9374,9376,9378,9380,9382,9384,9386,9388,9390,9392,9394,9396,9398,9401,9404,9407,9410,9413,9416,9419],{"title":8118,"path":8117,"lessonNumber":3319,"topics":9371,"summary":8120},[9352],{"title":8123,"path":8122,"lessonNumber":3325,"topics":9373,"summary":8124},[9352],{"title":8127,"path":8126,"lessonNumber":3331,"topics":9375,"summary":8128},[9352],{"title":8131,"path":8130,"lessonNumber":3337,"topics":9377,"summary":8132},[9352],{"title":8135,"path":8134,"lessonNumber":3343,"topics":9379,"summary":8136},[9352],{"title":8139,"path":8138,"lessonNumber":3349,"topics":9381,"summary":8140},[9352],{"title":8143,"path":8142,"lessonNumber":3355,"topics":9383,"summary":8144},[9352],{"title":8147,"path":8146,"lessonNumber":3361,"topics":9385,"summary":8148},[9352],{"title":8151,"path":8150,"lessonNumber":3367,"topics":9387,"summary":8152},[9352],{"title":8155,"path":8154,"lessonNumber":3373,"topics":9389,"summary":8156},[9352],{"title":8159,"path":8158,"lessonNumber":3650,"topics":9391,"summary":8160},[9352],{"title":8163,"path":8162,"lessonNumber":9311,"topics":9393,"summary":8164},[9352],{"title":8167,"path":8166,"lessonNumber":9342,"topics":9395,"summary":8168},[9352],{"title":8171,"path":8170,"lessonNumber":9345,"topics":9397,"summary":8172},[9352],{"title":8175,"path":8174,"lessonNumber":9399,"topics":9400,"summary":8176},15,[9352],{"title":8179,"path":8178,"lessonNumber":9402,"topics":9403,"summary":8180},16,[9352],{"title":8183,"path":8182,"lessonNumber":9405,"topics":9406,"summary":8184},17,[9352],{"title":8187,"path":8186,"lessonNumber":9408,"topics":9409,"summary":8188},18,[9352],{"title":8191,"path":8190,"lessonNumber":9411,"topics":9412,"summary":8192},19,[9352],{"title":8195,"path":8194,"lessonNumber":9414,"topics":9415,"summary":8196},20,[9352],{"title":8199,"path":8198,"lessonNumber":9417,"topics":9418,"summary":8200},21,[9352],{"title":8203,"path":8202,"lessonNumber":9420,"topics":9421,"summary":8204},22,[9352],{"module":8208,"moduleNumber":3349,"slug":9423,"lessons":9424},"minds-and-brains",[9425,9428,9430,9432,9434,9436,9438,9440],{"title":8207,"path":8206,"lessonNumber":3319,"topics":9426,"summary":8209},[9427],"Minds and Brains",{"title":8212,"path":8211,"lessonNumber":3325,"topics":9429,"summary":8213},[9427],{"title":8216,"path":8215,"lessonNumber":3331,"topics":9431,"summary":8217},[9427],{"title":8220,"path":8219,"lessonNumber":3337,"topics":9433,"summary":8221},[9427],{"title":8224,"path":8223,"lessonNumber":3343,"topics":9435,"summary":8225},[9427],{"title":8228,"path":8227,"lessonNumber":3349,"topics":9437,"summary":8229},[9427],{"title":8232,"path":8231,"lessonNumber":3355,"topics":9439,"summary":8233},[9427],{"title":8236,"path":8235,"lessonNumber":3361,"topics":9441,"summary":8237},[9427],"\u003Csvg style=\"width:100%;max-width:529.039px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 396.779 164.495\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-127.35 -97.585)\">\u003Cpath d=\"M66.231 34.203L65.950 34.203L65.950 29.484Q65.950 29.269 65.888 29.174Q65.825 29.078 65.708 29.057Q65.591 29.035 65.345 29.035L65.345 28.738L66.567 28.652L66.567 31.141Q67.044 30.676 67.743 30.676Q68.224 30.676 68.632 30.920Q69.040 31.164 69.276 31.578Q69.513 31.992 69.513 32.476Q69.513 32.851 69.364 33.180Q69.216 33.508 68.946 33.760Q68.677 34.012 68.333 34.146Q67.989 34.281 67.630 34.281Q67.309 34.281 67.011 34.133Q66.712 33.984 66.505 33.723L66.231 34.203M66.591 31.531L66.591 33.371Q66.743 33.668 67.003 33.848Q67.263 34.027 67.575 34.027Q68.001 34.027 68.268 33.808Q68.536 33.590 68.651 33.244Q68.766 32.898 68.766 32.476Q68.766 31.828 68.518 31.379Q68.270 30.930 67.673 30.930Q67.337 30.930 67.048 31.088Q66.759 31.246 66.591 31.531M70.134 33.371Q70.134 32.887 70.536 32.592Q70.938 32.297 71.489 32.178Q72.040 32.058 72.532 32.058L72.532 31.769Q72.532 31.543 72.417 31.336Q72.302 31.129 72.104 31.010Q71.907 30.891 71.677 30.891Q71.251 30.891 70.966 30.996Q71.036 31.023 71.083 31.078Q71.130 31.133 71.155 31.203Q71.181 31.273 71.181 31.348Q71.181 31.453 71.130 31.545Q71.079 31.637 70.987 31.687Q70.895 31.738 70.790 31.738Q70.684 31.738 70.593 31.687Q70.501 31.637 70.450 31.545Q70.399 31.453 70.399 31.348Q70.399 30.930 70.788 30.783Q71.177 30.637 71.677 30.637Q72.009 30.637 72.362 30.767Q72.716 30.898 72.944 31.152Q73.173 31.406 73.173 31.754L73.173 33.555Q73.173 33.687 73.245 33.797Q73.317 33.906 73.446 33.906Q73.571 33.906 73.640 33.801Q73.708 33.695 73.708 33.555L73.708 33.043L73.989 33.043L73.989 33.555Q73.989 33.758 73.872 33.916Q73.755 34.074 73.573 34.158Q73.391 34.242 73.188 34.242Q72.958 34.242 72.806 34.070Q72.653 33.898 72.622 33.668Q72.462 33.949 72.153 34.115Q71.845 34.281 71.493 34.281Q70.981 34.281 70.558 34.058Q70.134 33.836 70.134 33.371M70.821 33.371Q70.821 33.656 71.048 33.842Q71.274 34.027 71.567 34.027Q71.813 34.027 72.038 33.910Q72.263 33.793 72.397 33.590Q72.532 33.387 72.532 33.133L72.532 32.301Q72.266 32.301 71.981 32.355Q71.696 32.410 71.425 32.539Q71.153 32.668 70.987 32.875Q70.821 33.082 70.821 33.371M74.325 32.476Q74.325 31.980 74.575 31.555Q74.825 31.129 75.245 30.883Q75.665 30.637 76.165 30.637Q76.704 30.637 77.095 30.762Q77.485 30.887 77.485 31.301Q77.485 31.406 77.434 31.498Q77.384 31.590 77.292 31.641Q77.200 31.691 77.091 31.691Q76.985 31.691 76.893 31.641Q76.802 31.590 76.751 31.498Q76.700 31.406 76.700 31.301Q76.700 31.078 76.868 30.973Q76.645 30.914 76.173 30.914Q75.876 30.914 75.661 31.053Q75.446 31.191 75.315 31.422Q75.184 31.652 75.126 31.922Q75.067 32.191 75.067 32.476Q75.067 32.871 75.200 33.221Q75.333 33.570 75.604 33.787Q75.876 34.004 76.274 34.004Q76.649 34.004 76.925 33.787Q77.200 33.570 77.302 33.211Q77.317 33.148 77.380 33.148L77.485 33.148Q77.520 33.148 77.546 33.176Q77.571 33.203 77.571 33.242L77.571 33.266Q77.438 33.746 77.054 34.014Q76.669 34.281 76.165 34.281Q75.802 34.281 75.468 34.144Q75.134 34.008 74.874 33.758Q74.614 33.508 74.470 33.172Q74.325 32.836 74.325 32.476\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-127.35 -97.585)\">\u003Cpath d=\"M79.656 34.203L77.860 34.203L77.860 33.906Q78.129 33.906 78.297 33.861Q78.465 33.816 78.465 33.644L78.465 29.484Q78.465 29.269 78.403 29.174Q78.340 29.078 78.223 29.057Q78.106 29.035 77.860 29.035L77.860 28.738L79.082 28.652L79.082 32.418L80.180 31.531Q80.387 31.351 80.387 31.203Q80.387 31.137 80.334 31.094Q80.281 31.051 80.211 31.051L80.211 30.754L81.746 30.754L81.746 31.051Q81.215 31.051 80.617 31.531L80.008 32.027L81.082 33.426Q81.219 33.601 81.326 33.709Q81.434 33.816 81.569 33.861Q81.703 33.906 81.930 33.906L81.930 34.203L80.305 34.203L80.305 33.906Q80.547 33.906 80.547 33.754Q80.547 33.676 80.504 33.605Q80.461 33.535 80.379 33.426L79.578 32.379L79.051 32.805L79.051 33.644Q79.051 33.812 79.219 33.859Q79.387 33.906 79.656 33.906L79.656 34.203M82.313 34.812Q82.313 34.531 82.524 34.320Q82.735 34.109 83.020 34.019Q82.864 33.894 82.785 33.705Q82.707 33.516 82.707 33.316Q82.707 32.961 82.938 32.668Q82.571 32.328 82.571 31.859Q82.571 31.508 82.774 31.238Q82.977 30.969 83.297 30.822Q83.617 30.676 83.961 30.676Q84.481 30.676 84.852 30.957Q85.215 30.586 85.762 30.586Q85.942 30.586 86.069 30.713Q86.196 30.840 86.196 31.019Q86.196 31.125 86.117 31.203Q86.039 31.281 85.930 31.281Q85.821 31.281 85.744 31.205Q85.668 31.129 85.668 31.019Q85.668 30.918 85.707 30.867Q85.715 30.859 85.719 30.853Q85.723 30.848 85.723 30.844Q85.348 30.844 85.028 31.098Q85.348 31.437 85.348 31.859Q85.348 32.129 85.231 32.346Q85.114 32.562 84.908 32.721Q84.703 32.879 84.461 32.961Q84.219 33.043 83.961 33.043Q83.742 33.043 83.530 32.984Q83.317 32.926 83.121 32.805Q83.028 32.945 83.028 33.125Q83.028 33.332 83.164 33.484Q83.301 33.637 83.508 33.637L84.203 33.637Q84.692 33.637 85.104 33.721Q85.516 33.805 85.795 34.062Q86.074 34.320 86.074 34.812Q86.074 35.176 85.754 35.408Q85.434 35.641 84.992 35.742Q84.551 35.844 84.196 35.844Q83.840 35.844 83.397 35.742Q82.953 35.641 82.633 35.408Q82.313 35.176 82.313 34.812M82.817 34.812Q82.817 35.008 82.961 35.156Q83.106 35.305 83.319 35.394Q83.531 35.484 83.772 35.531Q84.012 35.578 84.196 35.578Q84.438 35.578 84.768 35.500Q85.098 35.422 85.334 35.248Q85.571 35.074 85.571 34.812Q85.571 34.406 85.160 34.297Q84.750 34.187 84.188 34.187L83.508 34.187Q83.239 34.187 83.028 34.365Q82.817 34.543 82.817 34.812M83.961 32.777Q84.684 32.777 84.684 31.859Q84.684 30.937 83.961 30.937Q83.235 30.937 83.235 31.859Q83.235 32.777 83.961 32.777M88.567 34.203L86.586 34.203L86.586 33.906Q86.856 33.906 87.024 33.861Q87.192 33.816 87.192 33.644L87.192 31.508Q87.192 31.293 87.129 31.197Q87.067 31.101 86.949 31.080Q86.832 31.058 86.586 31.058L86.586 30.762L87.754 30.676L87.754 31.461Q87.832 31.250 87.985 31.064Q88.137 30.879 88.336 30.777Q88.535 30.676 88.762 30.676Q89.008 30.676 89.199 30.820Q89.391 30.965 89.391 31.195Q89.391 31.351 89.285 31.461Q89.180 31.570 89.024 31.570Q88.867 31.570 88.758 31.461Q88.649 31.351 88.649 31.195Q88.649 31.035 88.754 30.930Q88.430 30.930 88.215 31.158Q88 31.387 87.905 31.726Q87.809 32.066 87.809 32.371L87.809 33.644Q87.809 33.812 88.035 33.859Q88.262 33.906 88.567 33.906L88.567 34.203M89.871 32.508Q89.871 32.004 90.127 31.572Q90.383 31.141 90.819 30.889Q91.254 30.637 91.754 30.637Q92.141 30.637 92.483 30.781Q92.824 30.926 93.086 31.187Q93.348 31.449 93.490 31.785Q93.633 32.121 93.633 32.508Q93.633 33 93.369 33.410Q93.106 33.820 92.676 34.051Q92.246 34.281 91.754 34.281Q91.262 34.281 90.828 34.049Q90.395 33.816 90.133 33.408Q89.871 33 89.871 32.508M91.754 34.004Q92.211 34.004 92.463 33.781Q92.715 33.558 92.803 33.207Q92.891 32.855 92.891 32.410Q92.891 31.980 92.797 31.642Q92.703 31.305 92.449 31.098Q92.196 30.891 91.754 30.891Q91.106 30.891 90.862 31.307Q90.617 31.723 90.617 32.410Q90.617 32.855 90.705 33.207Q90.793 33.558 91.045 33.781Q91.297 34.004 91.754 34.004M94.801 33.250L94.801 31.508Q94.801 31.293 94.739 31.197Q94.676 31.101 94.557 31.080Q94.438 31.058 94.192 31.058L94.192 30.762L95.438 30.676L95.438 33.226L95.438 33.250Q95.438 33.562 95.492 33.724Q95.547 33.887 95.698 33.957Q95.848 34.027 96.168 34.027Q96.598 34.027 96.871 33.689Q97.145 33.351 97.145 32.906L97.145 31.508Q97.145 31.293 97.082 31.197Q97.020 31.101 96.901 31.080Q96.781 31.058 96.535 31.058L96.535 30.762L97.781 30.676L97.781 33.461Q97.781 33.672 97.844 33.767Q97.906 33.863 98.026 33.885Q98.145 33.906 98.391 33.906L98.391 34.203L97.168 34.281L97.168 33.660Q97 33.949 96.719 34.115Q96.438 34.281 96.117 34.281Q94.801 34.281 94.801 33.250M100.766 34.203L98.910 34.203L98.910 33.906Q99.184 33.906 99.352 33.859Q99.520 33.812 99.520 33.644L99.520 31.508Q99.520 31.293 99.457 31.197Q99.395 31.101 99.276 31.080Q99.156 31.058 98.910 31.058L98.910 30.762L100.102 30.676L100.102 31.410Q100.215 31.195 100.408 31.027Q100.602 30.859 100.840 30.767Q101.078 30.676 101.332 30.676Q102.500 30.676 102.500 31.754L102.500 33.644Q102.500 33.812 102.670 33.859Q102.840 33.906 103.110 33.906L103.110 34.203L101.254 34.203L101.254 33.906Q101.528 33.906 101.696 33.859Q101.864 33.812 101.864 33.644L101.864 31.769Q101.864 31.387 101.742 31.158Q101.621 30.930 101.270 30.930Q100.957 30.930 100.703 31.092Q100.449 31.254 100.303 31.523Q100.156 31.793 100.156 32.090L100.156 33.644Q100.156 33.812 100.326 33.859Q100.496 33.906 100.766 33.906L100.766 34.203M105.371 34.281Q104.891 34.281 104.483 34.037Q104.074 33.793 103.836 33.379Q103.598 32.965 103.598 32.476Q103.598 31.984 103.856 31.568Q104.114 31.152 104.545 30.914Q104.977 30.676 105.469 30.676Q106.090 30.676 106.539 31.113L106.539 29.484Q106.539 29.269 106.477 29.174Q106.414 29.078 106.297 29.057Q106.180 29.035 105.934 29.035L105.934 28.738L107.156 28.652L107.156 33.461Q107.156 33.672 107.219 33.767Q107.281 33.863 107.399 33.885Q107.516 33.906 107.766 33.906L107.766 34.203L106.516 34.281L106.516 33.797Q106.051 34.281 105.371 34.281M105.438 34.027Q105.778 34.027 106.071 33.836Q106.364 33.644 106.516 33.348L106.516 31.516Q106.367 31.242 106.106 31.086Q105.844 30.930 105.531 30.930Q104.906 30.930 104.623 31.377Q104.340 31.824 104.340 32.484Q104.340 33.129 104.592 33.578Q104.844 34.027 105.438 34.027\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-127.35 -97.585)\">\u003Cpath d=\"M113.014 35.754L111.159 35.754L111.159 35.461Q111.428 35.461 111.596 35.416Q111.764 35.371 111.764 35.195L111.764 31.371Q111.764 31.164 111.608 31.111Q111.452 31.058 111.159 31.058L111.159 30.762L112.381 30.676L112.381 31.141Q112.612 30.918 112.926 30.797Q113.241 30.676 113.581 30.676Q114.053 30.676 114.457 30.922Q114.862 31.168 115.094 31.584Q115.327 32 115.327 32.476Q115.327 32.851 115.178 33.180Q115.030 33.508 114.760 33.760Q114.491 34.012 114.147 34.146Q113.803 34.281 113.444 34.281Q113.155 34.281 112.883 34.160Q112.612 34.039 112.405 33.828L112.405 35.195Q112.405 35.371 112.573 35.416Q112.741 35.461 113.014 35.461L113.014 35.754M112.405 31.539L112.405 33.379Q112.557 33.668 112.819 33.848Q113.081 34.027 113.389 34.027Q113.674 34.027 113.897 33.889Q114.120 33.750 114.272 33.519Q114.424 33.289 114.502 33.017Q114.581 32.746 114.581 32.476Q114.581 32.144 114.456 31.787Q114.331 31.430 114.082 31.193Q113.834 30.957 113.487 30.957Q113.163 30.957 112.868 31.113Q112.573 31.269 112.405 31.539M117.764 34.203L115.932 34.203L115.932 33.906Q116.206 33.906 116.373 33.859Q116.541 33.812 116.541 33.644L116.541 29.484Q116.541 29.269 116.479 29.174Q116.416 29.078 116.297 29.057Q116.178 29.035 115.932 29.035L115.932 28.738L117.155 28.652L117.155 33.644Q117.155 33.812 117.323 33.859Q117.491 33.906 117.764 33.906L117.764 34.203M118.307 33.371Q118.307 32.887 118.709 32.592Q119.112 32.297 119.663 32.178Q120.213 32.058 120.706 32.058L120.706 31.769Q120.706 31.543 120.590 31.336Q120.475 31.129 120.278 31.010Q120.081 30.891 119.850 30.891Q119.424 30.891 119.139 30.996Q119.209 31.023 119.256 31.078Q119.303 31.133 119.329 31.203Q119.354 31.273 119.354 31.348Q119.354 31.453 119.303 31.545Q119.252 31.637 119.161 31.687Q119.069 31.738 118.963 31.738Q118.858 31.738 118.766 31.687Q118.674 31.637 118.623 31.545Q118.573 31.453 118.573 31.348Q118.573 30.930 118.961 30.783Q119.350 30.637 119.850 30.637Q120.182 30.637 120.536 30.767Q120.889 30.898 121.118 31.152Q121.346 31.406 121.346 31.754L121.346 33.555Q121.346 33.687 121.418 33.797Q121.491 33.906 121.620 33.906Q121.745 33.906 121.813 33.801Q121.881 33.695 121.881 33.555L121.881 33.043L122.163 33.043L122.163 33.555Q122.163 33.758 122.045 33.916Q121.928 34.074 121.747 34.158Q121.565 34.242 121.362 34.242Q121.131 34.242 120.979 34.070Q120.827 33.898 120.795 33.668Q120.635 33.949 120.327 34.115Q120.018 34.281 119.666 34.281Q119.155 34.281 118.731 34.058Q118.307 33.836 118.307 33.371M118.995 33.371Q118.995 33.656 119.221 33.842Q119.448 34.027 119.741 34.027Q119.987 34.027 120.211 33.910Q120.436 33.793 120.571 33.590Q120.706 33.387 120.706 33.133L120.706 32.301Q120.440 32.301 120.155 32.355Q119.870 32.410 119.598 32.539Q119.327 32.668 119.161 32.875Q118.995 33.082 118.995 33.371M124.385 34.203L122.530 34.203L122.530 33.906Q122.803 33.906 122.971 33.859Q123.139 33.812 123.139 33.644L123.139 31.508Q123.139 31.293 123.077 31.197Q123.014 31.101 122.895 31.080Q122.776 31.058 122.530 31.058L122.530 30.762L123.721 30.676L123.721 31.410Q123.834 31.195 124.028 31.027Q124.221 30.859 124.459 30.767Q124.698 30.676 124.952 30.676Q126.120 30.676 126.120 31.754L126.120 33.644Q126.120 33.812 126.289 33.859Q126.459 33.906 126.729 33.906L126.729 34.203L124.873 34.203L124.873 33.906Q125.147 33.906 125.315 33.859Q125.483 33.812 125.483 33.644L125.483 31.769Q125.483 31.387 125.362 31.158Q125.241 30.930 124.889 30.930Q124.577 30.930 124.323 31.092Q124.069 31.254 123.922 31.523Q123.776 31.793 123.776 32.090L123.776 33.644Q123.776 33.812 123.946 33.859Q124.116 33.906 124.385 33.906L124.385 34.203M129.104 34.203L127.248 34.203L127.248 33.906Q127.522 33.906 127.690 33.859Q127.858 33.812 127.858 33.644L127.858 31.508Q127.858 31.293 127.795 31.197Q127.733 31.101 127.614 31.080Q127.495 31.058 127.248 31.058L127.248 30.762L128.440 30.676L128.440 31.410Q128.553 31.195 128.747 31.027Q128.940 30.859 129.178 30.767Q129.416 30.676 129.670 30.676Q130.838 30.676 130.838 31.754L130.838 33.644Q130.838 33.812 131.008 33.859Q131.178 33.906 131.448 33.906L131.448 34.203L129.592 34.203L129.592 33.906Q129.866 33.906 130.034 33.859Q130.202 33.812 130.202 33.644L130.202 31.769Q130.202 31.387 130.081 31.158Q129.959 30.930 129.608 30.930Q129.295 30.930 129.041 31.092Q128.788 31.254 128.641 31.523Q128.495 31.793 128.495 32.090L128.495 33.644Q128.495 33.812 128.664 33.859Q128.834 33.906 129.104 33.906L129.104 34.203M133.752 34.203L131.975 34.203L131.975 33.906Q132.248 33.906 132.416 33.859Q132.584 33.812 132.584 33.644L132.584 31.508Q132.584 31.293 132.528 31.197Q132.471 31.101 132.358 31.080Q132.245 31.058 131.998 31.058L131.998 30.762L133.198 30.676L133.198 33.644Q133.198 33.812 133.344 33.859Q133.491 33.906 133.752 33.906L133.752 34.203M132.311 29.281Q132.311 29.090 132.446 28.959Q132.581 28.828 132.776 28.828Q132.897 28.828 133 28.891Q133.104 28.953 133.166 29.057Q133.229 29.160 133.229 29.281Q133.229 29.476 133.098 29.611Q132.967 29.746 132.776 29.746Q132.577 29.746 132.444 29.613Q132.311 29.480 132.311 29.281M136.182 34.203L134.327 34.203L134.327 33.906Q134.600 33.906 134.768 33.859Q134.936 33.812 134.936 33.644L134.936 31.508Q134.936 31.293 134.873 31.197Q134.811 31.101 134.692 31.080Q134.573 31.058 134.327 31.058L134.327 30.762L135.518 30.676L135.518 31.410Q135.631 31.195 135.825 31.027Q136.018 30.859 136.256 30.767Q136.495 30.676 136.748 30.676Q137.916 30.676 137.916 31.754L137.916 33.644Q137.916 33.812 138.086 33.859Q138.256 33.906 138.526 33.906L138.526 34.203L136.670 34.203L136.670 33.906Q136.944 33.906 137.112 33.859Q137.280 33.812 137.280 33.644L137.280 31.769Q137.280 31.387 137.159 31.158Q137.038 30.930 136.686 30.930Q136.373 30.930 136.120 31.092Q135.866 31.254 135.719 31.523Q135.573 31.793 135.573 32.090L135.573 33.644Q135.573 33.812 135.743 33.859Q135.913 33.906 136.182 33.906L136.182 34.203M138.971 34.812Q138.971 34.531 139.182 34.320Q139.393 34.109 139.678 34.019Q139.522 33.894 139.444 33.705Q139.366 33.516 139.366 33.316Q139.366 32.961 139.596 32.668Q139.229 32.328 139.229 31.859Q139.229 31.508 139.432 31.238Q139.635 30.969 139.956 30.822Q140.276 30.676 140.620 30.676Q141.139 30.676 141.510 30.957Q141.873 30.586 142.420 30.586Q142.600 30.586 142.727 30.713Q142.854 30.840 142.854 31.019Q142.854 31.125 142.776 31.203Q142.698 31.281 142.588 31.281Q142.479 31.281 142.403 31.205Q142.327 31.129 142.327 31.019Q142.327 30.918 142.366 30.867Q142.373 30.859 142.377 30.853Q142.381 30.848 142.381 30.844Q142.006 30.844 141.686 31.098Q142.006 31.437 142.006 31.859Q142.006 32.129 141.889 32.346Q141.772 32.562 141.567 32.721Q141.362 32.879 141.120 32.961Q140.877 33.043 140.620 33.043Q140.401 33.043 140.188 32.984Q139.975 32.926 139.780 32.805Q139.686 32.945 139.686 33.125Q139.686 33.332 139.823 33.484Q139.959 33.637 140.166 33.637L140.862 33.637Q141.350 33.637 141.762 33.721Q142.174 33.805 142.454 34.062Q142.733 34.320 142.733 34.812Q142.733 35.176 142.413 35.408Q142.092 35.641 141.651 35.742Q141.209 35.844 140.854 35.844Q140.498 35.844 140.055 35.742Q139.612 35.641 139.291 35.408Q138.971 35.176 138.971 34.812M139.475 34.812Q139.475 35.008 139.620 35.156Q139.764 35.305 139.977 35.394Q140.190 35.484 140.430 35.531Q140.670 35.578 140.854 35.578Q141.096 35.578 141.426 35.500Q141.756 35.422 141.993 35.248Q142.229 35.074 142.229 34.812Q142.229 34.406 141.819 34.297Q141.409 34.187 140.846 34.187L140.166 34.187Q139.897 34.187 139.686 34.365Q139.475 34.543 139.475 34.812M140.620 32.777Q141.342 32.777 141.342 31.859Q141.342 30.937 140.620 30.937Q139.893 30.937 139.893 31.859Q139.893 32.777 140.620 32.777\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M28.09-36.929h73.978V-65.38H28.091Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-11.215 -82.58)\">\u003Cpath d=\"M67.247 34.203L65.391 34.203L65.391 33.906Q65.665 33.906 65.833 33.859Q66.001 33.812 66.001 33.644L66.001 31.508Q66.001 31.293 65.938 31.197Q65.876 31.101 65.757 31.080Q65.638 31.058 65.391 31.058L65.391 30.762L66.583 30.676L66.583 31.410Q66.696 31.195 66.890 31.027Q67.083 30.859 67.321 30.767Q67.559 30.676 67.813 30.676Q68.774 30.676 68.950 31.387Q69.134 31.058 69.462 30.867Q69.790 30.676 70.169 30.676Q71.345 30.676 71.345 31.754L71.345 33.644Q71.345 33.812 71.513 33.859Q71.681 33.906 71.950 33.906L71.950 34.203L70.095 34.203L70.095 33.906Q70.368 33.906 70.536 33.861Q70.704 33.816 70.704 33.644L70.704 31.769Q70.704 31.383 70.579 31.156Q70.454 30.930 70.102 30.930Q69.798 30.930 69.542 31.092Q69.286 31.254 69.138 31.523Q68.989 31.793 68.989 32.090L68.989 33.644Q68.989 33.812 69.159 33.859Q69.329 33.906 69.599 33.906L69.599 34.203L67.743 34.203L67.743 33.906Q68.016 33.906 68.184 33.859Q68.352 33.812 68.352 33.644L68.352 31.769Q68.352 31.383 68.227 31.156Q68.102 30.930 67.751 30.930Q67.446 30.930 67.190 31.092Q66.934 31.254 66.786 31.523Q66.638 31.793 66.638 32.090L66.638 33.644Q66.638 33.812 66.808 33.859Q66.977 33.906 67.247 33.906L67.247 34.203M72.395 32.508Q72.395 32.004 72.651 31.572Q72.907 31.141 73.343 30.889Q73.778 30.637 74.278 30.637Q74.665 30.637 75.007 30.781Q75.349 30.926 75.610 31.187Q75.872 31.449 76.015 31.785Q76.157 32.121 76.157 32.508Q76.157 33 75.893 33.410Q75.630 33.820 75.200 34.051Q74.770 34.281 74.278 34.281Q73.786 34.281 73.352 34.049Q72.919 33.816 72.657 33.408Q72.395 33 72.395 32.508M74.278 34.004Q74.735 34.004 74.987 33.781Q75.239 33.558 75.327 33.207Q75.415 32.855 75.415 32.410Q75.415 31.980 75.321 31.642Q75.227 31.305 74.974 31.098Q74.720 30.891 74.278 30.891Q73.630 30.891 73.386 31.307Q73.141 31.723 73.141 32.410Q73.141 32.855 73.229 33.207Q73.317 33.558 73.569 33.781Q73.821 34.004 74.278 34.004\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-11.215 -82.58)\">\u003Cpath d=\"M78.704 34.281Q78.223 34.281 77.815 34.037Q77.407 33.793 77.169 33.379Q76.930 32.965 76.930 32.476Q76.930 31.984 77.188 31.568Q77.446 31.152 77.878 30.914Q78.309 30.676 78.801 30.676Q79.422 30.676 79.872 31.113L79.872 29.484Q79.872 29.269 79.809 29.174Q79.747 29.078 79.629 29.057Q79.512 29.035 79.266 29.035L79.266 28.738L80.489 28.652L80.489 33.461Q80.489 33.672 80.551 33.767Q80.614 33.863 80.731 33.885Q80.848 33.906 81.098 33.906L81.098 34.203L79.848 34.281L79.848 33.797Q79.383 34.281 78.704 34.281M78.770 34.027Q79.110 34.027 79.403 33.836Q79.696 33.644 79.848 33.348L79.848 31.516Q79.700 31.242 79.438 31.086Q79.176 30.930 78.864 30.930Q78.239 30.930 77.956 31.377Q77.672 31.824 77.672 32.484Q77.672 33.129 77.924 33.578Q78.176 34.027 78.770 34.027M81.606 32.449Q81.606 31.969 81.838 31.553Q82.071 31.137 82.481 30.887Q82.891 30.637 83.368 30.637Q84.098 30.637 84.497 31.078Q84.895 31.519 84.895 32.250Q84.895 32.355 84.801 32.379L82.352 32.379L82.352 32.449Q82.352 32.859 82.473 33.215Q82.594 33.570 82.866 33.787Q83.137 34.004 83.567 34.004Q83.930 34.004 84.227 33.775Q84.524 33.547 84.626 33.195Q84.633 33.148 84.719 33.133L84.801 33.133Q84.895 33.160 84.895 33.242Q84.895 33.250 84.887 33.281Q84.825 33.508 84.686 33.691Q84.547 33.875 84.356 34.008Q84.165 34.141 83.946 34.211Q83.727 34.281 83.489 34.281Q83.118 34.281 82.780 34.144Q82.442 34.008 82.174 33.756Q81.907 33.504 81.756 33.164Q81.606 32.824 81.606 32.449M82.360 32.141L84.321 32.141Q84.321 31.836 84.219 31.545Q84.118 31.254 83.901 31.072Q83.684 30.891 83.368 30.891Q83.067 30.891 82.837 31.078Q82.606 31.266 82.483 31.557Q82.360 31.848 82.360 32.141M87.297 34.203L85.465 34.203L85.465 33.906Q85.739 33.906 85.907 33.859Q86.075 33.812 86.075 33.644L86.075 29.484Q86.075 29.269 86.012 29.174Q85.950 29.078 85.831 29.057Q85.712 29.035 85.465 29.035L85.465 28.738L86.688 28.652L86.688 33.644Q86.688 33.812 86.856 33.859Q87.024 33.906 87.297 33.906\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M130.52-36.929h73.978V-65.38h-73.977Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(78.819 -78.83)\">\u003Cpath d=\"M65.317 25.312Q65.317 25.031 65.528 24.820Q65.739 24.609 66.024 24.519Q65.868 24.394 65.790 24.205Q65.712 24.015 65.712 23.816Q65.712 23.461 65.942 23.168Q65.575 22.828 65.575 22.359Q65.575 22.008 65.778 21.738Q65.981 21.469 66.302 21.322Q66.622 21.176 66.966 21.176Q67.485 21.176 67.856 21.457Q68.220 21.086 68.766 21.086Q68.946 21.086 69.073 21.213Q69.200 21.340 69.200 21.519Q69.200 21.625 69.122 21.703Q69.044 21.781 68.934 21.781Q68.825 21.781 68.749 21.705Q68.673 21.629 68.673 21.519Q68.673 21.418 68.712 21.367Q68.720 21.359 68.724 21.353Q68.727 21.348 68.727 21.344Q68.352 21.344 68.032 21.598Q68.352 21.937 68.352 22.359Q68.352 22.629 68.235 22.846Q68.118 23.062 67.913 23.221Q67.708 23.379 67.466 23.461Q67.224 23.543 66.966 23.543Q66.747 23.543 66.534 23.484Q66.321 23.426 66.126 23.305Q66.032 23.445 66.032 23.625Q66.032 23.832 66.169 23.984Q66.306 24.137 66.513 24.137L67.208 24.137Q67.696 24.137 68.108 24.221Q68.520 24.305 68.800 24.562Q69.079 24.820 69.079 25.312Q69.079 25.676 68.759 25.908Q68.438 26.140 67.997 26.242Q67.556 26.344 67.200 26.344Q66.845 26.344 66.401 26.242Q65.958 26.140 65.638 25.908Q65.317 25.676 65.317 25.312M65.821 25.312Q65.821 25.508 65.966 25.656Q66.110 25.805 66.323 25.894Q66.536 25.984 66.776 26.031Q67.016 26.078 67.200 26.078Q67.442 26.078 67.772 26Q68.102 25.922 68.339 25.748Q68.575 25.574 68.575 25.312Q68.575 24.906 68.165 24.797Q67.755 24.687 67.192 24.687L66.513 24.687Q66.243 24.687 66.032 24.865Q65.821 25.043 65.821 25.312M66.966 23.277Q67.688 23.277 67.688 22.359Q67.688 21.437 66.966 21.437Q66.239 21.437 66.239 22.359Q66.239 23.277 66.966 23.277M71.477 24.703L69.645 24.703L69.645 24.406Q69.919 24.406 70.087 24.359Q70.255 24.312 70.255 24.144L70.255 19.984Q70.255 19.769 70.192 19.674Q70.130 19.578 70.011 19.557Q69.891 19.535 69.645 19.535L69.645 19.238L70.868 19.152L70.868 24.144Q70.868 24.312 71.036 24.359Q71.204 24.406 71.477 24.406L71.477 24.703M71.923 23.008Q71.923 22.504 72.179 22.072Q72.434 21.640 72.870 21.389Q73.306 21.137 73.806 21.137Q74.192 21.137 74.534 21.281Q74.876 21.426 75.138 21.687Q75.399 21.949 75.542 22.285Q75.684 22.621 75.684 23.008Q75.684 23.500 75.421 23.910Q75.157 24.320 74.727 24.551Q74.298 24.781 73.806 24.781Q73.313 24.781 72.880 24.549Q72.446 24.316 72.184 23.908Q71.923 23.500 71.923 23.008M73.806 24.504Q74.263 24.504 74.515 24.281Q74.766 24.058 74.854 23.707Q74.942 23.355 74.942 22.910Q74.942 22.480 74.849 22.142Q74.755 21.805 74.501 21.598Q74.247 21.390 73.806 21.390Q73.157 21.390 72.913 21.807Q72.669 22.223 72.669 22.910Q72.669 23.355 72.757 23.707Q72.845 24.058 73.097 24.281Q73.349 24.504 73.806 24.504M77.083 24.703L76.802 24.703L76.802 19.984Q76.802 19.769 76.739 19.674Q76.677 19.578 76.559 19.557Q76.442 19.535 76.196 19.535L76.196 19.238L77.419 19.152L77.419 21.640Q77.895 21.176 78.595 21.176Q79.075 21.176 79.483 21.420Q79.891 21.664 80.128 22.078Q80.364 22.492 80.364 22.976Q80.364 23.351 80.216 23.680Q80.067 24.008 79.798 24.260Q79.528 24.512 79.184 24.646Q78.841 24.781 78.481 24.781Q78.161 24.781 77.862 24.633Q77.563 24.484 77.356 24.223L77.083 24.703M77.442 22.031L77.442 23.871Q77.595 24.168 77.854 24.348Q78.114 24.527 78.427 24.527Q78.852 24.527 79.120 24.308Q79.388 24.090 79.503 23.744Q79.618 23.398 79.618 22.976Q79.618 22.328 79.370 21.879Q79.122 21.430 78.524 21.430Q78.188 21.430 77.899 21.588Q77.610 21.746 77.442 22.031M80.985 23.871Q80.985 23.387 81.388 23.092Q81.790 22.797 82.341 22.678Q82.891 22.558 83.384 22.558L83.384 22.269Q83.384 22.043 83.268 21.836Q83.153 21.629 82.956 21.510Q82.759 21.390 82.528 21.390Q82.102 21.390 81.817 21.496Q81.888 21.523 81.934 21.578Q81.981 21.633 82.007 21.703Q82.032 21.773 82.032 21.848Q82.032 21.953 81.981 22.045Q81.931 22.137 81.839 22.187Q81.747 22.238 81.641 22.238Q81.536 22.238 81.444 22.187Q81.352 22.137 81.302 22.045Q81.251 21.953 81.251 21.848Q81.251 21.430 81.640 21.283Q82.028 21.137 82.528 21.137Q82.860 21.137 83.214 21.267Q83.567 21.398 83.796 21.652Q84.024 21.906 84.024 22.254L84.024 24.055Q84.024 24.187 84.097 24.297Q84.169 24.406 84.298 24.406Q84.423 24.406 84.491 24.301Q84.559 24.195 84.559 24.055L84.559 23.543L84.841 23.543L84.841 24.055Q84.841 24.258 84.724 24.416Q84.606 24.574 84.425 24.658Q84.243 24.742 84.040 24.742Q83.809 24.742 83.657 24.570Q83.505 24.398 83.474 24.168Q83.313 24.449 83.005 24.615Q82.696 24.781 82.345 24.781Q81.833 24.781 81.409 24.558Q80.985 24.336 80.985 23.871M81.673 23.871Q81.673 24.156 81.899 24.342Q82.126 24.527 82.419 24.527Q82.665 24.527 82.890 24.410Q83.114 24.293 83.249 24.090Q83.384 23.887 83.384 23.633L83.384 22.801Q83.118 22.801 82.833 22.855Q82.548 22.910 82.276 23.039Q82.005 23.168 81.839 23.375Q81.673 23.582 81.673 23.871M87.048 24.703L85.216 24.703L85.216 24.406Q85.489 24.406 85.657 24.359Q85.825 24.312 85.825 24.144L85.825 19.984Q85.825 19.769 85.763 19.674Q85.700 19.578 85.581 19.557Q85.462 19.535 85.216 19.535L85.216 19.238L86.438 19.152L86.438 24.144Q86.438 24.312 86.606 24.359Q86.774 24.406 87.048 24.406\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(78.819 -78.83)\">\u003Cpath d=\"M92.229 26.254L90.374 26.254L90.374 25.961Q90.643 25.961 90.811 25.916Q90.979 25.871 90.979 25.695L90.979 21.871Q90.979 21.664 90.823 21.611Q90.667 21.558 90.374 21.558L90.374 21.262L91.596 21.176L91.596 21.640Q91.827 21.418 92.141 21.297Q92.456 21.176 92.796 21.176Q93.268 21.176 93.672 21.422Q94.077 21.668 94.309 22.084Q94.542 22.500 94.542 22.976Q94.542 23.351 94.393 23.680Q94.245 24.008 93.975 24.260Q93.706 24.512 93.362 24.646Q93.018 24.781 92.659 24.781Q92.370 24.781 92.098 24.660Q91.827 24.539 91.620 24.328L91.620 25.695Q91.620 25.871 91.788 25.916Q91.956 25.961 92.229 25.961L92.229 26.254M91.620 22.039L91.620 23.879Q91.772 24.168 92.034 24.348Q92.296 24.527 92.604 24.527Q92.889 24.527 93.112 24.389Q93.335 24.250 93.487 24.019Q93.639 23.789 93.717 23.517Q93.796 23.246 93.796 22.976Q93.796 22.644 93.671 22.287Q93.546 21.930 93.297 21.693Q93.049 21.457 92.702 21.457Q92.378 21.457 92.083 21.613Q91.788 21.769 91.620 22.039\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(78.819 -78.83)\">\u003Cpath d=\"M95.304 23.008Q95.304 22.504 95.560 22.072Q95.816 21.640 96.252 21.389Q96.687 21.137 97.187 21.137Q97.574 21.137 97.916 21.281Q98.257 21.426 98.519 21.687Q98.781 21.949 98.923 22.285Q99.066 22.621 99.066 23.008Q99.066 23.500 98.802 23.910Q98.539 24.320 98.109 24.551Q97.679 24.781 97.187 24.781Q96.695 24.781 96.261 24.549Q95.828 24.316 95.566 23.908Q95.304 23.500 95.304 23.008M97.187 24.504Q97.644 24.504 97.896 24.281Q98.148 24.058 98.236 23.707Q98.324 23.355 98.324 22.910Q98.324 22.480 98.230 22.142Q98.136 21.805 97.882 21.598Q97.629 21.390 97.187 21.390Q96.539 21.390 96.295 21.807Q96.050 22.223 96.050 22.910Q96.050 23.355 96.138 23.707Q96.226 24.058 96.478 24.281Q96.730 24.504 97.187 24.504M101.464 24.703L99.632 24.703L99.632 24.406Q99.906 24.406 100.074 24.359Q100.242 24.312 100.242 24.144L100.242 19.984Q100.242 19.769 100.179 19.674Q100.117 19.578 99.998 19.557Q99.879 19.535 99.632 19.535L99.632 19.238L100.855 19.152L100.855 24.144Q100.855 24.312 101.023 24.359Q101.191 24.406 101.464 24.406L101.464 24.703M103.769 24.703L101.992 24.703L101.992 24.406Q102.265 24.406 102.433 24.359Q102.601 24.312 102.601 24.144L102.601 22.008Q102.601 21.793 102.545 21.697Q102.488 21.601 102.375 21.580Q102.261 21.558 102.015 21.558L102.015 21.262L103.214 21.176L103.214 24.144Q103.214 24.312 103.361 24.359Q103.507 24.406 103.769 24.406L103.769 24.703M102.328 19.781Q102.328 19.590 102.462 19.459Q102.597 19.328 102.793 19.328Q102.914 19.328 103.017 19.390Q103.121 19.453 103.183 19.557Q103.246 19.660 103.246 19.781Q103.246 19.976 103.115 20.111Q102.984 20.246 102.793 20.246Q102.593 20.246 102.461 20.113Q102.328 19.980 102.328 19.781M104.312 22.976Q104.312 22.480 104.562 22.055Q104.812 21.629 105.232 21.383Q105.652 21.137 106.152 21.137Q106.691 21.137 107.082 21.262Q107.472 21.387 107.472 21.801Q107.472 21.906 107.421 21.998Q107.371 22.090 107.279 22.140Q107.187 22.191 107.078 22.191Q106.972 22.191 106.880 22.140Q106.789 22.090 106.738 21.998Q106.687 21.906 106.687 21.801Q106.687 21.578 106.855 21.473Q106.632 21.414 106.160 21.414Q105.863 21.414 105.648 21.553Q105.433 21.691 105.302 21.922Q105.171 22.152 105.113 22.422Q105.054 22.691 105.054 22.976Q105.054 23.371 105.187 23.721Q105.320 24.070 105.591 24.287Q105.863 24.504 106.261 24.504Q106.636 24.504 106.912 24.287Q107.187 24.070 107.289 23.711Q107.304 23.648 107.367 23.648L107.472 23.648Q107.507 23.648 107.533 23.676Q107.558 23.703 107.558 23.742L107.558 23.765Q107.425 24.246 107.041 24.514Q106.656 24.781 106.152 24.781Q105.789 24.781 105.455 24.644Q105.121 24.508 104.861 24.258Q104.601 24.008 104.457 23.672Q104.312 23.336 104.312 22.976M108.464 26Q108.578 26.078 108.754 26.078Q109.043 26.078 109.263 25.865Q109.484 25.652 109.609 25.351L109.898 24.703L108.625 21.816Q108.543 21.640 108.398 21.596Q108.254 21.551 107.984 21.551L107.984 21.254L109.703 21.254L109.703 21.551Q109.281 21.551 109.281 21.734Q109.281 21.746 109.296 21.816L110.234 23.941L111.066 22.031Q111.105 21.941 111.105 21.863Q111.105 21.723 111.004 21.637Q110.902 21.551 110.761 21.551L110.761 21.254L112.113 21.254L112.113 21.551Q111.859 21.551 111.666 21.676Q111.472 21.801 111.367 22.031L109.921 25.351Q109.808 25.605 109.642 25.828Q109.476 26.051 109.248 26.193Q109.019 26.336 108.754 26.336Q108.457 26.336 108.216 26.144Q107.976 25.953 107.976 25.664Q107.976 25.508 108.082 25.406Q108.187 25.305 108.336 25.305Q108.441 25.305 108.521 25.351Q108.601 25.398 108.648 25.476Q108.695 25.555 108.695 25.664Q108.695 25.785 108.634 25.873Q108.574 25.961 108.464 26\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(78.819 -78.83)\">\u003Cpath d=\"M78.794 36.195Q78.181 35.738 77.779 35.103Q77.376 34.469 77.181 33.723Q76.986 32.976 76.986 32.203Q76.986 31.430 77.181 30.683Q77.376 29.937 77.779 29.303Q78.181 28.668 78.794 28.211Q78.806 28.207 78.814 28.205Q78.822 28.203 78.833 28.203L78.911 28.203Q78.950 28.203 78.976 28.230Q79.001 28.258 79.001 28.301Q79.001 28.351 78.970 28.371Q78.462 28.824 78.140 29.447Q77.818 30.070 77.677 30.766Q77.536 31.461 77.536 32.203Q77.536 32.937 77.675 33.637Q77.814 34.336 78.138 34.961Q78.462 35.586 78.970 36.035Q79.001 36.055 79.001 36.105Q79.001 36.148 78.976 36.176Q78.950 36.203 78.911 36.203L78.833 36.203Q78.825 36.199 78.816 36.197Q78.806 36.195 78.794 36.195M80.345 33.242L80.345 31.051L79.642 31.051L79.642 30.797Q79.997 30.797 80.240 30.564Q80.482 30.332 80.593 29.984Q80.704 29.637 80.704 29.281L80.986 29.281L80.986 30.754L82.161 30.754L82.161 31.051L80.986 31.051L80.986 33.226Q80.986 33.547 81.105 33.775Q81.224 34.004 81.505 34.004Q81.685 34.004 81.802 33.881Q81.919 33.758 81.972 33.578Q82.025 33.398 82.025 33.226L82.025 32.754L82.306 32.754L82.306 33.242Q82.306 33.496 82.200 33.736Q82.095 33.976 81.898 34.129Q81.700 34.281 81.443 34.281Q81.126 34.281 80.874 34.158Q80.622 34.035 80.484 33.801Q80.345 33.566 80.345 33.242M83.122 33.371Q83.122 32.887 83.525 32.592Q83.927 32.297 84.478 32.178Q85.029 32.058 85.521 32.058L85.521 31.769Q85.521 31.543 85.406 31.336Q85.290 31.129 85.093 31.010Q84.896 30.891 84.665 30.891Q84.240 30.891 83.954 30.996Q84.025 31.023 84.072 31.078Q84.118 31.133 84.144 31.203Q84.169 31.273 84.169 31.348Q84.169 31.453 84.118 31.545Q84.068 31.637 83.976 31.687Q83.884 31.738 83.779 31.738Q83.673 31.738 83.581 31.687Q83.490 31.637 83.439 31.545Q83.388 31.453 83.388 31.348Q83.388 30.930 83.777 30.783Q84.165 30.637 84.665 30.637Q84.997 30.637 85.351 30.767Q85.704 30.898 85.933 31.152Q86.161 31.406 86.161 31.754L86.161 33.555Q86.161 33.687 86.234 33.797Q86.306 33.906 86.435 33.906Q86.560 33.906 86.628 33.801Q86.697 33.695 86.697 33.555L86.697 33.043L86.978 33.043L86.978 33.555Q86.978 33.758 86.861 33.916Q86.743 34.074 86.562 34.158Q86.380 34.242 86.177 34.242Q85.947 34.242 85.794 34.070Q85.642 33.898 85.611 33.668Q85.450 33.949 85.142 34.115Q84.833 34.281 84.482 34.281Q83.970 34.281 83.546 34.058Q83.122 33.836 83.122 33.371M83.810 33.371Q83.810 33.656 84.036 33.842Q84.263 34.027 84.556 34.027Q84.802 34.027 85.027 33.910Q85.251 33.793 85.386 33.590Q85.521 33.387 85.521 33.133L85.521 32.301Q85.255 32.301 84.970 32.355Q84.685 32.410 84.413 32.539Q84.142 32.668 83.976 32.875Q83.810 33.082 83.810 33.371M88.185 34.203L87.904 34.203L87.904 29.484Q87.904 29.269 87.841 29.174Q87.779 29.078 87.661 29.057Q87.544 29.035 87.298 29.035L87.298 28.738L88.521 28.652L88.521 31.141Q88.997 30.676 89.697 30.676Q90.177 30.676 90.585 30.920Q90.993 31.164 91.230 31.578Q91.466 31.992 91.466 32.476Q91.466 32.851 91.318 33.180Q91.169 33.508 90.900 33.760Q90.630 34.012 90.286 34.146Q89.943 34.281 89.583 34.281Q89.263 34.281 88.964 34.133Q88.665 33.984 88.458 33.723L88.185 34.203M88.544 31.531L88.544 33.371Q88.697 33.668 88.956 33.848Q89.216 34.027 89.529 34.027Q89.954 34.027 90.222 33.808Q90.490 33.590 90.605 33.244Q90.720 32.898 90.720 32.476Q90.720 31.828 90.472 31.379Q90.224 30.930 89.626 30.930Q89.290 30.930 89.001 31.088Q88.712 31.246 88.544 31.531M93.904 34.203L92.072 34.203L92.072 33.906Q92.345 33.906 92.513 33.859Q92.681 33.812 92.681 33.644L92.681 29.484Q92.681 29.269 92.618 29.174Q92.556 29.078 92.437 29.057Q92.318 29.035 92.072 29.035L92.072 28.738L93.294 28.652L93.294 33.644Q93.294 33.812 93.462 33.859Q93.630 33.906 93.904 33.906L93.904 34.203M94.349 32.449Q94.349 31.969 94.581 31.553Q94.814 31.137 95.224 30.887Q95.634 30.637 96.111 30.637Q96.841 30.637 97.240 31.078Q97.638 31.519 97.638 32.250Q97.638 32.355 97.544 32.379L95.095 32.379L95.095 32.449Q95.095 32.859 95.216 33.215Q95.337 33.570 95.609 33.787Q95.880 34.004 96.310 34.004Q96.673 34.004 96.970 33.775Q97.267 33.547 97.368 33.195Q97.376 33.148 97.462 33.133L97.544 33.133Q97.638 33.160 97.638 33.242Q97.638 33.250 97.630 33.281Q97.568 33.508 97.429 33.691Q97.290 33.875 97.099 34.008Q96.907 34.141 96.689 34.211Q96.470 34.281 96.232 34.281Q95.861 34.281 95.523 34.144Q95.185 34.008 94.917 33.756Q94.650 33.504 94.499 33.164Q94.349 32.824 94.349 32.449M95.103 32.141L97.064 32.141Q97.064 31.836 96.962 31.545Q96.861 31.254 96.644 31.072Q96.427 30.891 96.111 30.891Q95.810 30.891 95.579 31.078Q95.349 31.266 95.226 31.557Q95.103 31.848 95.103 32.141M98.529 36.203L98.447 36.203Q98.411 36.203 98.386 36.174Q98.361 36.144 98.361 36.105Q98.361 36.055 98.392 36.035Q98.779 35.699 99.062 35.250Q99.345 34.801 99.511 34.301Q99.677 33.801 99.751 33.283Q99.825 32.766 99.825 32.203Q99.825 31.633 99.751 31.117Q99.677 30.601 99.511 30.105Q99.345 29.609 99.066 29.162Q98.786 28.715 98.392 28.371Q98.361 28.351 98.361 28.301Q98.361 28.262 98.386 28.232Q98.411 28.203 98.447 28.203L98.529 28.203Q98.540 28.203 98.550 28.205Q98.560 28.207 98.568 28.211Q99.181 28.668 99.583 29.303Q99.986 29.937 100.181 30.683Q100.376 31.430 100.376 32.203Q100.376 32.976 100.181 33.723Q99.986 34.469 99.583 35.103Q99.181 35.738 98.568 36.195Q98.556 36.195 98.548 36.197Q98.540 36.199 98.529 36.203\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"var(--tk-accent)\">\u003Cpath fill=\"none\" d=\"M244.332-36.929h73.977V-65.38h-73.977Z\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\">\u003Cg transform=\"translate(199.784 -78.83)\">\u003Cpath d=\"M65.360 24.695L65.360 23.473Q65.360 23.445 65.391 23.414Q65.423 23.383 65.446 23.383L65.552 23.383Q65.622 23.383 65.638 23.445Q65.700 23.765 65.839 24.006Q65.977 24.246 66.210 24.387Q66.442 24.527 66.751 24.527Q66.989 24.527 67.198 24.467Q67.407 24.406 67.544 24.258Q67.681 24.109 67.681 23.863Q67.681 23.609 67.470 23.443Q67.259 23.277 66.989 23.223L66.368 23.109Q65.962 23.031 65.661 22.775Q65.360 22.519 65.360 22.144Q65.360 21.777 65.561 21.555Q65.763 21.332 66.087 21.234Q66.411 21.137 66.751 21.137Q67.216 21.137 67.513 21.344L67.735 21.160Q67.759 21.137 67.790 21.137L67.841 21.137Q67.872 21.137 67.899 21.164Q67.927 21.191 67.927 21.223L67.927 22.207Q67.927 22.238 67.901 22.267Q67.876 22.297 67.841 22.297L67.735 22.297Q67.700 22.297 67.673 22.269Q67.645 22.242 67.645 22.207Q67.645 21.808 67.393 21.588Q67.141 21.367 66.743 21.367Q66.388 21.367 66.104 21.490Q65.821 21.613 65.821 21.918Q65.821 22.137 66.022 22.269Q66.224 22.402 66.470 22.445L67.095 22.558Q67.524 22.648 67.833 22.945Q68.141 23.242 68.141 23.656Q68.141 24.226 67.743 24.504Q67.345 24.781 66.751 24.781Q66.200 24.781 65.849 24.445L65.552 24.758Q65.528 24.781 65.493 24.781L65.446 24.781Q65.423 24.781 65.391 24.750Q65.360 24.719 65.360 24.695M68.669 22.949Q68.669 22.469 68.901 22.053Q69.134 21.637 69.544 21.387Q69.954 21.137 70.431 21.137Q71.161 21.137 71.559 21.578Q71.958 22.019 71.958 22.750Q71.958 22.855 71.864 22.879L69.415 22.879L69.415 22.949Q69.415 23.359 69.536 23.715Q69.657 24.070 69.929 24.287Q70.200 24.504 70.630 24.504Q70.993 24.504 71.290 24.275Q71.587 24.047 71.688 23.695Q71.696 23.648 71.782 23.633L71.864 23.633Q71.958 23.660 71.958 23.742Q71.958 23.750 71.950 23.781Q71.888 24.008 71.749 24.191Q71.610 24.375 71.419 24.508Q71.227 24.640 71.009 24.711Q70.790 24.781 70.552 24.781Q70.181 24.781 69.843 24.644Q69.505 24.508 69.237 24.256Q68.970 24.004 68.819 23.664Q68.669 23.324 68.669 22.949M69.423 22.640L71.384 22.640Q71.384 22.336 71.282 22.045Q71.181 21.754 70.964 21.572Q70.747 21.390 70.431 21.390Q70.130 21.390 69.899 21.578Q69.669 21.765 69.546 22.057Q69.423 22.348 69.423 22.640M74.360 24.703L72.528 24.703L72.528 24.406Q72.802 24.406 72.970 24.359Q73.138 24.312 73.138 24.144L73.138 19.984Q73.138 19.769 73.075 19.674Q73.013 19.578 72.893 19.557Q72.774 19.535 72.528 19.535L72.528 19.238L73.751 19.152L73.751 24.144Q73.751 24.312 73.919 24.359Q74.087 24.406 74.360 24.406L74.360 24.703M74.806 22.949Q74.806 22.469 75.038 22.053Q75.270 21.637 75.681 21.387Q76.091 21.137 76.567 21.137Q77.298 21.137 77.696 21.578Q78.095 22.019 78.095 22.750Q78.095 22.855 78.001 22.879L75.552 22.879L75.552 22.949Q75.552 23.359 75.673 23.715Q75.794 24.070 76.065 24.287Q76.337 24.504 76.766 24.504Q77.130 24.504 77.427 24.275Q77.724 24.047 77.825 23.695Q77.833 23.648 77.919 23.633L78.001 23.633Q78.095 23.660 78.095 23.742Q78.095 23.750 78.087 23.781Q78.024 24.008 77.886 24.191Q77.747 24.375 77.556 24.508Q77.364 24.640 77.145 24.711Q76.927 24.781 76.688 24.781Q76.317 24.781 75.979 24.644Q75.641 24.508 75.374 24.256Q75.106 24.004 74.956 23.664Q74.806 23.324 74.806 22.949M75.559 22.640L77.520 22.640Q77.520 22.336 77.419 22.045Q77.317 21.754 77.100 21.572Q76.884 21.390 76.567 21.390Q76.266 21.390 76.036 21.578Q75.806 21.765 75.683 22.057Q75.559 22.348 75.559 22.640M78.626 22.976Q78.626 22.480 78.876 22.055Q79.126 21.629 79.546 21.383Q79.966 21.137 80.466 21.137Q81.005 21.137 81.395 21.262Q81.786 21.387 81.786 21.801Q81.786 21.906 81.735 21.998Q81.684 22.090 81.593 22.140Q81.501 22.191 81.391 22.191Q81.286 22.191 81.194 22.140Q81.102 22.090 81.052 21.998Q81.001 21.906 81.001 21.801Q81.001 21.578 81.169 21.473Q80.946 21.414 80.474 21.414Q80.177 21.414 79.962 21.553Q79.747 21.691 79.616 21.922Q79.485 22.152 79.427 22.422Q79.368 22.691 79.368 22.976Q79.368 23.371 79.501 23.721Q79.634 24.070 79.905 24.287Q80.177 24.504 80.575 24.504Q80.950 24.504 81.225 24.287Q81.501 24.070 81.602 23.711Q81.618 23.648 81.681 23.648L81.786 23.648Q81.821 23.648 81.847 23.676Q81.872 23.703 81.872 23.742L81.872 23.765Q81.739 24.246 81.354 24.514Q80.970 24.781 80.466 24.781Q80.102 24.781 79.768 24.644Q79.434 24.508 79.175 24.258Q78.915 24.008 78.770 23.672Q78.626 23.336 78.626 22.976M82.985 23.742L82.985 21.551L82.282 21.551L82.282 21.297Q82.638 21.297 82.880 21.064Q83.122 20.832 83.233 20.484Q83.345 20.137 83.345 19.781L83.626 19.781L83.626 21.254L84.802 21.254L84.802 21.551L83.626 21.551L83.626 23.726Q83.626 24.047 83.745 24.275Q83.864 24.504 84.145 24.504Q84.325 24.504 84.442 24.381Q84.559 24.258 84.612 24.078Q84.665 23.898 84.665 23.726L84.665 23.254L84.946 23.254L84.946 23.742Q84.946 23.996 84.841 24.236Q84.735 24.476 84.538 24.629Q84.341 24.781 84.083 24.781Q83.766 24.781 83.515 24.658Q83.263 24.535 83.124 24.301Q82.985 24.066 82.985 23.742\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.784 -78.83)\">\u003Cpath d=\"M90.235 24.703L88.672 24.703Q88.633 24.703 88.606 24.662Q88.579 24.621 88.579 24.574L88.602 24.473Q88.645 24.414 88.700 24.406Q89.024 24.406 89.266 24.262Q89.411 24.176 89.528 24.023Q89.645 23.871 89.692 23.832L92.641 19.101Q92.707 18.992 92.832 18.992L92.914 18.992Q93.028 18.992 93.051 19.101L93.692 24.246Q93.746 24.406 94.289 24.406Q94.387 24.437 94.387 24.527L94.364 24.633Q94.329 24.691 94.266 24.703L92.266 24.703Q92.231 24.703 92.200 24.662Q92.168 24.621 92.168 24.574L92.196 24.473Q92.227 24.418 92.289 24.406Q92.883 24.406 92.914 24.199L92.754 22.894L90.594 22.894L89.938 23.933Q89.930 23.980 89.899 24.053Q89.868 24.125 89.868 24.168Q89.868 24.301 89.987 24.353Q90.106 24.406 90.250 24.406Q90.344 24.437 90.344 24.527L90.321 24.633Q90.289 24.691 90.235 24.703M92.395 20.015L90.778 22.598L92.715 22.598\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.784 -78.83)\">\u003Cpath d=\"M95.304 25.187Q95.304 25.114 95.324 25.050L95.743 23.374L95.034 23.374Q94.999 23.374 94.976 23.340Q94.952 23.307 94.952 23.274Q94.973 23.186 94.986 23.156Q94.999 23.125 95.052 23.116L95.802 23.116L96.042 22.176Q96.069 22.073 96.152 22.013Q96.236 21.953 96.332 21.953Q96.423 21.953 96.487 22.010Q96.552 22.067 96.552 22.158Q96.552 22.179 96.550 22.190Q96.549 22.202 96.546 22.217L96.318 23.116L97.015 23.116Q97.050 23.116 97.075 23.148Q97.100 23.181 97.100 23.219Q97.079 23.304 97.065 23.334Q97.050 23.365 96.997 23.374L96.253 23.374L95.834 25.067Q95.808 25.149 95.808 25.258Q95.808 25.378 95.859 25.463Q95.910 25.548 96.019 25.548Q96.209 25.548 96.378 25.435Q96.546 25.322 96.671 25.154Q96.795 24.985 96.865 24.809Q96.877 24.780 96.930 24.754L97.027 24.754Q97.106 24.783 97.106 24.839Q97.106 24.845 97.100 24.874Q97.032 25.041 96.920 25.205Q96.807 25.369 96.665 25.492Q96.523 25.615 96.353 25.688Q96.183 25.762 96.007 25.762Q95.726 25.762 95.515 25.608Q95.304 25.454 95.304 25.187\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.784 -78.83)\">\u003Cpath d=\"M68.334 36.195Q67.721 35.738 67.319 35.103Q66.916 34.469 66.721 33.723Q66.526 32.976 66.526 32.203Q66.526 31.430 66.721 30.683Q66.916 29.937 67.319 29.303Q67.721 28.668 68.334 28.211Q68.346 28.207 68.354 28.205Q68.362 28.203 68.373 28.203L68.451 28.203Q68.490 28.203 68.516 28.230Q68.541 28.258 68.541 28.301Q68.541 28.351 68.510 28.371Q68.002 28.824 67.680 29.447Q67.358 30.070 67.217 30.766Q67.076 31.461 67.076 32.203Q67.076 32.937 67.215 33.637Q67.354 34.336 67.678 34.961Q68.002 35.586 68.510 36.035Q68.541 36.055 68.541 36.105Q68.541 36.148 68.516 36.176Q68.490 36.203 68.451 36.203L68.373 36.203Q68.365 36.199 68.356 36.197Q68.346 36.195 68.334 36.195M71.174 34.203L69.342 34.203L69.342 33.906Q69.615 33.906 69.783 33.859Q69.951 33.812 69.951 33.644L69.951 29.484Q69.951 29.269 69.889 29.174Q69.826 29.078 69.707 29.057Q69.588 29.035 69.342 29.035L69.342 28.738L70.565 28.652L70.565 33.644Q70.565 33.812 70.733 33.859Q70.901 33.906 71.174 33.906L71.174 34.203M71.619 32.508Q71.619 32.004 71.875 31.572Q72.131 31.141 72.567 30.889Q73.002 30.637 73.502 30.637Q73.889 30.637 74.231 30.781Q74.572 30.926 74.834 31.187Q75.096 31.449 75.238 31.785Q75.381 32.121 75.381 32.508Q75.381 33 75.117 33.410Q74.854 33.820 74.424 34.051Q73.994 34.281 73.502 34.281Q73.010 34.281 72.576 34.049Q72.143 33.816 71.881 33.408Q71.619 33 71.619 32.508M73.502 34.004Q73.959 34.004 74.211 33.781Q74.463 33.558 74.551 33.207Q74.639 32.855 74.639 32.410Q74.639 31.980 74.545 31.642Q74.451 31.305 74.197 31.098Q73.944 30.891 73.502 30.891Q72.854 30.891 72.610 31.307Q72.365 31.723 72.365 32.410Q72.365 32.855 72.453 33.207Q72.541 33.558 72.793 33.781Q73.045 34.004 73.502 34.004\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.784 -78.83)\">\u003Cpath d=\"M76.108 32.508Q76.108 32.004 76.364 31.572Q76.620 31.141 77.056 30.889Q77.491 30.637 77.991 30.637Q78.378 30.637 78.720 30.781Q79.061 30.926 79.323 31.187Q79.585 31.449 79.727 31.785Q79.870 32.121 79.870 32.508Q79.870 33 79.606 33.410Q79.343 33.820 78.913 34.051Q78.483 34.281 77.991 34.281Q77.499 34.281 77.065 34.049Q76.632 33.816 76.370 33.408Q76.108 33 76.108 32.508M77.991 34.004Q78.448 34.004 78.700 33.781Q78.952 33.558 79.040 33.207Q79.128 32.855 79.128 32.410Q79.128 31.980 79.034 31.642Q78.940 31.305 78.686 31.098Q78.433 30.891 77.991 30.891Q77.343 30.891 77.099 31.307Q76.854 31.723 76.854 32.410Q76.854 32.855 76.942 33.207Q77.030 33.558 77.282 33.781Q77.534 34.004 77.991 34.004M82.179 34.203L80.382 34.203L80.382 33.906Q80.651 33.906 80.819 33.861Q80.987 33.816 80.987 33.644L80.987 29.484Q80.987 29.269 80.925 29.174Q80.862 29.078 80.745 29.057Q80.628 29.035 80.382 29.035L80.382 28.738L81.604 28.652L81.604 32.418L82.702 31.531Q82.909 31.351 82.909 31.203Q82.909 31.137 82.856 31.094Q82.804 31.051 82.733 31.051L82.733 30.754L84.268 30.754L84.268 31.051Q83.737 31.051 83.140 31.531L82.530 32.027L83.604 33.426Q83.741 33.601 83.849 33.709Q83.956 33.816 84.091 33.861Q84.225 33.906 84.452 33.906L84.452 34.203L82.827 34.203L82.827 33.906Q83.069 33.906 83.069 33.754Q83.069 33.676 83.026 33.605Q82.983 33.535 82.901 33.426L82.100 32.379L81.573 32.805L81.573 33.644Q81.573 33.812 81.741 33.859Q81.909 33.906 82.179 33.906L82.179 34.203M85.518 33.250L85.518 31.508Q85.518 31.293 85.456 31.197Q85.393 31.101 85.274 31.080Q85.155 31.058 84.909 31.058L84.909 30.762L86.155 30.676L86.155 33.226L86.155 33.250Q86.155 33.562 86.210 33.724Q86.265 33.887 86.415 33.957Q86.565 34.027 86.886 34.027Q87.315 34.027 87.589 33.689Q87.862 33.351 87.862 32.906L87.862 31.508Q87.862 31.293 87.800 31.197Q87.737 31.101 87.618 31.080Q87.499 31.058 87.253 31.058L87.253 30.762L88.499 30.676L88.499 33.461Q88.499 33.672 88.561 33.767Q88.624 33.863 88.743 33.885Q88.862 33.906 89.108 33.906L89.108 34.203L87.886 34.281L87.886 33.660Q87.718 33.949 87.436 34.115Q87.155 34.281 86.835 34.281Q85.518 34.281 85.518 33.250M91.436 35.754L89.581 35.754L89.581 35.461Q89.850 35.461 90.018 35.416Q90.186 35.371 90.186 35.195L90.186 31.371Q90.186 31.164 90.030 31.111Q89.874 31.058 89.581 31.058L89.581 30.762L90.804 30.676L90.804 31.141Q91.034 30.918 91.349 30.797Q91.663 30.676 92.003 30.676Q92.475 30.676 92.880 30.922Q93.284 31.168 93.516 31.584Q93.749 32 93.749 32.476Q93.749 32.851 93.600 33.180Q93.452 33.508 93.183 33.760Q92.913 34.012 92.569 34.146Q92.225 34.281 91.866 34.281Q91.577 34.281 91.306 34.160Q91.034 34.039 90.827 33.828L90.827 35.195Q90.827 35.371 90.995 35.416Q91.163 35.461 91.436 35.461L91.436 35.754M90.827 31.539L90.827 33.379Q90.979 33.668 91.241 33.848Q91.503 34.027 91.811 34.027Q92.097 34.027 92.319 33.889Q92.542 33.750 92.694 33.519Q92.847 33.289 92.925 33.017Q93.003 32.746 93.003 32.476Q93.003 32.144 92.878 31.787Q92.753 31.430 92.505 31.193Q92.257 30.957 91.909 30.957Q91.585 30.957 91.290 31.113Q90.995 31.269 90.827 31.539M94.675 36.203L94.593 36.203Q94.558 36.203 94.532 36.174Q94.507 36.144 94.507 36.105Q94.507 36.055 94.538 36.035Q94.925 35.699 95.208 35.250Q95.491 34.801 95.657 34.301Q95.823 33.801 95.897 33.283Q95.972 32.766 95.972 32.203Q95.972 31.633 95.897 31.117Q95.823 30.601 95.657 30.105Q95.491 29.609 95.212 29.162Q94.933 28.715 94.538 28.371Q94.507 28.351 94.507 28.301Q94.507 28.262 94.532 28.232Q94.558 28.203 94.593 28.203L94.675 28.203Q94.686 28.203 94.696 28.205Q94.706 28.207 94.714 28.211Q95.327 28.668 95.729 29.303Q96.132 29.937 96.327 30.683Q96.522 31.430 96.522 32.203Q96.522 32.976 96.327 33.723Q96.132 34.469 95.729 35.103Q95.327 35.738 94.714 36.195Q94.702 36.195 94.694 36.197Q94.686 36.199 94.675 36.203\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M102.268-51.155h25.453\"\u002F>\u003Cpath stroke=\"none\" d=\"m130.32-51.155-4.159-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003Cg transform=\"translate(44.082 -89.091)\">\u003Cpath d=\"M65.393 34.196L65.393 33.133Q65.393 33.109 65.421 33.082Q65.448 33.055 65.472 33.055L65.581 33.055Q65.646 33.055 65.660 33.113Q65.756 33.547 66.002 33.798Q66.248 34.049 66.662 34.049Q67.003 34.049 67.256 33.916Q67.509 33.783 67.509 33.475Q67.509 33.318 67.415 33.203Q67.321 33.089 67.183 33.020Q67.044 32.952 66.877 32.914L66.296 32.815Q65.940 32.747 65.667 32.526Q65.393 32.306 65.393 31.964Q65.393 31.715 65.505 31.540Q65.616 31.366 65.802 31.267Q65.988 31.168 66.204 31.125Q66.419 31.082 66.662 31.082Q67.075 31.082 67.355 31.264L67.571 31.089Q67.581 31.086 67.588 31.084Q67.595 31.082 67.605 31.082L67.656 31.082Q67.683 31.082 67.707 31.106Q67.731 31.130 67.731 31.158L67.731 32.005Q67.731 32.026 67.707 32.053Q67.683 32.080 67.656 32.080L67.543 32.080Q67.516 32.080 67.490 32.055Q67.465 32.029 67.465 32.005Q67.465 31.769 67.359 31.605Q67.253 31.441 67.070 31.359Q66.887 31.277 66.655 31.277Q66.327 31.277 66.070 31.380Q65.814 31.482 65.814 31.759Q65.814 31.954 65.997 32.063Q66.180 32.173 66.409 32.214L66.983 32.320Q67.229 32.368 67.443 32.496Q67.656 32.624 67.793 32.827Q67.930 33.031 67.930 33.280Q67.930 33.793 67.564 34.032Q67.198 34.271 66.662 34.271Q66.166 34.271 65.834 33.977L65.568 34.251Q65.547 34.271 65.520 34.271L65.472 34.271Q65.448 34.271 65.421 34.244Q65.393 34.217 65.393 34.196M70.175 34.203L68.623 34.203L68.623 33.923Q68.849 33.923 68.998 33.889Q69.146 33.854 69.146 33.714L69.146 31.865Q69.146 31.677 69.099 31.593Q69.051 31.510 68.953 31.491Q68.856 31.472 68.644 31.472L68.644 31.192L69.700 31.117L69.700 33.714Q69.700 33.854 69.832 33.889Q69.963 33.923 70.175 33.923L70.175 34.203M68.904 29.896Q68.904 29.725 69.027 29.606Q69.150 29.486 69.321 29.486Q69.488 29.486 69.611 29.606Q69.734 29.725 69.734 29.896Q69.734 30.071 69.611 30.194Q69.488 30.317 69.321 30.317Q69.150 30.317 69.027 30.194Q68.904 30.071 68.904 29.896M72.503 34.203L70.869 34.203L70.869 33.923Q71.098 33.923 71.247 33.889Q71.395 33.854 71.395 33.714L71.395 31.865Q71.395 31.595 71.288 31.534Q71.180 31.472 70.869 31.472L70.869 31.192L71.929 31.117L71.929 31.766Q72.100 31.458 72.404 31.287Q72.708 31.117 73.053 31.117Q73.453 31.117 73.730 31.257Q74.007 31.397 74.092 31.745Q74.260 31.452 74.559 31.284Q74.858 31.117 75.203 31.117Q75.709 31.117 75.993 31.340Q76.276 31.564 76.276 32.060L76.276 33.714Q76.276 33.851 76.425 33.887Q76.574 33.923 76.799 33.923L76.799 34.203L75.169 34.203L75.169 33.923Q75.394 33.923 75.545 33.887Q75.695 33.851 75.695 33.714L75.695 32.074Q75.695 31.739 75.576 31.539Q75.456 31.339 75.141 31.339Q74.871 31.339 74.637 31.475Q74.403 31.612 74.265 31.846Q74.126 32.080 74.126 32.354L74.126 33.714Q74.126 33.851 74.275 33.887Q74.424 33.923 74.649 33.923L74.649 34.203L73.019 34.203L73.019 33.923Q73.248 33.923 73.397 33.889Q73.545 33.854 73.545 33.714L73.545 32.074Q73.545 31.739 73.426 31.539Q73.306 31.339 72.992 31.339Q72.722 31.339 72.487 31.475Q72.253 31.612 72.115 31.846Q71.976 32.080 71.976 32.354L71.976 33.714Q71.976 33.851 72.127 33.887Q72.277 33.923 72.503 33.923L72.503 34.203M77.787 33.783Q77.787 33.615 77.910 33.492Q78.033 33.369 78.207 33.369Q78.375 33.369 78.498 33.492Q78.621 33.615 78.621 33.783Q78.621 33.957 78.498 34.080Q78.375 34.203 78.207 34.203Q78.033 34.203 77.910 34.080Q77.787 33.957 77.787 33.783\" 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)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M204.698-51.155h36.834\"\u002F>\u003Cpath stroke=\"none\" d=\"m244.132-51.155-4.16-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(149.478 -90.452)\">\u003Cpath d=\"M65.393 32.692Q65.393 32.364 65.528 32.063Q65.663 31.763 65.899 31.542Q66.135 31.322 66.439 31.202Q66.744 31.082 67.068 31.082Q67.574 31.082 67.923 31.185Q68.271 31.287 68.271 31.663Q68.271 31.810 68.174 31.911Q68.077 32.012 67.930 32.012Q67.776 32.012 67.677 31.913Q67.578 31.814 67.578 31.663Q67.578 31.475 67.718 31.383Q67.516 31.332 67.075 31.332Q66.720 31.332 66.491 31.528Q66.262 31.725 66.161 32.034Q66.060 32.344 66.060 32.692Q66.060 33.041 66.186 33.347Q66.313 33.653 66.568 33.837Q66.822 34.022 67.178 34.022Q67.400 34.022 67.584 33.938Q67.769 33.854 67.904 33.699Q68.039 33.543 68.097 33.335Q68.111 33.280 68.165 33.280L68.278 33.280Q68.309 33.280 68.331 33.304Q68.353 33.328 68.353 33.362L68.353 33.383Q68.268 33.670 68.080 33.868Q67.892 34.066 67.627 34.169Q67.362 34.271 67.068 34.271Q66.638 34.271 66.250 34.065Q65.862 33.858 65.628 33.495Q65.393 33.133 65.393 32.692\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(149.478 -90.452)\">\u003Cpath d=\"M70.416 34.203L68.782 34.203L68.782 33.923Q69.011 33.923 69.160 33.889Q69.309 33.854 69.309 33.714L69.309 30.095Q69.309 29.825 69.201 29.763Q69.093 29.702 68.782 29.702L68.782 29.421L69.862 29.346L69.862 31.732Q69.968 31.547 70.146 31.405Q70.324 31.264 70.532 31.190Q70.741 31.117 70.966 31.117Q71.472 31.117 71.756 31.340Q72.040 31.564 72.040 32.060L72.040 33.714Q72.040 33.851 72.188 33.887Q72.337 33.923 72.563 33.923L72.563 34.203L70.932 34.203L70.932 33.923Q71.161 33.923 71.310 33.889Q71.459 33.854 71.459 33.714L71.459 32.074Q71.459 31.739 71.339 31.539Q71.219 31.339 70.905 31.339Q70.635 31.339 70.401 31.475Q70.167 31.612 70.028 31.846Q69.890 32.080 69.890 32.354L69.890 33.714Q69.890 33.851 70.040 33.887Q70.191 33.923 70.416 33.923L70.416 34.203M73.109 32.668Q73.109 32.347 73.234 32.058Q73.359 31.769 73.585 31.546Q73.810 31.322 74.106 31.202Q74.401 31.082 74.719 31.082Q75.047 31.082 75.309 31.182Q75.570 31.281 75.746 31.463Q75.922 31.646 76.016 31.904Q76.110 32.162 76.110 32.494Q76.110 32.586 76.028 32.607L73.773 32.607L73.773 32.668Q73.773 33.256 74.056 33.639Q74.340 34.022 74.907 34.022Q75.229 34.022 75.497 33.829Q75.765 33.636 75.854 33.321Q75.861 33.280 75.936 33.266L76.028 33.266Q76.110 33.290 76.110 33.362Q76.110 33.369 76.104 33.396Q75.991 33.793 75.620 34.032Q75.249 34.271 74.825 34.271Q74.388 34.271 73.988 34.063Q73.588 33.854 73.349 33.487Q73.109 33.120 73.109 32.668M73.779 32.398L75.594 32.398Q75.594 32.121 75.497 31.869Q75.399 31.616 75.201 31.460Q75.003 31.305 74.719 31.305Q74.442 31.305 74.229 31.463Q74.015 31.622 73.897 31.877Q73.779 32.132 73.779 32.398M76.756 33.475Q76.756 33.143 76.980 32.916Q77.204 32.689 77.548 32.561Q77.891 32.432 78.264 32.380Q78.636 32.327 78.941 32.327L78.941 32.074Q78.941 31.869 78.833 31.689Q78.725 31.510 78.544 31.407Q78.363 31.305 78.154 31.305Q77.748 31.305 77.512 31.397Q77.601 31.434 77.647 31.518Q77.693 31.602 77.693 31.704Q77.693 31.800 77.647 31.879Q77.601 31.957 77.520 32.002Q77.440 32.046 77.351 32.046Q77.201 32.046 77.100 31.949Q76.999 31.851 76.999 31.704Q76.999 31.082 78.154 31.082Q78.366 31.082 78.616 31.146Q78.865 31.209 79.067 31.328Q79.269 31.448 79.395 31.633Q79.522 31.817 79.522 32.060L79.522 33.636Q79.522 33.752 79.583 33.848Q79.645 33.943 79.757 33.943Q79.867 33.943 79.932 33.849Q79.997 33.755 79.997 33.636L79.997 33.188L80.263 33.188L80.263 33.636Q80.263 33.906 80.036 34.071Q79.809 34.237 79.528 34.237Q79.320 34.237 79.183 34.083Q79.046 33.930 79.023 33.714Q78.876 33.981 78.594 34.126Q78.312 34.271 77.987 34.271Q77.710 34.271 77.426 34.196Q77.143 34.121 76.950 33.942Q76.756 33.762 76.756 33.475M77.372 33.475Q77.372 33.649 77.472 33.779Q77.573 33.909 77.729 33.979Q77.884 34.049 78.048 34.049Q78.267 34.049 78.476 33.952Q78.684 33.854 78.812 33.673Q78.941 33.492 78.941 33.266L78.941 32.538Q78.616 32.538 78.250 32.629Q77.884 32.720 77.628 32.932Q77.372 33.143 77.372 33.475M82.324 35.560L80.694 35.560L80.694 35.280Q80.923 35.280 81.072 35.245Q81.220 35.211 81.220 35.071L81.220 31.725Q81.220 31.554 81.084 31.513Q80.947 31.472 80.694 31.472L80.694 31.192L81.774 31.117L81.774 31.523Q81.996 31.322 82.283 31.219Q82.570 31.117 82.878 31.117Q83.305 31.117 83.669 31.330Q84.033 31.544 84.247 31.908Q84.461 32.272 84.461 32.692Q84.461 33.137 84.221 33.501Q83.982 33.865 83.589 34.068Q83.196 34.271 82.752 34.271Q82.485 34.271 82.237 34.171Q81.989 34.070 81.801 33.889L81.801 35.071Q81.801 35.208 81.950 35.244Q82.099 35.280 82.324 35.280L82.324 35.560M81.801 31.872L81.801 33.482Q81.935 33.735 82.177 33.892Q82.420 34.049 82.697 34.049Q83.025 34.049 83.278 33.848Q83.531 33.646 83.664 33.328Q83.797 33.010 83.797 32.692Q83.797 32.463 83.733 32.234Q83.668 32.005 83.539 31.807Q83.411 31.609 83.216 31.489Q83.022 31.370 82.789 31.370Q82.495 31.370 82.227 31.499Q81.959 31.629 81.801 31.872\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(26.218 -56.165)\">\u003Cpath d=\"M65.452 25.475Q65.452 25.143 65.675 24.916Q65.899 24.689 66.243 24.561Q66.586 24.432 66.959 24.380Q67.331 24.327 67.636 24.327L67.636 24.074Q67.636 23.869 67.528 23.689Q67.420 23.510 67.239 23.407Q67.058 23.305 66.850 23.305Q66.443 23.305 66.207 23.397Q66.296 23.434 66.342 23.518Q66.388 23.602 66.388 23.704Q66.388 23.800 66.342 23.879Q66.296 23.957 66.215 24.002Q66.135 24.046 66.046 24.046Q65.896 24.046 65.795 23.949Q65.694 23.851 65.694 23.704Q65.694 23.082 66.850 23.082Q67.061 23.082 67.311 23.146Q67.560 23.209 67.762 23.328Q67.964 23.448 68.090 23.633Q68.217 23.817 68.217 24.060L68.217 25.636Q68.217 25.752 68.278 25.848Q68.340 25.943 68.453 25.943Q68.562 25.943 68.627 25.849Q68.692 25.755 68.692 25.636L68.692 25.188L68.958 25.188L68.958 25.636Q68.958 25.906 68.731 26.071Q68.504 26.237 68.224 26.237Q68.015 26.237 67.878 26.083Q67.742 25.930 67.718 25.714Q67.571 25.981 67.289 26.126Q67.007 26.271 66.682 26.271Q66.405 26.271 66.121 26.196Q65.838 26.121 65.645 25.942Q65.452 25.762 65.452 25.475M66.067 25.475Q66.067 25.649 66.168 25.779Q66.268 25.909 66.424 25.979Q66.579 26.049 66.744 26.049Q66.962 26.049 67.171 25.952Q67.379 25.854 67.507 25.673Q67.636 25.492 67.636 25.266L67.636 24.538Q67.311 24.538 66.945 24.629Q66.579 24.720 66.323 24.932Q66.067 25.143 66.067 25.475M71.057 26.203L69.423 26.203L69.423 25.923Q69.652 25.923 69.801 25.889Q69.950 25.854 69.950 25.714L69.950 22.095Q69.950 21.825 69.842 21.763Q69.734 21.702 69.423 21.702L69.423 21.421L70.503 21.346L70.503 23.732Q70.609 23.547 70.787 23.405Q70.965 23.264 71.173 23.190Q71.382 23.117 71.607 23.117Q72.113 23.117 72.397 23.340Q72.681 23.564 72.681 24.060L72.681 25.714Q72.681 25.851 72.829 25.887Q72.978 25.923 73.204 25.923L73.204 26.203L71.573 26.203L71.573 25.923Q71.802 25.923 71.951 25.889Q72.100 25.854 72.100 25.714L72.100 24.074Q72.100 23.739 71.980 23.539Q71.860 23.339 71.546 23.339Q71.276 23.339 71.042 23.475Q70.808 23.612 70.669 23.846Q70.531 24.080 70.531 24.354L70.531 25.714Q70.531 25.851 70.681 25.887Q70.831 25.923 71.057 25.923L71.057 26.203M73.750 24.668Q73.750 24.347 73.875 24.058Q74 23.769 74.225 23.546Q74.451 23.322 74.747 23.202Q75.042 23.082 75.360 23.082Q75.688 23.082 75.950 23.182Q76.211 23.281 76.387 23.463Q76.563 23.646 76.657 23.904Q76.751 24.162 76.751 24.494Q76.751 24.586 76.669 24.607L74.413 24.607L74.413 24.668Q74.413 25.256 74.697 25.639Q74.981 26.022 75.548 26.022Q75.870 26.022 76.138 25.829Q76.406 25.636 76.495 25.321Q76.502 25.280 76.577 25.266L76.669 25.266Q76.751 25.290 76.751 25.362Q76.751 25.369 76.745 25.396Q76.632 25.793 76.261 26.032Q75.890 26.271 75.466 26.271Q75.029 26.271 74.629 26.063Q74.229 25.854 73.990 25.487Q73.750 25.120 73.750 24.668M74.420 24.398L76.235 24.398Q76.235 24.121 76.138 23.869Q76.040 23.616 75.842 23.460Q75.644 23.305 75.360 23.305Q75.083 23.305 74.870 23.463Q74.656 23.622 74.538 23.877Q74.420 24.132 74.420 24.398M77.397 25.475Q77.397 25.143 77.621 24.916Q77.845 24.689 78.189 24.561Q78.532 24.432 78.905 24.380Q79.277 24.327 79.581 24.327L79.581 24.074Q79.581 23.869 79.474 23.689Q79.366 23.510 79.185 23.407Q79.004 23.305 78.795 23.305Q78.389 23.305 78.153 23.397Q78.242 23.434 78.288 23.518Q78.334 23.602 78.334 23.704Q78.334 23.800 78.288 23.879Q78.242 23.957 78.161 24.002Q78.081 24.046 77.992 24.046Q77.842 24.046 77.741 23.949Q77.640 23.851 77.640 23.704Q77.640 23.082 78.795 23.082Q79.007 23.082 79.257 23.146Q79.506 23.209 79.708 23.328Q79.910 23.448 80.036 23.633Q80.162 23.817 80.162 24.060L80.162 25.636Q80.162 25.752 80.224 25.848Q80.286 25.943 80.398 25.943Q80.508 25.943 80.573 25.849Q80.638 25.755 80.638 25.636L80.638 25.188L80.904 25.188L80.904 25.636Q80.904 25.906 80.677 26.071Q80.450 26.237 80.169 26.237Q79.961 26.237 79.824 26.083Q79.687 25.930 79.663 25.714Q79.516 25.981 79.235 26.126Q78.953 26.271 78.628 26.271Q78.351 26.271 78.067 26.196Q77.784 26.121 77.590 25.942Q77.397 25.762 77.397 25.475M78.013 25.475Q78.013 25.649 78.113 25.779Q78.214 25.909 78.370 25.979Q78.525 26.049 78.689 26.049Q78.908 26.049 79.117 25.952Q79.325 25.854 79.453 25.673Q79.581 25.492 79.581 25.266L79.581 24.538Q79.257 24.538 78.891 24.629Q78.525 24.720 78.269 24.932Q78.013 25.143 78.013 25.475M81.321 24.692Q81.321 24.354 81.461 24.063Q81.601 23.773 81.846 23.559Q82.090 23.346 82.394 23.231Q82.699 23.117 83.023 23.117Q83.293 23.117 83.557 23.216Q83.820 23.315 84.011 23.493L84.011 22.095Q84.011 21.825 83.903 21.763Q83.796 21.702 83.485 21.702L83.485 21.421L84.561 21.346L84.561 25.530Q84.561 25.718 84.616 25.801Q84.671 25.885 84.772 25.904Q84.872 25.923 85.088 25.923L85.088 26.203L83.980 26.271L83.980 25.854Q83.563 26.271 82.938 26.271Q82.507 26.271 82.135 26.059Q81.762 25.848 81.542 25.487Q81.321 25.126 81.321 24.692M82.996 26.049Q83.204 26.049 83.391 25.977Q83.577 25.906 83.731 25.769Q83.885 25.632 83.980 25.454L83.980 23.845Q83.895 23.698 83.750 23.578Q83.604 23.458 83.435 23.399Q83.266 23.339 83.085 23.339Q82.524 23.339 82.256 23.728Q81.988 24.118 81.988 24.699Q81.988 25.270 82.222 25.660Q82.456 26.049 82.996 26.049\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(26.218 -56.165)\">\u003Cpath d=\"M88.408 24.720Q88.408 24.378 88.543 24.079Q88.678 23.780 88.918 23.556Q89.157 23.332 89.475 23.207Q89.793 23.082 90.124 23.082Q90.569 23.082 90.968 23.298Q91.368 23.513 91.603 23.891Q91.837 24.268 91.837 24.720Q91.837 25.061 91.695 25.345Q91.553 25.629 91.309 25.836Q91.064 26.042 90.755 26.157Q90.446 26.271 90.124 26.271Q89.694 26.271 89.292 26.070Q88.890 25.868 88.649 25.516Q88.408 25.164 88.408 24.720M90.124 26.022Q90.726 26.022 90.950 25.644Q91.174 25.266 91.174 24.634Q91.174 24.022 90.939 23.663Q90.705 23.305 90.124 23.305Q89.072 23.305 89.072 24.634Q89.072 25.266 89.297 25.644Q89.523 26.022 90.124 26.022M94.229 26.203L92.496 26.203L92.496 25.923Q92.722 25.923 92.871 25.889Q93.019 25.854 93.019 25.714L93.019 23.465L92.431 23.465L92.431 23.185L93.019 23.185L93.019 22.368Q93.019 22.050 93.197 21.802Q93.375 21.555 93.665 21.414Q93.956 21.274 94.267 21.274Q94.523 21.274 94.727 21.416Q94.930 21.558 94.930 21.801Q94.930 21.937 94.831 22.036Q94.732 22.136 94.595 22.136Q94.458 22.136 94.359 22.036Q94.260 21.937 94.260 21.801Q94.260 21.620 94.400 21.527Q94.322 21.500 94.222 21.500Q94.014 21.500 93.860 21.633Q93.706 21.766 93.626 21.970Q93.546 22.173 93.546 22.382L93.546 23.185L94.434 23.185L94.434 23.465L93.573 23.465L93.573 25.714Q93.573 25.923 94.229 25.923\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(26.218 -56.165)\">\u003Cpath d=\"M98.136 25.362L98.136 23.465L97.497 23.465L97.497 23.243Q97.815 23.243 98.032 23.033Q98.249 22.823 98.349 22.513Q98.450 22.204 98.450 21.896L98.717 21.896L98.717 23.185L99.794 23.185L99.794 23.465L98.717 23.465L98.717 25.349Q98.717 25.625 98.821 25.824Q98.925 26.022 99.185 26.022Q99.342 26.022 99.448 25.918Q99.554 25.813 99.604 25.660Q99.653 25.506 99.653 25.349L99.653 24.935L99.920 24.935L99.920 25.362Q99.920 25.588 99.821 25.798Q99.722 26.008 99.537 26.140Q99.353 26.271 99.124 26.271Q98.686 26.271 98.411 26.034Q98.136 25.796 98.136 25.362M102.347 26.203L100.795 26.203L100.795 25.923Q101.021 25.923 101.169 25.889Q101.318 25.854 101.318 25.714L101.318 23.865Q101.318 23.677 101.270 23.593Q101.222 23.510 101.125 23.491Q101.027 23.472 100.816 23.472L100.816 23.192L101.872 23.117L101.872 25.714Q101.872 25.854 102.003 25.889Q102.135 25.923 102.347 25.923L102.347 26.203M101.075 21.896Q101.075 21.725 101.198 21.606Q101.321 21.486 101.492 21.486Q101.660 21.486 101.783 21.606Q101.906 21.725 101.906 21.896Q101.906 22.071 101.783 22.194Q101.660 22.317 101.492 22.317Q101.321 22.317 101.198 22.194Q101.075 22.071 101.075 21.896M104.674 26.203L103.041 26.203L103.041 25.923Q103.270 25.923 103.418 25.889Q103.567 25.854 103.567 25.714L103.567 23.865Q103.567 23.595 103.459 23.534Q103.352 23.472 103.041 23.472L103.041 23.192L104.100 23.117L104.100 23.766Q104.271 23.458 104.575 23.287Q104.879 23.117 105.225 23.117Q105.625 23.117 105.901 23.257Q106.178 23.397 106.264 23.745Q106.431 23.452 106.730 23.284Q107.029 23.117 107.375 23.117Q107.880 23.117 108.164 23.340Q108.448 23.564 108.448 24.060L108.448 25.714Q108.448 25.851 108.597 25.887Q108.745 25.923 108.971 25.923L108.971 26.203L107.340 26.203L107.340 25.923Q107.566 25.923 107.716 25.887Q107.867 25.851 107.867 25.714L107.867 24.074Q107.867 23.739 107.747 23.539Q107.628 23.339 107.313 23.339Q107.043 23.339 106.809 23.475Q106.575 23.612 106.436 23.846Q106.298 24.080 106.298 24.354L106.298 25.714Q106.298 25.851 106.447 25.887Q106.595 25.923 106.821 25.923L106.821 26.203L105.191 26.203L105.191 25.923Q105.420 25.923 105.568 25.889Q105.717 25.854 105.717 25.714L105.717 24.074Q105.717 23.739 105.597 23.539Q105.478 23.339 105.163 23.339Q104.893 23.339 104.659 23.475Q104.425 23.612 104.286 23.846Q104.148 24.080 104.148 24.354L104.148 25.714Q104.148 25.851 104.298 25.887Q104.449 25.923 104.674 25.923L104.674 26.203M109.518 24.668Q109.518 24.347 109.642 24.058Q109.767 23.769 109.993 23.546Q110.218 23.322 110.514 23.202Q110.810 23.082 111.128 23.082Q111.456 23.082 111.717 23.182Q111.979 23.281 112.155 23.463Q112.331 23.646 112.425 23.904Q112.519 24.162 112.519 24.494Q112.519 24.586 112.437 24.607L110.181 24.607L110.181 24.668Q110.181 25.256 110.464 25.639Q110.748 26.022 111.316 26.022Q111.637 26.022 111.905 25.829Q112.173 25.636 112.262 25.321Q112.269 25.280 112.344 25.266L112.437 25.266Q112.519 25.290 112.519 25.362Q112.519 25.369 112.512 25.396Q112.399 25.793 112.028 26.032Q111.657 26.271 111.233 26.271Q110.796 26.271 110.396 26.063Q109.996 25.854 109.757 25.487Q109.518 25.120 109.518 24.668M110.188 24.398L112.003 24.398Q112.003 24.121 111.905 23.869Q111.808 23.616 111.609 23.460Q111.411 23.305 111.128 23.305Q110.851 23.305 110.637 23.463Q110.423 23.622 110.305 23.877Q110.188 24.132 110.188 24.398M113.606 27.433Q113.606 27.399 113.633 27.372Q113.903 27.143 114.052 26.820Q114.200 26.497 114.200 26.141L114.200 26.104Q114.091 26.203 113.927 26.203Q113.746 26.203 113.626 26.083Q113.506 25.964 113.506 25.783Q113.506 25.608 113.626 25.489Q113.746 25.369 113.927 25.369Q114.183 25.369 114.303 25.608Q114.422 25.848 114.422 26.141Q114.422 26.541 114.253 26.912Q114.084 27.283 113.787 27.539Q113.756 27.560 113.729 27.560Q113.688 27.560 113.647 27.519Q113.606 27.478 113.606 27.433\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(26.218 -56.165)\">\u003Cpath d=\"M70.378 34.203L68.645 34.203L68.645 33.923Q68.871 33.923 69.020 33.889Q69.168 33.854 69.168 33.714L69.168 31.465L68.580 31.465L68.580 31.185L69.168 31.185L69.168 30.368Q69.168 30.050 69.346 29.802Q69.524 29.555 69.814 29.414Q70.105 29.274 70.416 29.274Q70.672 29.274 70.876 29.416Q71.079 29.558 71.079 29.801Q71.079 29.937 70.980 30.036Q70.881 30.136 70.744 30.136Q70.607 30.136 70.508 30.036Q70.409 29.937 70.409 29.801Q70.409 29.620 70.549 29.527Q70.471 29.500 70.371 29.500Q70.163 29.500 70.009 29.633Q69.855 29.766 69.775 29.970Q69.695 30.173 69.695 30.382L69.695 31.185L70.583 31.185L70.583 31.465L69.722 31.465L69.722 33.714Q69.722 33.923 70.378 33.923L70.378 34.203M71.017 32.720Q71.017 32.378 71.152 32.079Q71.287 31.780 71.527 31.556Q71.766 31.332 72.084 31.207Q72.402 31.082 72.733 31.082Q73.178 31.082 73.578 31.298Q73.977 31.513 74.212 31.891Q74.446 32.268 74.446 32.720Q74.446 33.061 74.304 33.345Q74.162 33.629 73.918 33.836Q73.673 34.042 73.364 34.157Q73.055 34.271 72.733 34.271Q72.303 34.271 71.901 34.070Q71.499 33.868 71.258 33.516Q71.017 33.164 71.017 32.720M72.733 34.022Q73.335 34.022 73.559 33.644Q73.783 33.266 73.783 32.634Q73.783 32.022 73.548 31.663Q73.314 31.305 72.733 31.305Q71.681 31.305 71.681 32.634Q71.681 33.266 71.906 33.644Q72.132 34.022 72.733 34.022M76.790 34.203L75.054 34.203L75.054 33.923Q75.283 33.923 75.432 33.889Q75.580 33.854 75.580 33.714L75.580 31.865Q75.580 31.595 75.473 31.534Q75.365 31.472 75.054 31.472L75.054 31.192L76.083 31.117L76.083 31.824Q76.213 31.516 76.455 31.317Q76.698 31.117 77.016 31.117Q77.235 31.117 77.406 31.241Q77.577 31.366 77.577 31.578Q77.577 31.715 77.477 31.814Q77.378 31.913 77.245 31.913Q77.108 31.913 77.009 31.814Q76.910 31.715 76.910 31.578Q76.910 31.438 77.009 31.339Q76.719 31.339 76.519 31.535Q76.319 31.732 76.226 32.026Q76.134 32.320 76.134 32.600L76.134 33.714Q76.134 33.923 76.790 33.923\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(26.218 -56.165)\">\u003Cpath d=\"M80.923 33.475Q80.923 33.143 81.146 32.916Q81.370 32.689 81.714 32.561Q82.057 32.432 82.430 32.380Q82.802 32.327 83.107 32.327L83.107 32.074Q83.107 31.869 82.999 31.689Q82.891 31.510 82.710 31.407Q82.529 31.305 82.321 31.305Q81.914 31.305 81.678 31.397Q81.767 31.434 81.813 31.518Q81.859 31.602 81.859 31.704Q81.859 31.800 81.813 31.879Q81.767 31.957 81.686 32.002Q81.606 32.046 81.517 32.046Q81.367 32.046 81.266 31.949Q81.165 31.851 81.165 31.704Q81.165 31.082 82.321 31.082Q82.532 31.082 82.782 31.146Q83.031 31.209 83.233 31.328Q83.435 31.448 83.561 31.633Q83.688 31.817 83.688 32.060L83.688 33.636Q83.688 33.752 83.749 33.848Q83.811 33.943 83.924 33.943Q84.033 33.943 84.098 33.849Q84.163 33.755 84.163 33.636L84.163 33.188L84.429 33.188L84.429 33.636Q84.429 33.906 84.202 34.071Q83.975 34.237 83.695 34.237Q83.486 34.237 83.349 34.083Q83.213 33.930 83.189 33.714Q83.042 33.981 82.760 34.126Q82.478 34.271 82.153 34.271Q81.876 34.271 81.592 34.196Q81.309 34.121 81.116 33.942Q80.923 33.762 80.923 33.475M81.538 33.475Q81.538 33.649 81.639 33.779Q81.739 33.909 81.895 33.979Q82.050 34.049 82.215 34.049Q82.433 34.049 82.642 33.952Q82.850 33.854 82.978 33.673Q83.107 33.492 83.107 33.266L83.107 32.538Q82.782 32.538 82.416 32.629Q82.050 32.720 81.794 32.932Q81.538 33.143 81.538 33.475M86.514 34.203L84.911 34.203L84.911 33.923Q85.137 33.923 85.286 33.889Q85.434 33.854 85.434 33.714L85.434 30.095Q85.434 29.825 85.327 29.763Q85.219 29.702 84.911 29.702L84.911 29.421L85.988 29.346L85.988 33.714Q85.988 33.851 86.138 33.887Q86.289 33.923 86.514 33.923L86.514 34.203M88.777 34.203L87.174 34.203L87.174 33.923Q87.400 33.923 87.548 33.889Q87.697 33.854 87.697 33.714L87.697 30.095Q87.697 29.825 87.589 29.763Q87.482 29.702 87.174 29.702L87.174 29.421L88.251 29.346L88.251 33.714Q88.251 33.851 88.401 33.887Q88.551 33.923 88.777 33.923\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(26.218 -56.165)\">\u003Cpath d=\"M92.073 34.196L92.073 33.133Q92.073 33.109 92.101 33.082Q92.128 33.055 92.152 33.055L92.261 33.055Q92.326 33.055 92.340 33.113Q92.436 33.547 92.682 33.798Q92.928 34.049 93.342 34.049Q93.683 34.049 93.936 33.916Q94.189 33.783 94.189 33.475Q94.189 33.318 94.095 33.203Q94.001 33.089 93.863 33.020Q93.724 32.952 93.557 32.914L92.976 32.815Q92.620 32.747 92.347 32.526Q92.073 32.306 92.073 31.964Q92.073 31.715 92.185 31.540Q92.296 31.366 92.482 31.267Q92.668 31.168 92.884 31.125Q93.099 31.082 93.342 31.082Q93.755 31.082 94.035 31.264L94.251 31.089Q94.261 31.086 94.268 31.084Q94.275 31.082 94.285 31.082L94.336 31.082Q94.363 31.082 94.387 31.106Q94.411 31.130 94.411 31.158L94.411 32.005Q94.411 32.026 94.387 32.053Q94.363 32.080 94.336 32.080L94.223 32.080Q94.196 32.080 94.170 32.055Q94.145 32.029 94.145 32.005Q94.145 31.769 94.039 31.605Q93.933 31.441 93.750 31.359Q93.567 31.277 93.335 31.277Q93.007 31.277 92.750 31.380Q92.494 31.482 92.494 31.759Q92.494 31.954 92.677 32.063Q92.860 32.173 93.089 32.214L93.663 32.320Q93.909 32.368 94.123 32.496Q94.336 32.624 94.473 32.827Q94.610 33.031 94.610 33.280Q94.610 33.793 94.244 34.032Q93.878 34.271 93.342 34.271Q92.846 34.271 92.514 33.977L92.248 34.251Q92.227 34.271 92.200 34.271L92.152 34.271Q92.128 34.271 92.101 34.244Q92.073 34.217 92.073 34.196M95.765 33.362L95.765 31.465L95.126 31.465L95.126 31.243Q95.444 31.243 95.661 31.033Q95.878 30.823 95.978 30.513Q96.079 30.204 96.079 29.896L96.346 29.896L96.346 31.185L97.423 31.185L97.423 31.465L96.346 31.465L96.346 33.349Q96.346 33.625 96.450 33.824Q96.554 34.022 96.814 34.022Q96.971 34.022 97.077 33.918Q97.183 33.813 97.233 33.660Q97.282 33.506 97.282 33.349L97.282 32.935L97.549 32.935L97.549 33.362Q97.549 33.588 97.450 33.798Q97.351 34.008 97.166 34.140Q96.982 34.271 96.753 34.271Q96.315 34.271 96.040 34.034Q95.765 33.796 95.765 33.362M98.417 33.475Q98.417 33.143 98.641 32.916Q98.865 32.689 99.208 32.561Q99.552 32.432 99.925 32.380Q100.297 32.327 100.601 32.327L100.601 32.074Q100.601 31.869 100.494 31.689Q100.386 31.510 100.205 31.407Q100.024 31.305 99.815 31.305Q99.408 31.305 99.173 31.397Q99.261 31.434 99.308 31.518Q99.354 31.602 99.354 31.704Q99.354 31.800 99.308 31.879Q99.261 31.957 99.181 32.002Q99.101 32.046 99.012 32.046Q98.862 32.046 98.761 31.949Q98.660 31.851 98.660 31.704Q98.660 31.082 99.815 31.082Q100.027 31.082 100.277 31.146Q100.526 31.209 100.728 31.328Q100.929 31.448 101.056 31.633Q101.182 31.817 101.182 32.060L101.182 33.636Q101.182 33.752 101.244 33.848Q101.305 33.943 101.418 33.943Q101.528 33.943 101.592 33.849Q101.657 33.755 101.657 33.636L101.657 33.188L101.924 33.188L101.924 33.636Q101.924 33.906 101.697 34.071Q101.469 34.237 101.189 34.237Q100.981 34.237 100.844 34.083Q100.707 33.930 100.683 33.714Q100.536 33.981 100.254 34.126Q99.972 34.271 99.648 34.271Q99.371 34.271 99.087 34.196Q98.803 34.121 98.610 33.942Q98.417 33.762 98.417 33.475M99.032 33.475Q99.032 33.649 99.133 33.779Q99.234 33.909 99.390 33.979Q99.545 34.049 99.709 34.049Q99.928 34.049 100.136 33.952Q100.345 33.854 100.473 33.673Q100.601 33.492 100.601 33.266L100.601 32.538Q100.277 32.538 99.911 32.629Q99.545 32.720 99.289 32.932Q99.032 33.143 99.032 33.475M102.867 33.362L102.867 31.465L102.228 31.465L102.228 31.243Q102.546 31.243 102.763 31.033Q102.980 30.823 103.081 30.513Q103.182 30.204 103.182 29.896L103.448 29.896L103.448 31.185L104.525 31.185L104.525 31.465L103.448 31.465L103.448 33.349Q103.448 33.625 103.553 33.824Q103.657 34.022 103.917 34.022Q104.074 34.022 104.180 33.918Q104.286 33.813 104.335 33.660Q104.385 33.506 104.385 33.349L104.385 32.935L104.652 32.935L104.652 33.362Q104.652 33.588 104.552 33.798Q104.453 34.008 104.269 34.140Q104.084 34.271 103.855 34.271Q103.418 34.271 103.143 34.034Q102.867 33.796 102.867 33.362M105.421 32.668Q105.421 32.347 105.545 32.058Q105.670 31.769 105.896 31.546Q106.121 31.322 106.417 31.202Q106.713 31.082 107.030 31.082Q107.359 31.082 107.620 31.182Q107.882 31.281 108.058 31.463Q108.234 31.646 108.328 31.904Q108.422 32.162 108.422 32.494Q108.422 32.586 108.340 32.607L106.084 32.607L106.084 32.668Q106.084 33.256 106.367 33.639Q106.651 34.022 107.218 34.022Q107.540 34.022 107.808 33.829Q108.076 33.636 108.165 33.321Q108.172 33.280 108.247 33.266L108.340 33.266Q108.422 33.290 108.422 33.362Q108.422 33.369 108.415 33.396Q108.302 33.793 107.931 34.032Q107.560 34.271 107.136 34.271Q106.699 34.271 106.299 34.063Q105.899 33.854 105.660 33.487Q105.421 33.120 105.421 32.668M106.091 32.398L107.905 32.398Q107.905 32.121 107.808 31.869Q107.711 31.616 107.512 31.460Q107.314 31.305 107.030 31.305Q106.754 31.305 106.540 31.463Q106.326 31.622 106.208 31.877Q106.091 32.132 106.091 32.398M109.009 34.196L109.009 33.133Q109.009 33.109 109.037 33.082Q109.064 33.055 109.088 33.055L109.197 33.055Q109.262 33.055 109.276 33.113Q109.372 33.547 109.618 33.798Q109.864 34.049 110.278 34.049Q110.619 34.049 110.872 33.916Q111.125 33.783 111.125 33.475Q111.125 33.318 111.031 33.203Q110.937 33.089 110.799 33.020Q110.660 32.952 110.493 32.914L109.912 32.815Q109.556 32.747 109.283 32.526Q109.009 32.306 109.009 31.964Q109.009 31.715 109.121 31.540Q109.232 31.366 109.418 31.267Q109.604 31.168 109.820 31.125Q110.035 31.082 110.278 31.082Q110.691 31.082 110.971 31.264L111.187 31.089Q111.197 31.086 111.204 31.084Q111.211 31.082 111.221 31.082L111.272 31.082Q111.300 31.082 111.323 31.106Q111.347 31.130 111.347 31.158L111.347 32.005Q111.347 32.026 111.323 32.053Q111.300 32.080 111.272 32.080L111.159 32.080Q111.132 32.080 111.106 32.055Q111.081 32.029 111.081 32.005Q111.081 31.769 110.975 31.605Q110.869 31.441 110.686 31.359Q110.503 31.277 110.271 31.277Q109.943 31.277 109.686 31.380Q109.430 31.482 109.430 31.759Q109.430 31.954 109.613 32.063Q109.796 32.173 110.025 32.214L110.599 32.320Q110.845 32.368 111.059 32.496Q111.272 32.624 111.409 32.827Q111.546 33.031 111.546 33.280Q111.546 33.793 111.180 34.032Q110.814 34.271 110.278 34.271Q109.782 34.271 109.450 33.977L109.184 34.251Q109.163 34.271 109.136 34.271L109.088 34.271Q109.064 34.271 109.037 34.244Q109.009 34.217 109.009 34.196\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-127.35 -9.38)\">\u003Cpath d=\"M67.134 34.281Q66.653 34.281 66.245 34.037Q65.837 33.793 65.599 33.379Q65.360 32.965 65.360 32.476Q65.360 31.984 65.618 31.568Q65.876 31.152 66.308 30.914Q66.739 30.676 67.231 30.676Q67.852 30.676 68.302 31.113L68.302 29.484Q68.302 29.269 68.239 29.174Q68.177 29.078 68.059 29.057Q67.942 29.035 67.696 29.035L67.696 28.738L68.919 28.652L68.919 33.461Q68.919 33.672 68.981 33.767Q69.044 33.863 69.161 33.885Q69.278 33.906 69.528 33.906L69.528 34.203L68.278 34.281L68.278 33.797Q67.813 34.281 67.134 34.281M67.200 34.027Q67.540 34.027 67.833 33.836Q68.126 33.644 68.278 33.348L68.278 31.516Q68.130 31.242 67.868 31.086Q67.606 30.930 67.294 30.930Q66.669 30.930 66.386 31.377Q66.102 31.824 66.102 32.484Q66.102 33.129 66.354 33.578Q66.606 34.027 67.200 34.027M70.036 32.449Q70.036 31.969 70.268 31.553Q70.501 31.137 70.911 30.887Q71.321 30.637 71.798 30.637Q72.528 30.637 72.927 31.078Q73.325 31.519 73.325 32.250Q73.325 32.355 73.231 32.379L70.782 32.379L70.782 32.449Q70.782 32.859 70.903 33.215Q71.024 33.570 71.296 33.787Q71.567 34.004 71.997 34.004Q72.360 34.004 72.657 33.775Q72.954 33.547 73.056 33.195Q73.063 33.148 73.149 33.133L73.231 33.133Q73.325 33.160 73.325 33.242Q73.325 33.250 73.317 33.281Q73.255 33.508 73.116 33.691Q72.977 33.875 72.786 34.008Q72.595 34.141 72.376 34.211Q72.157 34.281 71.919 34.281Q71.548 34.281 71.210 34.144Q70.872 34.008 70.604 33.756Q70.337 33.504 70.186 33.164Q70.036 32.824 70.036 32.449M70.790 32.141L72.751 32.141Q72.751 31.836 72.649 31.545Q72.548 31.254 72.331 31.072Q72.114 30.891 71.798 30.891Q71.497 30.891 71.266 31.078Q71.036 31.266 70.913 31.557Q70.790 31.848 70.790 32.141M73.856 32.476Q73.856 31.980 74.106 31.555Q74.356 31.129 74.776 30.883Q75.196 30.637 75.696 30.637Q76.235 30.637 76.626 30.762Q77.016 30.887 77.016 31.301Q77.016 31.406 76.966 31.498Q76.915 31.590 76.823 31.641Q76.731 31.691 76.622 31.691Q76.516 31.691 76.425 31.641Q76.333 31.590 76.282 31.498Q76.231 31.406 76.231 31.301Q76.231 31.078 76.399 30.973Q76.177 30.914 75.704 30.914Q75.407 30.914 75.192 31.053Q74.977 31.191 74.847 31.422Q74.716 31.652 74.657 31.922Q74.599 32.191 74.599 32.476Q74.599 32.871 74.731 33.221Q74.864 33.570 75.136 33.787Q75.407 34.004 75.806 34.004Q76.181 34.004 76.456 33.787Q76.731 33.570 76.833 33.211Q76.849 33.148 76.911 33.148L77.016 33.148Q77.052 33.148 77.077 33.176Q77.102 33.203 77.102 33.242L77.102 33.266Q76.970 33.746 76.585 34.014Q76.200 34.281 75.696 34.281Q75.333 34.281 74.999 34.144Q74.665 34.008 74.405 33.758Q74.145 33.508 74.001 33.172Q73.856 32.836 73.856 32.476M79.450 34.203L77.673 34.203L77.673 33.906Q77.946 33.906 78.114 33.859Q78.282 33.812 78.282 33.644L78.282 31.508Q78.282 31.293 78.225 31.197Q78.169 31.101 78.056 31.080Q77.942 31.058 77.696 31.058L77.696 30.762L78.895 30.676L78.895 33.644Q78.895 33.812 79.042 33.859Q79.188 33.906 79.450 33.906L79.450 34.203M78.009 29.281Q78.009 29.090 78.143 28.959Q78.278 28.828 78.474 28.828Q78.595 28.828 78.698 28.891Q78.802 28.953 78.864 29.057Q78.927 29.160 78.927 29.281Q78.927 29.476 78.796 29.611Q78.665 29.746 78.474 29.746Q78.274 29.746 78.141 29.613Q78.009 29.480 78.009 29.281M79.993 34.195L79.993 32.973Q79.993 32.945 80.024 32.914Q80.056 32.883 80.079 32.883L80.184 32.883Q80.255 32.883 80.270 32.945Q80.333 33.266 80.472 33.506Q80.610 33.746 80.843 33.887Q81.075 34.027 81.384 34.027Q81.622 34.027 81.831 33.967Q82.040 33.906 82.177 33.758Q82.313 33.609 82.313 33.363Q82.313 33.109 82.102 32.943Q81.891 32.777 81.622 32.723L81.001 32.609Q80.595 32.531 80.294 32.275Q79.993 32.019 79.993 31.644Q79.993 31.277 80.194 31.055Q80.395 30.832 80.720 30.734Q81.044 30.637 81.384 30.637Q81.849 30.637 82.145 30.844L82.368 30.660Q82.391 30.637 82.423 30.637L82.474 30.637Q82.505 30.637 82.532 30.664Q82.559 30.691 82.559 30.723L82.559 31.707Q82.559 31.738 82.534 31.767Q82.509 31.797 82.474 31.797L82.368 31.797Q82.333 31.797 82.306 31.769Q82.278 31.742 82.278 31.707Q82.278 31.308 82.026 31.088Q81.774 30.867 81.376 30.867Q81.020 30.867 80.737 30.990Q80.454 31.113 80.454 31.418Q80.454 31.637 80.655 31.769Q80.856 31.902 81.102 31.945L81.727 32.058Q82.157 32.148 82.466 32.445Q82.774 32.742 82.774 33.156Q82.774 33.726 82.376 34.004Q81.977 34.281 81.384 34.281Q80.833 34.281 80.481 33.945L80.184 34.258Q80.161 34.281 80.126 34.281L80.079 34.281Q80.056 34.281 80.024 34.250Q79.993 34.219 79.993 34.195M85.161 34.203L83.384 34.203L83.384 33.906Q83.657 33.906 83.825 33.859Q83.993 33.812 83.993 33.644L83.993 31.508Q83.993 31.293 83.936 31.197Q83.880 31.101 83.766 31.080Q83.653 31.058 83.407 31.058L83.407 30.762L84.606 30.676L84.606 33.644Q84.606 33.812 84.753 33.859Q84.899 33.906 85.161 33.906L85.161 34.203M83.720 29.281Q83.720 29.090 83.854 28.959Q83.989 28.828 84.184 28.828Q84.306 28.828 84.409 28.891Q84.513 28.953 84.575 29.057Q84.638 29.160 84.638 29.281Q84.638 29.476 84.507 29.611Q84.376 29.746 84.184 29.746Q83.985 29.746 83.852 29.613Q83.720 29.480 83.720 29.281M85.661 32.508Q85.661 32.004 85.917 31.572Q86.173 31.141 86.608 30.889Q87.044 30.637 87.544 30.637Q87.931 30.637 88.272 30.781Q88.614 30.926 88.876 31.187Q89.138 31.449 89.280 31.785Q89.423 32.121 89.423 32.508Q89.423 33 89.159 33.410Q88.895 33.820 88.466 34.051Q88.036 34.281 87.544 34.281Q87.052 34.281 86.618 34.049Q86.184 33.816 85.923 33.408Q85.661 33 85.661 32.508M87.544 34.004Q88.001 34.004 88.253 33.781Q88.505 33.558 88.593 33.207Q88.681 32.855 88.681 32.410Q88.681 31.980 88.587 31.642Q88.493 31.305 88.239 31.098Q87.985 30.891 87.544 30.891Q86.895 30.891 86.651 31.307Q86.407 31.723 86.407 32.410Q86.407 32.855 86.495 33.207Q86.583 33.558 86.835 33.781Q87.087 34.004 87.544 34.004M91.837 34.203L89.981 34.203L89.981 33.906Q90.255 33.906 90.423 33.859Q90.591 33.812 90.591 33.644L90.591 31.508Q90.591 31.293 90.528 31.197Q90.466 31.101 90.347 31.080Q90.227 31.058 89.981 31.058L89.981 30.762L91.173 30.676L91.173 31.410Q91.286 31.195 91.479 31.027Q91.673 30.859 91.911 30.767Q92.149 30.676 92.403 30.676Q93.571 30.676 93.571 31.754L93.571 33.644Q93.571 33.812 93.741 33.859Q93.911 33.906 94.181 33.906L94.181 34.203L92.325 34.203L92.325 33.906Q92.599 33.906 92.766 33.859Q92.934 33.812 92.934 33.644L92.934 31.769Q92.934 31.387 92.813 31.158Q92.692 30.930 92.341 30.930Q92.028 30.930 91.774 31.092Q91.520 31.254 91.374 31.523Q91.227 31.793 91.227 32.090L91.227 33.644Q91.227 33.812 91.397 33.859Q91.567 33.906 91.837 33.906L91.837 34.203M96.739 32.754L94.485 32.754L94.485 32.203L96.739 32.203L96.739 32.754M98.083 33.242L98.083 31.051L97.380 31.051L97.380 30.797Q97.735 30.797 97.977 30.564Q98.220 30.332 98.331 29.984Q98.442 29.637 98.442 29.281L98.724 29.281L98.724 30.754L99.899 30.754L99.899 31.051L98.724 31.051L98.724 33.226Q98.724 33.547 98.843 33.775Q98.962 34.004 99.243 34.004Q99.423 34.004 99.540 33.881Q99.657 33.758 99.710 33.578Q99.763 33.398 99.763 33.226L99.763 32.754L100.044 32.754L100.044 33.242Q100.044 33.496 99.938 33.736Q99.833 33.976 99.636 34.129Q99.438 34.281 99.181 34.281Q98.864 34.281 98.612 34.158Q98.360 34.035 98.222 33.801Q98.083 33.566 98.083 33.242M102.622 34.203L100.845 34.203L100.845 33.906Q101.118 33.906 101.286 33.859Q101.454 33.812 101.454 33.644L101.454 31.508Q101.454 31.293 101.397 31.197Q101.341 31.101 101.227 31.080Q101.114 31.058 100.868 31.058L100.868 30.762L102.067 30.676L102.067 33.644Q102.067 33.812 102.214 33.859Q102.360 33.906 102.622 33.906L102.622 34.203M101.181 29.281Q101.181 29.090 101.315 28.959Q101.450 28.828 101.645 28.828Q101.766 28.828 101.870 28.891Q101.974 28.953 102.036 29.057Q102.099 29.160 102.099 29.281Q102.099 29.476 101.968 29.611Q101.837 29.746 101.645 29.746Q101.446 29.746 101.313 29.613Q101.181 29.480 101.181 29.281M105.052 34.203L103.196 34.203L103.196 33.906Q103.470 33.906 103.638 33.859Q103.806 33.812 103.806 33.644L103.806 31.508Q103.806 31.293 103.743 31.197Q103.681 31.101 103.561 31.080Q103.442 31.058 103.196 31.058L103.196 30.762L104.388 30.676L104.388 31.410Q104.501 31.195 104.694 31.027Q104.888 30.859 105.126 30.767Q105.364 30.676 105.618 30.676Q106.579 30.676 106.755 31.387Q106.938 31.058 107.266 30.867Q107.595 30.676 107.974 30.676Q109.149 30.676 109.149 31.754L109.149 33.644Q109.149 33.812 109.317 33.859Q109.485 33.906 109.755 33.906L109.755 34.203L107.899 34.203L107.899 33.906Q108.173 33.906 108.341 33.861Q108.509 33.816 108.509 33.644L108.509 31.769Q108.509 31.383 108.384 31.156Q108.259 30.930 107.907 30.930Q107.602 30.930 107.347 31.092Q107.091 31.254 106.942 31.523Q106.794 31.793 106.794 32.090L106.794 33.644Q106.794 33.812 106.964 33.859Q107.134 33.906 107.403 33.906L107.403 34.203L105.548 34.203L105.548 33.906Q105.821 33.906 105.989 33.859Q106.157 33.812 106.157 33.644L106.157 31.769Q106.157 31.383 106.032 31.156Q105.907 30.930 105.556 30.930Q105.251 30.930 104.995 31.092Q104.739 31.254 104.591 31.523Q104.442 31.793 104.442 32.090L104.442 33.644Q104.442 33.812 104.612 33.859Q104.782 33.906 105.052 33.906L105.052 34.203M110.200 32.449Q110.200 31.969 110.433 31.553Q110.665 31.137 111.075 30.887Q111.485 30.637 111.962 30.637Q112.692 30.637 113.091 31.078Q113.489 31.519 113.489 32.250Q113.489 32.355 113.395 32.379L110.946 32.379L110.946 32.449Q110.946 32.859 111.067 33.215Q111.188 33.570 111.460 33.787Q111.731 34.004 112.161 34.004Q112.524 34.004 112.821 33.775Q113.118 33.547 113.220 33.195Q113.227 33.148 113.313 33.133L113.395 33.133Q113.489 33.160 113.489 33.242Q113.489 33.250 113.481 33.281Q113.419 33.508 113.280 33.691Q113.141 33.875 112.950 34.008Q112.759 34.141 112.540 34.211Q112.321 34.281 112.083 34.281Q111.712 34.281 111.374 34.144Q111.036 34.008 110.768 33.756Q110.501 33.504 110.350 33.164Q110.200 32.824 110.200 32.449M110.954 32.141L112.915 32.141Q112.915 31.836 112.813 31.545Q112.712 31.254 112.495 31.072Q112.278 30.891 111.962 30.891Q111.661 30.891 111.431 31.078Q111.200 31.266 111.077 31.557Q110.954 31.848 110.954 32.141\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-127.35 -9.38)\">\u003Cpath d=\"M118.721 35.754L116.866 35.754L116.866 35.461Q117.135 35.461 117.303 35.416Q117.471 35.371 117.471 35.195L117.471 31.371Q117.471 31.164 117.315 31.111Q117.159 31.058 116.866 31.058L116.866 30.762L118.088 30.676L118.088 31.141Q118.319 30.918 118.633 30.797Q118.948 30.676 119.287 30.676Q119.760 30.676 120.164 30.922Q120.569 31.168 120.801 31.584Q121.034 32 121.034 32.476Q121.034 32.851 120.885 33.180Q120.737 33.508 120.467 33.760Q120.198 34.012 119.854 34.146Q119.510 34.281 119.151 34.281Q118.862 34.281 118.590 34.160Q118.319 34.039 118.112 33.828L118.112 35.195Q118.112 35.371 118.280 35.416Q118.448 35.461 118.721 35.461L118.721 35.754M118.112 31.539L118.112 33.379Q118.264 33.668 118.526 33.848Q118.787 34.027 119.096 34.027Q119.381 34.027 119.604 33.889Q119.827 33.750 119.979 33.519Q120.131 33.289 120.209 33.017Q120.287 32.746 120.287 32.476Q120.287 32.144 120.162 31.787Q120.037 31.430 119.789 31.193Q119.541 30.957 119.194 30.957Q118.870 30.957 118.575 31.113Q118.280 31.269 118.112 31.539M123.471 34.203L121.639 34.203L121.639 33.906Q121.912 33.906 122.080 33.859Q122.248 33.812 122.248 33.644L122.248 29.484Q122.248 29.269 122.186 29.174Q122.123 29.078 122.004 29.057Q121.885 29.035 121.639 29.035L121.639 28.738L122.862 28.652L122.862 33.644Q122.862 33.812 123.030 33.859Q123.198 33.906 123.471 33.906L123.471 34.203M124.014 33.371Q124.014 32.887 124.416 32.592Q124.819 32.297 125.370 32.178Q125.920 32.058 126.412 32.058L126.412 31.769Q126.412 31.543 126.297 31.336Q126.182 31.129 125.985 31.010Q125.787 30.891 125.557 30.891Q125.131 30.891 124.846 30.996Q124.916 31.023 124.963 31.078Q125.010 31.133 125.036 31.203Q125.061 31.273 125.061 31.348Q125.061 31.453 125.010 31.545Q124.959 31.637 124.868 31.687Q124.776 31.738 124.670 31.738Q124.565 31.738 124.473 31.687Q124.381 31.637 124.330 31.545Q124.280 31.453 124.280 31.348Q124.280 30.930 124.668 30.783Q125.057 30.637 125.557 30.637Q125.889 30.637 126.243 30.767Q126.596 30.898 126.825 31.152Q127.053 31.406 127.053 31.754L127.053 33.555Q127.053 33.687 127.125 33.797Q127.198 33.906 127.327 33.906Q127.452 33.906 127.520 33.801Q127.588 33.695 127.588 33.555L127.588 33.043L127.870 33.043L127.870 33.555Q127.870 33.758 127.752 33.916Q127.635 34.074 127.454 34.158Q127.272 34.242 127.069 34.242Q126.838 34.242 126.686 34.070Q126.534 33.898 126.502 33.668Q126.342 33.949 126.034 34.115Q125.725 34.281 125.373 34.281Q124.862 34.281 124.438 34.058Q124.014 33.836 124.014 33.371M124.702 33.371Q124.702 33.656 124.928 33.842Q125.155 34.027 125.448 34.027Q125.694 34.027 125.918 33.910Q126.143 33.793 126.278 33.590Q126.412 33.387 126.412 33.133L126.412 32.301Q126.147 32.301 125.862 32.355Q125.577 32.410 125.305 32.539Q125.034 32.668 124.868 32.875Q124.702 33.082 124.702 33.371M130.092 34.203L128.237 34.203L128.237 33.906Q128.510 33.906 128.678 33.859Q128.846 33.812 128.846 33.644L128.846 31.508Q128.846 31.293 128.784 31.197Q128.721 31.101 128.602 31.080Q128.483 31.058 128.237 31.058L128.237 30.762L129.428 30.676L129.428 31.410Q129.541 31.195 129.735 31.027Q129.928 30.859 130.166 30.767Q130.405 30.676 130.659 30.676Q131.827 30.676 131.827 31.754L131.827 33.644Q131.827 33.812 131.996 33.859Q132.166 33.906 132.436 33.906L132.436 34.203L130.580 34.203L130.580 33.906Q130.854 33.906 131.022 33.859Q131.190 33.812 131.190 33.644L131.190 31.769Q131.190 31.387 131.069 31.158Q130.948 30.930 130.596 30.930Q130.284 30.930 130.030 31.092Q129.776 31.254 129.629 31.523Q129.483 31.793 129.483 32.090L129.483 33.644Q129.483 33.812 129.653 33.859Q129.823 33.906 130.092 33.906L130.092 34.203M134.811 34.203L132.955 34.203L132.955 33.906Q133.229 33.906 133.397 33.859Q133.565 33.812 133.565 33.644L133.565 31.508Q133.565 31.293 133.502 31.197Q133.440 31.101 133.321 31.080Q133.202 31.058 132.955 31.058L132.955 30.762L134.147 30.676L134.147 31.410Q134.260 31.195 134.454 31.027Q134.647 30.859 134.885 30.767Q135.123 30.676 135.377 30.676Q136.545 30.676 136.545 31.754L136.545 33.644Q136.545 33.812 136.715 33.859Q136.885 33.906 137.155 33.906L137.155 34.203L135.299 34.203L135.299 33.906Q135.573 33.906 135.741 33.859Q135.909 33.812 135.909 33.644L135.909 31.769Q135.909 31.387 135.787 31.158Q135.666 30.930 135.315 30.930Q135.002 30.930 134.748 31.092Q134.495 31.254 134.348 31.523Q134.202 31.793 134.202 32.090L134.202 33.644Q134.202 33.812 134.371 33.859Q134.541 33.906 134.811 33.906L134.811 34.203M139.459 34.203L137.682 34.203L137.682 33.906Q137.955 33.906 138.123 33.859Q138.291 33.812 138.291 33.644L138.291 31.508Q138.291 31.293 138.235 31.197Q138.178 31.101 138.065 31.080Q137.952 31.058 137.705 31.058L137.705 30.762L138.905 30.676L138.905 33.644Q138.905 33.812 139.051 33.859Q139.198 33.906 139.459 33.906L139.459 34.203M138.018 29.281Q138.018 29.090 138.153 28.959Q138.287 28.828 138.483 28.828Q138.604 28.828 138.707 28.891Q138.811 28.953 138.873 29.057Q138.936 29.160 138.936 29.281Q138.936 29.476 138.805 29.611Q138.674 29.746 138.483 29.746Q138.284 29.746 138.151 29.613Q138.018 29.480 138.018 29.281M141.889 34.203L140.034 34.203L140.034 33.906Q140.307 33.906 140.475 33.859Q140.643 33.812 140.643 33.644L140.643 31.508Q140.643 31.293 140.580 31.197Q140.518 31.101 140.399 31.080Q140.280 31.058 140.034 31.058L140.034 30.762L141.225 30.676L141.225 31.410Q141.338 31.195 141.532 31.027Q141.725 30.859 141.963 30.767Q142.202 30.676 142.455 30.676Q143.623 30.676 143.623 31.754L143.623 33.644Q143.623 33.812 143.793 33.859Q143.963 33.906 144.233 33.906L144.233 34.203L142.377 34.203L142.377 33.906Q142.651 33.906 142.819 33.859Q142.987 33.812 142.987 33.644L142.987 31.769Q142.987 31.387 142.866 31.158Q142.745 30.930 142.393 30.930Q142.080 30.930 141.827 31.092Q141.573 31.254 141.426 31.523Q141.280 31.793 141.280 32.090L141.280 33.644Q141.280 33.812 141.450 33.859Q141.620 33.906 141.889 33.906L141.889 34.203M144.678 34.812Q144.678 34.531 144.889 34.320Q145.100 34.109 145.385 34.019Q145.229 33.894 145.151 33.705Q145.073 33.516 145.073 33.316Q145.073 32.961 145.303 32.668Q144.936 32.328 144.936 31.859Q144.936 31.508 145.139 31.238Q145.342 30.969 145.662 30.822Q145.983 30.676 146.327 30.676Q146.846 30.676 147.217 30.957Q147.580 30.586 148.127 30.586Q148.307 30.586 148.434 30.713Q148.561 30.840 148.561 31.019Q148.561 31.125 148.483 31.203Q148.405 31.281 148.295 31.281Q148.186 31.281 148.110 31.205Q148.034 31.129 148.034 31.019Q148.034 30.918 148.073 30.867Q148.080 30.859 148.084 30.853Q148.088 30.848 148.088 30.844Q147.713 30.844 147.393 31.098Q147.713 31.437 147.713 31.859Q147.713 32.129 147.596 32.346Q147.479 32.562 147.274 32.721Q147.069 32.879 146.827 32.961Q146.584 33.043 146.327 33.043Q146.108 33.043 145.895 32.984Q145.682 32.926 145.487 32.805Q145.393 32.945 145.393 33.125Q145.393 33.332 145.530 33.484Q145.666 33.637 145.873 33.637L146.569 33.637Q147.057 33.637 147.469 33.721Q147.881 33.805 148.161 34.062Q148.440 34.320 148.440 34.812Q148.440 35.176 148.120 35.408Q147.799 35.641 147.358 35.742Q146.916 35.844 146.561 35.844Q146.205 35.844 145.762 35.742Q145.319 35.641 144.998 35.408Q144.678 35.176 144.678 34.812M145.182 34.812Q145.182 35.008 145.327 35.156Q145.471 35.305 145.684 35.394Q145.897 35.484 146.137 35.531Q146.377 35.578 146.561 35.578Q146.803 35.578 147.133 35.500Q147.463 35.422 147.700 35.248Q147.936 35.074 147.936 34.812Q147.936 34.406 147.526 34.297Q147.116 34.187 146.553 34.187L145.873 34.187Q145.604 34.187 145.393 34.365Q145.182 34.543 145.182 34.812M146.327 32.777Q147.049 32.777 147.049 31.859Q147.049 30.937 146.327 30.937Q145.600 30.937 145.600 31.859Q145.600 32.777 146.327 32.777\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M28.09 51.275h73.978V22.822H28.091Z\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(-14.678 5.079)\">\u003Cpath d=\"M65.360 34.195L65.360 32.973Q65.360 32.945 65.391 32.914Q65.423 32.883 65.446 32.883L65.552 32.883Q65.622 32.883 65.638 32.945Q65.700 33.266 65.839 33.506Q65.977 33.746 66.210 33.887Q66.442 34.027 66.751 34.027Q66.989 34.027 67.198 33.967Q67.407 33.906 67.544 33.758Q67.681 33.609 67.681 33.363Q67.681 33.109 67.470 32.943Q67.259 32.777 66.989 32.723L66.368 32.609Q65.962 32.531 65.661 32.275Q65.360 32.019 65.360 31.644Q65.360 31.277 65.561 31.055Q65.763 30.832 66.087 30.734Q66.411 30.637 66.751 30.637Q67.216 30.637 67.513 30.844L67.735 30.660Q67.759 30.637 67.790 30.637L67.841 30.637Q67.872 30.637 67.899 30.664Q67.927 30.691 67.927 30.723L67.927 31.707Q67.927 31.738 67.901 31.767Q67.876 31.797 67.841 31.797L67.735 31.797Q67.700 31.797 67.673 31.769Q67.645 31.742 67.645 31.707Q67.645 31.308 67.393 31.088Q67.141 30.867 66.743 30.867Q66.388 30.867 66.104 30.990Q65.821 31.113 65.821 31.418Q65.821 31.637 66.022 31.769Q66.224 31.902 66.470 31.945L67.095 32.058Q67.524 32.148 67.833 32.445Q68.141 32.742 68.141 33.156Q68.141 33.726 67.743 34.004Q67.345 34.281 66.751 34.281Q66.200 34.281 65.849 33.945L65.552 34.258Q65.528 34.281 65.493 34.281L65.446 34.281Q65.423 34.281 65.391 34.250Q65.360 34.219 65.360 34.195M69.294 33.242L69.294 31.051L68.591 31.051L68.591 30.797Q68.946 30.797 69.188 30.564Q69.431 30.332 69.542 29.984Q69.653 29.637 69.653 29.281L69.934 29.281L69.934 30.754L71.110 30.754L71.110 31.051L69.934 31.051L69.934 33.226Q69.934 33.547 70.054 33.775Q70.173 34.004 70.454 34.004Q70.634 34.004 70.751 33.881Q70.868 33.758 70.921 33.578Q70.974 33.398 70.974 33.226L70.974 32.754L71.255 32.754L71.255 33.242Q71.255 33.496 71.149 33.736Q71.044 33.976 70.847 34.129Q70.649 34.281 70.391 34.281Q70.075 34.281 69.823 34.158Q69.571 34.035 69.433 33.801Q69.294 33.566 69.294 33.242M72.071 33.371Q72.071 32.887 72.474 32.592Q72.876 32.297 73.427 32.178Q73.977 32.058 74.470 32.058L74.470 31.769Q74.470 31.543 74.354 31.336Q74.239 31.129 74.042 31.010Q73.845 30.891 73.614 30.891Q73.188 30.891 72.903 30.996Q72.974 31.023 73.020 31.078Q73.067 31.133 73.093 31.203Q73.118 31.273 73.118 31.348Q73.118 31.453 73.067 31.545Q73.016 31.637 72.925 31.687Q72.833 31.738 72.727 31.738Q72.622 31.738 72.530 31.687Q72.438 31.637 72.388 31.545Q72.337 31.453 72.337 31.348Q72.337 30.930 72.725 30.783Q73.114 30.637 73.614 30.637Q73.946 30.637 74.300 30.767Q74.653 30.898 74.882 31.152Q75.110 31.406 75.110 31.754L75.110 33.555Q75.110 33.687 75.183 33.797Q75.255 33.906 75.384 33.906Q75.509 33.906 75.577 33.801Q75.645 33.695 75.645 33.555L75.645 33.043L75.927 33.043L75.927 33.555Q75.927 33.758 75.809 33.916Q75.692 34.074 75.511 34.158Q75.329 34.242 75.126 34.242Q74.895 34.242 74.743 34.070Q74.591 33.898 74.559 33.668Q74.399 33.949 74.091 34.115Q73.782 34.281 73.431 34.281Q72.919 34.281 72.495 34.058Q72.071 33.836 72.071 33.371M72.759 33.371Q72.759 33.656 72.985 33.842Q73.212 34.027 73.505 34.027Q73.751 34.027 73.975 33.910Q74.200 33.793 74.335 33.590Q74.470 33.387 74.470 33.133L74.470 32.301Q74.204 32.301 73.919 32.355Q73.634 32.410 73.362 32.539Q73.091 32.668 72.925 32.875Q72.759 33.082 72.759 33.371M76.845 33.242L76.845 31.051L76.141 31.051L76.141 30.797Q76.497 30.797 76.739 30.564Q76.981 30.332 77.093 29.984Q77.204 29.637 77.204 29.281L77.485 29.281L77.485 30.754L78.661 30.754L78.661 31.051L77.485 31.051L77.485 33.226Q77.485 33.547 77.604 33.775Q77.724 34.004 78.005 34.004Q78.184 34.004 78.302 33.881Q78.419 33.758 78.472 33.578Q78.524 33.398 78.524 33.226L78.524 32.754L78.806 32.754L78.806 33.242Q78.806 33.496 78.700 33.736Q78.595 33.976 78.397 34.129Q78.200 34.281 77.942 34.281Q77.626 34.281 77.374 34.158Q77.122 34.035 76.983 33.801Q76.845 33.566 76.845 33.242M79.524 32.449Q79.524 31.969 79.757 31.553Q79.989 31.137 80.399 30.887Q80.809 30.637 81.286 30.637Q82.016 30.637 82.415 31.078Q82.813 31.519 82.813 32.250Q82.813 32.355 82.720 32.379L80.270 32.379L80.270 32.449Q80.270 32.859 80.391 33.215Q80.513 33.570 80.784 33.787Q81.056 34.004 81.485 34.004Q81.849 34.004 82.145 33.775Q82.442 33.547 82.544 33.195Q82.552 33.148 82.638 33.133L82.720 33.133Q82.813 33.160 82.813 33.242Q82.813 33.250 82.806 33.281Q82.743 33.508 82.604 33.691Q82.466 33.875 82.274 34.008Q82.083 34.141 81.864 34.211Q81.645 34.281 81.407 34.281Q81.036 34.281 80.698 34.144Q80.360 34.008 80.093 33.756Q79.825 33.504 79.675 33.164Q79.524 32.824 79.524 32.449M80.278 32.141L82.239 32.141Q82.239 31.836 82.138 31.545Q82.036 31.254 81.819 31.072Q81.602 30.891 81.286 30.891Q80.985 30.891 80.755 31.078Q80.524 31.266 80.401 31.557Q80.278 31.848 80.278 32.141\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-14.678 5.079)\">\u003Cpath d=\"M86.499 34.371L86.448 34.371Q86.413 34.371 86.387 34.342Q86.362 34.312 86.362 34.273L86.362 34.250L86.807 32.449Q86.823 32.387 86.897 32.387L87.003 32.387Q87.042 32.387 87.065 32.414Q87.089 32.441 87.089 32.484Q87.089 32.523 87.057 32.691Q87.026 32.859 87.026 32.945Q87.026 33.535 87.456 33.805Q87.885 34.074 88.507 34.074Q88.862 34.074 89.202 33.877Q89.542 33.680 89.755 33.348Q89.968 33.016 89.968 32.660Q89.968 32.363 89.800 32.146Q89.632 31.930 89.354 31.859L88.296 31.601Q88.030 31.539 87.815 31.369Q87.600 31.199 87.481 30.957Q87.362 30.715 87.362 30.433Q87.362 30.058 87.542 29.719Q87.721 29.379 88.018 29.121Q88.315 28.863 88.678 28.717Q89.042 28.570 89.409 28.570Q89.784 28.570 90.112 28.705Q90.440 28.840 90.632 29.125L91.096 28.594Q91.120 28.570 91.151 28.570L91.202 28.570Q91.241 28.570 91.264 28.598Q91.288 28.625 91.288 28.668L91.288 28.691L90.843 30.484Q90.815 30.555 90.753 30.555L90.647 30.555Q90.561 30.555 90.561 30.449Q90.593 30.273 90.593 30.058Q90.593 29.672 90.454 29.398Q90.315 29.125 90.048 28.984Q89.780 28.844 89.393 28.844Q89.061 28.844 88.727 29.016Q88.393 29.187 88.176 29.482Q87.960 29.777 87.960 30.113Q87.960 30.379 88.130 30.584Q88.300 30.789 88.569 30.859L89.624 31.113Q90.053 31.219 90.307 31.558Q90.561 31.898 90.561 32.340Q90.561 32.734 90.387 33.101Q90.214 33.469 89.911 33.758Q89.608 34.047 89.235 34.209Q88.862 34.371 88.479 34.371Q88.034 34.371 87.643 34.242Q87.253 34.113 87.018 33.820L86.553 34.348Q86.530 34.371 86.499 34.371\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-14.678 5.079)\">\u003Cpath d=\"M91.745 34.687Q91.745 34.614 91.765 34.550L92.184 32.874L91.475 32.874Q91.440 32.874 91.417 32.840Q91.393 32.807 91.393 32.774Q91.414 32.686 91.427 32.656Q91.440 32.625 91.493 32.616L92.243 32.616L92.483 31.676Q92.510 31.573 92.593 31.513Q92.677 31.453 92.773 31.453Q92.864 31.453 92.928 31.510Q92.993 31.567 92.993 31.658Q92.993 31.679 92.991 31.690Q92.990 31.702 92.987 31.717L92.759 32.616L93.456 32.616Q93.491 32.616 93.516 32.648Q93.541 32.681 93.541 32.719Q93.520 32.804 93.506 32.834Q93.491 32.865 93.438 32.874L92.694 32.874L92.275 34.567Q92.249 34.649 92.249 34.758Q92.249 34.878 92.300 34.963Q92.351 35.048 92.460 35.048Q92.650 35.048 92.819 34.935Q92.987 34.822 93.112 34.654Q93.236 34.485 93.306 34.309Q93.318 34.280 93.371 34.254L93.468 34.254Q93.547 34.283 93.547 34.339Q93.547 34.345 93.541 34.374Q93.473 34.541 93.361 34.705Q93.248 34.869 93.106 34.992Q92.964 35.115 92.794 35.188Q92.624 35.262 92.448 35.262Q92.167 35.262 91.956 35.108Q91.745 34.954 91.745 34.687\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"var(--tk-warn)\">\u003Cpath fill=\"none\" d=\"M130.52 51.275h73.978V22.822h-73.977Z\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\">\u003Cg transform=\"translate(84.013 9.873)\">\u003Cpath d=\"M67.231 24.703L65.399 24.703L65.399 24.406Q65.673 24.406 65.841 24.359Q66.009 24.312 66.009 24.144L66.009 19.984Q66.009 19.769 65.946 19.674Q65.884 19.578 65.765 19.557Q65.645 19.535 65.399 19.535L65.399 19.238L66.622 19.152L66.622 24.144Q66.622 24.312 66.790 24.359Q66.958 24.406 67.231 24.406L67.231 24.703M67.677 23.008Q67.677 22.504 67.933 22.072Q68.188 21.640 68.624 21.389Q69.059 21.137 69.559 21.137Q69.946 21.137 70.288 21.281Q70.630 21.426 70.891 21.687Q71.153 21.949 71.296 22.285Q71.438 22.621 71.438 23.008Q71.438 23.500 71.175 23.910Q70.911 24.320 70.481 24.551Q70.052 24.781 69.559 24.781Q69.067 24.781 68.634 24.549Q68.200 24.316 67.938 23.908Q67.677 23.500 67.677 23.008M69.559 24.504Q70.016 24.504 70.268 24.281Q70.520 24.058 70.608 23.707Q70.696 23.355 70.696 22.910Q70.696 22.480 70.602 22.142Q70.509 21.805 70.255 21.598Q70.001 21.390 69.559 21.390Q68.911 21.390 68.667 21.807Q68.423 22.223 68.423 22.910Q68.423 23.355 68.511 23.707Q68.599 24.058 68.850 24.281Q69.102 24.504 69.559 24.504\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(84.013 9.873)\">\u003Cpath d=\"M72.165 23.008Q72.165 22.504 72.421 22.072Q72.677 21.640 73.113 21.389Q73.548 21.137 74.048 21.137Q74.435 21.137 74.777 21.281Q75.118 21.426 75.380 21.687Q75.642 21.949 75.784 22.285Q75.927 22.621 75.927 23.008Q75.927 23.500 75.663 23.910Q75.400 24.320 74.970 24.551Q74.540 24.781 74.048 24.781Q73.556 24.781 73.122 24.549Q72.689 24.316 72.427 23.908Q72.165 23.500 72.165 23.008M74.048 24.504Q74.505 24.504 74.757 24.281Q75.009 24.058 75.097 23.707Q75.185 23.355 75.185 22.910Q75.185 22.480 75.091 22.142Q74.997 21.805 74.743 21.598Q74.490 21.390 74.048 21.390Q73.400 21.390 73.156 21.807Q72.911 22.223 72.911 22.910Q72.911 23.355 72.999 23.707Q73.087 24.058 73.339 24.281Q73.591 24.504 74.048 24.504M78.236 24.703L76.439 24.703L76.439 24.406Q76.708 24.406 76.876 24.361Q77.044 24.316 77.044 24.144L77.044 19.984Q77.044 19.769 76.982 19.674Q76.919 19.578 76.802 19.557Q76.685 19.535 76.439 19.535L76.439 19.238L77.661 19.152L77.661 22.918L78.759 22.031Q78.966 21.851 78.966 21.703Q78.966 21.637 78.913 21.594Q78.861 21.551 78.790 21.551L78.790 21.254L80.325 21.254L80.325 21.551Q79.794 21.551 79.197 22.031L78.587 22.527L79.661 23.926Q79.798 24.101 79.906 24.209Q80.013 24.316 80.148 24.361Q80.282 24.406 80.509 24.406L80.509 24.703L78.884 24.703L78.884 24.406Q79.126 24.406 79.126 24.254Q79.126 24.176 79.083 24.105Q79.040 24.035 78.958 23.926L78.157 22.879L77.630 23.305L77.630 24.144Q77.630 24.312 77.798 24.359Q77.966 24.406 78.236 24.406\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(84.013 9.873)\">\u003Cpath d=\"M80.527 23.871Q80.527 23.387 80.929 23.092Q81.332 22.797 81.882 22.678Q82.433 22.558 82.925 22.558L82.925 22.269Q82.925 22.043 82.810 21.836Q82.695 21.629 82.498 21.510Q82.300 21.390 82.070 21.390Q81.644 21.390 81.359 21.496Q81.429 21.523 81.476 21.578Q81.523 21.633 81.548 21.703Q81.574 21.773 81.574 21.848Q81.574 21.953 81.523 22.045Q81.472 22.137 81.380 22.187Q81.289 22.238 81.183 22.238Q81.078 22.238 80.986 22.187Q80.894 22.137 80.843 22.045Q80.793 21.953 80.793 21.848Q80.793 21.430 81.181 21.283Q81.570 21.137 82.070 21.137Q82.402 21.137 82.755 21.267Q83.109 21.398 83.337 21.652Q83.566 21.906 83.566 22.254L83.566 24.055Q83.566 24.187 83.638 24.297Q83.711 24.406 83.839 24.406Q83.964 24.406 84.033 24.301Q84.101 24.195 84.101 24.055L84.101 23.543L84.382 23.543L84.382 24.055Q84.382 24.258 84.265 24.416Q84.148 24.574 83.966 24.658Q83.785 24.742 83.582 24.742Q83.351 24.742 83.199 24.570Q83.046 24.398 83.015 24.168Q82.855 24.449 82.546 24.615Q82.238 24.781 81.886 24.781Q81.375 24.781 80.951 24.558Q80.527 24.336 80.527 23.871M81.214 23.871Q81.214 24.156 81.441 24.342Q81.668 24.527 81.961 24.527Q82.207 24.527 82.431 24.410Q82.656 24.293 82.791 24.090Q82.925 23.887 82.925 23.633L82.925 22.801Q82.660 22.801 82.375 22.855Q82.089 22.910 81.818 23.039Q81.546 23.168 81.380 23.375Q81.214 23.582 81.214 23.871M86.605 24.703L84.750 24.703L84.750 24.406Q85.023 24.406 85.191 24.359Q85.359 24.312 85.359 24.144L85.359 19.984Q85.359 19.769 85.296 19.674Q85.234 19.578 85.115 19.557Q84.996 19.535 84.750 19.535L84.750 19.238L85.972 19.152L85.972 21.855Q86.097 21.644 86.285 21.494Q86.472 21.344 86.699 21.260Q86.925 21.176 87.171 21.176Q88.339 21.176 88.339 22.254L88.339 24.144Q88.339 24.312 88.509 24.359Q88.679 24.406 88.949 24.406L88.949 24.703L87.093 24.703L87.093 24.406Q87.367 24.406 87.535 24.359Q87.703 24.312 87.703 24.144L87.703 22.269Q87.703 21.887 87.582 21.658Q87.461 21.430 87.109 21.430Q86.796 21.430 86.543 21.592Q86.289 21.754 86.142 22.023Q85.996 22.293 85.996 22.590L85.996 24.144Q85.996 24.312 86.166 24.359Q86.336 24.406 86.605 24.406L86.605 24.703M89.394 22.949Q89.394 22.469 89.627 22.053Q89.859 21.637 90.269 21.387Q90.679 21.137 91.156 21.137Q91.886 21.137 92.285 21.578Q92.683 22.019 92.683 22.750Q92.683 22.855 92.589 22.879L90.140 22.879L90.140 22.949Q90.140 23.359 90.261 23.715Q90.382 24.070 90.654 24.287Q90.925 24.504 91.355 24.504Q91.718 24.504 92.015 24.275Q92.312 24.047 92.414 23.695Q92.421 23.648 92.507 23.633L92.589 23.633Q92.683 23.660 92.683 23.742Q92.683 23.750 92.675 23.781Q92.613 24.008 92.474 24.191Q92.336 24.375 92.144 24.508Q91.953 24.640 91.734 24.711Q91.515 24.781 91.277 24.781Q90.906 24.781 90.568 24.644Q90.230 24.508 89.962 24.256Q89.695 24.004 89.545 23.664Q89.394 23.324 89.394 22.949M90.148 22.640L92.109 22.640Q92.109 22.336 92.007 22.045Q91.906 21.754 91.689 21.572Q91.472 21.390 91.156 21.390Q90.855 21.390 90.625 21.578Q90.394 21.765 90.271 22.057Q90.148 22.348 90.148 22.640M93.269 23.871Q93.269 23.387 93.671 23.092Q94.074 22.797 94.625 22.678Q95.175 22.558 95.668 22.558L95.668 22.269Q95.668 22.043 95.552 21.836Q95.437 21.629 95.240 21.510Q95.043 21.390 94.812 21.390Q94.386 21.390 94.101 21.496Q94.171 21.523 94.218 21.578Q94.265 21.633 94.291 21.703Q94.316 21.773 94.316 21.848Q94.316 21.953 94.265 22.045Q94.214 22.137 94.123 22.187Q94.031 22.238 93.925 22.238Q93.820 22.238 93.728 22.187Q93.636 22.137 93.586 22.045Q93.535 21.953 93.535 21.848Q93.535 21.430 93.923 21.283Q94.312 21.137 94.812 21.137Q95.144 21.137 95.498 21.267Q95.851 21.398 96.080 21.652Q96.308 21.906 96.308 22.254L96.308 24.055Q96.308 24.187 96.380 24.297Q96.453 24.406 96.582 24.406Q96.707 24.406 96.775 24.301Q96.843 24.195 96.843 24.055L96.843 23.543L97.125 23.543L97.125 24.055Q97.125 24.258 97.007 24.416Q96.890 24.574 96.709 24.658Q96.527 24.742 96.324 24.742Q96.093 24.742 95.941 24.570Q95.789 24.398 95.757 24.168Q95.597 24.449 95.289 24.615Q94.980 24.781 94.629 24.781Q94.117 24.781 93.693 24.558Q93.269 24.336 93.269 23.871M93.957 23.871Q93.957 24.156 94.183 24.342Q94.410 24.527 94.703 24.527Q94.949 24.527 95.173 24.410Q95.398 24.293 95.533 24.090Q95.668 23.887 95.668 23.633L95.668 22.801Q95.402 22.801 95.117 22.855Q94.832 22.910 94.560 23.039Q94.289 23.168 94.123 23.375Q93.957 23.582 93.957 23.871M99.234 24.781Q98.754 24.781 98.345 24.537Q97.937 24.293 97.699 23.879Q97.461 23.465 97.461 22.976Q97.461 22.484 97.718 22.068Q97.976 21.652 98.408 21.414Q98.839 21.176 99.332 21.176Q99.953 21.176 100.402 21.613L100.402 19.984Q100.402 19.769 100.339 19.674Q100.277 19.578 100.160 19.557Q100.043 19.535 99.796 19.535L99.796 19.238L101.019 19.152L101.019 23.961Q101.019 24.172 101.082 24.267Q101.144 24.363 101.261 24.385Q101.379 24.406 101.629 24.406L101.629 24.703L100.379 24.781L100.379 24.297Q99.914 24.781 99.234 24.781M99.300 24.527Q99.640 24.527 99.933 24.336Q100.226 24.144 100.379 23.848L100.379 22.015Q100.230 21.742 99.968 21.586Q99.707 21.430 99.394 21.430Q98.769 21.430 98.486 21.877Q98.203 22.324 98.203 22.984Q98.203 23.629 98.455 24.078Q98.707 24.527 99.300 24.527\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(84.013 9.873)\">\u003Cpath d=\"M71.498 34.203L69.513 34.203L69.513 33.906Q69.787 33.906 69.955 33.859Q70.123 33.812 70.123 33.644L70.123 31.051L69.482 31.051L69.482 30.754L70.123 30.754L70.123 29.820Q70.123 29.555 70.240 29.318Q70.357 29.082 70.550 28.918Q70.744 28.754 70.992 28.662Q71.240 28.570 71.505 28.570Q71.791 28.570 72.015 28.728Q72.240 28.887 72.240 29.164Q72.240 29.320 72.134 29.430Q72.029 29.539 71.865 29.539Q71.709 29.539 71.599 29.430Q71.490 29.320 71.490 29.164Q71.490 28.957 71.650 28.851Q71.552 28.828 71.459 28.828Q71.228 28.828 71.056 28.984Q70.884 29.141 70.798 29.377Q70.713 29.613 70.713 29.836L70.713 30.754L71.681 30.754L71.681 31.051L70.736 31.051L70.736 33.644Q70.736 33.812 70.963 33.859Q71.189 33.906 71.498 33.906L71.498 34.203M74.033 34.203L72.052 34.203L72.052 33.906Q72.322 33.906 72.490 33.861Q72.658 33.816 72.658 33.644L72.658 31.508Q72.658 31.293 72.595 31.197Q72.533 31.101 72.416 31.080Q72.298 31.058 72.052 31.058L72.052 30.762L73.220 30.676L73.220 31.461Q73.298 31.250 73.451 31.064Q73.603 30.879 73.802 30.777Q74.002 30.676 74.228 30.676Q74.474 30.676 74.666 30.820Q74.857 30.965 74.857 31.195Q74.857 31.351 74.752 31.461Q74.646 31.570 74.490 31.570Q74.334 31.570 74.224 31.461Q74.115 31.351 74.115 31.195Q74.115 31.035 74.220 30.930Q73.896 30.930 73.681 31.158Q73.466 31.387 73.371 31.726Q73.275 32.066 73.275 32.371L73.275 33.644Q73.275 33.812 73.502 33.859Q73.728 33.906 74.033 33.906L74.033 34.203M75.338 32.508Q75.338 32.004 75.593 31.572Q75.849 31.141 76.285 30.889Q76.720 30.637 77.220 30.637Q77.607 30.637 77.949 30.781Q78.291 30.926 78.552 31.187Q78.814 31.449 78.957 31.785Q79.099 32.121 79.099 32.508Q79.099 33 78.836 33.410Q78.572 33.820 78.142 34.051Q77.713 34.281 77.220 34.281Q76.728 34.281 76.295 34.049Q75.861 33.816 75.599 33.408Q75.338 33 75.338 32.508M77.220 34.004Q77.677 34.004 77.929 33.781Q78.181 33.558 78.269 33.207Q78.357 32.855 78.357 32.410Q78.357 31.980 78.263 31.642Q78.170 31.305 77.916 31.098Q77.662 30.891 77.220 30.891Q76.572 30.891 76.328 31.307Q76.084 31.723 76.084 32.410Q76.084 32.855 76.172 33.207Q76.259 33.558 76.511 33.781Q76.763 34.004 77.220 34.004M81.513 34.203L79.658 34.203L79.658 33.906Q79.931 33.906 80.099 33.859Q80.267 33.812 80.267 33.644L80.267 31.508Q80.267 31.293 80.205 31.197Q80.142 31.101 80.023 31.080Q79.904 31.058 79.658 31.058L79.658 30.762L80.849 30.676L80.849 31.410Q80.963 31.195 81.156 31.027Q81.349 30.859 81.588 30.767Q81.826 30.676 82.080 30.676Q83.041 30.676 83.216 31.387Q83.400 31.058 83.728 30.867Q84.056 30.676 84.435 30.676Q85.611 30.676 85.611 31.754L85.611 33.644Q85.611 33.812 85.779 33.859Q85.947 33.906 86.216 33.906L86.216 34.203L84.361 34.203L84.361 33.906Q84.634 33.906 84.802 33.861Q84.970 33.816 84.970 33.644L84.970 31.769Q84.970 31.383 84.845 31.156Q84.720 30.930 84.369 30.930Q84.064 30.930 83.808 31.092Q83.552 31.254 83.404 31.523Q83.255 31.793 83.255 32.090L83.255 33.644Q83.255 33.812 83.425 33.859Q83.595 33.906 83.865 33.906L83.865 34.203L82.009 34.203L82.009 33.906Q82.283 33.906 82.451 33.859Q82.619 33.812 82.619 33.644L82.619 31.769Q82.619 31.383 82.494 31.156Q82.369 30.930 82.017 30.930Q81.713 30.930 81.457 31.092Q81.201 31.254 81.052 31.523Q80.904 31.793 80.904 32.090L80.904 33.644Q80.904 33.812 81.074 33.859Q81.244 33.906 81.513 33.906\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(84.013 9.873)\">\u003Cpath d=\"M89.863 34.371L89.812 34.371Q89.777 34.371 89.751 34.342Q89.726 34.312 89.726 34.273L89.726 34.250L90.171 32.449Q90.187 32.387 90.261 32.387L90.367 32.387Q90.406 32.387 90.429 32.414Q90.453 32.441 90.453 32.484Q90.453 32.523 90.421 32.691Q90.390 32.859 90.390 32.945Q90.390 33.535 90.820 33.805Q91.249 34.074 91.871 34.074Q92.226 34.074 92.566 33.877Q92.906 33.680 93.119 33.348Q93.332 33.016 93.332 32.660Q93.332 32.363 93.164 32.146Q92.996 31.930 92.718 31.859L91.660 31.601Q91.394 31.539 91.179 31.369Q90.964 31.199 90.845 30.957Q90.726 30.715 90.726 30.433Q90.726 30.058 90.906 29.719Q91.085 29.379 91.382 29.121Q91.679 28.863 92.042 28.717Q92.406 28.570 92.773 28.570Q93.148 28.570 93.476 28.705Q93.804 28.840 93.996 29.125L94.460 28.594Q94.484 28.570 94.515 28.570L94.566 28.570Q94.605 28.570 94.628 28.598Q94.652 28.625 94.652 28.668L94.652 28.691L94.207 30.484Q94.179 30.555 94.117 30.555L94.011 30.555Q93.925 30.555 93.925 30.449Q93.957 30.273 93.957 30.058Q93.957 29.672 93.818 29.398Q93.679 29.125 93.412 28.984Q93.144 28.844 92.757 28.844Q92.425 28.844 92.091 29.016Q91.757 29.187 91.540 29.482Q91.324 29.777 91.324 30.113Q91.324 30.379 91.494 30.584Q91.664 30.789 91.933 30.859L92.988 31.113Q93.417 31.219 93.671 31.558Q93.925 31.898 93.925 32.340Q93.925 32.734 93.751 33.101Q93.578 33.469 93.275 33.758Q92.972 34.047 92.599 34.209Q92.226 34.371 91.843 34.371Q91.398 34.371 91.007 34.242Q90.617 34.113 90.382 33.820L89.917 34.348Q89.894 34.371 89.863 34.371\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(84.013 9.873)\">\u003Cpath d=\"M95.110 34.687Q95.110 34.614 95.130 34.550L95.549 32.874L94.840 32.874Q94.805 32.874 94.782 32.840Q94.758 32.807 94.758 32.774Q94.779 32.686 94.792 32.656Q94.805 32.625 94.858 32.616L95.608 32.616L95.848 31.676Q95.875 31.573 95.958 31.513Q96.042 31.453 96.138 31.453Q96.229 31.453 96.293 31.510Q96.358 31.567 96.358 31.658Q96.358 31.679 96.356 31.690Q96.355 31.702 96.352 31.717L96.124 32.616L96.821 32.616Q96.856 32.616 96.881 32.648Q96.906 32.681 96.906 32.719Q96.885 32.804 96.871 32.834Q96.856 32.865 96.803 32.874L96.059 32.874L95.640 34.567Q95.614 34.649 95.614 34.758Q95.614 34.878 95.665 34.963Q95.716 35.048 95.825 35.048Q96.015 35.048 96.184 34.935Q96.352 34.822 96.477 34.654Q96.601 34.485 96.671 34.309Q96.683 34.280 96.736 34.254L96.833 34.254Q96.912 34.283 96.912 34.339Q96.912 34.345 96.906 34.374Q96.838 34.541 96.726 34.705Q96.613 34.869 96.471 34.992Q96.329 35.115 96.159 35.188Q95.989 35.262 95.813 35.262Q95.532 35.262 95.321 35.108Q95.110 34.954 95.110 34.687\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"var(--tk-accent)\">\u003Cpath fill=\"none\" d=\"M244.332 51.275h73.977V22.822h-73.977Z\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\">\u003Cg transform=\"translate(199.784 5.123)\">\u003Cpath d=\"M65.360 34.195L65.360 32.973Q65.360 32.945 65.391 32.914Q65.423 32.883 65.446 32.883L65.552 32.883Q65.622 32.883 65.638 32.945Q65.700 33.266 65.839 33.506Q65.977 33.746 66.210 33.887Q66.442 34.027 66.751 34.027Q66.989 34.027 67.198 33.967Q67.407 33.906 67.544 33.758Q67.681 33.609 67.681 33.363Q67.681 33.109 67.470 32.943Q67.259 32.777 66.989 32.723L66.368 32.609Q65.962 32.531 65.661 32.275Q65.360 32.019 65.360 31.644Q65.360 31.277 65.561 31.055Q65.763 30.832 66.087 30.734Q66.411 30.637 66.751 30.637Q67.216 30.637 67.513 30.844L67.735 30.660Q67.759 30.637 67.790 30.637L67.841 30.637Q67.872 30.637 67.899 30.664Q67.927 30.691 67.927 30.723L67.927 31.707Q67.927 31.738 67.901 31.767Q67.876 31.797 67.841 31.797L67.735 31.797Q67.700 31.797 67.673 31.769Q67.645 31.742 67.645 31.707Q67.645 31.308 67.393 31.088Q67.141 30.867 66.743 30.867Q66.388 30.867 66.104 30.990Q65.821 31.113 65.821 31.418Q65.821 31.637 66.022 31.769Q66.224 31.902 66.470 31.945L67.095 32.058Q67.524 32.148 67.833 32.445Q68.141 32.742 68.141 33.156Q68.141 33.726 67.743 34.004Q67.345 34.281 66.751 34.281Q66.200 34.281 65.849 33.945L65.552 34.258Q65.528 34.281 65.493 34.281L65.446 34.281Q65.423 34.281 65.391 34.250Q65.360 34.219 65.360 34.195M68.669 32.449Q68.669 31.969 68.901 31.553Q69.134 31.137 69.544 30.887Q69.954 30.637 70.431 30.637Q71.161 30.637 71.559 31.078Q71.958 31.519 71.958 32.250Q71.958 32.355 71.864 32.379L69.415 32.379L69.415 32.449Q69.415 32.859 69.536 33.215Q69.657 33.570 69.929 33.787Q70.200 34.004 70.630 34.004Q70.993 34.004 71.290 33.775Q71.587 33.547 71.688 33.195Q71.696 33.148 71.782 33.133L71.864 33.133Q71.958 33.160 71.958 33.242Q71.958 33.250 71.950 33.281Q71.888 33.508 71.749 33.691Q71.610 33.875 71.419 34.008Q71.227 34.141 71.009 34.211Q70.790 34.281 70.552 34.281Q70.181 34.281 69.843 34.144Q69.505 34.008 69.237 33.756Q68.970 33.504 68.819 33.164Q68.669 32.824 68.669 32.449M69.423 32.141L71.384 32.141Q71.384 31.836 71.282 31.545Q71.181 31.254 70.964 31.072Q70.747 30.891 70.431 30.891Q70.130 30.891 69.899 31.078Q69.669 31.266 69.546 31.557Q69.423 31.848 69.423 32.141M74.360 34.203L72.528 34.203L72.528 33.906Q72.802 33.906 72.970 33.859Q73.138 33.812 73.138 33.644L73.138 29.484Q73.138 29.269 73.075 29.174Q73.013 29.078 72.893 29.057Q72.774 29.035 72.528 29.035L72.528 28.738L73.751 28.652L73.751 33.644Q73.751 33.812 73.919 33.859Q74.087 33.906 74.360 33.906L74.360 34.203M74.806 32.449Q74.806 31.969 75.038 31.553Q75.270 31.137 75.681 30.887Q76.091 30.637 76.567 30.637Q77.298 30.637 77.696 31.078Q78.095 31.519 78.095 32.250Q78.095 32.355 78.001 32.379L75.552 32.379L75.552 32.449Q75.552 32.859 75.673 33.215Q75.794 33.570 76.065 33.787Q76.337 34.004 76.766 34.004Q77.130 34.004 77.427 33.775Q77.724 33.547 77.825 33.195Q77.833 33.148 77.919 33.133L78.001 33.133Q78.095 33.160 78.095 33.242Q78.095 33.250 78.087 33.281Q78.024 33.508 77.886 33.691Q77.747 33.875 77.556 34.008Q77.364 34.141 77.145 34.211Q76.927 34.281 76.688 34.281Q76.317 34.281 75.979 34.144Q75.641 34.008 75.374 33.756Q75.106 33.504 74.956 33.164Q74.806 32.824 74.806 32.449M75.559 32.141L77.520 32.141Q77.520 31.836 77.419 31.545Q77.317 31.254 77.100 31.072Q76.884 30.891 76.567 30.891Q76.266 30.891 76.036 31.078Q75.806 31.266 75.683 31.557Q75.559 31.848 75.559 32.141M78.626 32.476Q78.626 31.980 78.876 31.555Q79.126 31.129 79.546 30.883Q79.966 30.637 80.466 30.637Q81.005 30.637 81.395 30.762Q81.786 30.887 81.786 31.301Q81.786 31.406 81.735 31.498Q81.684 31.590 81.593 31.641Q81.501 31.691 81.391 31.691Q81.286 31.691 81.194 31.641Q81.102 31.590 81.052 31.498Q81.001 31.406 81.001 31.301Q81.001 31.078 81.169 30.973Q80.946 30.914 80.474 30.914Q80.177 30.914 79.962 31.053Q79.747 31.191 79.616 31.422Q79.485 31.652 79.427 31.922Q79.368 32.191 79.368 32.476Q79.368 32.871 79.501 33.221Q79.634 33.570 79.905 33.787Q80.177 34.004 80.575 34.004Q80.950 34.004 81.225 33.787Q81.501 33.570 81.602 33.211Q81.618 33.148 81.681 33.148L81.786 33.148Q81.821 33.148 81.847 33.176Q81.872 33.203 81.872 33.242L81.872 33.266Q81.739 33.746 81.354 34.014Q80.970 34.281 80.466 34.281Q80.102 34.281 79.768 34.144Q79.434 34.008 79.175 33.758Q78.915 33.508 78.770 33.172Q78.626 32.836 78.626 32.476M82.985 33.242L82.985 31.051L82.282 31.051L82.282 30.797Q82.638 30.797 82.880 30.564Q83.122 30.332 83.233 29.984Q83.345 29.637 83.345 29.281L83.626 29.281L83.626 30.754L84.802 30.754L84.802 31.051L83.626 31.051L83.626 33.226Q83.626 33.547 83.745 33.775Q83.864 34.004 84.145 34.004Q84.325 34.004 84.442 33.881Q84.559 33.758 84.612 33.578Q84.665 33.398 84.665 33.226L84.665 32.754L84.946 32.754L84.946 33.242Q84.946 33.496 84.841 33.736Q84.735 33.976 84.538 34.129Q84.341 34.281 84.083 34.281Q83.766 34.281 83.515 34.158Q83.263 34.035 83.124 33.801Q82.985 33.566 82.985 33.242\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.784 5.123)\">\u003Cpath d=\"M90.235 34.203L88.672 34.203Q88.633 34.203 88.606 34.162Q88.579 34.121 88.579 34.074L88.602 33.973Q88.645 33.914 88.700 33.906Q89.024 33.906 89.266 33.762Q89.411 33.676 89.528 33.523Q89.645 33.371 89.692 33.332L92.641 28.601Q92.707 28.492 92.832 28.492L92.914 28.492Q93.028 28.492 93.051 28.601L93.692 33.746Q93.746 33.906 94.289 33.906Q94.387 33.937 94.387 34.027L94.364 34.133Q94.329 34.191 94.266 34.203L92.266 34.203Q92.231 34.203 92.200 34.162Q92.168 34.121 92.168 34.074L92.196 33.973Q92.227 33.918 92.289 33.906Q92.883 33.906 92.914 33.699L92.754 32.394L90.594 32.394L89.938 33.433Q89.930 33.480 89.899 33.553Q89.868 33.625 89.868 33.668Q89.868 33.801 89.987 33.853Q90.106 33.906 90.250 33.906Q90.344 33.937 90.344 34.027L90.321 34.133Q90.289 34.191 90.235 34.203M92.395 29.516L90.778 32.098L92.715 32.098\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.784 5.123)\">\u003Cpath d=\"M95.304 34.687Q95.304 34.614 95.324 34.550L95.743 32.874L95.034 32.874Q94.999 32.874 94.976 32.840Q94.952 32.807 94.952 32.774Q94.973 32.686 94.986 32.656Q94.999 32.625 95.052 32.616L95.802 32.616L96.042 31.676Q96.069 31.573 96.152 31.513Q96.236 31.453 96.332 31.453Q96.423 31.453 96.487 31.510Q96.552 31.567 96.552 31.658Q96.552 31.679 96.550 31.690Q96.549 31.702 96.546 31.717L96.318 32.616L97.015 32.616Q97.050 32.616 97.075 32.648Q97.100 32.681 97.100 32.719Q97.079 32.804 97.065 32.834Q97.050 32.865 96.997 32.874L96.253 32.874L95.834 34.567Q95.808 34.649 95.808 34.758Q95.808 34.878 95.859 34.963Q95.910 35.048 96.019 35.048Q96.209 35.048 96.378 34.935Q96.546 34.822 96.671 34.654Q96.795 34.485 96.865 34.309Q96.877 34.280 96.930 34.254L97.027 34.254Q97.106 34.283 97.106 34.339Q97.106 34.345 97.100 34.374Q97.032 34.541 96.920 34.705Q96.807 34.869 96.665 34.992Q96.523 35.115 96.353 35.188Q96.183 35.262 96.007 35.262Q95.726 35.262 95.515 35.108Q95.304 34.954 95.304 34.687\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M102.268 37.049h25.453\"\u002F>\u003Cpath stroke=\"none\" d=\"m130.32 37.049-4.159-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(31.986 -.888)\">\u003Cpath d=\"M65.352 32.720Q65.352 32.378 65.487 32.079Q65.622 31.780 65.862 31.556Q66.101 31.332 66.419 31.207Q66.737 31.082 67.068 31.082Q67.513 31.082 67.912 31.298Q68.312 31.513 68.547 31.891Q68.781 32.268 68.781 32.720Q68.781 33.061 68.639 33.345Q68.497 33.629 68.253 33.836Q68.008 34.042 67.699 34.157Q67.390 34.271 67.068 34.271Q66.638 34.271 66.236 34.070Q65.834 33.868 65.593 33.516Q65.352 33.164 65.352 32.720M67.068 34.022Q67.670 34.022 67.894 33.644Q68.118 33.266 68.118 32.634Q68.118 32.022 67.883 31.663Q67.649 31.305 67.068 31.305Q66.016 31.305 66.016 32.634Q66.016 33.266 66.241 33.644Q66.467 34.022 67.068 34.022M71.057 34.203L69.423 34.203L69.423 33.923Q69.652 33.923 69.801 33.889Q69.950 33.854 69.950 33.714L69.950 31.865Q69.950 31.595 69.842 31.534Q69.734 31.472 69.423 31.472L69.423 31.192L70.483 31.117L70.483 31.766Q70.654 31.458 70.958 31.287Q71.262 31.117 71.607 31.117Q72.113 31.117 72.397 31.340Q72.681 31.564 72.681 32.060L72.681 33.714Q72.681 33.851 72.829 33.887Q72.978 33.923 73.204 33.923L73.204 34.203L71.573 34.203L71.573 33.923Q71.802 33.923 71.951 33.889Q72.100 33.854 72.100 33.714L72.100 32.074Q72.100 31.739 71.980 31.539Q71.860 31.339 71.546 31.339Q71.276 31.339 71.042 31.475Q70.808 31.612 70.669 31.846Q70.531 32.080 70.531 32.354L70.531 33.714Q70.531 33.851 70.681 33.887Q70.831 33.923 71.057 33.923\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(31.986 -.888)\">\u003Cpath d=\"M76.491 32.692Q76.491 32.354 76.632 32.063Q76.772 31.773 77.016 31.559Q77.260 31.346 77.565 31.231Q77.869 31.117 78.194 31.117Q78.464 31.117 78.727 31.216Q78.990 31.315 79.181 31.493L79.181 30.095Q79.181 29.825 79.074 29.763Q78.966 29.702 78.655 29.702L78.655 29.421L79.732 29.346L79.732 33.530Q79.732 33.718 79.786 33.801Q79.841 33.885 79.942 33.904Q80.043 33.923 80.258 33.923L80.258 34.203L79.151 34.271L79.151 33.854Q78.734 34.271 78.108 34.271Q77.677 34.271 77.305 34.059Q76.932 33.848 76.712 33.487Q76.491 33.126 76.491 32.692M78.166 34.049Q78.375 34.049 78.561 33.977Q78.747 33.906 78.901 33.769Q79.055 33.632 79.151 33.454L79.151 31.845Q79.065 31.698 78.920 31.578Q78.775 31.458 78.605 31.399Q78.436 31.339 78.255 31.339Q77.695 31.339 77.426 31.728Q77.158 32.118 77.158 32.699Q77.158 33.270 77.392 33.660Q77.626 34.049 78.166 34.049M80.866 32.668Q80.866 32.347 80.991 32.058Q81.116 31.769 81.342 31.546Q81.567 31.322 81.863 31.202Q82.158 31.082 82.476 31.082Q82.804 31.082 83.066 31.182Q83.327 31.281 83.503 31.463Q83.679 31.646 83.773 31.904Q83.867 32.162 83.867 32.494Q83.867 32.586 83.785 32.607L81.530 32.607L81.530 32.668Q81.530 33.256 81.813 33.639Q82.097 34.022 82.664 34.022Q82.986 34.022 83.254 33.829Q83.522 33.636 83.611 33.321Q83.618 33.280 83.693 33.266L83.785 33.266Q83.867 33.290 83.867 33.362Q83.867 33.369 83.861 33.396Q83.748 33.793 83.377 34.032Q83.006 34.271 82.582 34.271Q82.145 34.271 81.745 34.063Q81.345 33.854 81.106 33.487Q80.866 33.120 80.866 32.668M81.536 32.398L83.351 32.398Q83.351 32.121 83.254 31.869Q83.156 31.616 82.958 31.460Q82.760 31.305 82.476 31.305Q82.199 31.305 81.986 31.463Q81.772 31.622 81.654 31.877Q81.536 32.132 81.536 32.398M86.137 34.203L84.503 34.203L84.503 33.923Q84.732 33.923 84.881 33.889Q85.030 33.854 85.030 33.714L85.030 31.865Q85.030 31.595 84.922 31.534Q84.814 31.472 84.503 31.472L84.503 31.192L85.563 31.117L85.563 31.766Q85.734 31.458 86.038 31.287Q86.342 31.117 86.687 31.117Q87.087 31.117 87.364 31.257Q87.641 31.397 87.726 31.745Q87.894 31.452 88.193 31.284Q88.492 31.117 88.837 31.117Q89.343 31.117 89.627 31.340Q89.910 31.564 89.910 32.060L89.910 33.714Q89.910 33.851 90.059 33.887Q90.208 33.923 90.433 33.923L90.433 34.203L88.803 34.203L88.803 33.923Q89.029 33.923 89.179 33.887Q89.329 33.851 89.329 33.714L89.329 32.074Q89.329 31.739 89.210 31.539Q89.090 31.339 88.776 31.339Q88.506 31.339 88.271 31.475Q88.037 31.612 87.899 31.846Q87.760 32.080 87.760 32.354L87.760 33.714Q87.760 33.851 87.909 33.887Q88.058 33.923 88.283 33.923L88.283 34.203L86.653 34.203L86.653 33.923Q86.882 33.923 87.031 33.889Q87.179 33.854 87.179 33.714L87.179 32.074Q87.179 31.739 87.060 31.539Q86.940 31.339 86.626 31.339Q86.356 31.339 86.122 31.475Q85.887 31.612 85.749 31.846Q85.611 32.080 85.611 32.354L85.611 33.714Q85.611 33.851 85.761 33.887Q85.911 33.923 86.137 33.923L86.137 34.203M91.079 33.475Q91.079 33.143 91.303 32.916Q91.527 32.689 91.871 32.561Q92.214 32.432 92.587 32.380Q92.959 32.327 93.263 32.327L93.263 32.074Q93.263 31.869 93.156 31.689Q93.048 31.510 92.867 31.407Q92.686 31.305 92.477 31.305Q92.071 31.305 91.835 31.397Q91.924 31.434 91.970 31.518Q92.016 31.602 92.016 31.704Q92.016 31.800 91.970 31.879Q91.924 31.957 91.843 32.002Q91.763 32.046 91.674 32.046Q91.524 32.046 91.423 31.949Q91.322 31.851 91.322 31.704Q91.322 31.082 92.477 31.082Q92.689 31.082 92.939 31.146Q93.188 31.209 93.390 31.328Q93.592 31.448 93.718 31.633Q93.844 31.817 93.844 32.060L93.844 33.636Q93.844 33.752 93.906 33.848Q93.968 33.943 94.080 33.943Q94.190 33.943 94.255 33.849Q94.320 33.755 94.320 33.636L94.320 33.188L94.586 33.188L94.586 33.636Q94.586 33.906 94.359 34.071Q94.132 34.237 93.851 34.237Q93.643 34.237 93.506 34.083Q93.369 33.930 93.345 33.714Q93.198 33.981 92.917 34.126Q92.635 34.271 92.310 34.271Q92.033 34.271 91.749 34.196Q91.466 34.121 91.272 33.942Q91.079 33.762 91.079 33.475M91.695 33.475Q91.695 33.649 91.795 33.779Q91.896 33.909 92.052 33.979Q92.207 34.049 92.371 34.049Q92.590 34.049 92.799 33.952Q93.007 33.854 93.135 33.673Q93.263 33.492 93.263 33.266L93.263 32.538Q92.939 32.538 92.573 32.629Q92.207 32.720 91.951 32.932Q91.695 33.143 91.695 33.475M96.685 34.203L95.051 34.203L95.051 33.923Q95.280 33.923 95.429 33.889Q95.577 33.854 95.577 33.714L95.577 31.865Q95.577 31.595 95.470 31.534Q95.362 31.472 95.051 31.472L95.051 31.192L96.111 31.117L96.111 31.766Q96.281 31.458 96.586 31.287Q96.890 31.117 97.235 31.117Q97.741 31.117 98.025 31.340Q98.308 31.564 98.308 32.060L98.308 33.714Q98.308 33.851 98.457 33.887Q98.606 33.923 98.831 33.923L98.831 34.203L97.201 34.203L97.201 33.923Q97.430 33.923 97.579 33.889Q97.727 33.854 97.727 33.714L97.727 32.074Q97.727 31.739 97.608 31.539Q97.488 31.339 97.174 31.339Q96.904 31.339 96.669 31.475Q96.435 31.612 96.297 31.846Q96.158 32.080 96.158 32.354L96.158 33.714Q96.158 33.851 96.309 33.887Q96.459 33.923 96.685 33.923L96.685 34.203M99.419 32.692Q99.419 32.354 99.559 32.063Q99.699 31.773 99.944 31.559Q100.188 31.346 100.492 31.231Q100.797 31.117 101.121 31.117Q101.391 31.117 101.655 31.216Q101.918 31.315 102.109 31.493L102.109 30.095Q102.109 29.825 102.001 29.763Q101.894 29.702 101.583 29.702L101.583 29.421L102.659 29.346L102.659 33.530Q102.659 33.718 102.714 33.801Q102.769 33.885 102.870 33.904Q102.970 33.923 103.186 33.923L103.186 34.203L102.078 34.271L102.078 33.854Q101.661 34.271 101.036 34.271Q100.605 34.271 100.233 34.059Q99.860 33.848 99.640 33.487Q99.419 33.126 99.419 32.692M101.094 34.049Q101.302 34.049 101.489 33.977Q101.675 33.906 101.829 33.769Q101.983 33.632 102.078 33.454L102.078 31.845Q101.993 31.698 101.848 31.578Q101.702 31.458 101.533 31.399Q101.364 31.339 101.183 31.339Q100.622 31.339 100.354 31.728Q100.086 32.118 100.086 32.699Q100.086 33.270 100.320 33.660Q100.554 34.049 101.094 34.049\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M204.698 37.049h36.834\"\u002F>\u003Cpath stroke=\"none\" d=\"m244.132 37.049-4.16-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-dasharray:3.0,3.0\">\u003Cpath fill=\"none\" d=\"M281.32 51.475c-59.75 28.253-159.335 28.253-115.51 1.054\"\u002F>\u003Cpath stroke=\"none\" d=\"m167.51 51.475-3.563.328 1.863.726-.176 1.993\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M65.393 32.692Q65.393 32.354 65.534 32.063Q65.674 31.773 65.918 31.559Q66.162 31.346 66.467 31.231Q66.771 31.117 67.096 31.117Q67.366 31.117 67.629 31.216Q67.892 31.315 68.083 31.493L68.083 30.095Q68.083 29.825 67.976 29.763Q67.868 29.702 67.557 29.702L67.557 29.421L68.634 29.346L68.634 33.530Q68.634 33.718 68.688 33.801Q68.743 33.885 68.844 33.904Q68.945 33.923 69.160 33.923L69.160 34.203L68.053 34.271L68.053 33.854Q67.636 34.271 67.010 34.271Q66.579 34.271 66.207 34.059Q65.834 33.848 65.614 33.487Q65.393 33.126 65.393 32.692M67.068 34.049Q67.277 34.049 67.463 33.977Q67.649 33.906 67.803 33.769Q67.957 33.632 68.053 33.454L68.053 31.845Q67.967 31.698 67.822 31.578Q67.677 31.458 67.507 31.399Q67.338 31.339 67.157 31.339Q66.597 31.339 66.328 31.728Q66.060 32.118 66.060 32.699Q66.060 33.270 66.294 33.660Q66.528 34.049 67.068 34.049M71.426 34.203L69.874 34.203L69.874 33.923Q70.100 33.923 70.249 33.889Q70.397 33.854 70.397 33.714L70.397 31.865Q70.397 31.677 70.350 31.593Q70.302 31.510 70.204 31.491Q70.107 31.472 69.895 31.472L69.895 31.192L70.951 31.117L70.951 33.714Q70.951 33.854 71.083 33.889Q71.214 33.923 71.426 33.923L71.426 34.203M70.155 29.896Q70.155 29.725 70.278 29.606Q70.401 29.486 70.572 29.486Q70.739 29.486 70.862 29.606Q70.985 29.725 70.985 29.896Q70.985 30.071 70.862 30.194Q70.739 30.317 70.572 30.317Q70.401 30.317 70.278 30.194Q70.155 30.071 70.155 29.896M72.072 34.196L72.072 33.133Q72.072 33.109 72.100 33.082Q72.127 33.055 72.151 33.055L72.260 33.055Q72.325 33.055 72.339 33.113Q72.434 33.547 72.681 33.798Q72.927 34.049 73.340 34.049Q73.682 34.049 73.935 33.916Q74.188 33.783 74.188 33.475Q74.188 33.318 74.094 33.203Q74 33.089 73.861 33.020Q73.723 32.952 73.556 32.914L72.975 32.815Q72.619 32.747 72.346 32.526Q72.072 32.306 72.072 31.964Q72.072 31.715 72.183 31.540Q72.294 31.366 72.481 31.267Q72.667 31.168 72.882 31.125Q73.098 31.082 73.340 31.082Q73.754 31.082 74.034 31.264L74.249 31.089Q74.260 31.086 74.266 31.084Q74.273 31.082 74.284 31.082L74.335 31.082Q74.362 31.082 74.386 31.106Q74.410 31.130 74.410 31.158L74.410 32.005Q74.410 32.026 74.386 32.053Q74.362 32.080 74.335 32.080L74.222 32.080Q74.195 32.080 74.169 32.055Q74.143 32.029 74.143 32.005Q74.143 31.769 74.037 31.605Q73.932 31.441 73.749 31.359Q73.566 31.277 73.333 31.277Q73.005 31.277 72.749 31.380Q72.493 31.482 72.493 31.759Q72.493 31.954 72.675 32.063Q72.858 32.173 73.087 32.214L73.662 32.320Q73.908 32.368 74.121 32.496Q74.335 32.624 74.472 32.827Q74.608 33.031 74.608 33.280Q74.608 33.793 74.243 34.032Q73.877 34.271 73.340 34.271Q72.845 34.271 72.513 33.977L72.246 34.251Q72.226 34.271 72.199 34.271L72.151 34.271Q72.127 34.271 72.100 34.244Q72.072 34.217 72.072 34.196M75.237 32.692Q75.237 32.364 75.372 32.063Q75.507 31.763 75.743 31.542Q75.979 31.322 76.283 31.202Q76.587 31.082 76.912 31.082Q77.418 31.082 77.766 31.185Q78.115 31.287 78.115 31.663Q78.115 31.810 78.018 31.911Q77.920 32.012 77.773 32.012Q77.620 32.012 77.520 31.913Q77.421 31.814 77.421 31.663Q77.421 31.475 77.561 31.383Q77.360 31.332 76.919 31.332Q76.563 31.332 76.334 31.528Q76.105 31.725 76.005 32.034Q75.904 32.344 75.904 32.692Q75.904 33.041 76.030 33.347Q76.157 33.653 76.411 33.837Q76.666 34.022 77.021 34.022Q77.244 34.022 77.428 33.938Q77.613 33.854 77.748 33.699Q77.883 33.543 77.941 33.335Q77.954 33.280 78.009 33.280L78.122 33.280Q78.153 33.280 78.175 33.304Q78.197 33.328 78.197 33.362L78.197 33.383Q78.112 33.670 77.924 33.868Q77.736 34.066 77.471 34.169Q77.206 34.271 76.912 34.271Q76.481 34.271 76.093 34.065Q75.705 33.858 75.471 33.495Q75.237 33.133 75.237 32.692M78.843 33.475Q78.843 33.143 79.067 32.916Q79.291 32.689 79.634 32.561Q79.978 32.432 80.350 32.380Q80.723 32.327 81.027 32.327L81.027 32.074Q81.027 31.869 80.920 31.689Q80.812 31.510 80.631 31.407Q80.450 31.305 80.241 31.305Q79.834 31.305 79.599 31.397Q79.687 31.434 79.734 31.518Q79.780 31.602 79.780 31.704Q79.780 31.800 79.734 31.879Q79.687 31.957 79.607 32.002Q79.527 32.046 79.438 32.046Q79.287 32.046 79.187 31.949Q79.086 31.851 79.086 31.704Q79.086 31.082 80.241 31.082Q80.453 31.082 80.703 31.146Q80.952 31.209 81.154 31.328Q81.355 31.448 81.482 31.633Q81.608 31.817 81.608 32.060L81.608 33.636Q81.608 33.752 81.670 33.848Q81.731 33.943 81.844 33.943Q81.954 33.943 82.018 33.849Q82.083 33.755 82.083 33.636L82.083 33.188L82.350 33.188L82.350 33.636Q82.350 33.906 82.123 34.071Q81.895 34.237 81.615 34.237Q81.407 34.237 81.270 34.083Q81.133 33.930 81.109 33.714Q80.962 33.981 80.680 34.126Q80.398 34.271 80.074 34.271Q79.797 34.271 79.513 34.196Q79.229 34.121 79.036 33.942Q78.843 33.762 78.843 33.475M79.458 33.475Q79.458 33.649 79.559 33.779Q79.660 33.909 79.816 33.979Q79.971 34.049 80.135 34.049Q80.354 34.049 80.562 33.952Q80.771 33.854 80.899 33.673Q81.027 33.492 81.027 33.266L81.027 32.538Q80.703 32.538 80.337 32.629Q79.971 32.720 79.715 32.932Q79.458 33.143 79.458 33.475M84.517 34.203L82.781 34.203L82.781 33.923Q83.010 33.923 83.158 33.889Q83.307 33.854 83.307 33.714L83.307 31.865Q83.307 31.595 83.199 31.534Q83.092 31.472 82.781 31.472L82.781 31.192L83.809 31.117L83.809 31.824Q83.939 31.516 84.182 31.317Q84.425 31.117 84.743 31.117Q84.961 31.117 85.132 31.241Q85.303 31.366 85.303 31.578Q85.303 31.715 85.204 31.814Q85.105 31.913 84.972 31.913Q84.835 31.913 84.736 31.814Q84.637 31.715 84.637 31.578Q84.637 31.438 84.736 31.339Q84.445 31.339 84.245 31.535Q84.045 31.732 83.953 32.026Q83.861 32.320 83.861 32.600L83.861 33.714Q83.861 33.923 84.517 33.923L84.517 34.203M85.888 32.692Q85.888 32.354 86.028 32.063Q86.168 31.773 86.412 31.559Q86.657 31.346 86.961 31.231Q87.265 31.117 87.590 31.117Q87.860 31.117 88.123 31.216Q88.386 31.315 88.578 31.493L88.578 30.095Q88.578 29.825 88.470 29.763Q88.362 29.702 88.051 29.702L88.051 29.421L89.128 29.346L89.128 33.530Q89.128 33.718 89.183 33.801Q89.237 33.885 89.338 33.904Q89.439 33.923 89.654 33.923L89.654 34.203L88.547 34.271L88.547 33.854Q88.130 34.271 87.504 34.271Q87.074 34.271 86.701 34.059Q86.329 33.848 86.108 33.487Q85.888 33.126 85.888 32.692M87.562 34.049Q87.771 34.049 87.957 33.977Q88.143 33.906 88.297 33.769Q88.451 33.632 88.547 33.454L88.547 31.845Q88.461 31.698 88.316 31.578Q88.171 31.458 88.002 31.399Q87.832 31.339 87.651 31.339Q87.091 31.339 86.822 31.728Q86.554 32.118 86.554 32.699Q86.554 33.270 86.788 33.660Q87.022 34.049 87.562 34.049M90.803 35.433Q90.803 35.399 90.830 35.372Q91.100 35.143 91.249 34.820Q91.397 34.497 91.397 34.141L91.397 34.104Q91.288 34.203 91.124 34.203Q90.943 34.203 90.823 34.083Q90.704 33.964 90.704 33.783Q90.704 33.608 90.823 33.489Q90.943 33.369 91.124 33.369Q91.380 33.369 91.500 33.608Q91.620 33.848 91.620 34.141Q91.620 34.541 91.450 34.912Q91.281 35.283 90.984 35.539Q90.953 35.560 90.926 35.560Q90.885 35.560 90.844 35.519Q90.803 35.478 90.803 35.433\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M97.034 34.203L95.298 34.203L95.298 33.923Q95.527 33.923 95.676 33.889Q95.824 33.854 95.824 33.714L95.824 31.865Q95.824 31.595 95.717 31.534Q95.609 31.472 95.298 31.472L95.298 31.192L96.327 31.117L96.327 31.824Q96.457 31.516 96.699 31.317Q96.942 31.117 97.260 31.117Q97.479 31.117 97.650 31.241Q97.821 31.366 97.821 31.578Q97.821 31.715 97.721 31.814Q97.622 31.913 97.489 31.913Q97.352 31.913 97.253 31.814Q97.154 31.715 97.154 31.578Q97.154 31.438 97.253 31.339Q96.963 31.339 96.763 31.535Q96.563 31.732 96.470 32.026Q96.378 32.320 96.378 32.600L96.378 33.714Q96.378 33.923 97.034 33.923L97.034 34.203M98.364 32.668Q98.364 32.347 98.489 32.058Q98.614 31.769 98.839 31.546Q99.065 31.322 99.360 31.202Q99.656 31.082 99.974 31.082Q100.302 31.082 100.564 31.182Q100.825 31.281 101.001 31.463Q101.177 31.646 101.271 31.904Q101.365 32.162 101.365 32.494Q101.365 32.586 101.283 32.607L99.027 32.607L99.027 32.668Q99.027 33.256 99.311 33.639Q99.595 34.022 100.162 34.022Q100.483 34.022 100.751 33.829Q101.020 33.636 101.109 33.321Q101.116 33.280 101.191 33.266L101.283 33.266Q101.365 33.290 101.365 33.362Q101.365 33.369 101.358 33.396Q101.245 33.793 100.875 34.032Q100.504 34.271 100.080 34.271Q99.642 34.271 99.242 34.063Q98.843 33.854 98.603 33.487Q98.364 33.120 98.364 32.668M99.034 32.398L100.849 32.398Q100.849 32.121 100.751 31.869Q100.654 31.616 100.456 31.460Q100.258 31.305 99.974 31.305Q99.697 31.305 99.483 31.463Q99.270 31.622 99.152 31.877Q99.034 32.132 99.034 32.398M103.597 35.560L101.967 35.560L101.967 35.280Q102.196 35.280 102.344 35.245Q102.493 35.211 102.493 35.071L102.493 31.725Q102.493 31.554 102.356 31.513Q102.220 31.472 101.967 31.472L101.967 31.192L103.047 31.117L103.047 31.523Q103.269 31.322 103.556 31.219Q103.843 31.117 104.151 31.117Q104.578 31.117 104.942 31.330Q105.306 31.544 105.520 31.908Q105.733 32.272 105.733 32.692Q105.733 33.137 105.494 33.501Q105.255 33.865 104.862 34.068Q104.469 34.271 104.024 34.271Q103.758 34.271 103.510 34.171Q103.262 34.070 103.074 33.889L103.074 35.071Q103.074 35.208 103.223 35.244Q103.371 35.280 103.597 35.280L103.597 35.560M103.074 31.872L103.074 33.482Q103.207 33.735 103.450 33.892Q103.693 34.049 103.970 34.049Q104.298 34.049 104.551 33.848Q104.803 33.646 104.937 33.328Q105.070 33.010 105.070 32.692Q105.070 32.463 105.005 32.234Q104.940 32.005 104.812 31.807Q104.684 31.609 104.489 31.489Q104.294 31.370 104.062 31.370Q103.768 31.370 103.500 31.499Q103.231 31.629 103.074 31.872\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M106.555 32.668Q106.555 32.347 106.680 32.058Q106.805 31.769 107.031 31.546Q107.256 31.322 107.552 31.202Q107.847 31.082 108.165 31.082Q108.493 31.082 108.755 31.182Q109.016 31.281 109.192 31.463Q109.368 31.646 109.462 31.904Q109.556 32.162 109.556 32.494Q109.556 32.586 109.474 32.607L107.219 32.607L107.219 32.668Q107.219 33.256 107.502 33.639Q107.786 34.022 108.353 34.022Q108.675 34.022 108.943 33.829Q109.211 33.636 109.300 33.321Q109.307 33.280 109.382 33.266L109.474 33.266Q109.556 33.290 109.556 33.362Q109.556 33.369 109.550 33.396Q109.437 33.793 109.066 34.032Q108.695 34.271 108.271 34.271Q107.834 34.271 107.434 34.063Q107.034 33.854 106.795 33.487Q106.555 33.120 106.555 32.668M107.225 32.398L109.040 32.398Q109.040 32.121 108.943 31.869Q108.845 31.616 108.647 31.460Q108.449 31.305 108.165 31.305Q107.888 31.305 107.675 31.463Q107.461 31.622 107.343 31.877Q107.225 32.132 107.225 32.398M110.202 33.475Q110.202 33.143 110.426 32.916Q110.650 32.689 110.994 32.561Q111.337 32.432 111.710 32.380Q112.082 32.327 112.386 32.327L112.386 32.074Q112.386 31.869 112.279 31.689Q112.171 31.510 111.990 31.407Q111.809 31.305 111.600 31.305Q111.194 31.305 110.958 31.397Q111.047 31.434 111.093 31.518Q111.139 31.602 111.139 31.704Q111.139 31.800 111.093 31.879Q111.047 31.957 110.966 32.002Q110.886 32.046 110.797 32.046Q110.647 32.046 110.546 31.949Q110.445 31.851 110.445 31.704Q110.445 31.082 111.600 31.082Q111.812 31.082 112.062 31.146Q112.311 31.209 112.513 31.328Q112.715 31.448 112.841 31.633Q112.968 31.817 112.968 32.060L112.968 33.636Q112.968 33.752 113.029 33.848Q113.091 33.943 113.203 33.943Q113.313 33.943 113.378 33.849Q113.443 33.755 113.443 33.636L113.443 33.188L113.709 33.188L113.709 33.636Q113.709 33.906 113.482 34.071Q113.255 34.237 112.974 34.237Q112.766 34.237 112.629 34.083Q112.492 33.930 112.469 33.714Q112.322 33.981 112.040 34.126Q111.758 34.271 111.433 34.271Q111.156 34.271 110.872 34.196Q110.589 34.121 110.396 33.942Q110.202 33.762 110.202 33.475M110.818 33.475Q110.818 33.649 110.918 33.779Q111.019 33.909 111.175 33.979Q111.330 34.049 111.494 34.049Q111.713 34.049 111.922 33.952Q112.130 33.854 112.258 33.673Q112.386 33.492 112.386 33.266L112.386 32.538Q112.062 32.538 111.696 32.629Q111.330 32.720 111.074 32.932Q110.818 33.143 110.818 33.475M114.653 33.362L114.653 31.465L114.013 31.465L114.013 31.243Q114.331 31.243 114.548 31.033Q114.765 30.823 114.866 30.513Q114.967 30.204 114.967 29.896L115.234 29.896L115.234 31.185L116.310 31.185L116.310 31.465L115.234 31.465L115.234 33.349Q115.234 33.625 115.338 33.824Q115.442 34.022 115.702 34.022Q115.859 34.022 115.965 33.918Q116.071 33.813 116.121 33.660Q116.170 33.506 116.170 33.349L116.170 32.935L116.437 32.935L116.437 33.362Q116.437 33.588 116.338 33.798Q116.239 34.008 116.054 34.140Q115.869 34.271 115.640 34.271Q115.203 34.271 114.928 34.034Q114.653 33.796 114.653 33.362\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M120.017 33.475Q120.017 33.143 120.240 32.916Q120.464 32.689 120.808 32.561Q121.151 32.432 121.524 32.380Q121.896 32.327 122.201 32.327L122.201 32.074Q122.201 31.869 122.093 31.689Q121.985 31.510 121.804 31.407Q121.623 31.305 121.415 31.305Q121.008 31.305 120.772 31.397Q120.861 31.434 120.907 31.518Q120.953 31.602 120.953 31.704Q120.953 31.800 120.907 31.879Q120.861 31.957 120.780 32.002Q120.700 32.046 120.611 32.046Q120.461 32.046 120.360 31.949Q120.259 31.851 120.259 31.704Q120.259 31.082 121.415 31.082Q121.626 31.082 121.876 31.146Q122.125 31.209 122.327 31.328Q122.529 31.448 122.655 31.633Q122.782 31.817 122.782 32.060L122.782 33.636Q122.782 33.752 122.843 33.848Q122.905 33.943 123.018 33.943Q123.127 33.943 123.192 33.849Q123.257 33.755 123.257 33.636L123.257 33.188L123.523 33.188L123.523 33.636Q123.523 33.906 123.296 34.071Q123.069 34.237 122.789 34.237Q122.580 34.237 122.443 34.083Q122.307 33.930 122.283 33.714Q122.136 33.981 121.854 34.126Q121.572 34.271 121.247 34.271Q120.970 34.271 120.686 34.196Q120.403 34.121 120.210 33.942Q120.017 33.762 120.017 33.475M120.632 33.475Q120.632 33.649 120.733 33.779Q120.833 33.909 120.989 33.979Q121.144 34.049 121.309 34.049Q121.527 34.049 121.736 33.952Q121.944 33.854 122.072 33.673Q122.201 33.492 122.201 33.266L122.201 32.538Q121.876 32.538 121.510 32.629Q121.144 32.720 120.888 32.932Q120.632 33.143 120.632 33.475M124.467 33.362L124.467 31.465L123.828 31.465L123.828 31.243Q124.145 31.243 124.363 31.033Q124.580 30.823 124.680 30.513Q124.781 30.204 124.781 29.896L125.048 29.896L125.048 31.185L126.124 31.185L126.124 31.465L125.048 31.465L125.048 33.349Q125.048 33.625 125.152 33.824Q125.256 34.022 125.516 34.022Q125.673 34.022 125.779 33.918Q125.885 33.813 125.935 33.660Q125.984 33.506 125.984 33.349L125.984 32.935L126.251 32.935L126.251 33.362Q126.251 33.588 126.152 33.798Q126.053 34.008 125.868 34.140Q125.684 34.271 125.455 34.271Q125.017 34.271 124.742 34.034Q124.467 33.796 124.467 33.362\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M130.109 34.343L130.057 34.343Q130.027 34.343 130.004 34.318Q129.982 34.292 129.982 34.258Q129.982 34.251 129.989 34.237L130.372 32.668Q130.386 32.614 130.450 32.614L130.563 32.614Q130.597 32.614 130.618 32.638Q130.638 32.661 130.638 32.699Q130.638 32.737 130.611 32.873Q130.584 33.010 130.584 33.089Q130.584 33.605 130.982 33.834Q131.380 34.063 131.941 34.063Q132.248 34.063 132.559 33.897Q132.870 33.731 133.070 33.451Q133.270 33.171 133.270 32.853Q133.270 32.597 133.110 32.403Q132.949 32.210 132.689 32.152L131.719 31.920Q131.469 31.862 131.274 31.718Q131.079 31.575 130.968 31.361Q130.857 31.147 130.857 30.891Q130.857 30.559 131.020 30.264Q131.182 29.968 131.455 29.746Q131.729 29.524 132.060 29.402Q132.392 29.281 132.703 29.281Q133.058 29.281 133.351 29.397Q133.643 29.514 133.831 29.766L134.251 29.302Q134.272 29.281 134.299 29.281L134.350 29.281Q134.385 29.281 134.405 29.307Q134.426 29.332 134.426 29.367Q134.426 29.373 134.419 29.387L134.032 30.949Q134.009 31.011 133.957 31.011L133.845 31.011Q133.769 31.011 133.769 30.918Q133.783 30.816 133.797 30.604Q133.797 30.081 133.506 29.807Q133.216 29.534 132.682 29.534Q132.460 29.534 132.231 29.614Q132.002 29.695 131.806 29.843Q131.609 29.992 131.491 30.195Q131.373 30.399 131.373 30.624Q131.373 30.864 131.539 31.041Q131.705 31.219 131.948 31.277L132.922 31.510Q133.171 31.564 133.371 31.722Q133.571 31.879 133.680 32.104Q133.790 32.330 133.790 32.593Q133.790 33.051 133.515 33.454Q133.240 33.858 132.802 34.100Q132.365 34.343 131.913 34.343Q130.973 34.343 130.570 33.861L130.157 34.323Q130.136 34.343 130.109 34.343\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M135.124 34.773Q135.124 34.710 135.139 34.659L135.481 33.289L134.851 33.289Q134.821 33.289 134.798 33.262Q134.775 33.235 134.775 33.203Q134.775 33.067 134.870 33.047L135.539 33.047L135.735 32.268Q135.756 32.185 135.835 32.129Q135.913 32.073 135.996 32.073Q136.074 32.073 136.130 32.124Q136.186 32.176 136.186 32.254Q136.186 32.288 136.179 32.303L135.996 33.047L136.626 33.047Q136.655 33.047 136.677 33.073Q136.699 33.099 136.699 33.128Q136.699 33.265 136.606 33.289L135.935 33.289L135.590 34.673Q135.571 34.739 135.571 34.817Q135.571 34.920 135.619 34.997Q135.666 35.074 135.764 35.074Q135.923 35.074 136.073 34.983Q136.223 34.893 136.333 34.757Q136.443 34.622 136.511 34.458Q136.521 34.434 136.565 34.412L136.670 34.412Q136.735 34.434 136.735 34.483Q136.735 34.488 136.731 34.512Q136.601 34.820 136.334 35.039Q136.067 35.259 135.754 35.259Q135.603 35.259 135.459 35.207Q135.315 35.154 135.219 35.044Q135.124 34.934 135.124 34.773\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(79.287 46.855)\">\u003Cpath d=\"M139.607 35.913L139.607 34.092L137.798 34.092Q137.686 34.078 137.664 33.968L137.664 33.938Q137.686 33.828 137.798 33.814L139.607 33.814L139.607 31.993Q139.619 31.939 139.658 31.903Q139.698 31.868 139.749 31.868Q139.861 31.868 139.888 31.993L139.888 33.814L141.697 33.814Q141.802 33.828 141.829 33.938L141.829 33.968Q141.802 34.078 141.697 34.092L139.888 34.092L139.888 35.913Q139.861 36.038 139.749 36.038Q139.698 36.038 139.658 36.003Q139.619 35.967 139.607 35.913M145.093 35.203L143.052 35.203L143.052 34.964Q143.833 34.964 143.833 34.844L143.833 32.298Q143.655 32.373 143.451 32.403Q143.247 32.432 143.018 32.432L143.018 32.193Q143.355 32.193 143.638 32.124Q143.921 32.056 144.131 31.873L144.236 31.873Q144.263 31.873 144.287 31.897Q144.312 31.922 144.312 31.949L144.312 34.844Q144.312 34.964 145.093 34.964\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Two ways to spend a model. Background planning (top) improves a global policy over many states ahead of time, so selecting \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.8333em;vertical-align:-0.15em;\">\u003C\u002Fspan>\u003Cspan class=\"mord\">\u003Cspan class=\"mord mathnormal\">A\u003C\u002Fspan>\u003Cspan class=\"msupsub\">\u003Cspan class=\"vlist-t vlist-t2\">\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.2806em;\">\u003Cspan style=\"top:-2.55em;margin-left:0em;margin-right:0.05em;\">\u003Cspan class=\"pstrut\" style=\"height:2.7em;\">\u003C\u002Fspan>\u003Cspan class=\"sizing reset-size6 size3 mtight\">\u003Cspan class=\"mord mathnormal mtight\">t\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"vlist-s\">​\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.15em;\">\u003Cspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> is a table lookup. Decision-time planning (bottom) runs a fresh lookahead from \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.8333em;vertical-align:-0.15em;\">\u003C\u002Fspan>\u003Cspan class=\"mord\">\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0576em;\">S\u003C\u002Fspan>\u003Cspan class=\"msupsub\">\u003Cspan class=\"vlist-t vlist-t2\">\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.2806em;\">\u003Cspan style=\"top:-2.55em;margin-left:-0.0576em;margin-right:0.05em;\">\u003Cspan class=\"pstrut\" style=\"height:2.7em;\">\u003C\u002Fspan>\u003Cspan class=\"sizing reset-size6 size3 mtight\">\u003Cspan class=\"mord mathnormal mtight\">t\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"vlist-s\">​\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.15em;\">\u003Cspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> and returns one action, then discards the work.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:396.792px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 297.594 160.045\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M219.124 4.752c0-42.428-63.693-76.822-142.264-76.822-78.57 0-142.263 34.394-142.263 76.822S-1.711 81.575 76.86 81.575 219.124 47.18 219.124 4.752Zm-142.264 0\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(102.735 -63.466)\">\u003Cpath d=\"M77.196 3.920Q77.196 3.436 77.598 3.141Q78.001 2.846 78.551 2.727Q79.102 2.607 79.594 2.607L79.594 2.318Q79.594 2.092 79.479 1.885Q79.364 1.678 79.167 1.559Q78.969 1.439 78.739 1.439Q78.313 1.439 78.028 1.545Q78.098 1.572 78.145 1.627Q78.192 1.682 78.217 1.752Q78.243 1.822 78.243 1.897Q78.243 2.002 78.192 2.094Q78.141 2.186 78.049 2.236Q77.958 2.287 77.852 2.287Q77.747 2.287 77.655 2.236Q77.563 2.186 77.512 2.094Q77.462 2.002 77.462 1.897Q77.462 1.479 77.850 1.332Q78.239 1.186 78.739 1.186Q79.071 1.186 79.424 1.316Q79.778 1.447 80.006 1.701Q80.235 1.955 80.235 2.303L80.235 4.104Q80.235 4.236 80.307 4.346Q80.380 4.455 80.508 4.455Q80.633 4.455 80.702 4.350Q80.770 4.244 80.770 4.104L80.770 3.592L81.051 3.592L81.051 4.104Q81.051 4.307 80.934 4.465Q80.817 4.623 80.635 4.707Q80.454 4.791 80.251 4.791Q80.020 4.791 79.868 4.619Q79.715 4.447 79.684 4.217Q79.524 4.498 79.215 4.664Q78.907 4.830 78.555 4.830Q78.044 4.830 77.620 4.607Q77.196 4.385 77.196 3.920M77.883 3.920Q77.883 4.205 78.110 4.391Q78.337 4.576 78.630 4.576Q78.876 4.576 79.100 4.459Q79.325 4.342 79.460 4.139Q79.594 3.936 79.594 3.682L79.594 2.850Q79.329 2.850 79.044 2.904Q78.758 2.959 78.487 3.088Q78.215 3.217 78.049 3.424Q77.883 3.631 77.883 3.920M83.258 4.752L81.426 4.752L81.426 4.455Q81.700 4.455 81.868 4.408Q82.036 4.361 82.036 4.193L82.036 0.033Q82.036-0.182 81.973-0.277Q81.911-0.373 81.792-0.394Q81.672-0.416 81.426-0.416L81.426-0.713L82.649-0.799L82.649 4.193Q82.649 4.361 82.817 4.408Q82.985 4.455 83.258 4.455L83.258 4.752M85.618 4.752L83.786 4.752L83.786 4.455Q84.059 4.455 84.227 4.408Q84.395 4.361 84.395 4.193L84.395 0.033Q84.395-0.182 84.333-0.277Q84.270-0.373 84.151-0.394Q84.032-0.416 83.786-0.416L83.786-0.713L85.008-0.799L85.008 4.193Q85.008 4.361 85.176 4.408Q85.344 4.455 85.618 4.455\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(102.735 -63.466)\">\u003Cpath d=\"M88.947 4.744L88.947 3.522Q88.947 3.494 88.978 3.463Q89.010 3.432 89.033 3.432L89.139 3.432Q89.209 3.432 89.225 3.494Q89.287 3.814 89.426 4.055Q89.564 4.295 89.797 4.436Q90.029 4.576 90.338 4.576Q90.576 4.576 90.785 4.516Q90.994 4.455 91.131 4.307Q91.268 4.158 91.268 3.912Q91.268 3.658 91.057 3.492Q90.846 3.326 90.576 3.272L89.955 3.158Q89.549 3.080 89.248 2.824Q88.947 2.568 88.947 2.193Q88.947 1.826 89.148 1.604Q89.350 1.381 89.674 1.283Q89.998 1.186 90.338 1.186Q90.803 1.186 91.100 1.393L91.322 1.209Q91.346 1.186 91.377 1.186L91.428 1.186Q91.459 1.186 91.486 1.213Q91.514 1.240 91.514 1.272L91.514 2.256Q91.514 2.287 91.488 2.316Q91.463 2.346 91.428 2.346L91.322 2.346Q91.287 2.346 91.260 2.318Q91.232 2.291 91.232 2.256Q91.232 1.857 90.980 1.637Q90.728 1.416 90.330 1.416Q89.975 1.416 89.691 1.539Q89.408 1.662 89.408 1.967Q89.408 2.186 89.609 2.318Q89.811 2.451 90.057 2.494L90.682 2.607Q91.111 2.697 91.420 2.994Q91.728 3.291 91.728 3.705Q91.728 4.275 91.330 4.553Q90.932 4.830 90.338 4.830Q89.787 4.830 89.436 4.494L89.139 4.807Q89.115 4.830 89.080 4.830L89.033 4.830Q89.010 4.830 88.978 4.799Q88.947 4.768 88.947 4.744M92.881 3.791L92.881 1.600L92.178 1.600L92.178 1.346Q92.533 1.346 92.775 1.113Q93.018 0.881 93.129 0.533Q93.240 0.186 93.240-0.170L93.521-0.170L93.521 1.303L94.697 1.303L94.697 1.600L93.521 1.600L93.521 3.775Q93.521 4.096 93.641 4.324Q93.760 4.553 94.041 4.553Q94.221 4.553 94.338 4.430Q94.455 4.307 94.508 4.127Q94.561 3.947 94.561 3.775L94.561 3.303L94.842 3.303L94.842 3.791Q94.842 4.045 94.736 4.285Q94.631 4.525 94.434 4.678Q94.236 4.830 93.978 4.830Q93.662 4.830 93.410 4.707Q93.158 4.584 93.020 4.350Q92.881 4.115 92.881 3.791M95.658 3.920Q95.658 3.436 96.061 3.141Q96.463 2.846 97.014 2.727Q97.564 2.607 98.057 2.607L98.057 2.318Q98.057 2.092 97.941 1.885Q97.826 1.678 97.629 1.559Q97.432 1.439 97.201 1.439Q96.775 1.439 96.490 1.545Q96.561 1.572 96.607 1.627Q96.654 1.682 96.680 1.752Q96.705 1.822 96.705 1.897Q96.705 2.002 96.654 2.094Q96.603 2.186 96.512 2.236Q96.420 2.287 96.314 2.287Q96.209 2.287 96.117 2.236Q96.025 2.186 95.975 2.094Q95.924 2.002 95.924 1.897Q95.924 1.479 96.312 1.332Q96.701 1.186 97.201 1.186Q97.533 1.186 97.887 1.316Q98.240 1.447 98.469 1.701Q98.697 1.955 98.697 2.303L98.697 4.104Q98.697 4.236 98.770 4.346Q98.842 4.455 98.971 4.455Q99.096 4.455 99.164 4.350Q99.232 4.244 99.232 4.104L99.232 3.592L99.514 3.592L99.514 4.104Q99.514 4.307 99.396 4.465Q99.279 4.623 99.098 4.707Q98.916 4.791 98.713 4.791Q98.482 4.791 98.330 4.619Q98.178 4.447 98.146 4.217Q97.986 4.498 97.678 4.664Q97.369 4.830 97.018 4.830Q96.506 4.830 96.082 4.607Q95.658 4.385 95.658 3.920M96.346 3.920Q96.346 4.205 96.572 4.391Q96.799 4.576 97.092 4.576Q97.338 4.576 97.562 4.459Q97.787 4.342 97.922 4.139Q98.057 3.936 98.057 3.682L98.057 2.850Q97.791 2.850 97.506 2.904Q97.221 2.959 96.949 3.088Q96.678 3.217 96.512 3.424Q96.346 3.631 96.346 3.920M100.432 3.791L100.432 1.600L99.728 1.600L99.728 1.346Q100.084 1.346 100.326 1.113Q100.568 0.881 100.680 0.533Q100.791 0.186 100.791-0.170L101.072-0.170L101.072 1.303L102.248 1.303L102.248 1.600L101.072 1.600L101.072 3.775Q101.072 4.096 101.191 4.324Q101.311 4.553 101.592 4.553Q101.771 4.553 101.889 4.430Q102.006 4.307 102.059 4.127Q102.111 3.947 102.111 3.775L102.111 3.303L102.393 3.303L102.393 3.791Q102.393 4.045 102.287 4.285Q102.182 4.525 101.984 4.678Q101.787 4.830 101.529 4.830Q101.213 4.830 100.961 4.707Q100.709 4.584 100.570 4.350Q100.432 4.115 100.432 3.791M103.111 2.998Q103.111 2.518 103.344 2.102Q103.576 1.686 103.986 1.436Q104.396 1.186 104.873 1.186Q105.603 1.186 106.002 1.627Q106.400 2.068 106.400 2.799Q106.400 2.904 106.307 2.928L103.857 2.928L103.857 2.998Q103.857 3.408 103.978 3.764Q104.100 4.119 104.371 4.336Q104.643 4.553 105.072 4.553Q105.436 4.553 105.732 4.324Q106.029 4.096 106.131 3.744Q106.139 3.697 106.225 3.682L106.307 3.682Q106.400 3.709 106.400 3.791Q106.400 3.799 106.393 3.830Q106.330 4.057 106.191 4.240Q106.053 4.424 105.861 4.557Q105.670 4.689 105.451 4.760Q105.232 4.830 104.994 4.830Q104.623 4.830 104.285 4.693Q103.947 4.557 103.680 4.305Q103.412 4.053 103.262 3.713Q103.111 3.373 103.111 2.998M103.865 2.689L105.826 2.689Q105.826 2.385 105.725 2.094Q105.623 1.803 105.406 1.621Q105.189 1.439 104.873 1.439Q104.572 1.439 104.342 1.627Q104.111 1.814 103.988 2.106Q103.865 2.397 103.865 2.689M106.932 4.744L106.932 3.522Q106.932 3.494 106.963 3.463Q106.994 3.432 107.018 3.432L107.123 3.432Q107.193 3.432 107.209 3.494Q107.271 3.814 107.410 4.055Q107.549 4.295 107.781 4.436Q108.014 4.576 108.322 4.576Q108.561 4.576 108.770 4.516Q108.978 4.455 109.115 4.307Q109.252 4.158 109.252 3.912Q109.252 3.658 109.041 3.492Q108.830 3.326 108.561 3.272L107.939 3.158Q107.533 3.080 107.232 2.824Q106.932 2.568 106.932 2.193Q106.932 1.826 107.133 1.604Q107.334 1.381 107.658 1.283Q107.982 1.186 108.322 1.186Q108.787 1.186 109.084 1.393L109.307 1.209Q109.330 1.186 109.361 1.186L109.412 1.186Q109.443 1.186 109.471 1.213Q109.498 1.240 109.498 1.272L109.498 2.256Q109.498 2.287 109.473 2.316Q109.447 2.346 109.412 2.346L109.307 2.346Q109.271 2.346 109.244 2.318Q109.217 2.291 109.217 2.256Q109.217 1.857 108.965 1.637Q108.713 1.416 108.314 1.416Q107.959 1.416 107.676 1.539Q107.393 1.662 107.393 1.967Q107.393 2.186 107.594 2.318Q107.795 2.451 108.041 2.494L108.666 2.607Q109.096 2.697 109.404 2.994Q109.713 3.291 109.713 3.705Q109.713 4.275 109.314 4.553Q108.916 4.830 108.322 4.830Q107.771 4.830 107.420 4.494L107.123 4.807Q107.100 4.830 107.064 4.830L107.018 4.830Q106.994 4.830 106.963 4.799Q106.932 4.768 106.932 4.744\" 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=\"M125.23 7.598c0-26.714-34.394-48.37-76.822-48.37s-76.823 21.656-76.823 48.37 34.394 48.37 76.823 48.37 76.822-21.656 76.822-48.37Zm-76.822 0\" style=\"stroke-width:.8\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-55.184 -47.635)\">\u003Cpath d=\"M79.106 4.752L77.126 4.752L77.126 4.455Q77.395 4.455 77.563 4.410Q77.731 4.365 77.731 4.193L77.731 2.057Q77.731 1.842 77.669 1.746Q77.606 1.650 77.489 1.629Q77.372 1.607 77.126 1.607L77.126 1.311L78.294 1.225L78.294 2.010Q78.372 1.799 78.524 1.613Q78.676 1.428 78.876 1.326Q79.075 1.225 79.301 1.225Q79.547 1.225 79.739 1.369Q79.930 1.514 79.930 1.744Q79.930 1.900 79.825 2.010Q79.719 2.119 79.563 2.119Q79.407 2.119 79.297 2.010Q79.188 1.900 79.188 1.744Q79.188 1.584 79.294 1.479Q78.969 1.479 78.755 1.707Q78.540 1.936 78.444 2.275Q78.348 2.615 78.348 2.920L78.348 4.193Q78.348 4.361 78.575 4.408Q78.801 4.455 79.106 4.455L79.106 4.752M80.411 2.998Q80.411 2.518 80.643 2.102Q80.876 1.686 81.286 1.436Q81.696 1.186 82.172 1.186Q82.903 1.186 83.301 1.627Q83.700 2.068 83.700 2.799Q83.700 2.904 83.606 2.928L81.157 2.928L81.157 2.998Q81.157 3.408 81.278 3.764Q81.399 4.119 81.671 4.336Q81.942 4.553 82.372 4.553Q82.735 4.553 83.032 4.324Q83.329 4.096 83.430 3.744Q83.438 3.697 83.524 3.682L83.606 3.682Q83.700 3.709 83.700 3.791Q83.700 3.799 83.692 3.830Q83.630 4.057 83.491 4.240Q83.352 4.424 83.161 4.557Q82.969 4.689 82.751 4.760Q82.532 4.830 82.294 4.830Q81.922 4.830 81.585 4.693Q81.247 4.557 80.979 4.305Q80.712 4.053 80.561 3.713Q80.411 3.373 80.411 2.998M81.165 2.689L83.126 2.689Q83.126 2.385 83.024 2.094Q82.922 1.803 82.706 1.621Q82.489 1.439 82.172 1.439Q81.872 1.439 81.641 1.627Q81.411 1.814 81.288 2.106Q81.165 2.397 81.165 2.689M86.102 4.752L84.270 4.752L84.270 4.455Q84.544 4.455 84.712 4.408Q84.880 4.361 84.880 4.193L84.880 0.033Q84.880-0.182 84.817-0.277Q84.755-0.373 84.635-0.394Q84.516-0.416 84.270-0.416L84.270-0.713L85.493-0.799L85.493 4.193Q85.493 4.361 85.661 4.408Q85.829 4.455 86.102 4.455L86.102 4.752M86.547 2.998Q86.547 2.518 86.780 2.102Q87.012 1.686 87.422 1.436Q87.833 1.186 88.309 1.186Q89.040 1.186 89.438 1.627Q89.837 2.068 89.837 2.799Q89.837 2.904 89.743 2.928L87.294 2.928L87.294 2.998Q87.294 3.408 87.415 3.764Q87.536 4.119 87.807 4.336Q88.079 4.553 88.508 4.553Q88.872 4.553 89.169 4.324Q89.465 4.096 89.567 3.744Q89.575 3.697 89.661 3.682L89.743 3.682Q89.837 3.709 89.837 3.791Q89.837 3.799 89.829 3.830Q89.766 4.057 89.628 4.240Q89.489 4.424 89.297 4.557Q89.106 4.689 88.887 4.760Q88.669 4.830 88.430 4.830Q88.059 4.830 87.721 4.693Q87.383 4.557 87.116 4.305Q86.848 4.053 86.698 3.713Q86.547 3.373 86.547 2.998M87.301 2.689L89.262 2.689Q89.262 2.385 89.161 2.094Q89.059 1.803 88.842 1.621Q88.626 1.439 88.309 1.439Q88.008 1.439 87.778 1.627Q87.547 1.814 87.424 2.106Q87.301 2.397 87.301 2.689M92.126 4.721L90.903 1.865Q90.821 1.689 90.676 1.645Q90.532 1.600 90.262 1.600L90.262 1.303L91.973 1.303L91.973 1.600Q91.551 1.600 91.551 1.783Q91.551 1.818 91.567 1.865L92.512 4.057L93.352 2.080Q93.391 2.002 93.391 1.912Q93.391 1.772 93.286 1.686Q93.180 1.600 93.040 1.600L93.040 1.303L94.391 1.303L94.391 1.600Q93.868 1.600 93.653 2.080L92.528 4.721Q92.465 4.830 92.360 4.830L92.294 4.830Q92.180 4.830 92.126 4.721\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-55.184 -47.635)\">\u003Cpath d=\"M94.440 3.920Q94.440 3.436 94.842 3.141Q95.245 2.846 95.795 2.727Q96.346 2.607 96.838 2.607L96.838 2.318Q96.838 2.092 96.723 1.885Q96.608 1.678 96.411 1.559Q96.213 1.439 95.983 1.439Q95.557 1.439 95.272 1.545Q95.342 1.572 95.389 1.627Q95.436 1.682 95.461 1.752Q95.487 1.822 95.487 1.897Q95.487 2.002 95.436 2.094Q95.385 2.186 95.293 2.236Q95.202 2.287 95.096 2.287Q94.991 2.287 94.899 2.236Q94.807 2.186 94.756 2.094Q94.706 2.002 94.706 1.897Q94.706 1.479 95.094 1.332Q95.483 1.186 95.983 1.186Q96.315 1.186 96.668 1.316Q97.022 1.447 97.250 1.701Q97.479 1.955 97.479 2.303L97.479 4.104Q97.479 4.236 97.551 4.346Q97.624 4.455 97.752 4.455Q97.877 4.455 97.946 4.350Q98.014 4.244 98.014 4.104L98.014 3.592L98.295 3.592L98.295 4.104Q98.295 4.307 98.178 4.465Q98.061 4.623 97.879 4.707Q97.698 4.791 97.495 4.791Q97.264 4.791 97.112 4.619Q96.959 4.447 96.928 4.217Q96.768 4.498 96.459 4.664Q96.151 4.830 95.799 4.830Q95.288 4.830 94.864 4.607Q94.440 4.385 94.440 3.920M95.127 3.920Q95.127 4.205 95.354 4.391Q95.581 4.576 95.874 4.576Q96.120 4.576 96.344 4.459Q96.569 4.342 96.704 4.139Q96.838 3.936 96.838 3.682L96.838 2.850Q96.573 2.850 96.288 2.904Q96.002 2.959 95.731 3.088Q95.459 3.217 95.293 3.424Q95.127 3.631 95.127 3.920M100.518 4.752L98.663 4.752L98.663 4.455Q98.936 4.455 99.104 4.408Q99.272 4.361 99.272 4.193L99.272 2.057Q99.272 1.842 99.209 1.746Q99.147 1.650 99.028 1.629Q98.909 1.607 98.663 1.607L98.663 1.311L99.854 1.225L99.854 1.959Q99.967 1.744 100.161 1.576Q100.354 1.408 100.592 1.316Q100.831 1.225 101.084 1.225Q102.252 1.225 102.252 2.303L102.252 4.193Q102.252 4.361 102.422 4.408Q102.592 4.455 102.862 4.455L102.862 4.752L101.006 4.752L101.006 4.455Q101.280 4.455 101.448 4.408Q101.616 4.361 101.616 4.193L101.616 2.318Q101.616 1.936 101.495 1.707Q101.374 1.479 101.022 1.479Q100.709 1.479 100.456 1.641Q100.202 1.803 100.055 2.072Q99.909 2.342 99.909 2.639L99.909 4.193Q99.909 4.361 100.079 4.408Q100.249 4.455 100.518 4.455\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-55.184 -47.635)\">\u003Cpath d=\"M103.703 3.791L103.703 1.600L103 1.600L103 1.346Q103.356 1.346 103.598 1.113Q103.840 0.881 103.951 0.533Q104.063 0.186 104.063-0.170L104.344-0.170L104.344 1.303L105.520 1.303L105.520 1.600L104.344 1.600L104.344 3.775Q104.344 4.096 104.463 4.324Q104.582 4.553 104.863 4.553Q105.043 4.553 105.160 4.430Q105.278 4.307 105.330 4.127Q105.383 3.947 105.383 3.775L105.383 3.303L105.664 3.303L105.664 3.791Q105.664 4.045 105.559 4.285Q105.453 4.525 105.256 4.678Q105.059 4.830 104.801 4.830Q104.485 4.830 104.233 4.707Q103.981 4.584 103.842 4.350Q103.703 4.115 103.703 3.791\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-55.184 -47.635)\">\u003Cpath d=\"M109.260 4.744L109.260 3.522Q109.260 3.494 109.291 3.463Q109.323 3.432 109.346 3.432L109.452 3.432Q109.522 3.432 109.538 3.494Q109.600 3.814 109.739 4.055Q109.877 4.295 110.110 4.436Q110.342 4.576 110.651 4.576Q110.889 4.576 111.098 4.516Q111.307 4.455 111.444 4.307Q111.581 4.158 111.581 3.912Q111.581 3.658 111.370 3.492Q111.159 3.326 110.889 3.272L110.268 3.158Q109.862 3.080 109.561 2.824Q109.260 2.568 109.260 2.193Q109.260 1.826 109.461 1.604Q109.663 1.381 109.987 1.283Q110.311 1.186 110.651 1.186Q111.116 1.186 111.413 1.393L111.635 1.209Q111.659 1.186 111.690 1.186L111.741 1.186Q111.772 1.186 111.799 1.213Q111.827 1.240 111.827 1.272L111.827 2.256Q111.827 2.287 111.801 2.316Q111.776 2.346 111.741 2.346L111.635 2.346Q111.600 2.346 111.573 2.318Q111.545 2.291 111.545 2.256Q111.545 1.857 111.293 1.637Q111.041 1.416 110.643 1.416Q110.288 1.416 110.004 1.539Q109.721 1.662 109.721 1.967Q109.721 2.186 109.922 2.318Q110.124 2.451 110.370 2.494L110.995 2.607Q111.424 2.697 111.733 2.994Q112.041 3.291 112.041 3.705Q112.041 4.275 111.643 4.553Q111.245 4.830 110.651 4.830Q110.100 4.830 109.749 4.494L109.452 4.807Q109.428 4.830 109.393 4.830L109.346 4.830Q109.323 4.830 109.291 4.799Q109.260 4.768 109.260 4.744M113.194 3.791L113.194 1.600L112.491 1.600L112.491 1.346Q112.846 1.346 113.088 1.113Q113.331 0.881 113.442 0.533Q113.553 0.186 113.553-0.170L113.834-0.170L113.834 1.303L115.010 1.303L115.010 1.600L113.834 1.600L113.834 3.775Q113.834 4.096 113.954 4.324Q114.073 4.553 114.354 4.553Q114.534 4.553 114.651 4.430Q114.768 4.307 114.821 4.127Q114.874 3.947 114.874 3.775L114.874 3.303L115.155 3.303L115.155 3.791Q115.155 4.045 115.049 4.285Q114.944 4.525 114.747 4.678Q114.549 4.830 114.291 4.830Q113.975 4.830 113.723 4.707Q113.471 4.584 113.333 4.350Q113.194 4.115 113.194 3.791M115.971 3.920Q115.971 3.436 116.374 3.141Q116.776 2.846 117.327 2.727Q117.877 2.607 118.370 2.607L118.370 2.318Q118.370 2.092 118.254 1.885Q118.139 1.678 117.942 1.559Q117.745 1.439 117.514 1.439Q117.088 1.439 116.803 1.545Q116.874 1.572 116.920 1.627Q116.967 1.682 116.993 1.752Q117.018 1.822 117.018 1.897Q117.018 2.002 116.967 2.094Q116.916 2.186 116.825 2.236Q116.733 2.287 116.627 2.287Q116.522 2.287 116.430 2.236Q116.338 2.186 116.288 2.094Q116.237 2.002 116.237 1.897Q116.237 1.479 116.625 1.332Q117.014 1.186 117.514 1.186Q117.846 1.186 118.200 1.316Q118.553 1.447 118.782 1.701Q119.010 1.955 119.010 2.303L119.010 4.104Q119.010 4.236 119.083 4.346Q119.155 4.455 119.284 4.455Q119.409 4.455 119.477 4.350Q119.545 4.244 119.545 4.104L119.545 3.592L119.827 3.592L119.827 4.104Q119.827 4.307 119.709 4.465Q119.592 4.623 119.411 4.707Q119.229 4.791 119.026 4.791Q118.795 4.791 118.643 4.619Q118.491 4.447 118.459 4.217Q118.299 4.498 117.991 4.664Q117.682 4.830 117.331 4.830Q116.819 4.830 116.395 4.607Q115.971 4.385 115.971 3.920M116.659 3.920Q116.659 4.205 116.885 4.391Q117.112 4.576 117.405 4.576Q117.651 4.576 117.875 4.459Q118.100 4.342 118.235 4.139Q118.370 3.936 118.370 3.682L118.370 2.850Q118.104 2.850 117.819 2.904Q117.534 2.959 117.262 3.088Q116.991 3.217 116.825 3.424Q116.659 3.631 116.659 3.920M120.745 3.791L120.745 1.600L120.041 1.600L120.041 1.346Q120.397 1.346 120.639 1.113Q120.881 0.881 120.993 0.533Q121.104 0.186 121.104-0.170L121.385-0.170L121.385 1.303L122.561 1.303L122.561 1.600L121.385 1.600L121.385 3.775Q121.385 4.096 121.504 4.324Q121.624 4.553 121.905 4.553Q122.084 4.553 122.202 4.430Q122.319 4.307 122.372 4.127Q122.424 3.947 122.424 3.775L122.424 3.303L122.706 3.303L122.706 3.791Q122.706 4.045 122.600 4.285Q122.495 4.525 122.297 4.678Q122.100 4.830 121.842 4.830Q121.526 4.830 121.274 4.707Q121.022 4.584 120.883 4.350Q120.745 4.115 120.745 3.791M123.424 2.998Q123.424 2.518 123.657 2.102Q123.889 1.686 124.299 1.436Q124.709 1.186 125.186 1.186Q125.916 1.186 126.315 1.627Q126.713 2.068 126.713 2.799Q126.713 2.904 126.620 2.928L124.170 2.928L124.170 2.998Q124.170 3.408 124.291 3.764Q124.413 4.119 124.684 4.336Q124.956 4.553 125.385 4.553Q125.749 4.553 126.045 4.324Q126.342 4.096 126.444 3.744Q126.452 3.697 126.538 3.682L126.620 3.682Q126.713 3.709 126.713 3.791Q126.713 3.799 126.706 3.830Q126.643 4.057 126.504 4.240Q126.366 4.424 126.174 4.557Q125.983 4.689 125.764 4.760Q125.545 4.830 125.307 4.830Q124.936 4.830 124.598 4.693Q124.260 4.557 123.993 4.305Q123.725 4.053 123.575 3.713Q123.424 3.373 123.424 2.998M124.178 2.689L126.139 2.689Q126.139 2.385 126.038 2.094Q125.936 1.803 125.719 1.621Q125.502 1.439 125.186 1.439Q124.885 1.439 124.655 1.627Q124.424 1.814 124.301 2.106Q124.178 2.397 124.178 2.689M127.245 4.744L127.245 3.522Q127.245 3.494 127.276 3.463Q127.307 3.432 127.331 3.432L127.436 3.432Q127.506 3.432 127.522 3.494Q127.584 3.814 127.723 4.055Q127.862 4.295 128.094 4.436Q128.327 4.576 128.635 4.576Q128.874 4.576 129.083 4.516Q129.291 4.455 129.428 4.307Q129.565 4.158 129.565 3.912Q129.565 3.658 129.354 3.492Q129.143 3.326 128.874 3.272L128.252 3.158Q127.846 3.080 127.545 2.824Q127.245 2.568 127.245 2.193Q127.245 1.826 127.446 1.604Q127.647 1.381 127.971 1.283Q128.295 1.186 128.635 1.186Q129.100 1.186 129.397 1.393L129.620 1.209Q129.643 1.186 129.674 1.186L129.725 1.186Q129.756 1.186 129.784 1.213Q129.811 1.240 129.811 1.272L129.811 2.256Q129.811 2.287 129.786 2.316Q129.760 2.346 129.725 2.346L129.620 2.346Q129.584 2.346 129.557 2.318Q129.530 2.291 129.530 2.256Q129.530 1.857 129.278 1.637Q129.026 1.416 128.627 1.416Q128.272 1.416 127.989 1.539Q127.706 1.662 127.706 1.967Q127.706 2.186 127.907 2.318Q128.108 2.451 128.354 2.494L128.979 2.607Q129.409 2.697 129.717 2.994Q130.026 3.291 130.026 3.705Q130.026 4.275 129.627 4.553Q129.229 4.830 128.635 4.830Q128.084 4.830 127.733 4.494L127.436 4.807Q127.413 4.830 127.377 4.830L127.331 4.830Q127.307 4.830 127.276 4.799Q127.245 4.768 127.245 4.744\" 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=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M32.759 7.598c0-8.643-7.007-15.65-15.65-15.65-8.642 0-15.649 7.007-15.649 15.65s7.007 15.649 15.65 15.649c8.642 0 15.649-7.006 15.649-15.65m-15.65 0\"\u002F>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M32.759 7.598c0-8.643-7.007-15.65-15.65-15.65-8.642 0-15.649 7.007-15.649 15.65s7.007 15.649 15.65 15.649c8.642 0 15.649-7.006 15.649-15.65Zm-15.65 0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(-68.016 4.998)\">\u003Cpath d=\"M77.174 4.745L77.174 3.682Q77.174 3.658 77.202 3.631Q77.229 3.604 77.253 3.604L77.362 3.604Q77.427 3.604 77.441 3.662Q77.537 4.096 77.783 4.347Q78.029 4.598 78.443 4.598Q78.784 4.598 79.037 4.465Q79.290 4.332 79.290 4.024Q79.290 3.867 79.196 3.752Q79.102 3.638 78.964 3.569Q78.825 3.501 78.658 3.463L78.077 3.364Q77.721 3.296 77.448 3.075Q77.174 2.855 77.174 2.513Q77.174 2.264 77.286 2.089Q77.397 1.915 77.583 1.816Q77.769 1.717 77.985 1.674Q78.200 1.631 78.443 1.631Q78.856 1.631 79.136 1.813L79.352 1.638Q79.362 1.635 79.369 1.633Q79.376 1.631 79.386 1.631L79.437 1.631Q79.464 1.631 79.488 1.655Q79.512 1.679 79.512 1.707L79.512 2.554Q79.512 2.575 79.488 2.602Q79.464 2.629 79.437 2.629L79.324 2.629Q79.297 2.629 79.271 2.604Q79.246 2.578 79.246 2.554Q79.246 2.318 79.140 2.154Q79.034 1.990 78.851 1.908Q78.668 1.826 78.436 1.826Q78.108 1.826 77.851 1.929Q77.595 2.031 77.595 2.308Q77.595 2.503 77.778 2.612Q77.961 2.722 78.190 2.763L78.764 2.869Q79.010 2.917 79.224 3.045Q79.437 3.173 79.574 3.376Q79.711 3.580 79.711 3.829Q79.711 4.342 79.345 4.581Q78.979 4.820 78.443 4.820Q77.947 4.820 77.615 4.526L77.349 4.800Q77.328 4.820 77.301 4.820L77.253 4.820Q77.229 4.820 77.202 4.793Q77.174 4.766 77.174 4.745M80.866 3.911L80.866 2.014L80.227 2.014L80.227 1.792Q80.545 1.792 80.762 1.582Q80.979 1.372 81.079 1.062Q81.180 0.753 81.180 0.445L81.447 0.445L81.447 1.734L82.524 1.734L82.524 2.014L81.447 2.014L81.447 3.898Q81.447 4.174 81.551 4.373Q81.655 4.571 81.915 4.571Q82.072 4.571 82.178 4.467Q82.284 4.362 82.334 4.209Q82.383 4.055 82.383 3.898L82.383 3.484L82.650 3.484L82.650 3.911Q82.650 4.137 82.551 4.347Q82.452 4.557 82.267 4.689Q82.083 4.820 81.854 4.820Q81.416 4.820 81.141 4.583Q80.866 4.345 80.866 3.911M83.518 4.024Q83.518 3.692 83.742 3.465Q83.966 3.238 84.309 3.110Q84.653 2.981 85.026 2.929Q85.398 2.876 85.702 2.876L85.702 2.623Q85.702 2.418 85.595 2.238Q85.487 2.059 85.306 1.956Q85.125 1.854 84.916 1.854Q84.509 1.854 84.274 1.946Q84.362 1.983 84.409 2.067Q84.455 2.151 84.455 2.253Q84.455 2.349 84.409 2.428Q84.362 2.506 84.282 2.551Q84.202 2.595 84.113 2.595Q83.963 2.595 83.862 2.498Q83.761 2.400 83.761 2.253Q83.761 1.631 84.916 1.631Q85.128 1.631 85.378 1.695Q85.627 1.758 85.829 1.877Q86.030 1.997 86.157 2.182Q86.283 2.366 86.283 2.609L86.283 4.185Q86.283 4.301 86.345 4.397Q86.406 4.492 86.519 4.492Q86.629 4.492 86.693 4.398Q86.758 4.304 86.758 4.185L86.758 3.737L87.025 3.737L87.025 4.185Q87.025 4.455 86.798 4.620Q86.570 4.786 86.290 4.786Q86.082 4.786 85.945 4.632Q85.808 4.479 85.784 4.263Q85.637 4.530 85.355 4.675Q85.073 4.820 84.749 4.820Q84.472 4.820 84.188 4.745Q83.904 4.670 83.711 4.491Q83.518 4.311 83.518 4.024M84.133 4.024Q84.133 4.198 84.234 4.328Q84.335 4.458 84.491 4.528Q84.646 4.598 84.810 4.598Q85.029 4.598 85.237 4.501Q85.446 4.403 85.574 4.222Q85.702 4.041 85.702 3.815L85.702 3.087Q85.378 3.087 85.012 3.178Q84.646 3.269 84.390 3.481Q84.133 3.692 84.133 4.024M89.192 4.752L87.456 4.752L87.456 4.472Q87.685 4.472 87.833 4.438Q87.982 4.403 87.982 4.263L87.982 2.414Q87.982 2.144 87.874 2.083Q87.767 2.021 87.456 2.021L87.456 1.741L88.485 1.666L88.485 2.373Q88.614 2.065 88.857 1.866Q89.100 1.666 89.418 1.666Q89.636 1.666 89.807 1.790Q89.978 1.915 89.978 2.127Q89.978 2.264 89.879 2.363Q89.780 2.462 89.647 2.462Q89.510 2.462 89.411 2.363Q89.312 2.264 89.312 2.127Q89.312 1.987 89.411 1.888Q89.120 1.888 88.920 2.084Q88.720 2.281 88.628 2.575Q88.536 2.869 88.536 3.149L88.536 4.263Q88.536 4.472 89.192 4.472L89.192 4.752M91.089 3.911L91.089 2.014L90.450 2.014L90.450 1.792Q90.768 1.792 90.985 1.582Q91.202 1.372 91.303 1.062Q91.403 0.753 91.403 0.445L91.670 0.445L91.670 1.734L92.747 1.734L92.747 2.014L91.670 2.014L91.670 3.898Q91.670 4.174 91.774 4.373Q91.879 4.571 92.138 4.571Q92.296 4.571 92.402 4.467Q92.507 4.362 92.557 4.209Q92.607 4.055 92.607 3.898L92.607 3.484L92.873 3.484L92.873 3.911Q92.873 4.137 92.774 4.347Q92.675 4.557 92.490 4.689Q92.306 4.820 92.077 4.820Q91.639 4.820 91.364 4.583Q91.089 4.345 91.089 3.911\" 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)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M28.49-.938c31.299-19.917 59.751-5.69 75.381 17.753\"\u002F>\u003Cpath stroke=\"none\" d=\"m105.313 18.979-.577-4.615-.865 2.451-2.596-.144\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(33.408 18.822)\">\u003Cpath d=\"M77.133 3.269Q77.133 2.927 77.268 2.628Q77.403 2.329 77.643 2.105Q77.882 1.881 78.200 1.756Q78.518 1.631 78.849 1.631Q79.294 1.631 79.693 1.847Q80.093 2.062 80.328 2.440Q80.562 2.817 80.562 3.269Q80.562 3.610 80.420 3.894Q80.278 4.178 80.034 4.385Q79.789 4.591 79.480 4.706Q79.171 4.820 78.849 4.820Q78.419 4.820 78.017 4.619Q77.615 4.417 77.374 4.065Q77.133 3.713 77.133 3.269M78.849 4.571Q79.451 4.571 79.675 4.193Q79.899 3.815 79.899 3.183Q79.899 2.571 79.664 2.212Q79.430 1.854 78.849 1.854Q77.797 1.854 77.797 3.183Q77.797 3.815 78.022 4.193Q78.248 4.571 78.849 4.571M82.800 6.109L81.170 6.109L81.170 5.829Q81.399 5.829 81.548 5.794Q81.696 5.760 81.696 5.620L81.696 2.274Q81.696 2.103 81.560 2.062Q81.423 2.021 81.170 2.021L81.170 1.741L82.250 1.666L82.250 2.072Q82.472 1.871 82.759 1.768Q83.047 1.666 83.354 1.666Q83.781 1.666 84.145 1.879Q84.509 2.093 84.723 2.457Q84.937 2.821 84.937 3.241Q84.937 3.686 84.697 4.050Q84.458 4.414 84.065 4.617Q83.672 4.820 83.228 4.820Q82.961 4.820 82.713 4.720Q82.465 4.619 82.277 4.438L82.277 5.620Q82.277 5.757 82.426 5.793Q82.575 5.829 82.800 5.829L82.800 6.109M82.277 2.421L82.277 4.031Q82.411 4.284 82.653 4.441Q82.896 4.598 83.173 4.598Q83.501 4.598 83.754 4.397Q84.007 4.195 84.140 3.877Q84.274 3.559 84.274 3.241Q84.274 3.012 84.209 2.783Q84.144 2.554 84.016 2.356Q83.887 2.158 83.693 2.038Q83.498 1.919 83.265 1.919Q82.971 1.919 82.703 2.048Q82.435 2.178 82.277 2.421M86.099 3.911L86.099 2.014L85.460 2.014L85.460 1.792Q85.777 1.792 85.995 1.582Q86.212 1.372 86.312 1.062Q86.413 0.753 86.413 0.445L86.680 0.445L86.680 1.734L87.756 1.734L87.756 2.014L86.680 2.014L86.680 3.898Q86.680 4.174 86.784 4.373Q86.888 4.571 87.148 4.571Q87.305 4.571 87.411 4.467Q87.517 4.362 87.567 4.209Q87.616 4.055 87.616 3.898L87.616 3.484L87.883 3.484L87.883 3.911Q87.883 4.137 87.784 4.347Q87.685 4.557 87.500 4.689Q87.316 4.820 87.087 4.820Q86.649 4.820 86.374 4.583Q86.099 4.345 86.099 3.911M90.310 4.752L88.758 4.752L88.758 4.472Q88.984 4.472 89.132 4.438Q89.281 4.403 89.281 4.263L89.281 2.414Q89.281 2.226 89.233 2.142Q89.185 2.059 89.088 2.040Q88.990 2.021 88.778 2.021L88.778 1.741L89.835 1.666L89.835 4.263Q89.835 4.403 89.966 4.438Q90.098 4.472 90.310 4.472L90.310 4.752M89.038 0.445Q89.038 0.274 89.161 0.155Q89.284 0.035 89.455 0.035Q89.623 0.035 89.746 0.155Q89.869 0.274 89.869 0.445Q89.869 0.620 89.746 0.743Q89.623 0.866 89.455 0.866Q89.284 0.866 89.161 0.743Q89.038 0.620 89.038 0.445M92.637 4.752L91.004 4.752L91.004 4.472Q91.233 4.472 91.381 4.438Q91.530 4.403 91.530 4.263L91.530 2.414Q91.530 2.144 91.422 2.083Q91.315 2.021 91.004 2.021L91.004 1.741L92.063 1.666L92.063 2.315Q92.234 2.007 92.538 1.836Q92.842 1.666 93.188 1.666Q93.588 1.666 93.864 1.806Q94.141 1.946 94.227 2.294Q94.394 2.001 94.693 1.833Q94.992 1.666 95.338 1.666Q95.843 1.666 96.127 1.889Q96.411 2.113 96.411 2.609L96.411 4.263Q96.411 4.400 96.559 4.436Q96.708 4.472 96.934 4.472L96.934 4.752L95.303 4.752L95.303 4.472Q95.529 4.472 95.679 4.436Q95.830 4.400 95.830 4.263L95.830 2.623Q95.830 2.288 95.710 2.088Q95.590 1.888 95.276 1.888Q95.006 1.888 94.772 2.024Q94.538 2.161 94.399 2.395Q94.261 2.629 94.261 2.903L94.261 4.263Q94.261 4.400 94.410 4.436Q94.558 4.472 94.784 4.472L94.784 4.752L93.153 4.752L93.153 4.472Q93.382 4.472 93.531 4.438Q93.680 4.403 93.680 4.263L93.680 2.623Q93.680 2.288 93.560 2.088Q93.441 1.888 93.126 1.888Q92.856 1.888 92.622 2.024Q92.388 2.161 92.249 2.395Q92.111 2.629 92.111 2.903L92.111 4.263Q92.111 4.400 92.261 4.436Q92.412 4.472 92.637 4.472L92.637 4.752M97.580 4.024Q97.580 3.692 97.804 3.465Q98.027 3.238 98.371 3.110Q98.714 2.981 99.087 2.929Q99.460 2.876 99.764 2.876L99.764 2.623Q99.764 2.418 99.656 2.238Q99.548 2.059 99.367 1.956Q99.186 1.854 98.978 1.854Q98.571 1.854 98.335 1.946Q98.424 1.983 98.470 2.067Q98.516 2.151 98.516 2.253Q98.516 2.349 98.470 2.428Q98.424 2.506 98.344 2.551Q98.263 2.595 98.174 2.595Q98.024 2.595 97.923 2.498Q97.822 2.400 97.822 2.253Q97.822 1.631 98.978 1.631Q99.190 1.631 99.439 1.695Q99.689 1.758 99.890 1.877Q100.092 1.997 100.218 2.182Q100.345 2.366 100.345 2.609L100.345 4.185Q100.345 4.301 100.406 4.397Q100.468 4.492 100.581 4.492Q100.690 4.492 100.755 4.398Q100.820 4.304 100.820 4.185L100.820 3.737L101.087 3.737L101.087 4.185Q101.087 4.455 100.859 4.620Q100.632 4.786 100.352 4.786Q100.143 4.786 100.006 4.632Q99.870 4.479 99.846 4.263Q99.699 4.530 99.417 4.675Q99.135 4.820 98.810 4.820Q98.533 4.820 98.250 4.745Q97.966 4.670 97.773 4.491Q97.580 4.311 97.580 4.024M98.195 4.024Q98.195 4.198 98.296 4.328Q98.397 4.458 98.552 4.528Q98.708 4.598 98.872 4.598Q99.090 4.598 99.299 4.501Q99.507 4.403 99.636 4.222Q99.764 4.041 99.764 3.815L99.764 3.087Q99.439 3.087 99.073 3.178Q98.708 3.269 98.451 3.481Q98.195 3.692 98.195 4.024M103.172 4.752L101.568 4.752L101.568 4.472Q101.794 4.472 101.943 4.438Q102.091 4.403 102.091 4.263L102.091 0.644Q102.091 0.374 101.984 0.312Q101.876 0.251 101.568 0.251L101.568-0.030L102.645-0.105L102.645 4.263Q102.645 4.400 102.796 4.436Q102.946 4.472 103.172 4.472\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(33.408 18.822)\">\u003Cpath d=\"M108.124 6.109L106.494 6.109L106.494 5.829Q106.723 5.829 106.872 5.794Q107.020 5.760 107.020 5.620L107.020 2.274Q107.020 2.103 106.884 2.062Q106.747 2.021 106.494 2.021L106.494 1.741L107.574 1.666L107.574 2.072Q107.796 1.871 108.083 1.768Q108.371 1.666 108.678 1.666Q109.105 1.666 109.469 1.879Q109.833 2.093 110.047 2.457Q110.261 2.821 110.261 3.241Q110.261 3.686 110.021 4.050Q109.782 4.414 109.389 4.617Q108.996 4.820 108.552 4.820Q108.285 4.820 108.037 4.720Q107.790 4.619 107.602 4.438L107.602 5.620Q107.602 5.757 107.750 5.793Q107.899 5.829 108.124 5.829L108.124 6.109M107.602 2.421L107.602 4.031Q107.735 4.284 107.978 4.441Q108.220 4.598 108.497 4.598Q108.825 4.598 109.078 4.397Q109.331 4.195 109.464 3.877Q109.598 3.559 109.598 3.241Q109.598 3.012 109.533 2.783Q109.468 2.554 109.340 2.356Q109.211 2.158 109.017 2.038Q108.822 1.919 108.589 1.919Q108.295 1.919 108.027 2.048Q107.759 2.178 107.602 2.421M110.955 4.024Q110.955 3.692 111.178 3.465Q111.402 3.238 111.746 3.110Q112.089 2.981 112.462 2.929Q112.834 2.876 113.139 2.876L113.139 2.623Q113.139 2.418 113.031 2.238Q112.923 2.059 112.742 1.956Q112.561 1.854 112.353 1.854Q111.946 1.854 111.710 1.946Q111.799 1.983 111.845 2.067Q111.891 2.151 111.891 2.253Q111.891 2.349 111.845 2.428Q111.799 2.506 111.718 2.551Q111.638 2.595 111.549 2.595Q111.399 2.595 111.298 2.498Q111.197 2.400 111.197 2.253Q111.197 1.631 112.353 1.631Q112.564 1.631 112.814 1.695Q113.063 1.758 113.265 1.877Q113.467 1.997 113.593 2.182Q113.720 2.366 113.720 2.609L113.720 4.185Q113.720 4.301 113.781 4.397Q113.843 4.492 113.956 4.492Q114.065 4.492 114.130 4.398Q114.195 4.304 114.195 4.185L114.195 3.737L114.461 3.737L114.461 4.185Q114.461 4.455 114.234 4.620Q114.007 4.786 113.727 4.786Q113.518 4.786 113.381 4.632Q113.245 4.479 113.221 4.263Q113.074 4.530 112.792 4.675Q112.510 4.820 112.185 4.820Q111.908 4.820 111.624 4.745Q111.341 4.670 111.148 4.491Q110.955 4.311 110.955 4.024M111.570 4.024Q111.570 4.198 111.671 4.328Q111.771 4.458 111.927 4.528Q112.083 4.598 112.247 4.598Q112.465 4.598 112.674 4.501Q112.882 4.403 113.010 4.222Q113.139 4.041 113.139 3.815L113.139 3.087Q112.814 3.087 112.448 3.178Q112.083 3.269 111.826 3.481Q111.570 3.692 111.570 4.024M115.405 3.911L115.405 2.014L114.766 2.014L114.766 1.792Q115.083 1.792 115.301 1.582Q115.518 1.372 115.618 1.062Q115.719 0.753 115.719 0.445L115.986 0.445L115.986 1.734L117.062 1.734L117.062 2.014L115.986 2.014L115.986 3.898Q115.986 4.174 116.090 4.373Q116.194 4.571 116.454 4.571Q116.611 4.571 116.717 4.467Q116.823 4.362 116.873 4.209Q116.922 4.055 116.922 3.898L116.922 3.484L117.189 3.484L117.189 3.911Q117.189 4.137 117.090 4.347Q116.991 4.557 116.806 4.689Q116.622 4.820 116.393 4.820Q115.955 4.820 115.680 4.583Q115.405 4.345 115.405 3.911M119.681 4.752L118.047 4.752L118.047 4.472Q118.276 4.472 118.425 4.438Q118.573 4.403 118.573 4.263L118.573 0.644Q118.573 0.374 118.466 0.312Q118.358 0.251 118.047 0.251L118.047-0.030L119.127-0.105L119.127 2.281Q119.233 2.096 119.411 1.954Q119.588 1.813 119.797 1.739Q120.005 1.666 120.231 1.666Q120.737 1.666 121.020 1.889Q121.304 2.113 121.304 2.609L121.304 4.263Q121.304 4.400 121.453 4.436Q121.602 4.472 121.827 4.472L121.827 4.752L120.197 4.752L120.197 4.472Q120.426 4.472 120.574 4.438Q120.723 4.403 120.723 4.263L120.723 2.623Q120.723 2.288 120.603 2.088Q120.484 1.888 120.169 1.888Q119.899 1.888 119.665 2.024Q119.431 2.161 119.293 2.395Q119.154 2.629 119.154 2.903L119.154 4.263Q119.154 4.400 119.305 4.436Q119.455 4.472 119.681 4.472\" 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-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(71.45 -5.825)\">\u003Cpath d=\"M87.594-3.248L86.042-3.248L86.042-3.528Q86.268-3.528 86.417-3.562Q86.565-3.597 86.565-3.737L86.565-5.586Q86.565-5.774 86.517-5.858Q86.470-5.941 86.372-5.960Q86.275-5.979 86.063-5.979L86.063-6.259L87.119-6.334L87.119-3.737Q87.119-3.597 87.251-3.562Q87.382-3.528 87.594-3.528L87.594-3.248M86.323-7.555Q86.323-7.726 86.446-7.845Q86.569-7.965 86.740-7.965Q86.907-7.965 87.030-7.845Q87.153-7.726 87.153-7.555Q87.153-7.380 87.030-7.257Q86.907-7.134 86.740-7.134Q86.569-7.134 86.446-7.257Q86.323-7.380 86.323-7.555M89.990-3.248L88.254-3.248L88.254-3.528Q88.483-3.528 88.632-3.562Q88.780-3.597 88.780-3.737L88.780-5.586Q88.780-5.856 88.673-5.917Q88.565-5.979 88.254-5.979L88.254-6.259L89.283-6.334L89.283-5.627Q89.413-5.935 89.655-6.134Q89.898-6.334 90.216-6.334Q90.434-6.334 90.605-6.210Q90.776-6.085 90.776-5.873Q90.776-5.736 90.677-5.637Q90.578-5.538 90.445-5.538Q90.308-5.538 90.209-5.637Q90.110-5.736 90.110-5.873Q90.110-6.013 90.209-6.112Q89.918-6.112 89.718-5.916Q89.518-5.719 89.426-5.425Q89.334-5.131 89.334-4.851L89.334-3.737Q89.334-3.528 89.990-3.528L89.990-3.248M93.111-3.248L91.374-3.248L91.374-3.528Q91.603-3.528 91.752-3.562Q91.901-3.597 91.901-3.737L91.901-5.586Q91.901-5.856 91.793-5.917Q91.685-5.979 91.374-5.979L91.374-6.259L92.403-6.334L92.403-5.627Q92.533-5.935 92.776-6.134Q93.018-6.334 93.336-6.334Q93.555-6.334 93.726-6.210Q93.897-6.085 93.897-5.873Q93.897-5.736 93.798-5.637Q93.699-5.538 93.565-5.538Q93.429-5.538 93.330-5.637Q93.230-5.736 93.230-5.873Q93.230-6.013 93.330-6.112Q93.039-6.112 92.839-5.916Q92.639-5.719 92.547-5.425Q92.455-5.131 92.455-4.851L92.455-3.737Q92.455-3.528 93.111-3.528L93.111-3.248M94.440-4.783Q94.440-5.104 94.565-5.393Q94.690-5.682 94.915-5.905Q95.141-6.129 95.437-6.249Q95.732-6.369 96.050-6.369Q96.378-6.369 96.640-6.269Q96.901-6.170 97.077-5.988Q97.253-5.805 97.347-5.547Q97.441-5.289 97.441-4.957Q97.441-4.865 97.359-4.844L95.103-4.844L95.103-4.783Q95.103-4.195 95.387-3.812Q95.671-3.429 96.238-3.429Q96.559-3.429 96.828-3.622Q97.096-3.815 97.185-4.130Q97.192-4.171 97.267-4.185L97.359-4.185Q97.441-4.161 97.441-4.089Q97.441-4.082 97.434-4.055Q97.322-3.658 96.951-3.419Q96.580-3.180 96.156-3.180Q95.719-3.180 95.319-3.388Q94.919-3.597 94.680-3.964Q94.440-4.331 94.440-4.783M95.110-5.053L96.925-5.053Q96.925-5.330 96.828-5.582Q96.730-5.835 96.532-5.991Q96.334-6.146 96.050-6.146Q95.773-6.146 95.560-5.988Q95.346-5.829 95.228-5.574Q95.110-5.319 95.110-5.053M99.697-3.248L98.094-3.248L98.094-3.528Q98.320-3.528 98.468-3.562Q98.617-3.597 98.617-3.737L98.617-7.356Q98.617-7.626 98.509-7.688Q98.402-7.749 98.094-7.749L98.094-8.030L99.171-8.105L99.171-3.737Q99.171-3.600 99.321-3.564Q99.472-3.528 99.697-3.528L99.697-3.248M100.251-4.783Q100.251-5.104 100.376-5.393Q100.500-5.682 100.726-5.905Q100.952-6.129 101.247-6.249Q101.543-6.369 101.861-6.369Q102.189-6.369 102.450-6.269Q102.712-6.170 102.888-5.988Q103.064-5.805 103.158-5.547Q103.252-5.289 103.252-4.957Q103.252-4.865 103.170-4.844L100.914-4.844L100.914-4.783Q100.914-4.195 101.198-3.812Q101.481-3.429 102.049-3.429Q102.370-3.429 102.638-3.622Q102.907-3.815 102.996-4.130Q103.002-4.171 103.078-4.185L103.170-4.185Q103.252-4.161 103.252-4.089Q103.252-4.082 103.245-4.055Q103.132-3.658 102.761-3.419Q102.391-3.180 101.967-3.180Q101.529-3.180 101.129-3.388Q100.729-3.597 100.490-3.964Q100.251-4.331 100.251-4.783M100.921-5.053L102.736-5.053Q102.736-5.330 102.638-5.582Q102.541-5.835 102.343-5.991Q102.144-6.146 101.861-6.146Q101.584-6.146 101.370-5.988Q101.157-5.829 101.039-5.574Q100.921-5.319 100.921-5.053M105.429-3.275L104.301-5.774Q104.229-5.921 104.100-5.953Q103.970-5.986 103.741-5.986L103.741-6.266L105.255-6.266L105.255-5.986Q104.903-5.986 104.903-5.839Q104.903-5.794 104.913-5.774L105.778-3.856L106.557-5.586Q106.591-5.654 106.591-5.733Q106.591-5.846 106.507-5.916Q106.424-5.986 106.304-5.986L106.304-6.266L107.500-6.266L107.500-5.986Q107.282-5.986 107.111-5.883Q106.940-5.781 106.851-5.586L105.815-3.275Q105.767-3.180 105.662-3.180L105.583-3.180Q105.477-3.180 105.429-3.275\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(71.45 -5.825)\">\u003Cpath d=\"M107.696-3.976Q107.696-4.308 107.919-4.535Q108.143-4.762 108.487-4.890Q108.830-5.019 109.203-5.071Q109.575-5.124 109.880-5.124L109.880-5.377Q109.880-5.582 109.772-5.762Q109.664-5.941 109.483-6.044Q109.302-6.146 109.094-6.146Q108.687-6.146 108.451-6.054Q108.540-6.017 108.586-5.933Q108.632-5.849 108.632-5.747Q108.632-5.651 108.586-5.572Q108.540-5.494 108.459-5.449Q108.379-5.405 108.290-5.405Q108.140-5.405 108.039-5.502Q107.938-5.600 107.938-5.747Q107.938-6.369 109.094-6.369Q109.305-6.369 109.555-6.305Q109.804-6.242 110.006-6.123Q110.208-6.003 110.334-5.818Q110.461-5.634 110.461-5.391L110.461-3.815Q110.461-3.699 110.522-3.603Q110.584-3.508 110.697-3.508Q110.806-3.508 110.871-3.602Q110.936-3.696 110.936-3.815L110.936-4.263L111.202-4.263L111.202-3.815Q111.202-3.545 110.975-3.380Q110.748-3.214 110.468-3.214Q110.259-3.214 110.122-3.368Q109.986-3.521 109.962-3.737Q109.815-3.470 109.533-3.325Q109.251-3.180 108.926-3.180Q108.649-3.180 108.365-3.255Q108.082-3.330 107.889-3.509Q107.696-3.689 107.696-3.976M108.311-3.976Q108.311-3.802 108.412-3.672Q108.512-3.542 108.668-3.472Q108.823-3.402 108.988-3.402Q109.206-3.402 109.415-3.499Q109.623-3.597 109.751-3.778Q109.880-3.959 109.880-4.185L109.880-4.913Q109.555-4.913 109.189-4.822Q108.823-4.731 108.567-4.519Q108.311-4.308 108.311-3.976M113.301-3.248L111.667-3.248L111.667-3.528Q111.896-3.528 112.045-3.562Q112.194-3.597 112.194-3.737L112.194-5.586Q112.194-5.856 112.086-5.917Q111.978-5.979 111.667-5.979L111.667-6.259L112.727-6.334L112.727-5.685Q112.898-5.993 113.202-6.164Q113.506-6.334 113.851-6.334Q114.357-6.334 114.641-6.111Q114.925-5.887 114.925-5.391L114.925-3.737Q114.925-3.600 115.073-3.564Q115.222-3.528 115.448-3.528L115.448-3.248L113.817-3.248L113.817-3.528Q114.046-3.528 114.195-3.562Q114.344-3.597 114.344-3.737L114.344-5.377Q114.344-5.712 114.224-5.912Q114.104-6.112 113.790-6.112Q113.520-6.112 113.286-5.976Q113.052-5.839 112.913-5.605Q112.775-5.371 112.775-5.097L112.775-3.737Q112.775-3.600 112.925-3.564Q113.075-3.528 113.301-3.528\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(71.45 -5.825)\">\u003Cpath d=\"M116.352-4.089L116.352-5.986L115.713-5.986L115.713-6.208Q116.031-6.208 116.248-6.418Q116.465-6.628 116.565-6.938Q116.666-7.247 116.666-7.555L116.933-7.555L116.933-6.266L118.010-6.266L118.010-5.986L116.933-5.986L116.933-4.102Q116.933-3.826 117.037-3.627Q117.141-3.429 117.401-3.429Q117.558-3.429 117.664-3.533Q117.770-3.638 117.820-3.791Q117.869-3.945 117.869-4.102L117.869-4.516L118.136-4.516L118.136-4.089Q118.136-3.863 118.037-3.653Q117.938-3.443 117.753-3.311Q117.569-3.180 117.340-3.180Q116.902-3.180 116.627-3.417Q116.352-3.655 116.352-4.089\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(71.45 -5.825)\">\u003Cpath d=\"M79.304 6.502Q78.754 6.102 78.383 5.547Q78.012 4.991 77.831 4.345Q77.650 3.699 77.650 3.002Q77.650 2.489 77.750 1.994Q77.851 1.498 78.056 1.047Q78.261 0.596 78.574 0.204Q78.887-0.187 79.304-0.491Q79.314-0.495 79.321-0.496Q79.328-0.498 79.338-0.498L79.406-0.498Q79.441-0.498 79.463-0.474Q79.485-0.450 79.485-0.413Q79.485-0.368 79.458-0.351Q79.109-0.050 78.856 0.334Q78.603 0.719 78.451 1.160Q78.299 1.601 78.227 2.057Q78.155 2.513 78.155 3.002Q78.155 4.003 78.465 4.890Q78.774 5.777 79.458 6.362Q79.485 6.379 79.485 6.423Q79.485 6.461 79.463 6.485Q79.441 6.509 79.406 6.509L79.338 6.509Q79.331 6.505 79.323 6.504Q79.314 6.502 79.304 6.502M81.977 4.752L80.343 4.752L80.343 4.472Q80.572 4.472 80.721 4.438Q80.869 4.403 80.869 4.263L80.869 2.414Q80.869 2.144 80.762 2.083Q80.654 2.021 80.343 2.021L80.343 1.741L81.402 1.666L81.402 2.315Q81.573 2.007 81.878 1.836Q82.182 1.666 82.527 1.666Q83.033 1.666 83.317 1.889Q83.600 2.113 83.600 2.609L83.600 4.263Q83.600 4.400 83.749 4.436Q83.898 4.472 84.123 4.472L84.123 4.752L82.493 4.752L82.493 4.472Q82.722 4.472 82.870 4.438Q83.019 4.403 83.019 4.263L83.019 2.623Q83.019 2.288 82.900 2.088Q82.780 1.888 82.465 1.888Q82.195 1.888 81.961 2.024Q81.727 2.161 81.589 2.395Q81.450 2.629 81.450 2.903L81.450 4.263Q81.450 4.400 81.601 4.436Q81.751 4.472 81.977 4.472L81.977 4.752M84.670 3.217Q84.670 2.896 84.795 2.607Q84.920 2.318 85.145 2.095Q85.371 1.871 85.666 1.751Q85.962 1.631 86.280 1.631Q86.608 1.631 86.870 1.731Q87.131 1.830 87.307 2.012Q87.483 2.195 87.577 2.453Q87.671 2.711 87.671 3.043Q87.671 3.135 87.589 3.156L85.333 3.156L85.333 3.217Q85.333 3.805 85.617 4.188Q85.901 4.571 86.468 4.571Q86.789 4.571 87.058 4.378Q87.326 4.185 87.415 3.870Q87.422 3.829 87.497 3.815L87.589 3.815Q87.671 3.839 87.671 3.911Q87.671 3.918 87.664 3.945Q87.551 4.342 87.181 4.581Q86.810 4.820 86.386 4.820Q85.948 4.820 85.548 4.612Q85.149 4.403 84.909 4.036Q84.670 3.669 84.670 3.217M85.340 2.947L87.155 2.947Q87.155 2.670 87.058 2.418Q86.960 2.165 86.762 2.009Q86.564 1.854 86.280 1.854Q86.003 1.854 85.789 2.012Q85.576 2.171 85.458 2.426Q85.340 2.681 85.340 2.947M89.848 4.725L88.720 2.226Q88.649 2.079 88.519 2.047Q88.389 2.014 88.160 2.014L88.160 1.734L89.674 1.734L89.674 2.014Q89.322 2.014 89.322 2.161Q89.322 2.206 89.332 2.226L90.197 4.144L90.976 2.414Q91.010 2.346 91.010 2.267Q91.010 2.154 90.927 2.084Q90.843 2.014 90.723 2.014L90.723 1.734L91.920 1.734L91.920 2.014Q91.701 2.014 91.530 2.117Q91.359 2.219 91.270 2.414L90.235 4.725Q90.187 4.820 90.081 4.820L90.002 4.820Q89.896 4.820 89.848 4.725\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(71.45 -5.825)\">\u003Cpath d=\"M92.217 3.217Q92.217 2.896 92.342 2.607Q92.467 2.318 92.693 2.095Q92.918 1.871 93.214 1.751Q93.509 1.631 93.827 1.631Q94.155 1.631 94.417 1.731Q94.678 1.830 94.854 2.012Q95.030 2.195 95.124 2.453Q95.218 2.711 95.218 3.043Q95.218 3.135 95.136 3.156L92.881 3.156L92.881 3.217Q92.881 3.805 93.164 4.188Q93.448 4.571 94.015 4.571Q94.337 4.571 94.605 4.378Q94.873 4.185 94.962 3.870Q94.969 3.829 95.044 3.815L95.136 3.815Q95.218 3.839 95.218 3.911Q95.218 3.918 95.212 3.945Q95.099 4.342 94.728 4.581Q94.357 4.820 93.933 4.820Q93.496 4.820 93.096 4.612Q92.696 4.403 92.457 4.036Q92.217 3.669 92.217 3.217M92.887 2.947L94.702 2.947Q94.702 2.670 94.605 2.418Q94.507 2.165 94.309 2.009Q94.111 1.854 93.827 1.854Q93.550 1.854 93.337 2.012Q93.123 2.171 93.005 2.426Q92.887 2.681 92.887 2.947M97.556 4.752L95.820 4.752L95.820 4.472Q96.049 4.472 96.198 4.438Q96.346 4.403 96.346 4.263L96.346 2.414Q96.346 2.144 96.239 2.083Q96.131 2.021 95.820 2.021L95.820 1.741L96.849 1.666L96.849 2.373Q96.979 2.065 97.221 1.866Q97.464 1.666 97.782 1.666Q98.001 1.666 98.172 1.790Q98.342 1.915 98.342 2.127Q98.342 2.264 98.243 2.363Q98.144 2.462 98.011 2.462Q97.874 2.462 97.775 2.363Q97.676 2.264 97.676 2.127Q97.676 1.987 97.775 1.888Q97.485 1.888 97.285 2.084Q97.085 2.281 96.992 2.575Q96.900 2.869 96.900 3.149L96.900 4.263Q96.900 4.472 97.556 4.472\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(71.45 -5.825)\">\u003Cpath d=\"M103.223 4.725L102.095 2.226Q102.023 2.079 101.893 2.047Q101.763 2.014 101.534 2.014L101.534 1.734L103.048 1.734L103.048 2.014Q102.696 2.014 102.696 2.161Q102.696 2.206 102.707 2.226L103.571 4.144L104.351 2.414Q104.385 2.346 104.385 2.267Q104.385 2.154 104.301 2.084Q104.217 2.014 104.098 2.014L104.098 1.734L105.294 1.734L105.294 2.014Q105.075 2.014 104.904 2.117Q104.734 2.219 104.645 2.414L103.609 4.725Q103.561 4.820 103.455 4.820L103.377 4.820Q103.271 4.820 103.223 4.725M107.451 4.752L105.899 4.752L105.899 4.472Q106.125 4.472 106.273 4.438Q106.422 4.403 106.422 4.263L106.422 2.414Q106.422 2.226 106.374 2.142Q106.326 2.059 106.229 2.040Q106.132 2.021 105.920 2.021L105.920 1.741L106.976 1.666L106.976 4.263Q106.976 4.403 107.107 4.438Q107.239 4.472 107.451 4.472L107.451 4.752M106.179 0.445Q106.179 0.274 106.302 0.155Q106.425 0.035 106.596 0.035Q106.764 0.035 106.887 0.155Q107.010 0.274 107.010 0.445Q107.010 0.620 106.887 0.743Q106.764 0.866 106.596 0.866Q106.425 0.866 106.302 0.743Q106.179 0.620 106.179 0.445M108.097 4.745L108.097 3.682Q108.097 3.658 108.124 3.631Q108.152 3.604 108.175 3.604L108.285 3.604Q108.350 3.604 108.363 3.662Q108.459 4.096 108.705 4.347Q108.951 4.598 109.365 4.598Q109.707 4.598 109.960 4.465Q110.213 4.332 110.213 4.024Q110.213 3.867 110.119 3.752Q110.025 3.638 109.886 3.569Q109.748 3.501 109.580 3.463L108.999 3.364Q108.644 3.296 108.370 3.075Q108.097 2.855 108.097 2.513Q108.097 2.264 108.208 2.089Q108.319 1.915 108.505 1.816Q108.692 1.717 108.907 1.674Q109.122 1.631 109.365 1.631Q109.778 1.631 110.059 1.813L110.274 1.638Q110.284 1.635 110.291 1.633Q110.298 1.631 110.308 1.631L110.360 1.631Q110.387 1.631 110.411 1.655Q110.435 1.679 110.435 1.707L110.435 2.554Q110.435 2.575 110.411 2.602Q110.387 2.629 110.360 2.629L110.247 2.629Q110.219 2.629 110.194 2.604Q110.168 2.578 110.168 2.554Q110.168 2.318 110.062 2.154Q109.956 1.990 109.773 1.908Q109.590 1.826 109.358 1.826Q109.030 1.826 108.774 1.929Q108.517 2.031 108.517 2.308Q108.517 2.503 108.700 2.612Q108.883 2.722 109.112 2.763L109.686 2.869Q109.932 2.917 110.146 3.045Q110.360 3.173 110.496 3.376Q110.633 3.580 110.633 3.829Q110.633 4.342 110.267 4.581Q109.902 4.820 109.365 4.820Q108.869 4.820 108.538 4.526L108.271 4.800Q108.251 4.820 108.223 4.820L108.175 4.820Q108.152 4.820 108.124 4.793Q108.097 4.766 108.097 4.745M112.879 4.752L111.327 4.752L111.327 4.472Q111.552 4.472 111.701 4.438Q111.850 4.403 111.850 4.263L111.850 2.414Q111.850 2.226 111.802 2.142Q111.754 2.059 111.657 2.040Q111.559 2.021 111.347 2.021L111.347 1.741L112.403 1.666L112.403 4.263Q112.403 4.403 112.535 4.438Q112.667 4.472 112.879 4.472L112.879 4.752M111.607 0.445Q111.607 0.274 111.730 0.155Q111.853 0.035 112.024 0.035Q112.192 0.035 112.315 0.155Q112.438 0.274 112.438 0.445Q112.438 0.620 112.315 0.743Q112.192 0.866 112.024 0.866Q111.853 0.866 111.730 0.743Q111.607 0.620 111.607 0.445M114.051 3.911L114.051 2.014L113.412 2.014L113.412 1.792Q113.730 1.792 113.947 1.582Q114.164 1.372 114.265 1.062Q114.365 0.753 114.365 0.445L114.632 0.445L114.632 1.734L115.709 1.734L115.709 2.014L114.632 2.014L114.632 3.898Q114.632 4.174 114.736 4.373Q114.840 4.571 115.100 4.571Q115.257 4.571 115.363 4.467Q115.469 4.362 115.519 4.209Q115.569 4.055 115.569 3.898L115.569 3.484L115.835 3.484L115.835 3.911Q115.835 4.137 115.736 4.347Q115.637 4.557 115.452 4.689Q115.268 4.820 115.039 4.820Q114.601 4.820 114.326 4.583Q114.051 4.345 114.051 3.911M116.604 3.217Q116.604 2.896 116.729 2.607Q116.854 2.318 117.079 2.095Q117.305 1.871 117.600 1.751Q117.896 1.631 118.214 1.631Q118.542 1.631 118.804 1.731Q119.065 1.830 119.241 2.012Q119.417 2.195 119.511 2.453Q119.605 2.711 119.605 3.043Q119.605 3.135 119.523 3.156L117.267 3.156L117.267 3.217Q117.267 3.805 117.551 4.188Q117.835 4.571 118.402 4.571Q118.723 4.571 118.992 4.378Q119.260 4.185 119.349 3.870Q119.356 3.829 119.431 3.815L119.523 3.815Q119.605 3.839 119.605 3.911Q119.605 3.918 119.598 3.945Q119.486 4.342 119.115 4.581Q118.744 4.820 118.320 4.820Q117.882 4.820 117.483 4.612Q117.083 4.403 116.843 4.036Q116.604 3.669 116.604 3.217M117.274 2.947L119.089 2.947Q119.089 2.670 118.992 2.418Q118.894 2.165 118.696 2.009Q118.498 1.854 118.214 1.854Q117.937 1.854 117.724 2.012Q117.510 2.171 117.392 2.426Q117.274 2.681 117.274 2.947M120.193 3.241Q120.193 2.903 120.333 2.612Q120.473 2.322 120.718 2.108Q120.962 1.895 121.266 1.780Q121.570 1.666 121.895 1.666Q122.165 1.666 122.428 1.765Q122.692 1.864 122.883 2.042L122.883 0.644Q122.883 0.374 122.775 0.312Q122.668 0.251 122.357 0.251L122.357-0.030L123.433-0.105L123.433 4.079Q123.433 4.267 123.488 4.350Q123.543 4.434 123.643 4.453Q123.744 4.472 123.960 4.472L123.960 4.752L122.852 4.820L122.852 4.403Q122.435 4.820 121.810 4.820Q121.379 4.820 121.007 4.608Q120.634 4.397 120.413 4.036Q120.193 3.675 120.193 3.241M121.868 4.598Q122.076 4.598 122.263 4.526Q122.449 4.455 122.603 4.318Q122.757 4.181 122.852 4.003L122.852 2.394Q122.767 2.247 122.621 2.127Q122.476 2.007 122.307 1.948Q122.138 1.888 121.957 1.888Q121.396 1.888 121.128 2.277Q120.860 2.667 120.860 3.248Q120.860 3.819 121.094 4.209Q121.328 4.598 121.868 4.598M124.930 6.509L124.862 6.509Q124.828 6.509 124.806 6.483Q124.783 6.458 124.783 6.423Q124.783 6.379 124.814 6.362Q125.170 6.058 125.419 5.668Q125.669 5.278 125.821 4.846Q125.973 4.414 126.043 3.945Q126.113 3.477 126.113 3.002Q126.113 2.523 126.043 2.057Q125.973 1.590 125.819 1.155Q125.665 0.719 125.414 0.331Q125.163-0.057 124.814-0.351Q124.783-0.368 124.783-0.413Q124.783-0.447 124.806-0.472Q124.828-0.498 124.862-0.498L124.930-0.498Q124.941-0.498 124.949-0.496Q124.958-0.495 124.968-0.491Q125.511-0.091 125.884 0.462Q126.257 1.016 126.438 1.662Q126.619 2.308 126.619 3.002Q126.619 3.703 126.438 4.350Q126.257 4.998 125.882 5.552Q125.508 6.106 124.968 6.502Q124.958 6.502 124.949 6.504Q124.941 6.505 124.930 6.509\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M175.79999999999998 18.979a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0M161.57299999999998 30.36a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0M190.02599999999998 33.205a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0m-2.2 0\"\u002F>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">RTDP updates only states the agent reaches. From the start states, an optimal policy visits the relevant states; irrelevant states are unreachable under any optimal policy from any start, and RTDP can skip them entirely.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:492.285px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 369.214 74.071\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-62.07-43.617H.526V-72.07H-62.07Z\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(-23.748 2.233)\">\u003Cpath d=\"M-30.534-59.598Q-30.534-60.078-30.301-60.494Q-30.069-60.910-29.659-61.160Q-29.249-61.410-28.772-61.410Q-28.042-61.410-27.643-60.969Q-27.245-60.528-27.245-59.797Q-27.245-59.692-27.338-59.668L-29.788-59.668L-29.788-59.598Q-29.788-59.188-29.667-58.832Q-29.545-58.477-29.274-58.260Q-29.002-58.043-28.573-58.043Q-28.209-58.043-27.913-58.272Q-27.616-58.500-27.514-58.852Q-27.506-58.899-27.420-58.914L-27.338-58.914Q-27.245-58.887-27.245-58.805Q-27.245-58.797-27.252-58.766Q-27.315-58.539-27.454-58.356Q-27.592-58.172-27.784-58.039Q-27.975-57.907-28.194-57.836Q-28.413-57.766-28.651-57.766Q-29.022-57.766-29.360-57.903Q-29.698-58.039-29.965-58.291Q-30.233-58.543-30.383-58.883Q-30.534-59.223-30.534-59.598M-29.780-59.907L-27.819-59.907Q-27.819-60.211-27.920-60.502Q-28.022-60.793-28.239-60.975Q-28.456-61.157-28.772-61.157Q-29.073-61.157-29.303-60.969Q-29.534-60.782-29.657-60.490Q-29.780-60.199-29.780-59.907M-24.827-57.844L-26.682-57.844L-26.682-58.141Q-26.409-58.141-26.241-58.188Q-26.073-58.235-26.073-58.403L-26.073-60.539Q-26.073-60.754-26.135-60.850Q-26.198-60.946-26.317-60.967Q-26.436-60.989-26.682-60.989L-26.682-61.285L-25.491-61.371L-25.491-60.637Q-25.377-60.852-25.184-61.020Q-24.991-61.188-24.752-61.280Q-24.514-61.371-24.260-61.371Q-23.092-61.371-23.092-60.293L-23.092-58.403Q-23.092-58.235-22.922-58.188Q-22.752-58.141-22.483-58.141L-22.483-57.844L-24.338-57.844L-24.338-58.141Q-24.065-58.141-23.897-58.188Q-23.729-58.235-23.729-58.403L-23.729-60.278Q-23.729-60.660-23.850-60.889Q-23.971-61.117-24.323-61.117Q-24.635-61.117-24.889-60.955Q-25.143-60.793-25.290-60.524Q-25.436-60.254-25.436-59.957L-25.436-58.403Q-25.436-58.235-25.266-58.188Q-25.096-58.141-24.827-58.141L-24.827-57.844M-21.995-59.571Q-21.995-60.067-21.745-60.492Q-21.495-60.918-21.075-61.164Q-20.655-61.410-20.155-61.410Q-19.616-61.410-19.225-61.285Q-18.834-61.160-18.834-60.746Q-18.834-60.641-18.885-60.549Q-18.936-60.457-19.028-60.407Q-19.120-60.356-19.229-60.356Q-19.334-60.356-19.426-60.407Q-19.518-60.457-19.569-60.549Q-19.620-60.641-19.620-60.746Q-19.620-60.969-19.452-61.074Q-19.674-61.133-20.147-61.133Q-20.444-61.133-20.659-60.994Q-20.874-60.856-21.004-60.625Q-21.135-60.395-21.194-60.125Q-21.252-59.856-21.252-59.571Q-21.252-59.176-21.120-58.826Q-20.987-58.477-20.715-58.260Q-20.444-58.043-20.045-58.043Q-19.670-58.043-19.395-58.260Q-19.120-58.477-19.018-58.836Q-19.002-58.899-18.940-58.899L-18.834-58.899Q-18.799-58.899-18.774-58.871Q-18.749-58.844-18.749-58.805L-18.749-58.782Q-18.881-58.301-19.266-58.033Q-19.651-57.766-20.155-57.766Q-20.518-57.766-20.852-57.903Q-21.186-58.039-21.446-58.289Q-21.706-58.539-21.850-58.875Q-21.995-59.211-21.995-59.571M-18.260-59.539Q-18.260-60.043-18.004-60.475Q-17.749-60.907-17.313-61.158Q-16.877-61.410-16.377-61.410Q-15.991-61.410-15.649-61.266Q-15.307-61.121-15.045-60.860Q-14.784-60.598-14.641-60.262Q-14.499-59.926-14.499-59.539Q-14.499-59.047-14.762-58.637Q-15.026-58.227-15.456-57.996Q-15.885-57.766-16.377-57.766Q-16.870-57.766-17.303-57.998Q-17.737-58.231-17.999-58.639Q-18.260-59.047-18.260-59.539M-16.377-58.043Q-15.920-58.043-15.668-58.266Q-15.417-58.489-15.329-58.840Q-15.241-59.192-15.241-59.637Q-15.241-60.067-15.334-60.405Q-15.428-60.742-15.682-60.949Q-15.936-61.157-16.377-61.157Q-17.026-61.157-17.270-60.740Q-17.514-60.324-17.514-59.637Q-17.514-59.192-17.426-58.840Q-17.338-58.489-17.086-58.266Q-16.834-58.043-16.377-58.043M-13.331-58.797L-13.331-60.539Q-13.331-60.754-13.393-60.850Q-13.456-60.946-13.575-60.967Q-13.694-60.989-13.940-60.989L-13.940-61.285L-12.694-61.371L-12.694-58.821L-12.694-58.797Q-12.694-58.485-12.639-58.323Q-12.584-58.160-12.434-58.090Q-12.284-58.020-11.963-58.020Q-11.534-58.020-11.260-58.358Q-10.987-58.696-10.987-59.141L-10.987-60.539Q-10.987-60.754-11.049-60.850Q-11.112-60.946-11.231-60.967Q-11.350-60.989-11.596-60.989L-11.596-61.285L-10.350-61.371L-10.350-58.586Q-10.350-58.375-10.288-58.280Q-10.225-58.184-10.106-58.162Q-9.987-58.141-9.741-58.141L-9.741-57.844L-10.963-57.766L-10.963-58.387Q-11.131-58.098-11.413-57.932Q-11.694-57.766-12.014-57.766Q-13.331-57.766-13.331-58.797M-7.366-57.844L-9.221-57.844L-9.221-58.141Q-8.948-58.141-8.780-58.188Q-8.612-58.235-8.612-58.403L-8.612-60.539Q-8.612-60.754-8.674-60.850Q-8.737-60.946-8.856-60.967Q-8.975-60.989-9.221-60.989L-9.221-61.285L-8.030-61.371L-8.030-60.637Q-7.917-60.852-7.723-61.020Q-7.530-61.188-7.292-61.280Q-7.053-61.371-6.799-61.371Q-5.631-61.371-5.631-60.293L-5.631-58.403Q-5.631-58.235-5.461-58.188Q-5.292-58.141-5.022-58.141L-5.022-57.844L-6.877-57.844L-6.877-58.141Q-6.604-58.141-6.436-58.188Q-6.268-58.235-6.268-58.403L-6.268-60.278Q-6.268-60.660-6.389-60.889Q-6.510-61.117-6.862-61.117Q-7.174-61.117-7.428-60.955Q-7.682-60.793-7.829-60.524Q-7.975-60.254-7.975-59.957L-7.975-58.403Q-7.975-58.235-7.805-58.188Q-7.635-58.141-7.366-58.141\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.748 2.233)\">\u003Cpath d=\"M-4.173-58.805L-4.173-60.996L-4.876-60.996L-4.876-61.250Q-4.520-61.250-4.278-61.483Q-4.036-61.715-3.925-62.063Q-3.813-62.410-3.813-62.766L-3.532-62.766L-3.532-61.293L-2.356-61.293L-2.356-60.996L-3.532-60.996L-3.532-58.821Q-3.532-58.500-3.413-58.272Q-3.294-58.043-3.013-58.043Q-2.833-58.043-2.716-58.166Q-2.598-58.289-2.546-58.469Q-2.493-58.649-2.493-58.821L-2.493-59.293L-2.212-59.293L-2.212-58.805Q-2.212-58.551-2.317-58.311Q-2.423-58.071-2.620-57.918Q-2.817-57.766-3.075-57.766Q-3.391-57.766-3.643-57.889Q-3.895-58.012-4.034-58.246Q-4.173-58.481-4.173-58.805M-1.493-59.598Q-1.493-60.078-1.261-60.494Q-1.028-60.910-0.618-61.160Q-0.208-61.410 0.269-61.410Q0.999-61.410 1.398-60.969Q1.796-60.528 1.796-59.797Q1.796-59.692 1.702-59.668L-0.747-59.668L-0.747-59.598Q-0.747-59.188-0.626-58.832Q-0.505-58.477-0.233-58.260Q0.038-58.043 0.468-58.043Q0.831-58.043 1.128-58.272Q1.425-58.500 1.527-58.852Q1.534-58.899 1.620-58.914L1.702-58.914Q1.796-58.887 1.796-58.805Q1.796-58.797 1.788-58.766Q1.726-58.539 1.587-58.356Q1.448-58.172 1.257-58.039Q1.066-57.907 0.847-57.836Q0.628-57.766 0.390-57.766Q0.019-57.766-0.319-57.903Q-0.657-58.039-0.925-58.291Q-1.192-58.543-1.343-58.883Q-1.493-59.223-1.493-59.598M-0.739-59.907L1.222-59.907Q1.222-60.211 1.120-60.502Q1.019-60.793 0.802-60.975Q0.585-61.157 0.269-61.157Q-0.032-61.157-0.263-60.969Q-0.493-60.782-0.616-60.490Q-0.739-60.199-0.739-59.907M4.292-57.844L2.312-57.844L2.312-58.141Q2.581-58.141 2.749-58.186Q2.917-58.231 2.917-58.403L2.917-60.539Q2.917-60.754 2.855-60.850Q2.792-60.946 2.675-60.967Q2.558-60.989 2.312-60.989L2.312-61.285L3.480-61.371L3.480-60.586Q3.558-60.797 3.710-60.983Q3.862-61.168 4.062-61.270Q4.261-61.371 4.487-61.371Q4.734-61.371 4.925-61.227Q5.116-61.082 5.116-60.852Q5.116-60.696 5.011-60.586Q4.905-60.477 4.749-60.477Q4.593-60.477 4.484-60.586Q4.374-60.696 4.374-60.852Q4.374-61.012 4.480-61.117Q4.155-61.117 3.941-60.889Q3.726-60.660 3.630-60.321Q3.534-59.981 3.534-59.676L3.534-58.403Q3.534-58.235 3.761-58.188Q3.987-58.141 4.292-58.141\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.748 2.233)\">\u003Cpath d=\"M8.788-57.676L8.737-57.676Q8.702-57.676 8.676-57.705Q8.651-57.735 8.651-57.774L8.651-57.797L9.096-59.598Q9.112-59.660 9.186-59.660L9.292-59.660Q9.331-59.660 9.354-59.633Q9.378-59.606 9.378-59.563Q9.378-59.524 9.346-59.356Q9.315-59.188 9.315-59.102Q9.315-58.512 9.745-58.242Q10.174-57.973 10.796-57.973Q11.151-57.973 11.491-58.170Q11.831-58.367 12.044-58.699Q12.257-59.032 12.257-59.387Q12.257-59.684 12.089-59.901Q11.921-60.117 11.643-60.188L10.585-60.446Q10.319-60.508 10.104-60.678Q9.889-60.848 9.770-61.090Q9.651-61.332 9.651-61.614Q9.651-61.989 9.831-62.328Q10.010-62.668 10.307-62.926Q10.604-63.184 10.967-63.330Q11.331-63.477 11.698-63.477Q12.073-63.477 12.401-63.342Q12.729-63.207 12.921-62.922L13.385-63.453Q13.409-63.477 13.440-63.477L13.491-63.477Q13.530-63.477 13.553-63.449Q13.577-63.422 13.577-63.379L13.577-63.356L13.132-61.563Q13.104-61.492 13.042-61.492L12.936-61.492Q12.850-61.492 12.850-61.598Q12.882-61.774 12.882-61.989Q12.882-62.375 12.743-62.649Q12.604-62.922 12.337-63.063Q12.069-63.203 11.682-63.203Q11.350-63.203 11.016-63.032Q10.682-62.860 10.465-62.565Q10.249-62.270 10.249-61.934Q10.249-61.668 10.419-61.463Q10.589-61.258 10.858-61.188L11.913-60.934Q12.342-60.828 12.596-60.489Q12.850-60.149 12.850-59.707Q12.850-59.313 12.676-58.946Q12.503-58.578 12.200-58.289Q11.897-58 11.524-57.838Q11.151-57.676 10.768-57.676Q10.323-57.676 9.932-57.805Q9.542-57.934 9.307-58.227L8.842-57.699Q8.819-57.676 8.788-57.676\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.748 2.233)\">\u003Cpath d=\"M14.034-57.360Q14.034-57.433 14.054-57.497L14.473-59.173L13.764-59.173Q13.729-59.173 13.706-59.207Q13.682-59.240 13.682-59.273Q13.703-59.361 13.716-59.391Q13.729-59.422 13.782-59.431L14.532-59.431L14.772-60.371Q14.799-60.474 14.882-60.534Q14.966-60.594 15.062-60.594Q15.153-60.594 15.217-60.537Q15.282-60.480 15.282-60.389Q15.282-60.368 15.280-60.357Q15.279-60.345 15.276-60.330L15.048-59.431L15.745-59.431Q15.780-59.431 15.805-59.399Q15.830-59.366 15.830-59.328Q15.809-59.243 15.795-59.213Q15.780-59.182 15.727-59.173L14.983-59.173L14.564-57.480Q14.538-57.398 14.538-57.289Q14.538-57.169 14.589-57.084Q14.640-56.999 14.749-56.999Q14.939-56.999 15.108-57.112Q15.276-57.225 15.401-57.393Q15.525-57.562 15.595-57.738Q15.607-57.767 15.660-57.793L15.757-57.793Q15.836-57.764 15.836-57.708Q15.836-57.702 15.830-57.673Q15.762-57.506 15.650-57.342Q15.537-57.178 15.395-57.055Q15.253-56.932 15.083-56.859Q14.913-56.785 14.737-56.785Q14.456-56.785 14.245-56.939Q14.034-57.093 14.034-57.360\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"var(--tk-accent)\">\u003Cpath fill=\"none\" d=\"M34.67-43.617h62.595V-72.07H34.67Z\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\">\u003Cg transform=\"translate(72.99 2)\">\u003Cpath d=\"M-28.651-56.293L-30.506-56.293L-30.506-56.586Q-30.237-56.586-30.069-56.631Q-29.901-56.676-29.901-56.852L-29.901-60.676Q-29.901-60.883-30.057-60.936Q-30.213-60.989-30.506-60.989L-30.506-61.285L-29.284-61.371L-29.284-60.907Q-29.053-61.129-28.739-61.250Q-28.424-61.371-28.084-61.371Q-27.612-61.371-27.208-61.125Q-26.803-60.879-26.571-60.463Q-26.338-60.047-26.338-59.571Q-26.338-59.196-26.487-58.867Q-26.635-58.539-26.905-58.287Q-27.174-58.035-27.518-57.901Q-27.862-57.766-28.221-57.766Q-28.510-57.766-28.782-57.887Q-29.053-58.008-29.260-58.219L-29.260-56.852Q-29.260-56.676-29.092-56.631Q-28.924-56.586-28.651-56.586L-28.651-56.293M-29.260-60.508L-29.260-58.668Q-29.108-58.379-28.846-58.199Q-28.584-58.020-28.276-58.020Q-27.991-58.020-27.768-58.158Q-27.545-58.297-27.393-58.528Q-27.241-58.758-27.163-59.030Q-27.084-59.301-27.084-59.571Q-27.084-59.903-27.209-60.260Q-27.334-60.617-27.583-60.854Q-27.831-61.090-28.178-61.090Q-28.502-61.090-28.797-60.934Q-29.092-60.778-29.260-60.508M-23.901-57.844L-25.733-57.844L-25.733-58.141Q-25.459-58.141-25.292-58.188Q-25.124-58.235-25.124-58.403L-25.124-62.563Q-25.124-62.778-25.186-62.873Q-25.249-62.969-25.368-62.990Q-25.487-63.012-25.733-63.012L-25.733-63.309L-24.510-63.395L-24.510-58.403Q-24.510-58.235-24.342-58.188Q-24.174-58.141-23.901-58.141L-23.901-57.844M-23.358-58.676Q-23.358-59.160-22.956-59.455Q-22.553-59.750-22.002-59.869Q-21.452-59.989-20.959-59.989L-20.959-60.278Q-20.959-60.504-21.075-60.711Q-21.190-60.918-21.387-61.037Q-21.584-61.157-21.815-61.157Q-22.241-61.157-22.526-61.051Q-22.456-61.024-22.409-60.969Q-22.362-60.914-22.336-60.844Q-22.311-60.774-22.311-60.699Q-22.311-60.594-22.362-60.502Q-22.413-60.410-22.504-60.360Q-22.596-60.309-22.702-60.309Q-22.807-60.309-22.899-60.360Q-22.991-60.410-23.042-60.502Q-23.092-60.594-23.092-60.699Q-23.092-61.117-22.704-61.264Q-22.315-61.410-21.815-61.410Q-21.483-61.410-21.129-61.280Q-20.776-61.149-20.547-60.895Q-20.319-60.641-20.319-60.293L-20.319-58.492Q-20.319-58.360-20.247-58.250Q-20.174-58.141-20.045-58.141Q-19.920-58.141-19.852-58.246Q-19.784-58.352-19.784-58.492L-19.784-59.004L-19.502-59.004L-19.502-58.492Q-19.502-58.289-19.620-58.131Q-19.737-57.973-19.918-57.889Q-20.100-57.805-20.303-57.805Q-20.534-57.805-20.686-57.977Q-20.838-58.149-20.870-58.379Q-21.030-58.098-21.338-57.932Q-21.647-57.766-21.999-57.766Q-22.510-57.766-22.934-57.989Q-23.358-58.211-23.358-58.676M-22.670-58.676Q-22.670-58.391-22.444-58.205Q-22.217-58.020-21.924-58.020Q-21.678-58.020-21.454-58.137Q-21.229-58.254-21.094-58.457Q-20.959-58.660-20.959-58.914L-20.959-59.746Q-21.225-59.746-21.510-59.692Q-21.795-59.637-22.067-59.508Q-22.338-59.379-22.504-59.172Q-22.670-58.965-22.670-58.676M-17.280-57.844L-19.135-57.844L-19.135-58.141Q-18.862-58.141-18.694-58.188Q-18.526-58.235-18.526-58.403L-18.526-60.539Q-18.526-60.754-18.588-60.850Q-18.651-60.946-18.770-60.967Q-18.889-60.989-19.135-60.989L-19.135-61.285L-17.944-61.371L-17.944-60.637Q-17.831-60.852-17.637-61.020Q-17.444-61.188-17.206-61.280Q-16.967-61.371-16.713-61.371Q-15.545-61.371-15.545-60.293L-15.545-58.403Q-15.545-58.235-15.376-58.188Q-15.206-58.141-14.936-58.141L-14.936-57.844L-16.792-57.844L-16.792-58.141Q-16.518-58.141-16.350-58.188Q-16.182-58.235-16.182-58.403L-16.182-60.278Q-16.182-60.660-16.303-60.889Q-16.424-61.117-16.776-61.117Q-17.088-61.117-17.342-60.955Q-17.596-60.793-17.743-60.524Q-17.889-60.254-17.889-59.957L-17.889-58.403Q-17.889-58.235-17.719-58.188Q-17.549-58.141-17.280-58.141\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(72.99 2)\">\u003Cpath d=\"M-9.578-57.844L-11.563-57.844L-11.563-58.141Q-11.289-58.141-11.121-58.188Q-10.953-58.235-10.953-58.403L-10.953-60.996L-11.594-60.996L-11.594-61.293L-10.953-61.293L-10.953-62.227Q-10.953-62.492-10.836-62.729Q-10.719-62.965-10.526-63.129Q-10.332-63.293-10.084-63.385Q-9.836-63.477-9.570-63.477Q-9.285-63.477-9.061-63.319Q-8.836-63.160-8.836-62.883Q-8.836-62.727-8.942-62.617Q-9.047-62.508-9.211-62.508Q-9.367-62.508-9.477-62.617Q-9.586-62.727-9.586-62.883Q-9.586-63.090-9.426-63.196Q-9.524-63.219-9.617-63.219Q-9.848-63.219-10.020-63.063Q-10.192-62.907-10.278-62.670Q-10.363-62.434-10.363-62.211L-10.363-61.293L-9.395-61.293L-9.395-60.996L-10.340-60.996L-10.340-58.403Q-10.340-58.235-10.113-58.188Q-9.887-58.141-9.578-58.141L-9.578-57.844M-7.043-57.844L-9.024-57.844L-9.024-58.141Q-8.754-58.141-8.586-58.186Q-8.418-58.231-8.418-58.403L-8.418-60.539Q-8.418-60.754-8.481-60.850Q-8.543-60.946-8.660-60.967Q-8.778-60.989-9.024-60.989L-9.024-61.285L-7.856-61.371L-7.856-60.586Q-7.778-60.797-7.625-60.983Q-7.473-61.168-7.274-61.270Q-7.074-61.371-6.848-61.371Q-6.602-61.371-6.410-61.227Q-6.219-61.082-6.219-60.852Q-6.219-60.696-6.324-60.586Q-6.430-60.477-6.586-60.477Q-6.742-60.477-6.852-60.586Q-6.961-60.696-6.961-60.852Q-6.961-61.012-6.856-61.117Q-7.180-61.117-7.395-60.889Q-7.610-60.660-7.705-60.321Q-7.801-59.981-7.801-59.676L-7.801-58.403Q-7.801-58.235-7.574-58.188Q-7.348-58.141-7.043-58.141L-7.043-57.844M-5.738-59.539Q-5.738-60.043-5.483-60.475Q-5.227-60.907-4.791-61.158Q-4.356-61.410-3.856-61.410Q-3.469-61.410-3.127-61.266Q-2.785-61.121-2.524-60.860Q-2.262-60.598-2.119-60.262Q-1.977-59.926-1.977-59.539Q-1.977-59.047-2.240-58.637Q-2.504-58.227-2.934-57.996Q-3.363-57.766-3.856-57.766Q-4.348-57.766-4.781-57.998Q-5.215-58.231-5.477-58.639Q-5.738-59.047-5.738-59.539M-3.856-58.043Q-3.399-58.043-3.147-58.266Q-2.895-58.489-2.807-58.840Q-2.719-59.192-2.719-59.637Q-2.719-60.067-2.813-60.405Q-2.906-60.742-3.160-60.949Q-3.414-61.157-3.856-61.157Q-4.504-61.157-4.748-60.740Q-4.992-60.324-4.992-59.637Q-4.992-59.192-4.904-58.840Q-4.817-58.489-4.565-58.266Q-4.313-58.043-3.856-58.043M0.437-57.844L-1.418-57.844L-1.418-58.141Q-1.145-58.141-0.977-58.188Q-0.809-58.235-0.809-58.403L-0.809-60.539Q-0.809-60.754-0.871-60.850Q-0.934-60.946-1.053-60.967Q-1.172-60.989-1.418-60.989L-1.418-61.285L-0.227-61.371L-0.227-60.637Q-0.113-60.852 0.080-61.020Q0.273-61.188 0.512-61.280Q0.750-61.371 1.004-61.371Q1.965-61.371 2.140-60.660Q2.324-60.989 2.652-61.180Q2.980-61.371 3.359-61.371Q4.535-61.371 4.535-60.293L4.535-58.403Q4.535-58.235 4.703-58.188Q4.871-58.141 5.140-58.141L5.140-57.844L3.285-57.844L3.285-58.141Q3.558-58.141 3.726-58.186Q3.894-58.231 3.894-58.403L3.894-60.278Q3.894-60.664 3.769-60.891Q3.644-61.117 3.293-61.117Q2.988-61.117 2.732-60.955Q2.476-60.793 2.328-60.524Q2.180-60.254 2.180-59.957L2.180-58.403Q2.180-58.235 2.349-58.188Q2.519-58.141 2.789-58.141L2.789-57.844L0.933-57.844L0.933-58.141Q1.207-58.141 1.375-58.188Q1.543-58.235 1.543-58.403L1.543-60.278Q1.543-60.664 1.418-60.891Q1.293-61.117 0.941-61.117Q0.637-61.117 0.381-60.955Q0.125-60.793-0.024-60.524Q-0.172-60.254-0.172-59.957L-0.172-58.403Q-0.172-58.235-0.002-58.188Q0.168-58.141 0.437-58.141\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(72.99 2)\">\u003Cpath d=\"M8.788-57.676L8.737-57.676Q8.702-57.676 8.676-57.705Q8.651-57.735 8.651-57.774L8.651-57.797L9.096-59.598Q9.112-59.660 9.186-59.660L9.292-59.660Q9.331-59.660 9.354-59.633Q9.378-59.606 9.378-59.563Q9.378-59.524 9.346-59.356Q9.315-59.188 9.315-59.102Q9.315-58.512 9.745-58.242Q10.174-57.973 10.796-57.973Q11.151-57.973 11.491-58.170Q11.831-58.367 12.044-58.699Q12.257-59.032 12.257-59.387Q12.257-59.684 12.089-59.901Q11.921-60.117 11.643-60.188L10.585-60.446Q10.319-60.508 10.104-60.678Q9.889-60.848 9.770-61.090Q9.651-61.332 9.651-61.614Q9.651-61.989 9.831-62.328Q10.010-62.668 10.307-62.926Q10.604-63.184 10.967-63.330Q11.331-63.477 11.698-63.477Q12.073-63.477 12.401-63.342Q12.729-63.207 12.921-62.922L13.385-63.453Q13.409-63.477 13.440-63.477L13.491-63.477Q13.530-63.477 13.553-63.449Q13.577-63.422 13.577-63.379L13.577-63.356L13.132-61.563Q13.104-61.492 13.042-61.492L12.936-61.492Q12.850-61.492 12.850-61.598Q12.882-61.774 12.882-61.989Q12.882-62.375 12.743-62.649Q12.604-62.922 12.337-63.063Q12.069-63.203 11.682-63.203Q11.350-63.203 11.016-63.032Q10.682-62.860 10.465-62.565Q10.249-62.270 10.249-61.934Q10.249-61.668 10.419-61.463Q10.589-61.258 10.858-61.188L11.913-60.934Q12.342-60.828 12.596-60.489Q12.850-60.149 12.850-59.707Q12.850-59.313 12.676-58.946Q12.503-58.578 12.200-58.289Q11.897-58 11.524-57.838Q11.151-57.676 10.768-57.676Q10.323-57.676 9.932-57.805Q9.542-57.934 9.307-58.227L8.842-57.699Q8.819-57.676 8.788-57.676\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(72.99 2)\">\u003Cpath d=\"M14.034-57.360Q14.034-57.433 14.054-57.497L14.473-59.173L13.764-59.173Q13.729-59.173 13.706-59.207Q13.682-59.240 13.682-59.273Q13.703-59.361 13.716-59.391Q13.729-59.422 13.782-59.431L14.532-59.431L14.772-60.371Q14.799-60.474 14.882-60.534Q14.966-60.594 15.062-60.594Q15.153-60.594 15.217-60.537Q15.282-60.480 15.282-60.389Q15.282-60.368 15.280-60.357Q15.279-60.345 15.276-60.330L15.048-59.431L15.745-59.431Q15.780-59.431 15.805-59.399Q15.830-59.366 15.830-59.328Q15.809-59.243 15.795-59.213Q15.780-59.182 15.727-59.173L14.983-59.173L14.564-57.480Q14.538-57.398 14.538-57.289Q14.538-57.169 14.589-57.084Q14.640-56.999 14.749-56.999Q14.939-56.999 15.108-57.112Q15.276-57.225 15.401-57.393Q15.525-57.562 15.595-57.738Q15.607-57.767 15.660-57.793L15.757-57.793Q15.836-57.764 15.836-57.708Q15.836-57.702 15.830-57.673Q15.762-57.506 15.650-57.342Q15.537-57.178 15.395-57.055Q15.253-56.932 15.083-56.859Q14.913-56.785 14.737-56.785Q14.456-56.785 14.245-56.939Q14.034-57.093 14.034-57.360\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M131.409-43.617h62.596V-72.07h-62.596Z\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(178.934 2.233)\">\u003Cpath d=\"M-30.534-59.598Q-30.534-60.078-30.301-60.494Q-30.069-60.910-29.659-61.160Q-29.249-61.410-28.772-61.410Q-28.042-61.410-27.643-60.969Q-27.245-60.528-27.245-59.797Q-27.245-59.692-27.338-59.668L-29.788-59.668L-29.788-59.598Q-29.788-59.188-29.667-58.832Q-29.545-58.477-29.274-58.260Q-29.002-58.043-28.573-58.043Q-28.209-58.043-27.913-58.272Q-27.616-58.500-27.514-58.852Q-27.506-58.899-27.420-58.914L-27.338-58.914Q-27.245-58.887-27.245-58.805Q-27.245-58.797-27.252-58.766Q-27.315-58.539-27.454-58.356Q-27.592-58.172-27.784-58.039Q-27.975-57.907-28.194-57.836Q-28.413-57.766-28.651-57.766Q-29.022-57.766-29.360-57.903Q-29.698-58.039-29.965-58.291Q-30.233-58.543-30.383-58.883Q-30.534-59.223-30.534-59.598M-29.780-59.907L-27.819-59.907Q-27.819-60.211-27.920-60.502Q-28.022-60.793-28.239-60.975Q-28.456-61.157-28.772-61.157Q-29.073-61.157-29.303-60.969Q-29.534-60.782-29.657-60.490Q-29.780-60.199-29.780-59.907M-24.827-57.844L-26.682-57.844L-26.682-58.141Q-26.409-58.141-26.241-58.188Q-26.073-58.235-26.073-58.403L-26.073-60.539Q-26.073-60.754-26.135-60.850Q-26.198-60.946-26.317-60.967Q-26.436-60.989-26.682-60.989L-26.682-61.285L-25.491-61.371L-25.491-60.637Q-25.377-60.852-25.184-61.020Q-24.991-61.188-24.752-61.280Q-24.514-61.371-24.260-61.371Q-23.299-61.371-23.124-60.660Q-22.940-60.989-22.612-61.180Q-22.284-61.371-21.905-61.371Q-20.729-61.371-20.729-60.293L-20.729-58.403Q-20.729-58.235-20.561-58.188Q-20.393-58.141-20.124-58.141L-20.124-57.844L-21.979-57.844L-21.979-58.141Q-21.706-58.141-21.538-58.186Q-21.370-58.231-21.370-58.403L-21.370-60.278Q-21.370-60.664-21.495-60.891Q-21.620-61.117-21.971-61.117Q-22.276-61.117-22.532-60.955Q-22.788-60.793-22.936-60.524Q-23.084-60.254-23.084-59.957L-23.084-58.403Q-23.084-58.235-22.915-58.188Q-22.745-58.141-22.475-58.141L-22.475-57.844L-24.331-57.844L-24.331-58.141Q-24.057-58.141-23.889-58.188Q-23.721-58.235-23.721-58.403L-23.721-60.278Q-23.721-60.664-23.846-60.891Q-23.971-61.117-24.323-61.117Q-24.627-61.117-24.883-60.955Q-25.139-60.793-25.288-60.524Q-25.436-60.254-25.436-59.957L-25.436-58.403Q-25.436-58.235-25.266-58.188Q-25.096-58.141-24.827-58.141L-24.827-57.844M-17.819-57.844L-19.596-57.844L-19.596-58.141Q-19.323-58.141-19.155-58.188Q-18.987-58.235-18.987-58.403L-18.987-60.539Q-18.987-60.754-19.043-60.850Q-19.100-60.946-19.213-60.967Q-19.327-60.989-19.573-60.989L-19.573-61.285L-18.374-61.371L-18.374-58.403Q-18.374-58.235-18.227-58.188Q-18.081-58.141-17.819-58.141L-17.819-57.844M-19.260-62.766Q-19.260-62.957-19.126-63.088Q-18.991-63.219-18.795-63.219Q-18.674-63.219-18.571-63.157Q-18.467-63.094-18.405-62.990Q-18.342-62.887-18.342-62.766Q-18.342-62.571-18.473-62.436Q-18.604-62.301-18.795-62.301Q-18.995-62.301-19.127-62.434Q-19.260-62.567-19.260-62.766M-16.694-58.805L-16.694-60.996L-17.397-60.996L-17.397-61.250Q-17.042-61.250-16.799-61.483Q-16.557-61.715-16.446-62.063Q-16.334-62.410-16.334-62.766L-16.053-62.766L-16.053-61.293L-14.877-61.293L-14.877-60.996L-16.053-60.996L-16.053-58.821Q-16.053-58.500-15.934-58.272Q-15.815-58.043-15.534-58.043Q-15.354-58.043-15.237-58.166Q-15.120-58.289-15.067-58.469Q-15.014-58.649-15.014-58.821L-15.014-59.293L-14.733-59.293L-14.733-58.805Q-14.733-58.551-14.838-58.311Q-14.944-58.071-15.141-57.918Q-15.338-57.766-15.596-57.766Q-15.913-57.766-16.165-57.889Q-16.417-58.012-16.555-58.246Q-16.694-58.481-16.694-58.805\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(178.934 2.233)\">\u003Cpath d=\"M-9.442-57.844L-11.005-57.844Q-11.044-57.844-11.071-57.885Q-11.098-57.926-11.098-57.973L-11.075-58.074Q-11.032-58.133-10.977-58.141Q-10.653-58.141-10.411-58.285Q-10.266-58.371-10.149-58.524Q-10.032-58.676-9.985-58.715L-7.036-63.446Q-6.970-63.555-6.845-63.555L-6.763-63.555Q-6.649-63.555-6.626-63.446L-5.985-58.301Q-5.931-58.141-5.388-58.141Q-5.290-58.110-5.290-58.020L-5.313-57.914Q-5.348-57.856-5.411-57.844L-7.411-57.844Q-7.446-57.844-7.477-57.885Q-7.509-57.926-7.509-57.973L-7.481-58.074Q-7.450-58.129-7.388-58.141Q-6.794-58.141-6.763-58.348L-6.923-59.653L-9.083-59.653L-9.739-58.614Q-9.747-58.567-9.778-58.494Q-9.809-58.422-9.809-58.379Q-9.809-58.246-9.690-58.194Q-9.571-58.141-9.427-58.141Q-9.333-58.110-9.333-58.020L-9.356-57.914Q-9.388-57.856-9.442-57.844M-7.282-62.532L-8.899-59.949L-6.962-59.949\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(178.934 2.233)\">\u003Cpath d=\"M-4.373-57.360Q-4.373-57.433-4.353-57.497L-3.934-59.173L-4.643-59.173Q-4.678-59.173-4.701-59.207Q-4.725-59.240-4.725-59.273Q-4.704-59.361-4.691-59.391Q-4.678-59.422-4.625-59.431L-3.875-59.431L-3.635-60.371Q-3.608-60.474-3.525-60.534Q-3.441-60.594-3.345-60.594Q-3.254-60.594-3.190-60.537Q-3.125-60.480-3.125-60.389Q-3.125-60.368-3.127-60.357Q-3.128-60.345-3.131-60.330L-3.359-59.431L-2.662-59.431Q-2.627-59.431-2.602-59.399Q-2.577-59.366-2.577-59.328Q-2.598-59.243-2.612-59.213Q-2.627-59.182-2.680-59.173L-3.424-59.173L-3.843-57.480Q-3.869-57.398-3.869-57.289Q-3.869-57.169-3.818-57.084Q-3.767-56.999-3.658-56.999Q-3.468-56.999-3.299-57.112Q-3.131-57.225-3.006-57.393Q-2.882-57.562-2.812-57.738Q-2.800-57.767-2.747-57.793L-2.650-57.793Q-2.571-57.764-2.571-57.708Q-2.571-57.702-2.577-57.673Q-2.645-57.506-2.757-57.342Q-2.870-57.178-3.012-57.055Q-3.154-56.932-3.324-56.859Q-3.494-56.785-3.670-56.785Q-3.951-56.785-4.162-56.939Q-4.373-57.093-4.373-57.360\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M228.148-43.617h62.596V-72.07h-62.596Z\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(266.175 6.238)\">\u003Cpath d=\"M-13.241-68.176Q-13.241-68.660-12.839-68.955Q-12.436-69.250-11.886-69.369Q-11.335-69.489-10.843-69.489L-10.843-69.778Q-10.843-70.004-10.958-70.211Q-11.073-70.418-11.270-70.537Q-11.468-70.656-11.698-70.656Q-12.124-70.656-12.409-70.551Q-12.339-70.524-12.292-70.469Q-12.245-70.414-12.220-70.344Q-12.194-70.274-12.194-70.199Q-12.194-70.094-12.245-70.002Q-12.296-69.910-12.388-69.860Q-12.479-69.809-12.585-69.809Q-12.690-69.809-12.782-69.860Q-12.874-69.910-12.925-70.002Q-12.975-70.094-12.975-70.199Q-12.975-70.617-12.587-70.764Q-12.198-70.910-11.698-70.910Q-11.366-70.910-11.013-70.780Q-10.659-70.649-10.431-70.395Q-10.202-70.141-10.202-69.793L-10.202-67.992Q-10.202-67.860-10.130-67.750Q-10.057-67.641-9.929-67.641Q-9.804-67.641-9.735-67.746Q-9.667-67.852-9.667-67.992L-9.667-68.504L-9.386-68.504L-9.386-67.992Q-9.386-67.789-9.503-67.631Q-9.620-67.473-9.802-67.389Q-9.983-67.305-10.186-67.305Q-10.417-67.305-10.569-67.477Q-10.722-67.649-10.753-67.879Q-10.913-67.598-11.222-67.432Q-11.530-67.266-11.882-67.266Q-12.393-67.266-12.817-67.489Q-13.241-67.711-13.241-68.176M-12.554-68.176Q-12.554-67.891-12.327-67.705Q-12.100-67.520-11.807-67.520Q-11.561-67.520-11.337-67.637Q-11.112-67.754-10.977-67.957Q-10.843-68.160-10.843-68.414L-10.843-69.246Q-11.108-69.246-11.393-69.192Q-11.679-69.137-11.950-69.008Q-12.222-68.879-12.388-68.672Q-12.554-68.465-12.554-68.176M-9.050-69.071Q-9.050-69.567-8.800-69.992Q-8.550-70.418-8.130-70.664Q-7.710-70.910-7.210-70.910Q-6.671-70.910-6.280-70.785Q-5.889-70.660-5.889-70.246Q-5.889-70.141-5.940-70.049Q-5.991-69.957-6.083-69.906Q-6.175-69.856-6.284-69.856Q-6.389-69.856-6.481-69.906Q-6.573-69.957-6.624-70.049Q-6.675-70.141-6.675-70.246Q-6.675-70.469-6.507-70.574Q-6.729-70.633-7.202-70.633Q-7.499-70.633-7.714-70.494Q-7.929-70.356-8.059-70.125Q-8.190-69.895-8.249-69.625Q-8.307-69.356-8.307-69.071Q-8.307-68.676-8.175-68.326Q-8.042-67.977-7.770-67.760Q-7.499-67.543-7.100-67.543Q-6.725-67.543-6.450-67.760Q-6.175-67.977-6.073-68.336Q-6.057-68.399-5.995-68.399L-5.889-68.399Q-5.854-68.399-5.829-68.371Q-5.804-68.344-5.804-68.305L-5.804-68.281Q-5.936-67.801-6.321-67.533Q-6.706-67.266-7.210-67.266Q-7.573-67.266-7.907-67.403Q-8.241-67.539-8.501-67.789Q-8.761-68.039-8.905-68.375Q-9.050-68.711-9.050-69.071M-4.690-68.305L-4.690-70.496L-5.393-70.496L-5.393-70.750Q-5.038-70.750-4.796-70.983Q-4.554-71.215-4.442-71.563Q-4.331-71.910-4.331-72.266L-4.050-72.266L-4.050-70.793L-2.874-70.793L-2.874-70.496L-4.050-70.496L-4.050-68.321Q-4.050-68-3.931-67.772Q-3.811-67.543-3.530-67.543Q-3.350-67.543-3.233-67.666Q-3.116-67.789-3.063-67.969Q-3.011-68.149-3.011-68.321L-3.011-68.793L-2.729-68.793L-2.729-68.305Q-2.729-68.051-2.835-67.811Q-2.940-67.571-3.138-67.418Q-3.335-67.266-3.593-67.266Q-3.909-67.266-4.161-67.389Q-4.413-67.512-4.552-67.746Q-4.690-67.981-4.690-68.305M-1.425-65.938Q-1.425-65.961-1.393-66.008Q-1.100-66.270-0.934-66.637Q-0.768-67.004-0.768-67.391L-0.768-67.449Q-0.897-67.344-1.065-67.344Q-1.257-67.344-1.393-67.477Q-1.530-67.610-1.530-67.809Q-1.530-68-1.393-68.133Q-1.257-68.266-1.065-68.266Q-0.764-68.266-0.639-67.996Q-0.514-67.727-0.514-67.391Q-0.514-66.942-0.696-66.528Q-0.878-66.114-1.218-65.817Q-1.241-65.793-1.280-65.793Q-1.327-65.793-1.376-65.838Q-1.425-65.883-1.425-65.938\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(266.175 6.238)\">\u003Cpath d=\"M-30.534-59.539Q-30.534-60.043-30.278-60.475Q-30.022-60.907-29.586-61.158Q-29.151-61.410-28.651-61.410Q-28.264-61.410-27.922-61.266Q-27.581-61.121-27.319-60.860Q-27.057-60.598-26.915-60.262Q-26.772-59.926-26.772-59.539Q-26.772-59.047-27.036-58.637Q-27.299-58.227-27.729-57.996Q-28.159-57.766-28.651-57.766Q-29.143-57.766-29.577-57.998Q-30.010-58.231-30.272-58.639Q-30.534-59.047-30.534-59.539M-28.651-58.043Q-28.194-58.043-27.942-58.266Q-27.690-58.489-27.602-58.840Q-27.514-59.192-27.514-59.637Q-27.514-60.067-27.608-60.405Q-27.702-60.742-27.956-60.949Q-28.209-61.157-28.651-61.157Q-29.299-61.157-29.543-60.740Q-29.788-60.324-29.788-59.637Q-29.788-59.192-29.700-58.840Q-29.612-58.489-29.360-58.266Q-29.108-58.043-28.651-58.043M-25.374-57.844L-25.655-57.844L-25.655-62.563Q-25.655-62.778-25.717-62.873Q-25.780-62.969-25.897-62.990Q-26.014-63.012-26.260-63.012L-26.260-63.309L-25.038-63.395L-25.038-60.907Q-24.561-61.371-23.862-61.371Q-23.381-61.371-22.973-61.127Q-22.565-60.883-22.329-60.469Q-22.092-60.055-22.092-59.571Q-22.092-59.196-22.241-58.867Q-22.389-58.539-22.659-58.287Q-22.928-58.035-23.272-57.901Q-23.616-57.766-23.975-57.766Q-24.295-57.766-24.594-57.914Q-24.893-58.063-25.100-58.324L-25.374-57.844M-25.014-60.516L-25.014-58.676Q-24.862-58.379-24.602-58.199Q-24.342-58.020-24.030-58.020Q-23.604-58.020-23.336-58.239Q-23.069-58.457-22.954-58.803Q-22.838-59.149-22.838-59.571Q-22.838-60.219-23.086-60.668Q-23.334-61.117-23.932-61.117Q-24.268-61.117-24.557-60.959Q-24.846-60.801-25.014-60.516M-21.526-57.852L-21.526-59.074Q-21.526-59.102-21.495-59.133Q-21.463-59.164-21.440-59.164L-21.334-59.164Q-21.264-59.164-21.249-59.102Q-21.186-58.782-21.047-58.541Q-20.909-58.301-20.676-58.160Q-20.444-58.020-20.135-58.020Q-19.897-58.020-19.688-58.080Q-19.479-58.141-19.342-58.289Q-19.206-58.438-19.206-58.684Q-19.206-58.938-19.417-59.104Q-19.627-59.270-19.897-59.324L-20.518-59.438Q-20.924-59.516-21.225-59.772Q-21.526-60.028-21.526-60.403Q-21.526-60.770-21.325-60.992Q-21.124-61.215-20.799-61.313Q-20.475-61.410-20.135-61.410Q-19.670-61.410-19.374-61.203L-19.151-61.387Q-19.127-61.410-19.096-61.410L-19.045-61.410Q-19.014-61.410-18.987-61.383Q-18.959-61.356-18.959-61.324L-18.959-60.340Q-18.959-60.309-18.985-60.280Q-19.010-60.250-19.045-60.250L-19.151-60.250Q-19.186-60.250-19.213-60.278Q-19.241-60.305-19.241-60.340Q-19.241-60.739-19.493-60.959Q-19.745-61.180-20.143-61.180Q-20.499-61.180-20.782-61.057Q-21.065-60.934-21.065-60.629Q-21.065-60.410-20.864-60.278Q-20.663-60.145-20.417-60.102L-19.792-59.989Q-19.362-59.899-19.053-59.602Q-18.745-59.305-18.745-58.891Q-18.745-58.321-19.143-58.043Q-19.542-57.766-20.135-57.766Q-20.686-57.766-21.038-58.102L-21.334-57.789Q-21.358-57.766-21.393-57.766L-21.440-57.766Q-21.463-57.766-21.495-57.797Q-21.526-57.828-21.526-57.852M-18.217-59.598Q-18.217-60.078-17.985-60.494Q-17.752-60.910-17.342-61.160Q-16.932-61.410-16.456-61.410Q-15.725-61.410-15.327-60.969Q-14.928-60.528-14.928-59.797Q-14.928-59.692-15.022-59.668L-17.471-59.668L-17.471-59.598Q-17.471-59.188-17.350-58.832Q-17.229-58.477-16.958-58.260Q-16.686-58.043-16.256-58.043Q-15.893-58.043-15.596-58.272Q-15.299-58.500-15.198-58.852Q-15.190-58.899-15.104-58.914L-15.022-58.914Q-14.928-58.887-14.928-58.805Q-14.928-58.797-14.936-58.766Q-14.999-58.539-15.137-58.356Q-15.276-58.172-15.467-58.039Q-15.659-57.907-15.877-57.836Q-16.096-57.766-16.334-57.766Q-16.706-57.766-17.043-57.903Q-17.381-58.039-17.649-58.291Q-17.917-58.543-18.067-58.883Q-18.217-59.223-18.217-59.598M-17.463-59.907L-15.502-59.907Q-15.502-60.211-15.604-60.502Q-15.706-60.793-15.922-60.975Q-16.139-61.157-16.456-61.157Q-16.756-61.157-16.987-60.969Q-17.217-60.782-17.340-60.490Q-17.463-60.199-17.463-59.907M-12.432-57.844L-14.413-57.844L-14.413-58.141Q-14.143-58.141-13.975-58.186Q-13.807-58.231-13.807-58.403L-13.807-60.539Q-13.807-60.754-13.870-60.850Q-13.932-60.946-14.049-60.967Q-14.167-60.989-14.413-60.989L-14.413-61.285L-13.245-61.371L-13.245-60.586Q-13.167-60.797-13.014-60.983Q-12.862-61.168-12.663-61.270Q-12.463-61.371-12.237-61.371Q-11.991-61.371-11.799-61.227Q-11.608-61.082-11.608-60.852Q-11.608-60.696-11.713-60.586Q-11.819-60.477-11.975-60.477Q-12.131-60.477-12.241-60.586Q-12.350-60.696-12.350-60.852Q-12.350-61.012-12.245-61.117Q-12.569-61.117-12.784-60.889Q-12.999-60.660-13.094-60.321Q-13.190-59.981-13.190-59.676L-13.190-58.403Q-13.190-58.235-12.963-58.188Q-12.737-58.141-12.432-58.141L-12.432-57.844M-9.327-57.875L-10.549-60.731Q-10.631-60.907-10.776-60.951Q-10.920-60.996-11.190-60.996L-11.190-61.293L-9.479-61.293L-9.479-60.996Q-9.901-60.996-9.901-60.813Q-9.901-60.778-9.885-60.731L-8.940-58.539L-8.100-60.516Q-8.061-60.594-8.061-60.684Q-8.061-60.824-8.167-60.910Q-8.272-60.996-8.413-60.996L-8.413-61.293L-7.061-61.293L-7.061-60.996Q-7.584-60.996-7.799-60.516L-8.924-57.875Q-8.987-57.766-9.092-57.766L-9.159-57.766Q-9.272-57.766-9.327-57.875\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(266.175 6.238)\">\u003Cpath d=\"M-6.868-59.598Q-6.868-60.078-6.635-60.494Q-6.403-60.910-5.993-61.160Q-5.583-61.410-5.106-61.410Q-4.376-61.410-3.977-60.969Q-3.579-60.528-3.579-59.797Q-3.579-59.692-3.672-59.668L-6.122-59.668L-6.122-59.598Q-6.122-59.188-6.001-58.832Q-5.879-58.477-5.608-58.260Q-5.336-58.043-4.907-58.043Q-4.543-58.043-4.247-58.272Q-3.950-58.500-3.848-58.852Q-3.840-58.899-3.754-58.914L-3.672-58.914Q-3.579-58.887-3.579-58.805Q-3.579-58.797-3.586-58.766Q-3.649-58.539-3.788-58.356Q-3.926-58.172-4.118-58.039Q-4.309-57.907-4.528-57.836Q-4.747-57.766-4.985-57.766Q-5.356-57.766-5.694-57.903Q-6.032-58.039-6.299-58.291Q-6.567-58.543-6.717-58.883Q-6.868-59.223-6.868-59.598M-6.114-59.907L-4.153-59.907Q-4.153-60.211-4.254-60.502Q-4.356-60.793-4.573-60.975Q-4.790-61.157-5.106-61.157Q-5.407-61.157-5.637-60.969Q-5.868-60.782-5.991-60.490Q-6.114-60.199-6.114-59.907\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(266.175 6.238)\">\u003Cpath d=\"M0.099-57.676L0.048-57.676Q0.013-57.676-0.013-57.705Q-0.038-57.735-0.038-57.774L-0.038-57.797L0.407-59.598Q0.423-59.660 0.497-59.660L0.603-59.660Q0.642-59.660 0.665-59.633Q0.689-59.606 0.689-59.563Q0.689-59.524 0.657-59.356Q0.626-59.188 0.626-59.102Q0.626-58.512 1.056-58.242Q1.485-57.973 2.107-57.973Q2.462-57.973 2.802-58.170Q3.142-58.367 3.355-58.699Q3.567-59.032 3.567-59.387Q3.567-59.684 3.400-59.901Q3.232-60.117 2.954-60.188L1.896-60.446Q1.630-60.508 1.415-60.678Q1.200-60.848 1.081-61.090Q0.962-61.332 0.962-61.614Q0.962-61.989 1.142-62.328Q1.321-62.668 1.618-62.926Q1.915-63.184 2.278-63.330Q2.642-63.477 3.009-63.477Q3.384-63.477 3.712-63.342Q4.040-63.207 4.232-62.922L4.696-63.453Q4.720-63.477 4.751-63.477L4.802-63.477Q4.841-63.477 4.864-63.449Q4.888-63.422 4.888-63.379L4.888-63.356L4.442-61.563Q4.415-61.492 4.353-61.492L4.247-61.492Q4.161-61.492 4.161-61.598Q4.192-61.774 4.192-61.989Q4.192-62.375 4.054-62.649Q3.915-62.922 3.648-63.063Q3.380-63.203 2.993-63.203Q2.661-63.203 2.327-63.032Q1.993-62.860 1.776-62.565Q1.560-62.270 1.560-61.934Q1.560-61.668 1.730-61.463Q1.900-61.258 2.169-61.188L3.224-60.934Q3.653-60.828 3.907-60.489Q4.161-60.149 4.161-59.707Q4.161-59.313 3.987-58.946Q3.814-58.578 3.511-58.289Q3.208-58 2.835-57.838Q2.462-57.676 2.079-57.676Q1.634-57.676 1.243-57.805Q0.853-57.934 0.618-58.227L0.153-57.699Q0.130-57.676 0.099-57.676\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(266.175 6.238)\">\u003Cpath d=\"M5.345-57.249Q5.345-57.322 5.365-57.386L5.784-59.062L5.075-59.062Q5.040-59.062 5.017-59.096Q4.993-59.129 4.993-59.162Q5.014-59.250 5.027-59.280Q5.040-59.311 5.093-59.320L5.843-59.320L6.083-60.260Q6.110-60.363 6.193-60.423Q6.277-60.483 6.373-60.483Q6.464-60.483 6.528-60.426Q6.593-60.369 6.593-60.278Q6.593-60.257 6.591-60.246Q6.590-60.234 6.587-60.219L6.359-59.320L7.056-59.320Q7.091-59.320 7.116-59.288Q7.141-59.255 7.141-59.217Q7.120-59.132 7.106-59.102Q7.091-59.071 7.038-59.062L6.294-59.062L5.875-57.369Q5.849-57.287 5.849-57.178Q5.849-57.058 5.900-56.973Q5.951-56.888 6.060-56.888Q6.250-56.888 6.419-57.001Q6.587-57.114 6.712-57.282Q6.836-57.451 6.906-57.627Q6.918-57.656 6.971-57.682L7.068-57.682Q7.147-57.653 7.147-57.597Q7.147-57.591 7.141-57.562Q7.073-57.395 6.961-57.231Q6.848-57.067 6.706-56.944Q6.564-56.821 6.394-56.748Q6.224-56.674 6.048-56.674Q5.767-56.674 5.556-56.828Q5.345-56.982 5.345-57.249\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(266.175 6.238)\">\u003Cpath d=\"M10.181-56.042L10.181-58.078L8.153-58.078Q8.092-58.087 8.051-58.130Q8.010-58.174 8.010-58.233Q8.010-58.292 8.051-58.336Q8.092-58.379 8.153-58.388L10.181-58.388L10.181-60.424Q10.189-60.483 10.235-60.525Q10.280-60.568 10.336-60.568Q10.397-60.568 10.441-60.527Q10.485-60.486 10.494-60.424L10.494-58.388L12.521-58.388Q12.583-58.379 12.624-58.338Q12.665-58.297 12.665-58.233Q12.665-58.169 12.624-58.128Q12.583-58.087 12.521-58.078L10.494-58.078L10.494-56.042Q10.485-55.980 10.441-55.939Q10.397-55.898 10.336-55.898Q10.280-55.898 10.235-55.941Q10.189-55.983 10.181-56.042M16.186-56.733L13.895-56.733L13.895-56.991Q14.771-56.991 14.771-57.164L14.771-60.243Q14.578-60.155 14.347-60.118Q14.115-60.082 13.860-60.082L13.860-60.339Q14.238-60.339 14.559-60.424Q14.880-60.509 15.108-60.723L15.228-60.723Q15.261-60.723 15.285-60.700Q15.310-60.676 15.310-60.638L15.310-57.164Q15.310-56.991 16.186-56.991\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.180\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M.726-57.844h31.143\"\u002F>\u003Cpath stroke=\"none\" d=\"m34.47-57.844-4.16-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M97.465-57.844h31.144\"\u002F>\u003Cpath stroke=\"none\" d=\"m131.209-57.844-4.16-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M194.205-57.844h31.143\"\u002F>\u003Cpath stroke=\"none\" d=\"m227.948-57.844-4.16-2.08 1.56 2.08-1.56 2.08\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M259.446-43.417c0 33.943-290.218 33.943-290.218 2.6\"\u002F>\u003Cpath stroke=\"none\" d=\"m-30.772-43.417-2.08 4.16 2.08-1.56 2.08 1.56\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\">\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M-30.458-59.355Q-30.458-59.693-30.317-59.984Q-30.177-60.274-29.933-60.488Q-29.689-60.701-29.384-60.816Q-29.080-60.930-28.755-60.930Q-28.485-60.930-28.222-60.831Q-27.959-60.732-27.768-60.554L-27.768-61.952Q-27.768-62.222-27.875-62.284Q-27.983-62.345-28.294-62.345L-28.294-62.626L-27.217-62.701L-27.217-58.517Q-27.217-58.329-27.163-58.246Q-27.108-58.162-27.007-58.143Q-26.906-58.124-26.691-58.124L-26.691-57.844L-27.798-57.776L-27.798-58.193Q-28.215-57.776-28.841-57.776Q-29.272-57.776-29.644-57.988Q-30.017-58.199-30.237-58.560Q-30.458-58.921-30.458-59.355M-28.783-57.998Q-28.574-57.998-28.388-58.070Q-28.202-58.141-28.048-58.278Q-27.894-58.415-27.798-58.593L-27.798-60.202Q-27.884-60.349-28.029-60.469Q-28.174-60.589-28.344-60.648Q-28.513-60.708-28.694-60.708Q-29.254-60.708-29.523-60.319Q-29.791-59.929-29.791-59.348Q-29.791-58.777-29.557-58.387Q-29.323-57.998-28.783-57.998M-24.425-57.844L-25.977-57.844L-25.977-58.124Q-25.751-58.124-25.602-58.158Q-25.454-58.193-25.454-58.333L-25.454-60.182Q-25.454-60.370-25.501-60.454Q-25.549-60.537-25.647-60.556Q-25.744-60.575-25.956-60.575L-25.956-60.855L-24.900-60.930L-24.900-58.333Q-24.900-58.193-24.768-58.158Q-24.637-58.124-24.425-58.124L-24.425-57.844M-25.696-62.151Q-25.696-62.322-25.573-62.441Q-25.450-62.561-25.279-62.561Q-25.112-62.561-24.989-62.441Q-24.866-62.322-24.866-62.151Q-24.866-61.976-24.989-61.853Q-25.112-61.730-25.279-61.730Q-25.450-61.730-25.573-61.853Q-25.696-61.976-25.696-62.151M-23.779-57.851L-23.779-58.914Q-23.779-58.938-23.751-58.965Q-23.724-58.992-23.700-58.992L-23.591-58.992Q-23.526-58.992-23.512-58.934Q-23.417-58.500-23.170-58.249Q-22.924-57.998-22.511-57.998Q-22.169-57.998-21.916-58.131Q-21.663-58.264-21.663-58.572Q-21.663-58.729-21.757-58.844Q-21.851-58.958-21.990-59.027Q-22.128-59.095-22.295-59.133L-22.876-59.232Q-23.232-59.300-23.505-59.521Q-23.779-59.741-23.779-60.083Q-23.779-60.332-23.668-60.507Q-23.557-60.681-23.370-60.780Q-23.184-60.879-22.969-60.922Q-22.753-60.965-22.511-60.965Q-22.097-60.965-21.817-60.783L-21.602-60.958Q-21.591-60.961-21.584-60.963Q-21.578-60.965-21.567-60.965L-21.516-60.965Q-21.489-60.965-21.465-60.941Q-21.441-60.917-21.441-60.889L-21.441-60.042Q-21.441-60.021-21.465-59.994Q-21.489-59.967-21.516-59.967L-21.629-59.967Q-21.656-59.967-21.682-59.992Q-21.708-60.018-21.708-60.042Q-21.708-60.278-21.814-60.442Q-21.919-60.606-22.102-60.688Q-22.285-60.770-22.518-60.770Q-22.846-60.770-23.102-60.667Q-23.358-60.565-23.358-60.288Q-23.358-60.093-23.176-59.984Q-22.993-59.874-22.764-59.833L-22.189-59.727Q-21.943-59.679-21.730-59.551Q-21.516-59.423-21.379-59.220Q-21.243-59.016-21.243-58.767Q-21.243-58.254-21.608-58.015Q-21.974-57.776-22.511-57.776Q-23.006-57.776-23.338-58.070L-23.605-57.796Q-23.625-57.776-23.652-57.776L-23.700-57.776Q-23.724-57.776-23.751-57.803Q-23.779-57.830-23.779-57.851M-20.614-59.355Q-20.614-59.683-20.479-59.984Q-20.344-60.284-20.108-60.505Q-19.872-60.725-19.568-60.845Q-19.264-60.965-18.939-60.965Q-18.433-60.965-18.084-60.862Q-17.736-60.760-17.736-60.384Q-17.736-60.237-17.833-60.136Q-17.931-60.035-18.078-60.035Q-18.231-60.035-18.331-60.134Q-18.430-60.233-18.430-60.384Q-18.430-60.572-18.290-60.664Q-18.491-60.715-18.932-60.715Q-19.288-60.715-19.517-60.519Q-19.746-60.322-19.846-60.013Q-19.947-59.703-19.947-59.355Q-19.947-59.006-19.821-58.700Q-19.694-58.394-19.440-58.210Q-19.185-58.025-18.830-58.025Q-18.607-58.025-18.423-58.109Q-18.238-58.193-18.103-58.348Q-17.968-58.504-17.910-58.712Q-17.897-58.767-17.842-58.767L-17.729-58.767Q-17.698-58.767-17.676-58.743Q-17.654-58.719-17.654-58.685L-17.654-58.664Q-17.739-58.377-17.927-58.179Q-18.115-57.981-18.380-57.878Q-18.645-57.776-18.939-57.776Q-19.370-57.776-19.758-57.982Q-20.146-58.189-20.380-58.552Q-20.614-58.914-20.614-59.355M-17.008-58.572Q-17.008-58.904-16.784-59.131Q-16.560-59.358-16.217-59.486Q-15.873-59.615-15.501-59.667Q-15.128-59.720-14.824-59.720L-14.824-59.973Q-14.824-60.178-14.931-60.358Q-15.039-60.537-15.220-60.640Q-15.401-60.742-15.610-60.742Q-16.017-60.742-16.252-60.650Q-16.164-60.613-16.117-60.529Q-16.071-60.445-16.071-60.343Q-16.071-60.247-16.117-60.168Q-16.164-60.090-16.244-60.045Q-16.324-60.001-16.413-60.001Q-16.564-60.001-16.664-60.098Q-16.765-60.196-16.765-60.343Q-16.765-60.965-15.610-60.965Q-15.398-60.965-15.148-60.901Q-14.899-60.838-14.697-60.719Q-14.496-60.599-14.369-60.414Q-14.243-60.230-14.243-59.987L-14.243-58.411Q-14.243-58.295-14.181-58.199Q-14.120-58.104-14.007-58.104Q-13.897-58.104-13.833-58.198Q-13.768-58.292-13.768-58.411L-13.768-58.859L-13.501-58.859L-13.501-58.411Q-13.501-58.141-13.728-57.976Q-13.956-57.810-14.236-57.810Q-14.444-57.810-14.581-57.964Q-14.718-58.117-14.742-58.333Q-14.889-58.066-15.171-57.921Q-15.453-57.776-15.777-57.776Q-16.054-57.776-16.338-57.851Q-16.622-57.926-16.815-58.105Q-17.008-58.285-17.008-58.572M-16.393-58.572Q-16.393-58.398-16.292-58.268Q-16.191-58.138-16.035-58.068Q-15.880-57.998-15.716-57.998Q-15.497-57.998-15.289-58.095Q-15.080-58.193-14.952-58.374Q-14.824-58.555-14.824-58.781L-14.824-59.509Q-15.148-59.509-15.514-59.418Q-15.880-59.327-16.136-59.115Q-16.393-58.904-16.393-58.572M-11.334-57.844L-13.070-57.844L-13.070-58.124Q-12.841-58.124-12.693-58.158Q-12.544-58.193-12.544-58.333L-12.544-60.182Q-12.544-60.452-12.652-60.513Q-12.759-60.575-13.070-60.575L-13.070-60.855L-12.042-60.930L-12.042-60.223Q-11.912-60.531-11.669-60.730Q-11.426-60.930-11.108-60.930Q-10.890-60.930-10.719-60.806Q-10.548-60.681-10.548-60.469Q-10.548-60.332-10.647-60.233Q-10.746-60.134-10.879-60.134Q-11.016-60.134-11.115-60.233Q-11.214-60.332-11.214-60.469Q-11.214-60.609-11.115-60.708Q-11.406-60.708-11.606-60.512Q-11.806-60.315-11.898-60.021Q-11.990-59.727-11.990-59.447L-11.990-58.333Q-11.990-58.124-11.334-58.124L-11.334-57.844M-9.963-59.355Q-9.963-59.693-9.823-59.984Q-9.683-60.274-9.439-60.488Q-9.194-60.701-8.890-60.816Q-8.586-60.930-8.261-60.930Q-7.991-60.930-7.728-60.831Q-7.465-60.732-7.273-60.554L-7.273-61.952Q-7.273-62.222-7.381-62.284Q-7.489-62.345-7.800-62.345L-7.800-62.626L-6.723-62.701L-6.723-58.517Q-6.723-58.329-6.668-58.246Q-6.614-58.162-6.513-58.143Q-6.412-58.124-6.197-58.124L-6.197-57.844L-7.304-57.776L-7.304-58.193Q-7.721-57.776-8.347-57.776Q-8.777-57.776-9.150-57.988Q-9.522-58.199-9.743-58.560Q-9.963-58.921-9.963-59.355M-8.289-57.998Q-8.080-57.998-7.894-58.070Q-7.708-58.141-7.554-58.278Q-7.400-58.415-7.304-58.593L-7.304-60.202Q-7.390-60.349-7.535-60.469Q-7.680-60.589-7.849-60.648Q-8.019-60.708-8.200-60.708Q-8.760-60.708-9.029-60.319Q-9.297-59.929-9.297-59.348Q-9.297-58.777-9.063-58.387Q-8.829-57.998-8.289-57.998\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M-1.187-56.487L-2.817-56.487L-2.817-56.767Q-2.588-56.767-2.439-56.802Q-2.291-56.836-2.291-56.976L-2.291-60.322Q-2.291-60.493-2.427-60.534Q-2.564-60.575-2.817-60.575L-2.817-60.855L-1.737-60.930L-1.737-60.524Q-1.515-60.725-1.228-60.828Q-0.940-60.930-0.633-60.930Q-0.206-60.930 0.158-60.717Q0.522-60.503 0.736-60.139Q0.950-59.775 0.950-59.355Q0.950-58.910 0.710-58.546Q0.471-58.182 0.078-57.979Q-0.315-57.776-0.759-57.776Q-1.026-57.776-1.274-57.876Q-1.521-57.977-1.709-58.158L-1.709-56.976Q-1.709-56.839-1.561-56.803Q-1.412-56.767-1.187-56.767L-1.187-56.487M-1.709-60.175L-1.709-58.565Q-1.576-58.312-1.333-58.155Q-1.091-57.998-0.814-57.998Q-0.486-57.998-0.233-58.199Q0.020-58.401 0.153-58.719Q0.287-59.037 0.287-59.355Q0.287-59.584 0.222-59.813Q0.157-60.042 0.029-60.240Q-0.100-60.438-0.294-60.558Q-0.489-60.677-0.722-60.677Q-1.016-60.677-1.284-60.548Q-1.552-60.418-1.709-60.175M3.253-57.844L1.650-57.844L1.650-58.124Q1.876-58.124 2.025-58.158Q2.173-58.193 2.173-58.333L2.173-61.952Q2.173-62.222 2.066-62.284Q1.958-62.345 1.650-62.345L1.650-62.626L2.727-62.701L2.727-58.333Q2.727-58.196 2.877-58.160Q3.028-58.124 3.253-58.124L3.253-57.844M3.906-58.572Q3.906-58.904 4.130-59.131Q4.354-59.358 4.698-59.486Q5.041-59.615 5.414-59.667Q5.786-59.720 6.090-59.720L6.090-59.973Q6.090-60.178 5.983-60.358Q5.875-60.537 5.694-60.640Q5.513-60.742 5.304-60.742Q4.897-60.742 4.662-60.650Q4.751-60.613 4.797-60.529Q4.843-60.445 4.843-60.343Q4.843-60.247 4.797-60.168Q4.751-60.090 4.670-60.045Q4.590-60.001 4.501-60.001Q4.351-60.001 4.250-60.098Q4.149-60.196 4.149-60.343Q4.149-60.965 5.304-60.965Q5.516-60.965 5.766-60.901Q6.015-60.838 6.217-60.719Q6.418-60.599 6.545-60.414Q6.671-60.230 6.671-59.987L6.671-58.411Q6.671-58.295 6.733-58.199Q6.794-58.104 6.907-58.104Q7.017-58.104 7.082-58.198Q7.147-58.292 7.147-58.411L7.147-58.859L7.413-58.859L7.413-58.411Q7.413-58.141 7.186-57.976Q6.959-57.810 6.678-57.810Q6.470-57.810 6.333-57.964Q6.196-58.117 6.172-58.333Q6.025-58.066 5.743-57.921Q5.461-57.776 5.137-57.776Q4.860-57.776 4.576-57.851Q4.293-57.926 4.099-58.105Q3.906-58.285 3.906-58.572M4.522-58.572Q4.522-58.398 4.622-58.268Q4.723-58.138 4.879-58.068Q5.034-57.998 5.198-57.998Q5.417-57.998 5.626-58.095Q5.834-58.193 5.962-58.374Q6.090-58.555 6.090-58.781L6.090-59.509Q5.766-59.509 5.400-59.418Q5.034-59.327 4.778-59.115Q4.522-58.904 4.522-58.572M9.512-57.844L7.878-57.844L7.878-58.124Q8.107-58.124 8.256-58.158Q8.404-58.193 8.404-58.333L8.404-60.182Q8.404-60.452 8.297-60.513Q8.189-60.575 7.878-60.575L7.878-60.855L8.938-60.930L8.938-60.281Q9.108-60.589 9.413-60.760Q9.717-60.930 10.062-60.930Q10.568-60.930 10.852-60.707Q11.135-60.483 11.135-59.987L11.135-58.333Q11.135-58.196 11.284-58.160Q11.433-58.124 11.658-58.124L11.658-57.844L10.028-57.844L10.028-58.124Q10.257-58.124 10.406-58.158Q10.554-58.193 10.554-58.333L10.554-59.973Q10.554-60.308 10.435-60.508Q10.315-60.708 10.001-60.708Q9.730-60.708 9.496-60.572Q9.262-60.435 9.124-60.201Q8.985-59.967 8.985-59.693L8.985-58.333Q8.985-58.196 9.136-58.160Q9.286-58.124 9.512-58.124L9.512-57.844M12.745-56.614Q12.745-56.648 12.772-56.675Q13.043-56.904 13.191-57.227Q13.340-57.550 13.340-57.906L13.340-57.943Q13.230-57.844 13.066-57.844Q12.885-57.844 12.766-57.964Q12.646-58.083 12.646-58.264Q12.646-58.439 12.766-58.558Q12.885-58.678 13.066-58.678Q13.323-58.678 13.442-58.439Q13.562-58.199 13.562-57.906Q13.562-57.506 13.393-57.135Q13.224-56.764 12.926-56.508Q12.896-56.487 12.868-56.487Q12.827-56.487 12.786-56.528Q12.745-56.569 12.745-56.614\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M18.960-57.844L17.224-57.844L17.224-58.124Q17.453-58.124 17.602-58.158Q17.750-58.193 17.750-58.333L17.750-60.182Q17.750-60.452 17.643-60.513Q17.535-60.575 17.224-60.575L17.224-60.855L18.253-60.930L18.253-60.223Q18.383-60.531 18.625-60.730Q18.868-60.930 19.186-60.930Q19.405-60.930 19.576-60.806Q19.747-60.681 19.747-60.469Q19.747-60.332 19.647-60.233Q19.548-60.134 19.415-60.134Q19.278-60.134 19.179-60.233Q19.080-60.332 19.080-60.469Q19.080-60.609 19.179-60.708Q18.889-60.708 18.689-60.512Q18.489-60.315 18.396-60.021Q18.304-59.727 18.304-59.447L18.304-58.333Q18.304-58.124 18.960-58.124L18.960-57.844M20.290-59.379Q20.290-59.700 20.415-59.989Q20.540-60.278 20.765-60.501Q20.991-60.725 21.286-60.845Q21.582-60.965 21.900-60.965Q22.228-60.965 22.490-60.865Q22.751-60.766 22.927-60.584Q23.103-60.401 23.197-60.143Q23.291-59.885 23.291-59.553Q23.291-59.461 23.209-59.440L20.953-59.440L20.953-59.379Q20.953-58.791 21.237-58.408Q21.521-58.025 22.088-58.025Q22.409-58.025 22.677-58.218Q22.946-58.411 23.035-58.726Q23.042-58.767 23.117-58.781L23.209-58.781Q23.291-58.757 23.291-58.685Q23.291-58.678 23.284-58.651Q23.171-58.254 22.801-58.015Q22.430-57.776 22.006-57.776Q21.568-57.776 21.168-57.984Q20.769-58.193 20.529-58.560Q20.290-58.927 20.290-59.379M20.960-59.649L22.775-59.649Q22.775-59.926 22.677-60.178Q22.580-60.431 22.382-60.587Q22.184-60.742 21.900-60.742Q21.623-60.742 21.409-60.584Q21.196-60.425 21.078-60.170Q20.960-59.915 20.960-59.649M23.879-57.851L23.879-58.914Q23.879-58.938 23.906-58.965Q23.934-58.992 23.958-58.992L24.067-58.992Q24.132-58.992 24.146-58.934Q24.241-58.500 24.487-58.249Q24.733-57.998 25.147-57.998Q25.489-57.998 25.742-58.131Q25.995-58.264 25.995-58.572Q25.995-58.729 25.901-58.844Q25.807-58.958 25.668-59.027Q25.530-59.095 25.362-59.133L24.781-59.232Q24.426-59.300 24.152-59.521Q23.879-59.741 23.879-60.083Q23.879-60.332 23.990-60.507Q24.101-60.681 24.287-60.780Q24.474-60.879 24.689-60.922Q24.904-60.965 25.147-60.965Q25.561-60.965 25.841-60.783L26.056-60.958Q26.066-60.961 26.073-60.963Q26.080-60.965 26.090-60.965L26.142-60.965Q26.169-60.965 26.193-60.941Q26.217-60.917 26.217-60.889L26.217-60.042Q26.217-60.021 26.193-59.994Q26.169-59.967 26.142-59.967L26.029-59.967Q26.001-59.967 25.976-59.992Q25.950-60.018 25.950-60.042Q25.950-60.278 25.844-60.442Q25.738-60.606 25.555-60.688Q25.373-60.770 25.140-60.770Q24.812-60.770 24.556-60.667Q24.299-60.565 24.299-60.288Q24.299-60.093 24.482-59.984Q24.665-59.874 24.894-59.833L25.468-59.727Q25.714-59.679 25.928-59.551Q26.142-59.423 26.278-59.220Q26.415-59.016 26.415-58.767Q26.415-58.254 26.049-58.015Q25.684-57.776 25.147-57.776Q24.651-57.776 24.320-58.070L24.053-57.796Q24.033-57.776 24.005-57.776L23.958-57.776Q23.934-57.776 23.906-57.803Q23.879-57.830 23.879-57.851M27.570-58.685L27.570-60.582L26.931-60.582L26.931-60.804Q27.249-60.804 27.466-61.014Q27.683-61.224 27.784-61.534Q27.885-61.843 27.885-62.151L28.151-62.151L28.151-60.862L29.228-60.862L29.228-60.582L28.151-60.582L28.151-58.698Q28.151-58.422 28.256-58.223Q28.360-58.025 28.620-58.025Q28.777-58.025 28.883-58.129Q28.989-58.234 29.038-58.387Q29.088-58.541 29.088-58.698L29.088-59.112L29.354-59.112L29.354-58.685Q29.354-58.459 29.255-58.249Q29.156-58.039 28.972-57.907Q28.787-57.776 28.558-57.776Q28.121-57.776 27.845-58.013Q27.570-58.251 27.570-58.685M30.223-58.572Q30.223-58.904 30.447-59.131Q30.670-59.358 31.014-59.486Q31.357-59.615 31.730-59.667Q32.103-59.720 32.407-59.720L32.407-59.973Q32.407-60.178 32.299-60.358Q32.191-60.537 32.010-60.640Q31.829-60.742 31.621-60.742Q31.214-60.742 30.978-60.650Q31.067-60.613 31.113-60.529Q31.159-60.445 31.159-60.343Q31.159-60.247 31.113-60.168Q31.067-60.090 30.987-60.045Q30.906-60.001 30.817-60.001Q30.667-60.001 30.566-60.098Q30.465-60.196 30.465-60.343Q30.465-60.965 31.621-60.965Q31.833-60.965 32.082-60.901Q32.332-60.838 32.533-60.719Q32.735-60.599 32.861-60.414Q32.988-60.230 32.988-59.987L32.988-58.411Q32.988-58.295 33.049-58.199Q33.111-58.104 33.224-58.104Q33.333-58.104 33.398-58.198Q33.463-58.292 33.463-58.411L33.463-58.859L33.729-58.859L33.729-58.411Q33.729-58.141 33.502-57.976Q33.275-57.810 32.995-57.810Q32.786-57.810 32.649-57.964Q32.513-58.117 32.489-58.333Q32.342-58.066 32.060-57.921Q31.778-57.776 31.453-57.776Q31.176-57.776 30.893-57.851Q30.609-57.926 30.416-58.105Q30.223-58.285 30.223-58.572M30.838-58.572Q30.838-58.398 30.939-58.268Q31.040-58.138 31.195-58.068Q31.351-57.998 31.515-57.998Q31.733-57.998 31.942-58.095Q32.150-58.193 32.279-58.374Q32.407-58.555 32.407-58.781L32.407-59.509Q32.082-59.509 31.716-59.418Q31.351-59.327 31.094-59.115Q30.838-58.904 30.838-58.572M35.896-57.844L34.160-57.844L34.160-58.124Q34.389-58.124 34.538-58.158Q34.687-58.193 34.687-58.333L34.687-60.182Q34.687-60.452 34.579-60.513Q34.471-60.575 34.160-60.575L34.160-60.855L35.189-60.930L35.189-60.223Q35.319-60.531 35.562-60.730Q35.804-60.930 36.122-60.930Q36.341-60.930 36.512-60.806Q36.683-60.681 36.683-60.469Q36.683-60.332 36.584-60.233Q36.484-60.134 36.351-60.134Q36.214-60.134 36.115-60.233Q36.016-60.332 36.016-60.469Q36.016-60.609 36.115-60.708Q35.825-60.708 35.625-60.512Q35.425-60.315 35.333-60.021Q35.240-59.727 35.240-59.447L35.240-58.333Q35.240-58.124 35.896-58.124L35.896-57.844M37.793-58.685L37.793-60.582L37.154-60.582L37.154-60.804Q37.472-60.804 37.689-61.014Q37.906-61.224 38.007-61.534Q38.108-61.843 38.108-62.151L38.375-62.151L38.375-60.862L39.451-60.862L39.451-60.582L38.375-60.582L38.375-58.698Q38.375-58.422 38.479-58.223Q38.583-58.025 38.843-58.025Q39-58.025 39.106-58.129Q39.212-58.234 39.261-58.387Q39.311-58.541 39.311-58.698L39.311-59.112L39.578-59.112L39.578-58.685Q39.578-58.459 39.479-58.249Q39.379-58.039 39.195-57.907Q39.010-57.776 38.781-57.776Q38.344-57.776 38.069-58.013Q37.793-58.251 37.793-58.685\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M44.503-57.871L43.522-60.370Q43.461-60.513 43.343-60.548Q43.225-60.582 43.009-60.582L43.009-60.862L44.489-60.862L44.489-60.582Q44.110-60.582 44.110-60.421Q44.110-60.411 44.124-60.370L44.838-58.538L45.511-60.243Q45.481-60.315 45.481-60.343Q45.481-60.370 45.453-60.370Q45.392-60.517 45.274-60.549Q45.156-60.582 44.944-60.582L44.944-60.862L46.342-60.862L46.342-60.582Q45.966-60.582 45.966-60.421Q45.966-60.390 45.973-60.370L46.728-58.432L47.415-60.182Q47.436-60.233 47.436-60.288Q47.436-60.428 47.323-60.505Q47.210-60.582 47.070-60.582L47.070-60.862L48.290-60.862L48.290-60.582Q48.085-60.582 47.930-60.476Q47.774-60.370 47.702-60.182L46.797-57.871Q46.762-57.776 46.650-57.776L46.581-57.776Q46.472-57.776 46.434-57.871L45.652-59.874L44.865-57.871Q44.831-57.776 44.718-57.776L44.650-57.776Q44.541-57.776 44.503-57.871M50.437-57.844L48.885-57.844L48.885-58.124Q49.111-58.124 49.259-58.158Q49.408-58.193 49.408-58.333L49.408-60.182Q49.408-60.370 49.360-60.454Q49.312-60.537 49.215-60.556Q49.117-60.575 48.905-60.575L48.905-60.855L49.962-60.930L49.962-58.333Q49.962-58.193 50.093-58.158Q50.225-58.124 50.437-58.124L50.437-57.844M49.165-62.151Q49.165-62.322 49.288-62.441Q49.411-62.561 49.582-62.561Q49.750-62.561 49.873-62.441Q49.996-62.322 49.996-62.151Q49.996-61.976 49.873-61.853Q49.750-61.730 49.582-61.730Q49.411-61.730 49.288-61.853Q49.165-61.976 49.165-62.151M51.609-58.685L51.609-60.582L50.970-60.582L50.970-60.804Q51.288-60.804 51.505-61.014Q51.722-61.224 51.823-61.534Q51.924-61.843 51.924-62.151L52.190-62.151L52.190-60.862L53.267-60.862L53.267-60.582L52.190-60.582L52.190-58.698Q52.190-58.422 52.294-58.223Q52.399-58.025 52.658-58.025Q52.816-58.025 52.922-58.129Q53.028-58.234 53.077-58.387Q53.127-58.541 53.127-58.698L53.127-59.112L53.393-59.112L53.393-58.685Q53.393-58.459 53.294-58.249Q53.195-58.039 53.010-57.907Q52.826-57.776 52.597-57.776Q52.159-57.776 51.884-58.013Q51.609-58.251 51.609-58.685M55.885-57.844L54.251-57.844L54.251-58.124Q54.480-58.124 54.629-58.158Q54.778-58.193 54.778-58.333L54.778-61.952Q54.778-62.222 54.670-62.284Q54.562-62.345 54.251-62.345L54.251-62.626L55.331-62.701L55.331-60.315Q55.437-60.500 55.615-60.642Q55.793-60.783 56.001-60.857Q56.210-60.930 56.435-60.930Q56.941-60.930 57.225-60.707Q57.509-60.483 57.509-59.987L57.509-58.333Q57.509-58.196 57.657-58.160Q57.806-58.124 58.031-58.124L58.031-57.844L56.401-57.844L56.401-58.124Q56.630-58.124 56.779-58.158Q56.927-58.193 56.927-58.333L56.927-59.973Q56.927-60.308 56.808-60.508Q56.688-60.708 56.374-60.708Q56.104-60.708 55.870-60.572Q55.635-60.435 55.497-60.201Q55.359-59.967 55.359-59.693L55.359-58.333Q55.359-58.196 55.509-58.160Q55.659-58.124 55.885-58.124\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M61.669-57.704L61.617-57.704Q61.587-57.704 61.564-57.729Q61.542-57.755 61.542-57.789Q61.542-57.796 61.549-57.810L61.932-59.379Q61.946-59.433 62.010-59.433L62.123-59.433Q62.157-59.433 62.178-59.409Q62.198-59.386 62.198-59.348Q62.198-59.310 62.171-59.174Q62.144-59.037 62.144-58.958Q62.144-58.442 62.542-58.213Q62.940-57.984 63.501-57.984Q63.808-57.984 64.119-58.150Q64.430-58.316 64.630-58.596Q64.830-58.876 64.830-59.194Q64.830-59.450 64.670-59.644Q64.509-59.837 64.249-59.895L63.279-60.127Q63.029-60.185 62.834-60.329Q62.639-60.472 62.528-60.686Q62.417-60.900 62.417-61.156Q62.417-61.488 62.580-61.783Q62.742-62.079 63.015-62.301Q63.289-62.523 63.620-62.645Q63.952-62.766 64.263-62.766Q64.618-62.766 64.911-62.650Q65.203-62.533 65.391-62.281L65.811-62.745Q65.832-62.766 65.859-62.766L65.910-62.766Q65.945-62.766 65.965-62.740Q65.986-62.715 65.986-62.680Q65.986-62.674 65.979-62.660L65.592-61.098Q65.569-61.036 65.517-61.036L65.405-61.036Q65.329-61.036 65.329-61.129Q65.343-61.231 65.357-61.443Q65.357-61.966 65.066-62.240Q64.776-62.513 64.242-62.513Q64.020-62.513 63.791-62.433Q63.562-62.352 63.366-62.204Q63.169-62.055 63.051-61.852Q62.933-61.648 62.933-61.423Q62.933-61.183 63.099-61.006Q63.265-60.828 63.508-60.770L64.482-60.537Q64.731-60.483 64.931-60.325Q65.131-60.168 65.240-59.943Q65.350-59.717 65.350-59.454Q65.350-58.996 65.075-58.593Q64.800-58.189 64.362-57.947Q63.925-57.704 63.473-57.704Q62.533-57.704 62.130-58.186L61.717-57.724Q61.696-57.704 61.669-57.704\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M66.684-57.274Q66.684-57.337 66.699-57.388L67.041-58.758L66.411-58.758Q66.381-58.758 66.358-58.785Q66.335-58.812 66.335-58.844Q66.335-58.980 66.430-59L67.099-59L67.295-59.779Q67.316-59.862 67.395-59.918Q67.473-59.974 67.556-59.974Q67.634-59.974 67.690-59.923Q67.746-59.871 67.746-59.793Q67.746-59.759 67.739-59.744L67.556-59L68.186-59Q68.215-59 68.237-58.974Q68.259-58.948 68.259-58.919Q68.259-58.782 68.166-58.758L67.495-58.758L67.150-57.374Q67.131-57.308 67.131-57.230Q67.131-57.127 67.179-57.050Q67.226-56.973 67.324-56.973Q67.483-56.973 67.633-57.064Q67.783-57.154 67.893-57.290Q68.003-57.425 68.071-57.589Q68.081-57.613 68.125-57.635L68.230-57.635Q68.295-57.613 68.295-57.564Q68.295-57.559 68.291-57.535Q68.161-57.227 67.894-57.008Q67.627-56.788 67.314-56.788Q67.163-56.788 67.019-56.840Q66.875-56.893 66.779-57.003Q66.684-57.113 66.684-57.274\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(90.833 48.478)\">\u003Cpath d=\"M71.167-56.134L71.167-57.955L69.358-57.955Q69.246-57.969 69.224-58.079L69.224-58.109Q69.246-58.219 69.358-58.233L71.167-58.233L71.167-60.054Q71.179-60.108 71.218-60.144Q71.258-60.179 71.309-60.179Q71.421-60.179 71.448-60.054L71.448-58.233L73.257-58.233Q73.362-58.219 73.389-58.109L73.389-58.079Q73.362-57.969 73.257-57.955L71.448-57.955L71.448-56.134Q71.421-56.009 71.309-56.009Q71.258-56.009 71.218-56.044Q71.179-56.080 71.167-56.134M76.653-56.844L74.612-56.844L74.612-57.083Q75.393-57.083 75.393-57.203L75.393-59.749Q75.215-59.674 75.011-59.644Q74.807-59.615 74.578-59.615L74.578-59.854Q74.915-59.854 75.198-59.923Q75.481-59.991 75.691-60.174L75.796-60.174Q75.823-60.174 75.847-60.150Q75.872-60.125 75.872-60.098L75.872-57.203Q75.872-57.083 76.653-57.083\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The decision-time loop. Encounter a state, plan a lookahead from it, emit one action, act, and discard the plan; the next state restarts the computation. Planning output is an action, not a stored policy.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:277.290px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 207.968 121.918\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg fill=\"var(--tk-bg)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath d=\"M39.16-64.757a7.113 7.113 0 1 0-14.226 0 7.113 7.113 0 0 0 14.226 0Zm-7.113 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\">\u003Cg transform=\"translate(-36.007 -83.467)\">\u003Cpath d=\"M34.111 20.601L32.375 20.601L32.375 20.321Q32.604 20.321 32.753 20.287Q32.901 20.252 32.901 20.112L32.901 18.263Q32.901 17.993 32.794 17.932Q32.686 17.870 32.375 17.870L32.375 17.590L33.404 17.515L33.404 18.222Q33.534 17.914 33.776 17.715Q34.019 17.515 34.337 17.515Q34.556 17.515 34.727 17.639Q34.898 17.764 34.898 17.976Q34.898 18.113 34.798 18.212Q34.699 18.311 34.566 18.311Q34.429 18.311 34.330 18.212Q34.231 18.113 34.231 17.976Q34.231 17.836 34.330 17.737Q34.040 17.737 33.840 17.933Q33.640 18.130 33.547 18.424Q33.455 18.718 33.455 18.998L33.455 20.112Q33.455 20.321 34.111 20.321L34.111 20.601M35.441 19.118Q35.441 18.776 35.576 18.477Q35.711 18.178 35.950 17.954Q36.190 17.730 36.507 17.605Q36.825 17.480 37.157 17.480Q37.601 17.480 38.001 17.696Q38.401 17.911 38.635 18.289Q38.869 18.666 38.869 19.118Q38.869 19.459 38.727 19.743Q38.586 20.027 38.341 20.234Q38.097 20.440 37.787 20.555Q37.478 20.669 37.157 20.669Q36.726 20.669 36.325 20.468Q35.923 20.266 35.682 19.914Q35.441 19.562 35.441 19.118M37.157 20.420Q37.758 20.420 37.982 20.042Q38.206 19.664 38.206 19.032Q38.206 18.420 37.972 18.061Q37.738 17.703 37.157 17.703Q36.104 17.703 36.104 19.032Q36.104 19.664 36.330 20.042Q36.555 20.420 37.157 20.420\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.007 -83.467)\">\u003Cpath d=\"M39.647 19.118Q39.647 18.776 39.782 18.477Q39.917 18.178 40.157 17.954Q40.396 17.730 40.714 17.605Q41.032 17.480 41.363 17.480Q41.808 17.480 42.207 17.696Q42.607 17.911 42.842 18.289Q43.076 18.666 43.076 19.118Q43.076 19.459 42.934 19.743Q42.792 20.027 42.548 20.234Q42.303 20.440 41.994 20.555Q41.685 20.669 41.363 20.669Q40.933 20.669 40.531 20.468Q40.129 20.266 39.888 19.914Q39.647 19.562 39.647 19.118M41.363 20.420Q41.965 20.420 42.189 20.042Q42.413 19.664 42.413 19.032Q42.413 18.420 42.178 18.061Q41.944 17.703 41.363 17.703Q40.311 17.703 40.311 19.032Q40.311 19.664 40.536 20.042Q40.762 20.420 41.363 20.420M44.197 19.760L44.197 17.863L43.558 17.863L43.558 17.641Q43.875 17.641 44.093 17.431Q44.310 17.221 44.410 16.911Q44.511 16.602 44.511 16.294L44.778 16.294L44.778 17.583L45.854 17.583L45.854 17.863L44.778 17.863L44.778 19.747Q44.778 20.023 44.882 20.222Q44.986 20.420 45.246 20.420Q45.403 20.420 45.509 20.316Q45.615 20.211 45.665 20.058Q45.714 19.904 45.714 19.747L45.714 19.333L45.981 19.333L45.981 19.760Q45.981 19.986 45.882 20.196Q45.783 20.406 45.598 20.538Q45.414 20.669 45.185 20.669Q44.747 20.669 44.472 20.432Q44.197 20.194 44.197 19.760\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.007 -83.467)\">\u003Cpath d=\"M49.839 20.741L49.787 20.741Q49.757 20.741 49.734 20.716Q49.712 20.690 49.712 20.656Q49.712 20.649 49.719 20.635L50.102 19.066Q50.116 19.012 50.180 19.012L50.293 19.012Q50.327 19.012 50.348 19.036Q50.368 19.059 50.368 19.097Q50.368 19.135 50.341 19.271Q50.314 19.408 50.314 19.487Q50.314 20.003 50.712 20.232Q51.110 20.461 51.671 20.461Q51.978 20.461 52.289 20.295Q52.600 20.129 52.800 19.849Q53 19.569 53 19.251Q53 18.995 52.840 18.801Q52.679 18.608 52.419 18.550L51.449 18.318Q51.199 18.260 51.004 18.116Q50.809 17.973 50.698 17.759Q50.587 17.545 50.587 17.289Q50.587 16.957 50.750 16.662Q50.912 16.366 51.185 16.144Q51.459 15.922 51.790 15.800Q52.122 15.679 52.433 15.679Q52.788 15.679 53.081 15.795Q53.373 15.912 53.561 16.164L53.981 15.700Q54.002 15.679 54.029 15.679L54.080 15.679Q54.115 15.679 54.135 15.705Q54.156 15.730 54.156 15.765Q54.156 15.771 54.149 15.785L53.762 17.347Q53.739 17.409 53.687 17.409L53.575 17.409Q53.499 17.409 53.499 17.316Q53.513 17.214 53.527 17.002Q53.527 16.479 53.236 16.205Q52.946 15.932 52.412 15.932Q52.190 15.932 51.961 16.012Q51.732 16.093 51.536 16.241Q51.339 16.390 51.221 16.593Q51.103 16.797 51.103 17.022Q51.103 17.262 51.269 17.439Q51.435 17.617 51.678 17.675L52.652 17.908Q52.901 17.962 53.101 18.120Q53.301 18.277 53.410 18.502Q53.520 18.728 53.520 18.991Q53.520 19.449 53.245 19.852Q52.970 20.256 52.532 20.498Q52.095 20.741 51.643 20.741Q50.703 20.741 50.300 20.259L49.887 20.721Q49.866 20.741 49.839 20.741\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.007 -83.467)\">\u003Cpath d=\"M54.854 21.171Q54.854 21.108 54.869 21.057L55.211 19.687L54.581 19.687Q54.551 19.687 54.528 19.660Q54.505 19.633 54.505 19.601Q54.505 19.465 54.600 19.445L55.269 19.445L55.465 18.666Q55.486 18.583 55.565 18.527Q55.643 18.471 55.726 18.471Q55.804 18.471 55.860 18.522Q55.916 18.574 55.916 18.652Q55.916 18.686 55.909 18.701L55.726 19.445L56.356 19.445Q56.385 19.445 56.407 19.471Q56.429 19.497 56.429 19.526Q56.429 19.663 56.336 19.687L55.665 19.687L55.320 21.071Q55.301 21.137 55.301 21.215Q55.301 21.318 55.349 21.395Q55.396 21.472 55.494 21.472Q55.653 21.472 55.803 21.381Q55.953 21.291 56.063 21.155Q56.173 21.020 56.241 20.856Q56.251 20.832 56.295 20.810L56.400 20.810Q56.465 20.832 56.465 20.881Q56.465 20.886 56.461 20.910Q56.331 21.218 56.064 21.437Q55.797 21.657 55.484 21.657Q55.333 21.657 55.189 21.605Q55.045 21.552 54.949 21.442Q54.854 21.332 54.854 21.171\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-bg)\">\u003Cpath d=\"M-29.126-24.923a7.113 7.113 0 1 0-14.226 0 7.113 7.113 0 0 0 14.226 0Zm-7.113 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-bg)\">\u003Cpath d=\"M39.16-24.923a7.113 7.113 0 1 0-14.226 0 7.113 7.113 0 0 0 14.226 0Zm-7.113 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-bg)\">\u003Cpath d=\"M107.447-24.923a7.113 7.113 0 1 0-14.226 0 7.113 7.113 0 0 0 14.226 0Zm-7.113 0\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"m25.558-60.971-55.48 32.363\" style=\"stroke-width:.8\"\u002F>\u003Cpath fill=\"none\" d=\"M32.047-57.244v25.008M38.537-60.971l55.48 32.363\"\u002F>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M-52.6 17.756a6.402 6.402 0 1 0-12.803 0 6.402 6.402 0 0 0 12.803 0Zm-6.401 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M-7.076 17.756a6.402 6.402 0 1 0-12.803 0 6.402 6.402 0 0 0 12.803 0Zm-6.401 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M18.532 17.756a6.402 6.402 0 1 0-12.803 0 6.402 6.402 0 0 0 12.803 0Zm-6.402 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M58.366 17.756a6.402 6.402 0 1 0-12.804 0 6.402 6.402 0 0 0 12.804 0Zm-6.402 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M83.974 17.756a6.402 6.402 0 1 0-12.804 0 6.402 6.402 0 0 0 12.804 0Zm-6.402 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M129.498 17.756a6.402 6.402 0 1 0-12.804 0 6.402 6.402 0 0 0 12.804 0Zm-6.402 0\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"m-39.68-18.47-16.215 30.4M-32.798-18.47l16.214 30.401M28.955-18.296l-14.033 30.07M35.14-18.296l14.032 30.07M96.892-18.47 80.678 11.93M103.775-18.47l16.214 30.4\"\u002F>\u003Cg stroke=\"none\" font-size=\"7\">\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M34.029 20.601L32.426 20.601L32.426 20.321Q32.652 20.321 32.801 20.287Q32.949 20.252 32.949 20.112L32.949 16.493Q32.949 16.223 32.842 16.161Q32.734 16.100 32.426 16.100L32.426 15.819L33.503 15.744L33.503 20.112Q33.503 20.249 33.653 20.285Q33.804 20.321 34.029 20.321L34.029 20.601M34.583 19.066Q34.583 18.745 34.708 18.456Q34.833 18.167 35.058 17.944Q35.284 17.720 35.579 17.600Q35.875 17.480 36.193 17.480Q36.521 17.480 36.783 17.580Q37.044 17.679 37.220 17.861Q37.396 18.044 37.490 18.302Q37.584 18.560 37.584 18.892Q37.584 18.984 37.502 19.005L35.246 19.005L35.246 19.066Q35.246 19.654 35.530 20.037Q35.814 20.420 36.381 20.420Q36.702 20.420 36.971 20.227Q37.239 20.034 37.328 19.719Q37.335 19.678 37.410 19.664L37.502 19.664Q37.584 19.688 37.584 19.760Q37.584 19.767 37.577 19.794Q37.464 20.191 37.094 20.430Q36.723 20.669 36.299 20.669Q35.861 20.669 35.462 20.461Q35.062 20.252 34.822 19.885Q34.583 19.518 34.583 19.066M35.253 18.796L37.068 18.796Q37.068 18.519 36.971 18.267Q36.873 18.014 36.675 17.858Q36.477 17.703 36.193 17.703Q35.916 17.703 35.703 17.861Q35.489 18.020 35.371 18.275Q35.253 18.530 35.253 18.796M38.230 19.873Q38.230 19.541 38.454 19.314Q38.678 19.087 39.021 18.959Q39.365 18.830 39.737 18.778Q40.110 18.725 40.414 18.725L40.414 18.472Q40.414 18.267 40.307 18.087Q40.199 17.908 40.018 17.805Q39.837 17.703 39.628 17.703Q39.221 17.703 38.985 17.795Q39.074 17.832 39.120 17.916Q39.167 18 39.167 18.102Q39.167 18.198 39.120 18.277Q39.074 18.355 38.994 18.400Q38.914 18.444 38.825 18.444Q38.674 18.444 38.574 18.347Q38.473 18.249 38.473 18.102Q38.473 17.480 39.628 17.480Q39.840 17.480 40.089 17.544Q40.339 17.607 40.541 17.726Q40.742 17.846 40.869 18.031Q40.995 18.215 40.995 18.458L40.995 20.034Q40.995 20.150 41.057 20.246Q41.118 20.341 41.231 20.341Q41.340 20.341 41.405 20.247Q41.470 20.153 41.470 20.034L41.470 19.586L41.737 19.586L41.737 20.034Q41.737 20.304 41.510 20.469Q41.282 20.635 41.002 20.635Q40.794 20.635 40.657 20.481Q40.520 20.328 40.496 20.112Q40.349 20.379 40.067 20.524Q39.785 20.669 39.461 20.669Q39.184 20.669 38.900 20.594Q38.616 20.519 38.423 20.340Q38.230 20.160 38.230 19.873M38.845 19.873Q38.845 20.047 38.946 20.177Q39.047 20.307 39.203 20.377Q39.358 20.447 39.522 20.447Q39.741 20.447 39.949 20.350Q40.158 20.252 40.286 20.071Q40.414 19.890 40.414 19.664L40.414 18.936Q40.089 18.936 39.724 19.027Q39.358 19.118 39.102 19.330Q38.845 19.541 38.845 19.873\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M43.542 20.574L42.414 18.075Q42.342 17.928 42.212 17.896Q42.082 17.863 41.853 17.863L41.853 17.583L43.367 17.583L43.367 17.863Q43.015 17.863 43.015 18.010Q43.015 18.055 43.026 18.075L43.890 19.993L44.670 18.263Q44.704 18.195 44.704 18.116Q44.704 18.003 44.620 17.933Q44.536 17.863 44.417 17.863L44.417 17.583L45.613 17.583L45.613 17.863Q45.394 17.863 45.223 17.966Q45.053 18.068 44.964 18.263L43.928 20.574Q43.880 20.669 43.774 20.669L43.696 20.669Q43.590 20.669 43.542 20.574\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M45.897 19.066Q45.897 18.745 46.022 18.456Q46.147 18.167 46.373 17.944Q46.598 17.720 46.894 17.600Q47.189 17.480 47.507 17.480Q47.835 17.480 48.097 17.580Q48.358 17.679 48.534 17.861Q48.710 18.044 48.804 18.302Q48.898 18.560 48.898 18.892Q48.898 18.984 48.816 19.005L46.561 19.005L46.561 19.066Q46.561 19.654 46.844 20.037Q47.128 20.420 47.695 20.420Q48.017 20.420 48.285 20.227Q48.553 20.034 48.642 19.719Q48.649 19.678 48.724 19.664L48.816 19.664Q48.898 19.688 48.898 19.760Q48.898 19.767 48.892 19.794Q48.779 20.191 48.408 20.430Q48.037 20.669 47.613 20.669Q47.176 20.669 46.776 20.461Q46.376 20.252 46.137 19.885Q45.897 19.518 45.897 19.066M46.567 18.796L48.382 18.796Q48.382 18.519 48.285 18.267Q48.187 18.014 47.989 17.858Q47.791 17.703 47.507 17.703Q47.230 17.703 47.017 17.861Q46.803 18.020 46.685 18.275Q46.567 18.530 46.567 18.796M49.486 20.594L49.486 19.531Q49.486 19.507 49.514 19.480Q49.541 19.453 49.565 19.453L49.674 19.453Q49.739 19.453 49.753 19.511Q49.849 19.945 50.095 20.196Q50.341 20.447 50.754 20.447Q51.096 20.447 51.349 20.314Q51.602 20.181 51.602 19.873Q51.602 19.716 51.508 19.601Q51.414 19.487 51.276 19.418Q51.137 19.350 50.970 19.312L50.389 19.213Q50.033 19.145 49.760 18.924Q49.486 18.704 49.486 18.362Q49.486 18.113 49.597 17.938Q49.708 17.764 49.895 17.665Q50.081 17.566 50.296 17.523Q50.512 17.480 50.754 17.480Q51.168 17.480 51.448 17.662L51.664 17.487Q51.674 17.484 51.681 17.482Q51.687 17.480 51.698 17.480L51.749 17.480Q51.776 17.480 51.800 17.504Q51.824 17.528 51.824 17.556L51.824 18.403Q51.824 18.424 51.800 18.451Q51.776 18.478 51.749 18.478L51.636 18.478Q51.609 18.478 51.583 18.453Q51.558 18.427 51.558 18.403Q51.558 18.167 51.452 18.003Q51.346 17.839 51.163 17.757Q50.980 17.675 50.748 17.675Q50.419 17.675 50.163 17.778Q49.907 17.880 49.907 18.157Q49.907 18.352 50.090 18.461Q50.272 18.571 50.501 18.612L51.076 18.718Q51.322 18.766 51.535 18.894Q51.749 19.022 51.886 19.225Q52.022 19.429 52.022 19.678Q52.022 20.191 51.657 20.430Q51.291 20.669 50.754 20.669Q50.259 20.669 49.927 20.375L49.661 20.649Q49.640 20.669 49.613 20.669L49.565 20.669Q49.541 20.669 49.514 20.642Q49.486 20.615 49.486 20.594M53.051 20.181Q53.051 20.013 53.174 19.890Q53.297 19.767 53.472 19.767Q53.639 19.767 53.762 19.890Q53.885 20.013 53.885 20.181Q53.885 20.355 53.762 20.478Q53.639 20.601 53.472 20.601Q53.297 20.601 53.174 20.478Q53.051 20.355 53.051 20.181M53.051 17.997Q53.051 17.829 53.174 17.706Q53.297 17.583 53.472 17.583Q53.639 17.583 53.762 17.706Q53.885 17.829 53.885 17.997Q53.885 18.171 53.762 18.294Q53.639 18.417 53.472 18.417Q53.297 18.417 53.174 18.294Q53.051 18.171 53.051 17.997\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M58.540 19.873Q58.540 19.541 58.763 19.314Q58.987 19.087 59.331 18.959Q59.674 18.830 60.047 18.778Q60.419 18.725 60.724 18.725L60.724 18.472Q60.724 18.267 60.616 18.087Q60.508 17.908 60.327 17.805Q60.146 17.703 59.938 17.703Q59.531 17.703 59.295 17.795Q59.384 17.832 59.430 17.916Q59.476 18 59.476 18.102Q59.476 18.198 59.430 18.277Q59.384 18.355 59.303 18.400Q59.223 18.444 59.134 18.444Q58.984 18.444 58.883 18.347Q58.782 18.249 58.782 18.102Q58.782 17.480 59.938 17.480Q60.149 17.480 60.399 17.544Q60.648 17.607 60.850 17.726Q61.052 17.846 61.178 18.031Q61.305 18.215 61.305 18.458L61.305 20.034Q61.305 20.150 61.366 20.246Q61.428 20.341 61.541 20.341Q61.650 20.341 61.715 20.247Q61.780 20.153 61.780 20.034L61.780 19.586L62.046 19.586L62.046 20.034Q62.046 20.304 61.819 20.469Q61.592 20.635 61.312 20.635Q61.103 20.635 60.966 20.481Q60.830 20.328 60.806 20.112Q60.659 20.379 60.377 20.524Q60.095 20.669 59.770 20.669Q59.493 20.669 59.209 20.594Q58.926 20.519 58.733 20.340Q58.540 20.160 58.540 19.873M59.155 19.873Q59.155 20.047 59.256 20.177Q59.356 20.307 59.512 20.377Q59.667 20.447 59.832 20.447Q60.050 20.447 60.259 20.350Q60.467 20.252 60.595 20.071Q60.724 19.890 60.724 19.664L60.724 18.936Q60.399 18.936 60.033 19.027Q59.667 19.118 59.411 19.330Q59.155 19.541 59.155 19.873M64.107 21.958L62.477 21.958L62.477 21.678Q62.706 21.678 62.855 21.643Q63.003 21.609 63.003 21.469L63.003 18.123Q63.003 17.952 62.867 17.911Q62.730 17.870 62.477 17.870L62.477 17.590L63.557 17.515L63.557 17.921Q63.779 17.720 64.066 17.617Q64.354 17.515 64.661 17.515Q65.088 17.515 65.452 17.728Q65.816 17.942 66.030 18.306Q66.244 18.670 66.244 19.090Q66.244 19.535 66.004 19.899Q65.765 20.263 65.372 20.466Q64.979 20.669 64.535 20.669Q64.268 20.669 64.020 20.569Q63.772 20.468 63.584 20.287L63.584 21.469Q63.584 21.606 63.733 21.642Q63.882 21.678 64.107 21.678L64.107 21.958M63.584 18.270L63.584 19.880Q63.718 20.133 63.960 20.290Q64.203 20.447 64.480 20.447Q64.808 20.447 65.061 20.246Q65.314 20.044 65.447 19.726Q65.581 19.408 65.581 19.090Q65.581 18.861 65.516 18.632Q65.451 18.403 65.323 18.205Q65.194 18.007 65 17.887Q64.805 17.768 64.572 17.768Q64.278 17.768 64.010 17.897Q63.742 18.027 63.584 18.270M68.523 21.958L66.893 21.958L66.893 21.678Q67.122 21.678 67.271 21.643Q67.419 21.609 67.419 21.469L67.419 18.123Q67.419 17.952 67.283 17.911Q67.146 17.870 66.893 17.870L66.893 17.590L67.973 17.515L67.973 17.921Q68.195 17.720 68.482 17.617Q68.770 17.515 69.077 17.515Q69.504 17.515 69.868 17.728Q70.232 17.942 70.446 18.306Q70.660 18.670 70.660 19.090Q70.660 19.535 70.420 19.899Q70.181 20.263 69.788 20.466Q69.395 20.669 68.951 20.669Q68.684 20.669 68.436 20.569Q68.188 20.468 68 20.287L68 21.469Q68 21.606 68.149 21.642Q68.298 21.678 68.523 21.678L68.523 21.958M68 18.270L68 19.880Q68.134 20.133 68.376 20.290Q68.619 20.447 68.896 20.447Q69.224 20.447 69.477 20.246Q69.730 20.044 69.863 19.726Q69.997 19.408 69.997 19.090Q69.997 18.861 69.932 18.632Q69.867 18.403 69.739 18.205Q69.610 18.007 69.416 17.887Q69.221 17.768 68.988 17.768Q68.694 17.768 68.426 17.897Q68.158 18.027 68 18.270M72.963 20.601L71.360 20.601L71.360 20.321Q71.586 20.321 71.735 20.287Q71.883 20.252 71.883 20.112L71.883 16.493Q71.883 16.223 71.776 16.161Q71.668 16.100 71.360 16.100L71.360 15.819L72.437 15.744L72.437 20.112Q72.437 20.249 72.587 20.285Q72.738 20.321 72.963 20.321L72.963 20.601M73.893 21.736Q74.023 21.804 74.160 21.804Q74.331 21.804 74.481 21.715Q74.631 21.626 74.742 21.481Q74.854 21.336 74.932 21.168L75.195 20.601L74.026 18.075Q73.951 17.928 73.821 17.896Q73.691 17.863 73.459 17.863L73.459 17.583L74.980 17.583L74.980 17.863Q74.631 17.863 74.631 18.010Q74.635 18.031 74.636 18.048Q74.638 18.065 74.638 18.075L75.496 19.934L76.269 18.263Q76.303 18.195 76.303 18.116Q76.303 18.003 76.219 17.933Q76.135 17.863 76.022 17.863L76.022 17.583L77.219 17.583L77.219 17.863Q77 17.863 76.827 17.967Q76.655 18.072 76.563 18.263L75.226 21.168Q75.055 21.538 74.785 21.784Q74.515 22.030 74.160 22.030Q73.890 22.030 73.671 21.864Q73.452 21.698 73.452 21.435Q73.452 21.298 73.544 21.209Q73.637 21.121 73.777 21.121Q73.914 21.121 74.002 21.209Q74.091 21.298 74.091 21.435Q74.091 21.538 74.038 21.616Q73.985 21.695 73.893 21.736\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M80.519 19.873Q80.519 19.541 80.742 19.314Q80.966 19.087 81.310 18.959Q81.653 18.830 82.026 18.778Q82.398 18.725 82.703 18.725L82.703 18.472Q82.703 18.267 82.595 18.087Q82.487 17.908 82.306 17.805Q82.125 17.703 81.917 17.703Q81.510 17.703 81.274 17.795Q81.363 17.832 81.409 17.916Q81.455 18 81.455 18.102Q81.455 18.198 81.409 18.277Q81.363 18.355 81.282 18.400Q81.202 18.444 81.113 18.444Q80.963 18.444 80.862 18.347Q80.761 18.249 80.761 18.102Q80.761 17.480 81.917 17.480Q82.128 17.480 82.378 17.544Q82.627 17.607 82.829 17.726Q83.031 17.846 83.157 18.031Q83.284 18.215 83.284 18.458L83.284 20.034Q83.284 20.150 83.345 20.246Q83.407 20.341 83.520 20.341Q83.629 20.341 83.694 20.247Q83.759 20.153 83.759 20.034L83.759 19.586L84.025 19.586L84.025 20.034Q84.025 20.304 83.798 20.469Q83.571 20.635 83.291 20.635Q83.082 20.635 82.945 20.481Q82.809 20.328 82.785 20.112Q82.638 20.379 82.356 20.524Q82.074 20.669 81.749 20.669Q81.472 20.669 81.188 20.594Q80.905 20.519 80.712 20.340Q80.519 20.160 80.519 19.873M81.134 19.873Q81.134 20.047 81.235 20.177Q81.335 20.307 81.491 20.377Q81.646 20.447 81.811 20.447Q82.029 20.447 82.238 20.350Q82.446 20.252 82.574 20.071Q82.703 19.890 82.703 19.664L82.703 18.936Q82.378 18.936 82.012 19.027Q81.646 19.118 81.390 19.330Q81.134 19.541 81.134 19.873M86.086 21.958L84.456 21.958L84.456 21.678Q84.685 21.678 84.834 21.643Q84.982 21.609 84.982 21.469L84.982 18.123Q84.982 17.952 84.846 17.911Q84.709 17.870 84.456 17.870L84.456 17.590L85.536 17.515L85.536 17.921Q85.758 17.720 86.045 17.617Q86.333 17.515 86.640 17.515Q87.067 17.515 87.431 17.728Q87.795 17.942 88.009 18.306Q88.223 18.670 88.223 19.090Q88.223 19.535 87.983 19.899Q87.744 20.263 87.351 20.466Q86.958 20.669 86.514 20.669Q86.247 20.669 85.999 20.569Q85.751 20.468 85.563 20.287L85.563 21.469Q85.563 21.606 85.712 21.642Q85.861 21.678 86.086 21.678L86.086 21.958M85.563 18.270L85.563 19.880Q85.697 20.133 85.939 20.290Q86.182 20.447 86.459 20.447Q86.787 20.447 87.040 20.246Q87.293 20.044 87.426 19.726Q87.560 19.408 87.560 19.090Q87.560 18.861 87.495 18.632Q87.430 18.403 87.302 18.205Q87.173 18.007 86.979 17.887Q86.784 17.768 86.551 17.768Q86.257 17.768 85.989 17.897Q85.721 18.027 85.563 18.270M90.502 21.958L88.872 21.958L88.872 21.678Q89.101 21.678 89.250 21.643Q89.398 21.609 89.398 21.469L89.398 18.123Q89.398 17.952 89.262 17.911Q89.125 17.870 88.872 17.870L88.872 17.590L89.952 17.515L89.952 17.921Q90.174 17.720 90.461 17.617Q90.749 17.515 91.056 17.515Q91.483 17.515 91.847 17.728Q92.211 17.942 92.425 18.306Q92.639 18.670 92.639 19.090Q92.639 19.535 92.399 19.899Q92.160 20.263 91.767 20.466Q91.374 20.669 90.930 20.669Q90.663 20.669 90.415 20.569Q90.167 20.468 89.979 20.287L89.979 21.469Q89.979 21.606 90.128 21.642Q90.277 21.678 90.502 21.678L90.502 21.958M89.979 18.270L89.979 19.880Q90.113 20.133 90.355 20.290Q90.598 20.447 90.875 20.447Q91.203 20.447 91.456 20.246Q91.709 20.044 91.842 19.726Q91.976 19.408 91.976 19.090Q91.976 18.861 91.911 18.632Q91.846 18.403 91.718 18.205Q91.589 18.007 91.395 17.887Q91.200 17.768 90.967 17.768Q90.673 17.768 90.405 17.897Q90.137 18.027 89.979 18.270M95.024 20.601L93.288 20.601L93.288 20.321Q93.517 20.321 93.666 20.287Q93.814 20.252 93.814 20.112L93.814 18.263Q93.814 17.993 93.707 17.932Q93.599 17.870 93.288 17.870L93.288 17.590L94.317 17.515L94.317 18.222Q94.447 17.914 94.689 17.715Q94.932 17.515 95.250 17.515Q95.469 17.515 95.640 17.639Q95.811 17.764 95.811 17.976Q95.811 18.113 95.711 18.212Q95.612 18.311 95.479 18.311Q95.342 18.311 95.243 18.212Q95.144 18.113 95.144 17.976Q95.144 17.836 95.243 17.737Q94.953 17.737 94.753 17.933Q94.553 18.130 94.460 18.424Q94.368 18.718 94.368 18.998L94.368 20.112Q94.368 20.321 95.024 20.321L95.024 20.601M96.354 19.118Q96.354 18.776 96.489 18.477Q96.624 18.178 96.863 17.954Q97.103 17.730 97.420 17.605Q97.738 17.480 98.070 17.480Q98.514 17.480 98.914 17.696Q99.314 17.911 99.548 18.289Q99.782 18.666 99.782 19.118Q99.782 19.459 99.640 19.743Q99.499 20.027 99.254 20.234Q99.010 20.440 98.700 20.555Q98.391 20.669 98.070 20.669Q97.639 20.669 97.238 20.468Q96.836 20.266 96.595 19.914Q96.354 19.562 96.354 19.118M98.070 20.420Q98.671 20.420 98.895 20.042Q99.119 19.664 99.119 19.032Q99.119 18.420 98.885 18.061Q98.651 17.703 98.070 17.703Q97.017 17.703 97.017 19.032Q97.017 19.664 97.243 20.042Q97.468 20.420 98.070 20.420\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M101.358 20.601L100.035 20.601L100.035 20.321Q100.596 20.321 100.975 19.921L101.690 19.124L100.777 18.075Q100.640 17.928 100.492 17.896Q100.343 17.863 100.076 17.863L100.076 17.583L101.577 17.583L101.577 17.863Q101.385 17.863 101.385 17.997Q101.385 18.027 101.416 18.075L102.011 18.759L102.452 18.263Q102.565 18.133 102.565 18.017Q102.565 17.955 102.527 17.909Q102.489 17.863 102.431 17.863L102.431 17.583L103.747 17.583L103.747 17.863Q103.187 17.863 102.807 18.263L102.185 18.964L103.180 20.112Q103.279 20.211 103.380 20.256Q103.481 20.300 103.592 20.310Q103.703 20.321 103.881 20.321L103.881 20.601L102.387 20.601L102.387 20.321Q102.452 20.321 102.512 20.287Q102.571 20.252 102.571 20.187Q102.571 20.140 102.541 20.112L101.864 19.326L101.331 19.921Q101.218 20.051 101.218 20.167Q101.218 20.232 101.259 20.276Q101.300 20.321 101.358 20.321L101.358 20.601M105.993 20.601L104.441 20.601L104.441 20.321Q104.667 20.321 104.815 20.287Q104.964 20.252 104.964 20.112L104.964 18.263Q104.964 18.075 104.916 17.991Q104.868 17.908 104.771 17.889Q104.674 17.870 104.462 17.870L104.462 17.590L105.518 17.515L105.518 20.112Q105.518 20.252 105.649 20.287Q105.781 20.321 105.993 20.321L105.993 20.601M104.721 16.294Q104.721 16.123 104.844 16.004Q104.967 15.884 105.138 15.884Q105.306 15.884 105.429 16.004Q105.552 16.123 105.552 16.294Q105.552 16.469 105.429 16.592Q105.306 16.715 105.138 16.715Q104.967 16.715 104.844 16.592Q104.721 16.469 104.721 16.294M108.320 20.601L106.687 20.601L106.687 20.321Q106.916 20.321 107.064 20.287Q107.213 20.252 107.213 20.112L107.213 18.263Q107.213 17.993 107.105 17.932Q106.998 17.870 106.687 17.870L106.687 17.590L107.746 17.515L107.746 18.164Q107.917 17.856 108.221 17.685Q108.526 17.515 108.871 17.515Q109.271 17.515 109.548 17.655Q109.824 17.795 109.910 18.143Q110.077 17.850 110.376 17.682Q110.675 17.515 111.021 17.515Q111.527 17.515 111.810 17.738Q112.094 17.962 112.094 18.458L112.094 20.112Q112.094 20.249 112.243 20.285Q112.391 20.321 112.617 20.321L112.617 20.601L110.986 20.601L110.986 20.321Q111.212 20.321 111.362 20.285Q111.513 20.249 111.513 20.112L111.513 18.472Q111.513 18.137 111.393 17.937Q111.274 17.737 110.959 17.737Q110.689 17.737 110.455 17.873Q110.221 18.010 110.082 18.244Q109.944 18.478 109.944 18.752L109.944 20.112Q109.944 20.249 110.093 20.285Q110.241 20.321 110.467 20.321L110.467 20.601L108.837 20.601L108.837 20.321Q109.066 20.321 109.214 20.287Q109.363 20.252 109.363 20.112L109.363 18.472Q109.363 18.137 109.243 17.937Q109.124 17.737 108.809 17.737Q108.539 17.737 108.305 17.873Q108.071 18.010 107.933 18.244Q107.794 18.478 107.794 18.752L107.794 20.112Q107.794 20.249 107.944 20.285Q108.095 20.321 108.320 20.321L108.320 20.601M113.263 19.873Q113.263 19.541 113.487 19.314Q113.711 19.087 114.054 18.959Q114.398 18.830 114.770 18.778Q115.143 18.725 115.447 18.725L115.447 18.472Q115.447 18.267 115.339 18.087Q115.232 17.908 115.050 17.805Q114.869 17.703 114.661 17.703Q114.254 17.703 114.018 17.795Q114.107 17.832 114.153 17.916Q114.199 18 114.199 18.102Q114.199 18.198 114.153 18.277Q114.107 18.355 114.027 18.400Q113.946 18.444 113.858 18.444Q113.707 18.444 113.606 18.347Q113.506 18.249 113.506 18.102Q113.506 17.480 114.661 17.480Q114.873 17.480 115.122 17.544Q115.372 17.607 115.573 17.726Q115.775 17.846 115.902 18.031Q116.028 18.215 116.028 18.458L116.028 20.034Q116.028 20.150 116.090 20.246Q116.151 20.341 116.264 20.341Q116.373 20.341 116.438 20.247Q116.503 20.153 116.503 20.034L116.503 19.586L116.770 19.586L116.770 20.034Q116.770 20.304 116.542 20.469Q116.315 20.635 116.035 20.635Q115.826 20.635 115.690 20.481Q115.553 20.328 115.529 20.112Q115.382 20.379 115.100 20.524Q114.818 20.669 114.493 20.669Q114.216 20.669 113.933 20.594Q113.649 20.519 113.456 20.340Q113.263 20.160 113.263 19.873M113.878 19.873Q113.878 20.047 113.979 20.177Q114.080 20.307 114.235 20.377Q114.391 20.447 114.555 20.447Q114.774 20.447 114.982 20.350Q115.191 20.252 115.319 20.071Q115.447 19.890 115.447 19.664L115.447 18.936Q115.122 18.936 114.757 19.027Q114.391 19.118 114.134 19.330Q113.878 19.541 113.878 19.873M117.713 19.760L117.713 17.863L117.074 17.863L117.074 17.641Q117.392 17.641 117.609 17.431Q117.826 17.221 117.927 16.911Q118.028 16.602 118.028 16.294L118.294 16.294L118.294 17.583L119.371 17.583L119.371 17.863L118.294 17.863L118.294 19.747Q118.294 20.023 118.398 20.222Q118.503 20.420 118.762 20.420Q118.920 20.420 119.026 20.316Q119.132 20.211 119.181 20.058Q119.231 19.904 119.231 19.747L119.231 19.333L119.497 19.333L119.497 19.760Q119.497 19.986 119.398 20.196Q119.299 20.406 119.114 20.538Q118.930 20.669 118.701 20.669Q118.263 20.669 117.988 20.432Q117.713 20.194 117.713 19.760M120.266 19.066Q120.266 18.745 120.391 18.456Q120.516 18.167 120.741 17.944Q120.967 17.720 121.263 17.600Q121.558 17.480 121.876 17.480Q122.204 17.480 122.466 17.580Q122.727 17.679 122.903 17.861Q123.079 18.044 123.173 18.302Q123.267 18.560 123.267 18.892Q123.267 18.984 123.185 19.005L120.929 19.005L120.929 19.066Q120.929 19.654 121.213 20.037Q121.497 20.420 122.064 20.420Q122.385 20.420 122.654 20.227Q122.922 20.034 123.011 19.719Q123.018 19.678 123.093 19.664L123.185 19.664Q123.267 19.688 123.267 19.760Q123.267 19.767 123.260 19.794Q123.148 20.191 122.777 20.430Q122.406 20.669 121.982 20.669Q121.545 20.669 121.145 20.461Q120.745 20.252 120.506 19.885Q120.266 19.518 120.266 19.066M120.936 18.796L122.751 18.796Q122.751 18.519 122.654 18.267Q122.556 18.014 122.358 17.858Q122.160 17.703 121.876 17.703Q121.599 17.703 121.386 17.861Q121.172 18.020 121.054 18.275Q120.936 18.530 120.936 18.796\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M128.161 20.574L127.033 18.075Q126.961 17.928 126.831 17.896Q126.701 17.863 126.472 17.863L126.472 17.583L127.986 17.583L127.986 17.863Q127.634 17.863 127.634 18.010Q127.634 18.055 127.645 18.075L128.509 19.993L129.289 18.263Q129.323 18.195 129.323 18.116Q129.323 18.003 129.239 17.933Q129.155 17.863 129.036 17.863L129.036 17.583L130.232 17.583L130.232 17.863Q130.013 17.863 129.842 17.966Q129.672 18.068 129.583 18.263L128.547 20.574Q128.499 20.669 128.393 20.669L128.315 20.669Q128.209 20.669 128.161 20.574\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M130.401 19.873Q130.401 19.541 130.624 19.314Q130.848 19.087 131.192 18.959Q131.535 18.830 131.908 18.778Q132.280 18.725 132.585 18.725L132.585 18.472Q132.585 18.267 132.477 18.087Q132.369 17.908 132.188 17.805Q132.007 17.703 131.799 17.703Q131.392 17.703 131.156 17.795Q131.245 17.832 131.291 17.916Q131.337 18 131.337 18.102Q131.337 18.198 131.291 18.277Q131.245 18.355 131.164 18.400Q131.084 18.444 130.995 18.444Q130.845 18.444 130.744 18.347Q130.643 18.249 130.643 18.102Q130.643 17.480 131.799 17.480Q132.010 17.480 132.260 17.544Q132.509 17.607 132.711 17.726Q132.913 17.846 133.039 18.031Q133.166 18.215 133.166 18.458L133.166 20.034Q133.166 20.150 133.227 20.246Q133.289 20.341 133.402 20.341Q133.511 20.341 133.576 20.247Q133.641 20.153 133.641 20.034L133.641 19.586L133.907 19.586L133.907 20.034Q133.907 20.304 133.680 20.469Q133.453 20.635 133.173 20.635Q132.964 20.635 132.827 20.481Q132.691 20.328 132.667 20.112Q132.520 20.379 132.238 20.524Q131.956 20.669 131.631 20.669Q131.354 20.669 131.070 20.594Q130.787 20.519 130.594 20.340Q130.401 20.160 130.401 19.873M131.016 19.873Q131.016 20.047 131.117 20.177Q131.217 20.307 131.373 20.377Q131.528 20.447 131.693 20.447Q131.911 20.447 132.120 20.350Q132.328 20.252 132.456 20.071Q132.585 19.890 132.585 19.664L132.585 18.936Q132.260 18.936 131.894 19.027Q131.528 19.118 131.272 19.330Q131.016 19.541 131.016 19.873M135.992 20.601L134.389 20.601L134.389 20.321Q134.615 20.321 134.764 20.287Q134.912 20.252 134.912 20.112L134.912 16.493Q134.912 16.223 134.805 16.161Q134.697 16.100 134.389 16.100L134.389 15.819L135.466 15.744L135.466 20.112Q135.466 20.249 135.616 20.285Q135.767 20.321 135.992 20.321L135.992 20.601M137.161 19.767L137.161 18.263Q137.161 17.993 137.054 17.932Q136.946 17.870 136.635 17.870L136.635 17.590L137.742 17.515L137.742 19.747L137.742 19.767Q137.742 20.047 137.794 20.191Q137.845 20.334 137.987 20.391Q138.129 20.447 138.416 20.447Q138.669 20.447 138.874 20.307Q139.079 20.167 139.195 19.941Q139.311 19.716 139.311 19.466L139.311 18.263Q139.311 17.993 139.204 17.932Q139.096 17.870 138.785 17.870L138.785 17.590L139.892 17.515L139.892 19.928Q139.892 20.119 139.945 20.201Q139.998 20.283 140.099 20.302Q140.200 20.321 140.415 20.321L140.415 20.601L139.339 20.669L139.339 20.105Q139.229 20.287 139.084 20.410Q138.939 20.533 138.752 20.601Q138.566 20.669 138.364 20.669Q137.161 20.669 137.161 19.767M140.962 19.066Q140.962 18.745 141.087 18.456Q141.212 18.167 141.437 17.944Q141.663 17.720 141.958 17.600Q142.254 17.480 142.572 17.480Q142.900 17.480 143.162 17.580Q143.423 17.679 143.599 17.861Q143.775 18.044 143.869 18.302Q143.963 18.560 143.963 18.892Q143.963 18.984 143.881 19.005L141.625 19.005L141.625 19.066Q141.625 19.654 141.909 20.037Q142.193 20.420 142.760 20.420Q143.081 20.420 143.350 20.227Q143.618 20.034 143.707 19.719Q143.714 19.678 143.789 19.664L143.881 19.664Q143.963 19.688 143.963 19.760Q143.963 19.767 143.956 19.794Q143.843 20.191 143.473 20.430Q143.102 20.669 142.678 20.669Q142.240 20.669 141.840 20.461Q141.441 20.252 141.201 19.885Q140.962 19.518 140.962 19.066M141.632 18.796L143.447 18.796Q143.447 18.519 143.350 18.267Q143.252 18.014 143.054 17.858Q142.856 17.703 142.572 17.703Q142.295 17.703 142.081 17.861Q141.868 18.020 141.750 18.275Q141.632 18.530 141.632 18.796\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M147.933 19.753Q147.933 19.541 147.994 19.309Q148.056 19.077 148.167 18.796Q148.278 18.516 148.360 18.311Q148.435 18.109 148.435 17.969Q148.435 17.870 148.396 17.803Q148.357 17.737 148.268 17.737Q147.987 17.737 147.798 18.008Q147.608 18.280 147.519 18.612Q147.509 18.677 147.447 18.677L147.338 18.677Q147.307 18.677 147.283 18.646Q147.259 18.615 147.259 18.591L147.259 18.564Q147.328 18.304 147.468 18.067Q147.608 17.829 147.818 17.672Q148.028 17.515 148.281 17.515Q148.463 17.515 148.618 17.586Q148.774 17.658 148.871 17.793Q148.968 17.928 148.968 18.109Q148.968 18.226 148.921 18.362Q148.692 18.926 148.589 19.234Q148.487 19.541 148.487 19.846Q148.487 20.122 148.633 20.285Q148.780 20.447 149.050 20.447Q149.437 20.447 149.758 20.013Q149.878 19.856 150.004 19.606Q150.131 19.357 150.214 19.097Q150.298 18.837 150.298 18.663Q150.298 18.458 150.237 18.364Q150.175 18.270 150.047 18.132Q149.919 17.993 149.919 17.897Q149.919 17.798 149.977 17.709Q150.035 17.621 150.125 17.564Q150.216 17.508 150.319 17.508Q150.510 17.508 150.597 17.677Q150.684 17.846 150.684 18.061Q150.684 18.390 150.570 18.832Q150.455 19.275 150.237 19.699Q150.018 20.122 149.712 20.396Q149.406 20.669 149.044 20.669Q148.555 20.669 148.244 20.447Q147.933 20.225 147.933 19.753\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-68.734 18.353)\">\u003Cpath d=\"M153.394 19.347L151.336 19.347L151.336 18.844L153.394 18.844L153.394 19.347M154.723 19.760L154.723 17.863L154.084 17.863L154.084 17.641Q154.402 17.641 154.619 17.431Q154.836 17.221 154.937 16.911Q155.038 16.602 155.038 16.294L155.304 16.294L155.304 17.583L156.381 17.583L156.381 17.863L155.304 17.863L155.304 19.747Q155.304 20.023 155.409 20.222Q155.513 20.420 155.773 20.420Q155.930 20.420 156.036 20.316Q156.142 20.211 156.191 20.058Q156.241 19.904 156.241 19.747L156.241 19.333L156.508 19.333L156.508 19.760Q156.508 19.986 156.408 20.196Q156.309 20.406 156.125 20.538Q155.940 20.669 155.711 20.669Q155.274 20.669 154.998 20.432Q154.723 20.194 154.723 19.760M158.934 20.601L157.383 20.601L157.383 20.321Q157.608 20.321 157.757 20.287Q157.905 20.252 157.905 20.112L157.905 18.263Q157.905 18.075 157.858 17.991Q157.810 17.908 157.712 17.889Q157.615 17.870 157.403 17.870L157.403 17.590L158.459 17.515L158.459 20.112Q158.459 20.252 158.591 20.287Q158.722 20.321 158.934 20.321L158.934 20.601M157.663 16.294Q157.663 16.123 157.786 16.004Q157.909 15.884 158.080 15.884Q158.247 15.884 158.370 16.004Q158.493 16.123 158.493 16.294Q158.493 16.469 158.370 16.592Q158.247 16.715 158.080 16.715Q157.909 16.715 157.786 16.592Q157.663 16.469 157.663 16.294M161.248 20.601L159.645 20.601L159.645 20.321Q159.871 20.321 160.019 20.287Q160.168 20.252 160.168 20.112L160.168 16.493Q160.168 16.223 160.061 16.161Q159.953 16.100 159.645 16.100L159.645 15.819L160.722 15.744L160.722 20.112Q160.722 20.249 160.872 20.285Q161.023 20.321 161.248 20.321L161.248 20.601M161.843 19.090Q161.843 18.752 161.983 18.461Q162.123 18.171 162.368 17.957Q162.612 17.744 162.916 17.629Q163.220 17.515 163.545 17.515Q163.815 17.515 164.078 17.614Q164.342 17.713 164.533 17.891L164.533 16.493Q164.533 16.223 164.425 16.161Q164.318 16.100 164.007 16.100L164.007 15.819L165.083 15.744L165.083 19.928Q165.083 20.116 165.138 20.199Q165.193 20.283 165.293 20.302Q165.394 20.321 165.610 20.321L165.610 20.601L164.502 20.669L164.502 20.252Q164.085 20.669 163.460 20.669Q163.029 20.669 162.656 20.457Q162.284 20.246 162.063 19.885Q161.843 19.524 161.843 19.090M163.518 20.447Q163.726 20.447 163.913 20.375Q164.099 20.304 164.253 20.167Q164.406 20.030 164.502 19.852L164.502 18.243Q164.417 18.096 164.271 17.976Q164.126 17.856 163.957 17.797Q163.788 17.737 163.607 17.737Q163.046 17.737 162.778 18.126Q162.509 18.516 162.509 19.097Q162.509 19.668 162.744 20.058Q162.978 20.447 163.518 20.447M166.218 19.066Q166.218 18.745 166.343 18.456Q166.467 18.167 166.693 17.944Q166.919 17.720 167.214 17.600Q167.510 17.480 167.828 17.480Q168.156 17.480 168.417 17.580Q168.679 17.679 168.855 17.861Q169.031 18.044 169.125 18.302Q169.219 18.560 169.219 18.892Q169.219 18.984 169.137 19.005L166.881 19.005L166.881 19.066Q166.881 19.654 167.165 20.037Q167.448 20.420 168.016 20.420Q168.337 20.420 168.605 20.227Q168.874 20.034 168.963 19.719Q168.969 19.678 169.045 19.664L169.137 19.664Q169.219 19.688 169.219 19.760Q169.219 19.767 169.212 19.794Q169.099 20.191 168.728 20.430Q168.358 20.669 167.934 20.669Q167.496 20.669 167.096 20.461Q166.696 20.252 166.457 19.885Q166.218 19.518 166.218 19.066M166.888 18.796L168.703 18.796Q168.703 18.519 168.605 18.267Q168.508 18.014 168.310 17.858Q168.112 17.703 167.828 17.703Q167.551 17.703 167.337 17.861Q167.124 18.020 167.006 18.275Q166.888 18.530 166.888 18.796\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m-16.322-29.19 26.471-22.502\"\u002F>\u003Cpath stroke=\"none\" d=\"m12.13-53.376-4.516 1.11 2.535.574.159 2.595\"\u002F>\u003C\u002Fg>\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(22.027 -70.805)\">\u003Cpath d=\"M33.168 20.601L32.901 20.601L32.901 16.493Q32.901 16.223 32.794 16.161Q32.686 16.100 32.375 16.100L32.375 15.819L33.455 15.744L33.455 17.914Q33.664 17.723 33.949 17.619Q34.234 17.515 34.532 17.515Q34.850 17.515 35.147 17.636Q35.444 17.757 35.667 17.973Q35.889 18.188 36.015 18.473Q36.142 18.759 36.142 19.090Q36.142 19.535 35.902 19.899Q35.663 20.263 35.270 20.466Q34.877 20.669 34.433 20.669Q34.238 20.669 34.048 20.613Q33.859 20.557 33.698 20.452Q33.537 20.348 33.397 20.187L33.168 20.601M33.483 18.256L33.483 19.873Q33.619 20.133 33.860 20.290Q34.101 20.447 34.378 20.447Q34.672 20.447 34.884 20.340Q35.096 20.232 35.229 20.040Q35.362 19.849 35.421 19.610Q35.479 19.371 35.479 19.090Q35.479 18.731 35.385 18.427Q35.291 18.123 35.063 17.930Q34.836 17.737 34.470 17.737Q34.170 17.737 33.903 17.873Q33.636 18.010 33.483 18.256M36.836 19.873Q36.836 19.541 37.059 19.314Q37.283 19.087 37.627 18.959Q37.970 18.830 38.343 18.778Q38.715 18.725 39.020 18.725L39.020 18.472Q39.020 18.267 38.912 18.087Q38.804 17.908 38.623 17.805Q38.442 17.703 38.234 17.703Q37.827 17.703 37.591 17.795Q37.680 17.832 37.726 17.916Q37.772 18 37.772 18.102Q37.772 18.198 37.726 18.277Q37.680 18.355 37.599 18.400Q37.519 18.444 37.430 18.444Q37.280 18.444 37.179 18.347Q37.078 18.249 37.078 18.102Q37.078 17.480 38.234 17.480Q38.445 17.480 38.695 17.544Q38.944 17.607 39.146 17.726Q39.348 17.846 39.474 18.031Q39.601 18.215 39.601 18.458L39.601 20.034Q39.601 20.150 39.662 20.246Q39.724 20.341 39.837 20.341Q39.946 20.341 40.011 20.247Q40.076 20.153 40.076 20.034L40.076 19.586L40.342 19.586L40.342 20.034Q40.342 20.304 40.115 20.469Q39.888 20.635 39.608 20.635Q39.399 20.635 39.262 20.481Q39.126 20.328 39.102 20.112Q38.955 20.379 38.673 20.524Q38.391 20.669 38.066 20.669Q37.789 20.669 37.505 20.594Q37.222 20.519 37.029 20.340Q36.836 20.160 36.836 19.873M37.451 19.873Q37.451 20.047 37.552 20.177Q37.652 20.307 37.808 20.377Q37.964 20.447 38.128 20.447Q38.346 20.447 38.555 20.350Q38.763 20.252 38.891 20.071Q39.020 19.890 39.020 19.664L39.020 18.936Q38.695 18.936 38.329 19.027Q37.964 19.118 37.707 19.330Q37.451 19.541 37.451 19.873M40.759 19.090Q40.759 18.762 40.894 18.461Q41.029 18.161 41.265 17.940Q41.501 17.720 41.805 17.600Q42.109 17.480 42.434 17.480Q42.940 17.480 43.289 17.583Q43.637 17.685 43.637 18.061Q43.637 18.208 43.540 18.309Q43.443 18.410 43.296 18.410Q43.142 18.410 43.043 18.311Q42.943 18.212 42.943 18.061Q42.943 17.873 43.084 17.781Q42.882 17.730 42.441 17.730Q42.086 17.730 41.857 17.926Q41.628 18.123 41.527 18.432Q41.426 18.742 41.426 19.090Q41.426 19.439 41.552 19.745Q41.679 20.051 41.933 20.235Q42.188 20.420 42.544 20.420Q42.766 20.420 42.950 20.336Q43.135 20.252 43.270 20.097Q43.405 19.941 43.463 19.733Q43.477 19.678 43.531 19.678L43.644 19.678Q43.675 19.678 43.697 19.702Q43.719 19.726 43.719 19.760L43.719 19.781Q43.634 20.068 43.446 20.266Q43.258 20.464 42.993 20.567Q42.728 20.669 42.434 20.669Q42.004 20.669 41.616 20.463Q41.228 20.256 40.994 19.893Q40.759 19.531 40.759 19.090\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(22.027 -70.805)\">\u003Cpath d=\"M45.701 20.601L44.118 20.601L44.118 20.321Q44.347 20.321 44.496 20.287Q44.644 20.252 44.644 20.112L44.644 16.493Q44.644 16.223 44.537 16.161Q44.429 16.100 44.118 16.100L44.118 15.819L45.198 15.744L45.198 19.032L46.183 18.263Q46.388 18.126 46.388 17.976Q46.388 17.932 46.347 17.897Q46.306 17.863 46.261 17.863L46.261 17.583L47.625 17.583L47.625 17.863Q47.136 17.863 46.617 18.263L46.060 18.697L47.037 19.921Q47.239 20.167 47.372 20.244Q47.505 20.321 47.792 20.321L47.792 20.601L46.360 20.601L46.360 20.321Q46.548 20.321 46.548 20.208Q46.548 20.112 46.394 19.921L45.660 19.012L45.178 19.391L45.178 20.112Q45.178 20.249 45.326 20.285Q45.475 20.321 45.701 20.321\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(22.027 -70.805)\">\u003Cpath d=\"M51.575 19.767L51.575 18.263Q51.575 17.993 51.467 17.932Q51.359 17.870 51.048 17.870L51.048 17.590L52.156 17.515L52.156 19.747L52.156 19.767Q52.156 20.047 52.207 20.191Q52.258 20.334 52.400 20.391Q52.542 20.447 52.829 20.447Q53.082 20.447 53.287 20.307Q53.492 20.167 53.608 19.941Q53.725 19.716 53.725 19.466L53.725 18.263Q53.725 17.993 53.617 17.932Q53.509 17.870 53.198 17.870L53.198 17.590L54.306 17.515L54.306 19.928Q54.306 20.119 54.359 20.201Q54.412 20.283 54.512 20.302Q54.613 20.321 54.829 20.321L54.829 20.601L53.752 20.669L53.752 20.105Q53.643 20.287 53.497 20.410Q53.352 20.533 53.166 20.601Q52.979 20.669 52.778 20.669Q51.575 20.669 51.575 19.767M57.061 21.958L55.430 21.958L55.430 21.678Q55.659 21.678 55.808 21.643Q55.957 21.609 55.957 21.469L55.957 18.123Q55.957 17.952 55.820 17.911Q55.683 17.870 55.430 17.870L55.430 17.590L56.510 17.515L56.510 17.921Q56.732 17.720 57.019 17.617Q57.307 17.515 57.614 17.515Q58.041 17.515 58.405 17.728Q58.769 17.942 58.983 18.306Q59.197 18.670 59.197 19.090Q59.197 19.535 58.957 19.899Q58.718 20.263 58.325 20.466Q57.932 20.669 57.488 20.669Q57.221 20.669 56.973 20.569Q56.726 20.468 56.538 20.287L56.538 21.469Q56.538 21.606 56.686 21.642Q56.835 21.678 57.061 21.678L57.061 21.958M56.538 18.270L56.538 19.880Q56.671 20.133 56.914 20.290Q57.156 20.447 57.433 20.447Q57.761 20.447 58.014 20.246Q58.267 20.044 58.400 19.726Q58.534 19.408 58.534 19.090Q58.534 18.861 58.469 18.632Q58.404 18.403 58.276 18.205Q58.147 18.007 57.953 17.887Q57.758 17.768 57.525 17.768Q57.231 17.768 56.963 17.897Q56.695 18.027 56.538 18.270\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(22.027 -70.805)\">\u003Cpath d=\"M64.658 22.351Q64.108 21.951 63.737 21.396Q63.366 20.840 63.185 20.194Q63.004 19.548 63.004 18.851Q63.004 18.338 63.104 17.843Q63.205 17.347 63.410 16.896Q63.615 16.445 63.928 16.053Q64.241 15.662 64.658 15.358Q64.668 15.354 64.675 15.353Q64.682 15.351 64.692 15.351L64.760 15.351Q64.795 15.351 64.817 15.375Q64.839 15.399 64.839 15.436Q64.839 15.481 64.812 15.498Q64.463 15.799 64.210 16.183Q63.957 16.568 63.805 17.009Q63.653 17.450 63.581 17.906Q63.509 18.362 63.509 18.851Q63.509 19.852 63.819 20.739Q64.128 21.626 64.812 22.211Q64.839 22.228 64.839 22.272Q64.839 22.310 64.817 22.334Q64.795 22.358 64.760 22.358L64.692 22.358Q64.685 22.354 64.677 22.353Q64.668 22.351 64.658 22.351M67.331 20.601L65.697 20.601L65.697 20.321Q65.926 20.321 66.075 20.287Q66.223 20.252 66.223 20.112L66.223 18.263Q66.223 17.993 66.116 17.932Q66.008 17.870 65.697 17.870L65.697 17.590L66.756 17.515L66.756 18.164Q66.927 17.856 67.232 17.685Q67.536 17.515 67.881 17.515Q68.281 17.515 68.558 17.655Q68.835 17.795 68.920 18.143Q69.088 17.850 69.387 17.682Q69.686 17.515 70.031 17.515Q70.537 17.515 70.820 17.738Q71.104 17.962 71.104 18.458L71.104 20.112Q71.104 20.249 71.253 20.285Q71.401 20.321 71.627 20.321L71.627 20.601L69.997 20.601L69.997 20.321Q70.222 20.321 70.373 20.285Q70.523 20.249 70.523 20.112L70.523 18.472Q70.523 18.137 70.403 17.937Q70.284 17.737 69.969 17.737Q69.699 17.737 69.465 17.873Q69.231 18.010 69.093 18.244Q68.954 18.478 68.954 18.752L68.954 20.112Q68.954 20.249 69.103 20.285Q69.252 20.321 69.477 20.321L69.477 20.601L67.847 20.601L67.847 20.321Q68.076 20.321 68.224 20.287Q68.373 20.252 68.373 20.112L68.373 18.472Q68.373 18.137 68.254 17.937Q68.134 17.737 67.819 17.737Q67.549 17.737 67.315 17.873Q67.081 18.010 66.943 18.244Q66.804 18.478 66.804 18.752L66.804 20.112Q66.804 20.249 66.955 20.285Q67.105 20.321 67.331 20.321L67.331 20.601M72.273 19.873Q72.273 19.541 72.497 19.314Q72.721 19.087 73.064 18.959Q73.408 18.830 73.780 18.778Q74.153 18.725 74.457 18.725L74.457 18.472Q74.457 18.267 74.349 18.087Q74.242 17.908 74.061 17.805Q73.880 17.703 73.671 17.703Q73.264 17.703 73.028 17.795Q73.117 17.832 73.163 17.916Q73.210 18 73.210 18.102Q73.210 18.198 73.163 18.277Q73.117 18.355 73.037 18.400Q72.957 18.444 72.868 18.444Q72.717 18.444 72.617 18.347Q72.516 18.249 72.516 18.102Q72.516 17.480 73.671 17.480Q73.883 17.480 74.132 17.544Q74.382 17.607 74.584 17.726Q74.785 17.846 74.912 18.031Q75.038 18.215 75.038 18.458L75.038 20.034Q75.038 20.150 75.100 20.246Q75.161 20.341 75.274 20.341Q75.383 20.341 75.448 20.247Q75.513 20.153 75.513 20.034L75.513 19.586L75.780 19.586L75.780 20.034Q75.780 20.304 75.553 20.469Q75.325 20.635 75.045 20.635Q74.837 20.635 74.700 20.481Q74.563 20.328 74.539 20.112Q74.392 20.379 74.110 20.524Q73.828 20.669 73.504 20.669Q73.227 20.669 72.943 20.594Q72.659 20.519 72.466 20.340Q72.273 20.160 72.273 19.873M72.888 19.873Q72.888 20.047 72.989 20.177Q73.090 20.307 73.245 20.377Q73.401 20.447 73.565 20.447Q73.784 20.447 73.992 20.350Q74.201 20.252 74.329 20.071Q74.457 19.890 74.457 19.664L74.457 18.936Q74.132 18.936 73.767 19.027Q73.401 19.118 73.145 19.330Q72.888 19.541 72.888 19.873M77.380 20.601L76.057 20.601L76.057 20.321Q76.617 20.321 76.997 19.921L77.711 19.124L76.798 18.075Q76.662 17.928 76.513 17.896Q76.364 17.863 76.098 17.863L76.098 17.583L77.598 17.583L77.598 17.863Q77.407 17.863 77.407 17.997Q77.407 18.027 77.438 18.075L78.032 18.759L78.473 18.263Q78.586 18.133 78.586 18.017Q78.586 17.955 78.548 17.909Q78.511 17.863 78.453 17.863L78.453 17.583L79.769 17.583L79.769 17.863Q79.208 17.863 78.829 18.263L78.207 18.964L79.201 20.112Q79.300 20.211 79.401 20.256Q79.502 20.300 79.613 20.310Q79.724 20.321 79.902 20.321L79.902 20.601L78.408 20.601L78.408 20.321Q78.473 20.321 78.533 20.287Q78.593 20.252 78.593 20.187Q78.593 20.140 78.562 20.112L77.885 19.326L77.352 19.921Q77.239 20.051 77.239 20.167Q77.239 20.232 77.280 20.276Q77.321 20.321 77.380 20.321L77.380 20.601M80.719 22.358L80.651 22.358Q80.616 22.358 80.594 22.332Q80.572 22.307 80.572 22.272Q80.572 22.228 80.603 22.211Q80.958 21.907 81.208 21.517Q81.457 21.127 81.609 20.695Q81.761 20.263 81.831 19.794Q81.901 19.326 81.901 18.851Q81.901 18.372 81.831 17.906Q81.761 17.439 81.608 17.004Q81.454 16.568 81.203 16.180Q80.951 15.792 80.603 15.498Q80.572 15.481 80.572 15.436Q80.572 15.402 80.594 15.377Q80.616 15.351 80.651 15.351L80.719 15.351Q80.729 15.351 80.738 15.353Q80.746 15.354 80.756 15.358Q81.300 15.758 81.672 16.311Q82.045 16.865 82.226 17.511Q82.407 18.157 82.407 18.851Q82.407 19.552 82.226 20.199Q82.045 20.847 81.671 21.401Q81.297 21.955 80.756 22.351Q80.746 22.351 80.738 22.353Q80.729 22.354 80.719 22.358\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" 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(-61.908 -30.29)\">\u003Cpath d=\"M33.168 20.601L32.901 20.601L32.901 16.493Q32.901 16.223 32.794 16.161Q32.686 16.100 32.375 16.100L32.375 15.819L33.455 15.744L33.455 17.914Q33.664 17.723 33.949 17.619Q34.234 17.515 34.532 17.515Q34.850 17.515 35.147 17.636Q35.444 17.757 35.667 17.973Q35.889 18.188 36.015 18.473Q36.142 18.759 36.142 19.090Q36.142 19.535 35.902 19.899Q35.663 20.263 35.270 20.466Q34.877 20.669 34.433 20.669Q34.238 20.669 34.048 20.613Q33.859 20.557 33.698 20.452Q33.537 20.348 33.397 20.187L33.168 20.601M33.483 18.256L33.483 19.873Q33.619 20.133 33.860 20.290Q34.101 20.447 34.378 20.447Q34.672 20.447 34.884 20.340Q35.096 20.232 35.229 20.040Q35.362 19.849 35.421 19.610Q35.479 19.371 35.479 19.090Q35.479 18.731 35.385 18.427Q35.291 18.123 35.063 17.930Q34.836 17.737 34.470 17.737Q34.170 17.737 33.903 17.873Q33.636 18.010 33.483 18.256\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-61.908 -30.29)\">\u003Cpath d=\"M36.952 19.066Q36.952 18.745 37.077 18.456Q37.202 18.167 37.428 17.944Q37.653 17.720 37.949 17.600Q38.244 17.480 38.562 17.480Q38.890 17.480 39.152 17.580Q39.413 17.679 39.589 17.861Q39.765 18.044 39.859 18.302Q39.953 18.560 39.953 18.892Q39.953 18.984 39.871 19.005L37.616 19.005L37.616 19.066Q37.616 19.654 37.899 20.037Q38.183 20.420 38.750 20.420Q39.072 20.420 39.340 20.227Q39.608 20.034 39.697 19.719Q39.704 19.678 39.779 19.664L39.871 19.664Q39.953 19.688 39.953 19.760Q39.953 19.767 39.947 19.794Q39.834 20.191 39.463 20.430Q39.092 20.669 38.668 20.669Q38.231 20.669 37.831 20.461Q37.431 20.252 37.192 19.885Q36.952 19.518 36.952 19.066M37.622 18.796L39.437 18.796Q39.437 18.519 39.340 18.267Q39.242 18.014 39.044 17.858Q38.846 17.703 38.562 17.703Q38.285 17.703 38.072 17.861Q37.858 18.020 37.740 18.275Q37.622 18.530 37.622 18.796M40.541 20.594L40.541 19.531Q40.541 19.507 40.569 19.480Q40.596 19.453 40.620 19.453L40.729 19.453Q40.794 19.453 40.808 19.511Q40.904 19.945 41.150 20.196Q41.396 20.447 41.809 20.447Q42.151 20.447 42.404 20.314Q42.657 20.181 42.657 19.873Q42.657 19.716 42.563 19.601Q42.469 19.487 42.331 19.418Q42.192 19.350 42.025 19.312L41.444 19.213Q41.088 19.145 40.815 18.924Q40.541 18.704 40.541 18.362Q40.541 18.113 40.652 17.938Q40.763 17.764 40.950 17.665Q41.136 17.566 41.351 17.523Q41.567 17.480 41.809 17.480Q42.223 17.480 42.503 17.662L42.719 17.487Q42.729 17.484 42.736 17.482Q42.742 17.480 42.753 17.480L42.804 17.480Q42.831 17.480 42.855 17.504Q42.879 17.528 42.879 17.556L42.879 18.403Q42.879 18.424 42.855 18.451Q42.831 18.478 42.804 18.478L42.691 18.478Q42.664 18.478 42.638 18.453Q42.613 18.427 42.613 18.403Q42.613 18.167 42.507 18.003Q42.401 17.839 42.218 17.757Q42.035 17.675 41.803 17.675Q41.474 17.675 41.218 17.778Q40.962 17.880 40.962 18.157Q40.962 18.352 41.145 18.461Q41.327 18.571 41.556 18.612L42.131 18.718Q42.377 18.766 42.590 18.894Q42.804 19.022 42.941 19.225Q43.077 19.429 43.077 19.678Q43.077 20.191 42.712 20.430Q42.346 20.669 41.809 20.669Q41.314 20.669 40.982 20.375L40.716 20.649Q40.695 20.669 40.668 20.669L40.620 20.669Q40.596 20.669 40.569 20.642Q40.541 20.615 40.541 20.594M44.233 19.760L44.233 17.863L43.594 17.863L43.594 17.641Q43.911 17.641 44.128 17.431Q44.346 17.221 44.446 16.911Q44.547 16.602 44.547 16.294L44.814 16.294L44.814 17.583L45.890 17.583L45.890 17.863L44.814 17.863L44.814 19.747Q44.814 20.023 44.918 20.222Q45.022 20.420 45.282 20.420Q45.439 20.420 45.545 20.316Q45.651 20.211 45.701 20.058Q45.750 19.904 45.750 19.747L45.750 19.333L46.017 19.333L46.017 19.760Q46.017 19.986 45.918 20.196Q45.819 20.406 45.634 20.538Q45.450 20.669 45.221 20.669Q44.783 20.669 44.508 20.432Q44.233 20.194 44.233 19.760\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-61.908 -30.29)\">\u003Cpath d=\"M49.595 19.873Q49.595 19.541 49.818 19.314Q50.042 19.087 50.386 18.959Q50.729 18.830 51.102 18.778Q51.474 18.725 51.779 18.725L51.779 18.472Q51.779 18.267 51.671 18.087Q51.563 17.908 51.382 17.805Q51.201 17.703 50.993 17.703Q50.586 17.703 50.350 17.795Q50.439 17.832 50.485 17.916Q50.531 18 50.531 18.102Q50.531 18.198 50.485 18.277Q50.439 18.355 50.358 18.400Q50.278 18.444 50.189 18.444Q50.039 18.444 49.938 18.347Q49.837 18.249 49.837 18.102Q49.837 17.480 50.993 17.480Q51.204 17.480 51.454 17.544Q51.703 17.607 51.905 17.726Q52.107 17.846 52.233 18.031Q52.360 18.215 52.360 18.458L52.360 20.034Q52.360 20.150 52.421 20.246Q52.483 20.341 52.596 20.341Q52.705 20.341 52.770 20.247Q52.835 20.153 52.835 20.034L52.835 19.586L53.101 19.586L53.101 20.034Q53.101 20.304 52.874 20.469Q52.647 20.635 52.367 20.635Q52.158 20.635 52.021 20.481Q51.885 20.328 51.861 20.112Q51.714 20.379 51.432 20.524Q51.150 20.669 50.825 20.669Q50.548 20.669 50.264 20.594Q49.981 20.519 49.788 20.340Q49.595 20.160 49.595 19.873M50.210 19.873Q50.210 20.047 50.311 20.177Q50.411 20.307 50.567 20.377Q50.722 20.447 50.887 20.447Q51.105 20.447 51.314 20.350Q51.522 20.252 51.650 20.071Q51.779 19.890 51.779 19.664L51.779 18.936Q51.454 18.936 51.088 19.027Q50.722 19.118 50.466 19.330Q50.210 19.541 50.210 19.873M53.518 19.090Q53.518 18.762 53.653 18.461Q53.788 18.161 54.024 17.940Q54.260 17.720 54.564 17.600Q54.868 17.480 55.193 17.480Q55.699 17.480 56.048 17.583Q56.396 17.685 56.396 18.061Q56.396 18.208 56.299 18.309Q56.201 18.410 56.055 18.410Q55.901 18.410 55.802 18.311Q55.702 18.212 55.702 18.061Q55.702 17.873 55.843 17.781Q55.641 17.730 55.200 17.730Q54.845 17.730 54.616 17.926Q54.387 18.123 54.286 18.432Q54.185 18.742 54.185 19.090Q54.185 19.439 54.311 19.745Q54.438 20.051 54.692 20.235Q54.947 20.420 55.303 20.420Q55.525 20.420 55.709 20.336Q55.894 20.252 56.029 20.097Q56.164 19.941 56.222 19.733Q56.236 19.678 56.290 19.678L56.403 19.678Q56.434 19.678 56.456 19.702Q56.478 19.726 56.478 19.760L56.478 19.781Q56.393 20.068 56.205 20.266Q56.017 20.464 55.752 20.567Q55.487 20.669 55.193 20.669Q54.763 20.669 54.375 20.463Q53.987 20.256 53.753 19.893Q53.518 19.531 53.518 19.090M57.593 19.760L57.593 17.863L56.953 17.863L56.953 17.641Q57.271 17.641 57.488 17.431Q57.705 17.221 57.806 16.911Q57.907 16.602 57.907 16.294L58.174 16.294L58.174 17.583L59.250 17.583L59.250 17.863L58.174 17.863L58.174 19.747Q58.174 20.023 58.278 20.222Q58.382 20.420 58.642 20.420Q58.799 20.420 58.905 20.316Q59.011 20.211 59.061 20.058Q59.110 19.904 59.110 19.747L59.110 19.333L59.377 19.333L59.377 19.760Q59.377 19.986 59.278 20.196Q59.179 20.406 58.994 20.538Q58.809 20.669 58.580 20.669Q58.143 20.669 57.868 20.432Q57.593 20.194 57.593 19.760M61.804 20.601L60.252 20.601L60.252 20.321Q60.477 20.321 60.626 20.287Q60.775 20.252 60.775 20.112L60.775 18.263Q60.775 18.075 60.727 17.991Q60.679 17.908 60.582 17.889Q60.484 17.870 60.272 17.870L60.272 17.590L61.328 17.515L61.328 20.112Q61.328 20.252 61.460 20.287Q61.592 20.321 61.804 20.321L61.804 20.601M60.532 16.294Q60.532 16.123 60.655 16.004Q60.778 15.884 60.949 15.884Q61.117 15.884 61.240 16.004Q61.363 16.123 61.363 16.294Q61.363 16.469 61.240 16.592Q61.117 16.715 60.949 16.715Q60.778 16.715 60.655 16.592Q60.532 16.469 60.532 16.294M62.409 19.118Q62.409 18.776 62.544 18.477Q62.679 18.178 62.918 17.954Q63.157 17.730 63.475 17.605Q63.793 17.480 64.124 17.480Q64.569 17.480 64.969 17.696Q65.368 17.911 65.603 18.289Q65.837 18.666 65.837 19.118Q65.837 19.459 65.695 19.743Q65.553 20.027 65.309 20.234Q65.064 20.440 64.755 20.555Q64.446 20.669 64.124 20.669Q63.694 20.669 63.292 20.468Q62.890 20.266 62.649 19.914Q62.409 19.562 62.409 19.118M64.124 20.420Q64.726 20.420 64.950 20.042Q65.174 19.664 65.174 19.032Q65.174 18.420 64.940 18.061Q64.705 17.703 64.124 17.703Q63.072 17.703 63.072 19.032Q63.072 19.664 63.297 20.042Q63.523 20.420 64.124 20.420M68.113 20.601L66.479 20.601L66.479 20.321Q66.708 20.321 66.857 20.287Q67.006 20.252 67.006 20.112L67.006 18.263Q67.006 17.993 66.898 17.932Q66.790 17.870 66.479 17.870L66.479 17.590L67.539 17.515L67.539 18.164Q67.710 17.856 68.014 17.685Q68.318 17.515 68.663 17.515Q69.169 17.515 69.453 17.738Q69.737 17.962 69.737 18.458L69.737 20.112Q69.737 20.249 69.885 20.285Q70.034 20.321 70.260 20.321L70.260 20.601L68.629 20.601L68.629 20.321Q68.858 20.321 69.007 20.287Q69.156 20.252 69.156 20.112L69.156 18.472Q69.156 18.137 69.036 17.937Q68.916 17.737 68.602 17.737Q68.332 17.737 68.098 17.873Q67.864 18.010 67.725 18.244Q67.587 18.478 67.587 18.752L67.587 20.112Q67.587 20.249 67.737 20.285Q67.888 20.321 68.113 20.321\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Heuristic search as decision-time planning. A lookahead tree is grown from the root (\u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.8333em;vertical-align:-0.15em;\">\u003C\u002Fspan>\u003Cspan class=\"mord\">\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0576em;\">S\u003C\u002Fspan>\u003Cspan class=\"msupsub\">\u003Cspan class=\"vlist-t vlist-t2\">\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.2806em;\">\u003Cspan style=\"top:-2.55em;margin-left:-0.0576em;margin-right:0.05em;\">\u003Cspan class=\"pstrut\" style=\"height:2.7em;\">\u003C\u002Fspan>\u003Cspan class=\"sizing reset-size6 size3 mtight\">\u003Cspan class=\"mord mathnormal mtight\">t\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"vlist-s\">​\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.15em;\">\u003Cspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>); an approximate value \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6679em;\">\u003C\u002Fspan>\u003Cspan class=\"mord accent\">\u003Cspan class=\"vlist-t\">\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.6679em;\">\u003Cspan style=\"top:-3em;\">\u003Cspan class=\"pstrut\" style=\"height:3em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0359em;\">v\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan style=\"top:-3.35em;\">\u003Cspan class=\"pstrut\" style=\"height:3em;\">\u003C\u002Fspan>\u003Cspan class=\"accent-body\" style=\"left:-0.2222em;\">\u003Cspan class=\"mord\">~\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> is applied at the leaves and backed up with expected max updates toward the root, where the best action is chosen. Backed-up values are then discarded.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:319.063px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 239.298 130.515\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg fill=\"var(--tk-bg)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath d=\"M56.248-63.334a8.536 8.536 0 1 0-17.072 0 8.536 8.536 0 0 0 17.072 0Zm-8.536 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-size=\"7\">\u003Cg transform=\"translate(-34.075 -66.134)\">\u003Cpath d=\"M48.026 4.945L48.026 3.882Q48.026 3.858 48.054 3.831Q48.081 3.804 48.105 3.804L48.214 3.804Q48.279 3.804 48.293 3.862Q48.389 4.296 48.635 4.547Q48.881 4.798 49.295 4.798Q49.636 4.798 49.889 4.665Q50.142 4.532 50.142 4.224Q50.142 4.067 50.048 3.952Q49.954 3.838 49.816 3.769Q49.677 3.701 49.510 3.663L48.929 3.564Q48.573 3.496 48.300 3.275Q48.026 3.055 48.026 2.713Q48.026 2.464 48.138 2.289Q48.249 2.115 48.435 2.016Q48.621 1.917 48.837 1.874Q49.052 1.831 49.295 1.831Q49.708 1.831 49.988 2.013L50.204 1.838Q50.214 1.835 50.221 1.833Q50.228 1.831 50.238 1.831L50.289 1.831Q50.316 1.831 50.340 1.855Q50.364 1.879 50.364 1.907L50.364 2.754Q50.364 2.775 50.340 2.802Q50.316 2.829 50.289 2.829L50.176 2.829Q50.149 2.829 50.123 2.804Q50.098 2.778 50.098 2.754Q50.098 2.518 49.992 2.354Q49.886 2.190 49.703 2.108Q49.520 2.026 49.288 2.026Q48.960 2.026 48.703 2.129Q48.447 2.231 48.447 2.508Q48.447 2.703 48.630 2.812Q48.813 2.922 49.042 2.963L49.616 3.069Q49.862 3.117 50.076 3.245Q50.289 3.373 50.426 3.576Q50.563 3.780 50.563 4.029Q50.563 4.542 50.197 4.781Q49.831 5.020 49.295 5.020Q48.799 5.020 48.467 4.726L48.201 5Q48.180 5.020 48.153 5.020L48.105 5.020Q48.081 5.020 48.054 4.993Q48.026 4.966 48.026 4.945M51.718 4.111L51.718 2.214L51.079 2.214L51.079 1.992Q51.397 1.992 51.614 1.782Q51.831 1.572 51.931 1.262Q52.032 0.953 52.032 0.645L52.299 0.645L52.299 1.934L53.376 1.934L53.376 2.214L52.299 2.214L52.299 4.098Q52.299 4.374 52.403 4.573Q52.507 4.771 52.767 4.771Q52.924 4.771 53.030 4.667Q53.136 4.562 53.186 4.409Q53.235 4.255 53.235 4.098L53.235 3.684L53.502 3.684L53.502 4.111Q53.502 4.337 53.403 4.547Q53.304 4.757 53.119 4.889Q52.935 5.020 52.706 5.020Q52.268 5.020 51.993 4.783Q51.718 4.545 51.718 4.111M54.370 4.224Q54.370 3.892 54.594 3.665Q54.818 3.438 55.161 3.310Q55.505 3.181 55.878 3.129Q56.250 3.076 56.554 3.076L56.554 2.823Q56.554 2.618 56.447 2.438Q56.339 2.259 56.158 2.156Q55.977 2.054 55.768 2.054Q55.361 2.054 55.126 2.146Q55.214 2.183 55.261 2.267Q55.307 2.351 55.307 2.453Q55.307 2.549 55.261 2.628Q55.214 2.706 55.134 2.751Q55.054 2.795 54.965 2.795Q54.815 2.795 54.714 2.698Q54.613 2.600 54.613 2.453Q54.613 1.831 55.768 1.831Q55.980 1.831 56.230 1.895Q56.479 1.958 56.681 2.077Q56.882 2.197 57.009 2.382Q57.135 2.566 57.135 2.809L57.135 4.385Q57.135 4.501 57.197 4.597Q57.258 4.692 57.371 4.692Q57.481 4.692 57.545 4.598Q57.610 4.504 57.610 4.385L57.610 3.937L57.877 3.937L57.877 4.385Q57.877 4.655 57.650 4.820Q57.422 4.986 57.142 4.986Q56.934 4.986 56.797 4.832Q56.660 4.679 56.636 4.463Q56.489 4.730 56.207 4.875Q55.925 5.020 55.601 5.020Q55.324 5.020 55.040 4.945Q54.756 4.870 54.563 4.691Q54.370 4.511 54.370 4.224M54.985 4.224Q54.985 4.398 55.086 4.528Q55.187 4.658 55.343 4.728Q55.498 4.798 55.662 4.798Q55.881 4.798 56.089 4.701Q56.298 4.603 56.426 4.422Q56.554 4.241 56.554 4.015L56.554 3.287Q56.230 3.287 55.864 3.378Q55.498 3.469 55.242 3.681Q54.985 3.892 54.985 4.224M58.820 4.111L58.820 2.214L58.181 2.214L58.181 1.992Q58.499 1.992 58.716 1.782Q58.933 1.572 59.034 1.262Q59.135 0.953 59.135 0.645L59.401 0.645L59.401 1.934L60.478 1.934L60.478 2.214L59.401 2.214L59.401 4.098Q59.401 4.374 59.506 4.573Q59.610 4.771 59.870 4.771Q60.027 4.771 60.133 4.667Q60.239 4.562 60.288 4.409Q60.338 4.255 60.338 4.098L60.338 3.684L60.605 3.684L60.605 4.111Q60.605 4.337 60.505 4.547Q60.406 4.757 60.222 4.889Q60.037 5.020 59.808 5.020Q59.371 5.020 59.096 4.783Q58.820 4.545 58.820 4.111M61.374 3.417Q61.374 3.096 61.498 2.807Q61.623 2.518 61.849 2.295Q62.074 2.071 62.370 1.951Q62.666 1.831 62.983 1.831Q63.312 1.831 63.573 1.931Q63.835 2.030 64.011 2.212Q64.187 2.395 64.281 2.653Q64.375 2.911 64.375 3.243Q64.375 3.335 64.293 3.356L62.037 3.356L62.037 3.417Q62.037 4.005 62.320 4.388Q62.604 4.771 63.171 4.771Q63.493 4.771 63.761 4.578Q64.029 4.385 64.118 4.070Q64.125 4.029 64.200 4.015L64.293 4.015Q64.375 4.039 64.375 4.111Q64.375 4.118 64.368 4.145Q64.255 4.542 63.884 4.781Q63.513 5.020 63.089 5.020Q62.652 5.020 62.252 4.812Q61.852 4.603 61.613 4.236Q61.374 3.869 61.374 3.417M62.044 3.147L63.858 3.147Q63.858 2.870 63.761 2.618Q63.664 2.365 63.465 2.209Q63.267 2.054 62.983 2.054Q62.707 2.054 62.493 2.212Q62.279 2.371 62.161 2.626Q62.044 2.881 62.044 3.147\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-34.075 -66.134)\">\u003Cpath d=\"M68.200 4.532Q68.391 4.798 68.996 4.798Q69.225 4.798 69.470 4.728Q69.714 4.658 69.876 4.503Q70.039 4.347 70.039 4.104Q70.039 3.930 69.888 3.822Q69.738 3.715 69.543 3.677L69.089 3.595Q68.819 3.540 68.631 3.352Q68.443 3.164 68.443 2.908Q68.443 2.583 68.629 2.346Q68.815 2.108 69.113 1.987Q69.410 1.866 69.731 1.866Q69.936 1.866 70.152 1.925Q70.367 1.985 70.509 2.120Q70.651 2.255 70.651 2.467Q70.651 2.635 70.557 2.761Q70.463 2.888 70.299 2.888Q70.199 2.888 70.126 2.823Q70.053 2.758 70.053 2.655Q70.053 2.535 70.136 2.438Q70.220 2.341 70.333 2.320Q70.176 2.088 69.718 2.088Q69.420 2.088 69.171 2.231Q68.921 2.375 68.921 2.655Q68.921 2.911 69.283 2.994L69.745 3.076Q70.059 3.137 70.288 3.346Q70.517 3.554 70.517 3.862Q70.517 4.125 70.362 4.376Q70.206 4.627 69.970 4.778Q69.577 5.020 68.990 5.020Q68.562 5.020 68.212 4.865Q67.862 4.709 67.862 4.344Q67.862 4.149 67.978 4.005Q68.094 3.862 68.289 3.862Q68.408 3.862 68.489 3.933Q68.569 4.005 68.569 4.125Q68.569 4.282 68.463 4.398Q68.357 4.515 68.200 4.532\" 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-bg)\">\u003Cpath d=\"M-17.73-29.191a8.536 8.536 0 1 0-17.07 0 8.536 8.536 0 0 0 17.07 0Zm-8.535 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-bg)\">\u003Cpath d=\"M56.248-29.191a8.536 8.536 0 1 0-17.072 0 8.536 8.536 0 0 0 17.072 0Zm-8.536 0\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-bg)\">\u003Cpath d=\"M130.225-29.191a8.536 8.536 0 1 0-17.071 0 8.536 8.536 0 0 0 17.071 0Zm-8.536 0\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"m39.599-59.59-57.933 26.738\" style=\"stroke-width:.8\"\u002F>\u003Cpath fill=\"none\" d=\"M47.712-54.398v16.471M55.825-59.59l57.933 26.738\"\u002F>\u003Cg transform=\"translate(-54.184 -57.593)\">\u003Cpath d=\"M48.085 4.224Q48.085 3.892 48.308 3.665Q48.532 3.438 48.876 3.310Q49.219 3.181 49.592 3.129Q49.964 3.076 50.269 3.076L50.269 2.823Q50.269 2.618 50.161 2.438Q50.053 2.259 49.872 2.156Q49.691 2.054 49.483 2.054Q49.076 2.054 48.840 2.146Q48.929 2.183 48.975 2.267Q49.021 2.351 49.021 2.453Q49.021 2.549 48.975 2.628Q48.929 2.706 48.848 2.751Q48.768 2.795 48.679 2.795Q48.529 2.795 48.428 2.698Q48.327 2.600 48.327 2.453Q48.327 1.831 49.483 1.831Q49.694 1.831 49.944 1.895Q50.193 1.958 50.395 2.077Q50.597 2.197 50.723 2.382Q50.850 2.566 50.850 2.809L50.850 4.385Q50.850 4.501 50.911 4.597Q50.973 4.692 51.086 4.692Q51.195 4.692 51.260 4.598Q51.325 4.504 51.325 4.385L51.325 3.937L51.591 3.937L51.591 4.385Q51.591 4.655 51.364 4.820Q51.137 4.986 50.857 4.986Q50.648 4.986 50.511 4.832Q50.375 4.679 50.351 4.463Q50.204 4.730 49.922 4.875Q49.640 5.020 49.315 5.020Q49.038 5.020 48.754 4.945Q48.471 4.870 48.278 4.691Q48.085 4.511 48.085 4.224M48.700 4.224Q48.700 4.398 48.801 4.528Q48.901 4.658 49.057 4.728Q49.212 4.798 49.377 4.798Q49.595 4.798 49.804 4.701Q50.012 4.603 50.140 4.422Q50.269 4.241 50.269 4.015L50.269 3.287Q49.944 3.287 49.578 3.378Q49.212 3.469 48.956 3.681Q48.700 3.892 48.700 4.224M55.020 4.952L52.490 4.952L52.490 4.672Q53.458 4.672 53.458 4.463L53.458 0.844Q53.065 1.032 52.442 1.032L52.442 0.751Q52.859 0.751 53.223 0.650Q53.587 0.550 53.844 0.304L53.970 0.304Q54.035 0.321 54.052 0.389L54.052 4.463Q54.052 4.672 55.020 4.672\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(7.8 -54.65)\">\u003Cpath d=\"M48.085 4.224Q48.085 3.892 48.308 3.665Q48.532 3.438 48.876 3.310Q49.219 3.181 49.592 3.129Q49.964 3.076 50.269 3.076L50.269 2.823Q50.269 2.618 50.161 2.438Q50.053 2.259 49.872 2.156Q49.691 2.054 49.483 2.054Q49.076 2.054 48.840 2.146Q48.929 2.183 48.975 2.267Q49.021 2.351 49.021 2.453Q49.021 2.549 48.975 2.628Q48.929 2.706 48.848 2.751Q48.768 2.795 48.679 2.795Q48.529 2.795 48.428 2.698Q48.327 2.600 48.327 2.453Q48.327 1.831 49.483 1.831Q49.694 1.831 49.944 1.895Q50.193 1.958 50.395 2.077Q50.597 2.197 50.723 2.382Q50.850 2.566 50.850 2.809L50.850 4.385Q50.850 4.501 50.911 4.597Q50.973 4.692 51.086 4.692Q51.195 4.692 51.260 4.598Q51.325 4.504 51.325 4.385L51.325 3.937L51.591 3.937L51.591 4.385Q51.591 4.655 51.364 4.820Q51.137 4.986 50.857 4.986Q50.648 4.986 50.511 4.832Q50.375 4.679 50.351 4.463Q50.204 4.730 49.922 4.875Q49.640 5.020 49.315 5.020Q49.038 5.020 48.754 4.945Q48.471 4.870 48.278 4.691Q48.085 4.511 48.085 4.224M48.700 4.224Q48.700 4.398 48.801 4.528Q48.901 4.658 49.057 4.728Q49.212 4.798 49.377 4.798Q49.595 4.798 49.804 4.701Q50.012 4.603 50.140 4.422Q50.269 4.241 50.269 4.015L50.269 3.287Q49.944 3.287 49.578 3.378Q49.212 3.469 48.956 3.681Q48.700 3.892 48.700 4.224M55.020 4.952L52.135 4.952L52.135 4.750Q52.135 4.720 52.162 4.692L53.410 3.475Q53.482 3.400 53.524 3.358Q53.567 3.315 53.646 3.236Q54.059 2.823 54.290 2.465Q54.521 2.108 54.521 1.684Q54.521 1.452 54.442 1.249Q54.363 1.045 54.222 0.895Q54.080 0.744 53.885 0.664Q53.690 0.584 53.458 0.584Q53.147 0.584 52.889 0.743Q52.630 0.902 52.501 1.179L52.521 1.179Q52.689 1.179 52.796 1.290Q52.904 1.401 52.904 1.565Q52.904 1.722 52.795 1.835Q52.685 1.948 52.521 1.948Q52.360 1.948 52.248 1.835Q52.135 1.722 52.135 1.565Q52.135 1.189 52.343 0.902Q52.552 0.615 52.887 0.459Q53.222 0.304 53.577 0.304Q54.001 0.304 54.380 0.462Q54.760 0.621 54.994 0.938Q55.228 1.254 55.228 1.684Q55.228 1.995 55.088 2.264Q54.948 2.532 54.743 2.737Q54.538 2.942 54.175 3.224Q53.813 3.506 53.704 3.602L52.849 4.330L53.492 4.330Q53.755 4.330 54.044 4.328Q54.333 4.327 54.551 4.318Q54.770 4.309 54.787 4.292Q54.849 4.227 54.886 4.060Q54.924 3.892 54.962 3.650L55.228 3.650\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(46.212 -57.593)\">\u003Cpath d=\"M48.085 4.224Q48.085 3.892 48.308 3.665Q48.532 3.438 48.876 3.310Q49.219 3.181 49.592 3.129Q49.964 3.076 50.269 3.076L50.269 2.823Q50.269 2.618 50.161 2.438Q50.053 2.259 49.872 2.156Q49.691 2.054 49.483 2.054Q49.076 2.054 48.840 2.146Q48.929 2.183 48.975 2.267Q49.021 2.351 49.021 2.453Q49.021 2.549 48.975 2.628Q48.929 2.706 48.848 2.751Q48.768 2.795 48.679 2.795Q48.529 2.795 48.428 2.698Q48.327 2.600 48.327 2.453Q48.327 1.831 49.483 1.831Q49.694 1.831 49.944 1.895Q50.193 1.958 50.395 2.077Q50.597 2.197 50.723 2.382Q50.850 2.566 50.850 2.809L50.850 4.385Q50.850 4.501 50.911 4.597Q50.973 4.692 51.086 4.692Q51.195 4.692 51.260 4.598Q51.325 4.504 51.325 4.385L51.325 3.937L51.591 3.937L51.591 4.385Q51.591 4.655 51.364 4.820Q51.137 4.986 50.857 4.986Q50.648 4.986 50.511 4.832Q50.375 4.679 50.351 4.463Q50.204 4.730 49.922 4.875Q49.640 5.020 49.315 5.020Q49.038 5.020 48.754 4.945Q48.471 4.870 48.278 4.691Q48.085 4.511 48.085 4.224M48.700 4.224Q48.700 4.398 48.801 4.528Q48.901 4.658 49.057 4.728Q49.212 4.798 49.377 4.798Q49.595 4.798 49.804 4.701Q50.012 4.603 50.140 4.422Q50.269 4.241 50.269 4.015L50.269 3.287Q49.944 3.287 49.578 3.378Q49.212 3.469 48.956 3.681Q48.700 3.892 48.700 4.224M52.490 4.405Q52.610 4.562 52.801 4.661Q52.993 4.761 53.208 4.800Q53.423 4.839 53.646 4.839Q53.943 4.839 54.138 4.684Q54.333 4.528 54.423 4.274Q54.514 4.019 54.514 3.735Q54.514 3.441 54.421 3.190Q54.329 2.939 54.131 2.783Q53.933 2.628 53.639 2.628L53.123 2.628Q53.095 2.628 53.070 2.602Q53.044 2.577 53.044 2.553L53.044 2.481Q53.044 2.450 53.070 2.428Q53.095 2.406 53.123 2.406L53.564 2.375Q53.926 2.375 54.146 2.018Q54.367 1.660 54.367 1.271Q54.367 0.943 54.172 0.739Q53.977 0.536 53.646 0.536Q53.358 0.536 53.106 0.620Q52.853 0.703 52.689 0.891Q52.836 0.891 52.936 1.006Q53.037 1.120 53.037 1.271Q53.037 1.421 52.931 1.531Q52.825 1.640 52.668 1.640Q52.507 1.640 52.398 1.531Q52.289 1.421 52.289 1.271Q52.289 0.946 52.497 0.727Q52.706 0.509 53.022 0.406Q53.338 0.304 53.646 0.304Q53.963 0.304 54.292 0.408Q54.620 0.512 54.847 0.734Q55.074 0.956 55.074 1.271Q55.074 1.705 54.787 2.030Q54.500 2.354 54.066 2.501Q54.377 2.566 54.657 2.732Q54.938 2.898 55.115 3.156Q55.293 3.414 55.293 3.735Q55.293 4.145 55.049 4.455Q54.804 4.764 54.423 4.928Q54.042 5.092 53.646 5.092Q53.276 5.092 52.919 4.979Q52.562 4.867 52.318 4.617Q52.073 4.368 52.073 3.998Q52.073 3.827 52.190 3.715Q52.306 3.602 52.477 3.602Q52.586 3.602 52.677 3.653Q52.767 3.704 52.822 3.797Q52.877 3.889 52.877 3.998Q52.877 4.166 52.764 4.285Q52.651 4.405 52.490 4.405\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-109.982 -32.432)\">\u003Cpath d=\"M50.778 5.092Q50.265 5.092 49.797 4.899Q49.329 4.706 48.970 4.364Q48.611 4.022 48.406 3.561Q48.201 3.099 48.201 2.587Q48.201 1.900 48.549 1.310Q48.898 0.721 49.493 0.375Q50.087 0.030 50.778 0.030Q51.468 0.030 52.063 0.375Q52.658 0.721 53.006 1.310Q53.355 1.900 53.355 2.587Q53.355 2.952 53.244 3.305Q53.133 3.657 52.924 3.966Q52.716 4.275 52.432 4.508Q52.149 4.740 51.793 4.890Q51.879 5.065 51.976 5.208Q52.073 5.352 52.203 5.442Q52.333 5.533 52.507 5.533Q52.777 5.533 52.989 5.366Q53.201 5.198 53.201 4.938Q53.225 4.853 53.297 4.853Q53.345 4.853 53.370 4.884Q53.396 4.914 53.396 4.966Q53.396 5.273 53.299 5.583Q53.201 5.892 52.991 6.100Q52.781 6.309 52.460 6.309Q52.060 6.309 51.872 6.035Q51.684 5.762 51.561 5.280L51.492 4.993Q51.137 5.092 50.778 5.092M50.351 4.477Q50.351 4.644 50.477 4.742Q50.604 4.839 50.778 4.839Q51.116 4.839 51.414 4.713Q51.321 4.429 51.181 4.267Q51.041 4.104 50.778 4.104Q50.610 4.104 50.481 4.210Q50.351 4.316 50.351 4.477M50.129 4.477Q50.129 4.224 50.325 4.053Q50.522 3.882 50.778 3.882Q51.086 3.882 51.285 4.074Q51.485 4.265 51.653 4.597Q51.991 4.391 52.202 4.079Q52.412 3.766 52.509 3.385Q52.607 3.004 52.607 2.587Q52.607 2.149 52.497 1.741Q52.388 1.332 52.159 1.001Q51.930 0.669 51.583 0.476Q51.236 0.283 50.778 0.283Q50.323 0.283 49.975 0.478Q49.626 0.673 49.400 1.001Q49.175 1.329 49.062 1.739Q48.949 2.149 48.949 2.587Q48.949 3.052 49.076 3.482Q49.202 3.913 49.483 4.244Q49.763 4.576 50.190 4.737Q50.129 4.620 50.129 4.477M59.333 4.145L54.500 4.145Q54.432 4.135 54.386 4.089Q54.339 4.043 54.339 3.971Q54.339 3.906 54.386 3.860Q54.432 3.814 54.500 3.804L59.333 3.804Q59.401 3.814 59.448 3.860Q59.494 3.906 59.494 3.971Q59.494 4.043 59.448 4.089Q59.401 4.135 59.333 4.145M59.333 2.607L54.500 2.607Q54.432 2.597 54.386 2.551Q54.339 2.505 54.339 2.433Q54.339 2.289 54.500 2.265L59.333 2.265Q59.494 2.289 59.494 2.433Q59.494 2.505 59.448 2.551Q59.401 2.597 59.333 2.607M61.979 5.092Q61.343 5.092 60.979 4.747Q60.615 4.402 60.480 3.877Q60.345 3.352 60.345 2.727Q60.345 1.702 60.700 1.003Q61.056 0.304 61.979 0.304Q62.905 0.304 63.257 1.003Q63.609 1.702 63.609 2.727Q63.609 3.352 63.474 3.877Q63.339 4.402 62.977 4.747Q62.614 5.092 61.979 5.092M61.979 4.867Q62.416 4.867 62.630 4.492Q62.843 4.118 62.893 3.651Q62.942 3.185 62.942 2.607Q62.942 2.054 62.893 1.626Q62.843 1.199 62.631 0.864Q62.420 0.529 61.979 0.529Q61.637 0.529 61.433 0.736Q61.230 0.943 61.143 1.255Q61.056 1.568 61.034 1.884Q61.011 2.201 61.011 2.607Q61.011 3.024 61.034 3.366Q61.056 3.708 61.145 4.056Q61.233 4.405 61.439 4.636Q61.644 4.867 61.979 4.867M64.686 4.532Q64.686 4.364 64.809 4.241Q64.932 4.118 65.106 4.118Q65.274 4.118 65.397 4.241Q65.520 4.364 65.520 4.532Q65.520 4.706 65.397 4.829Q65.274 4.952 65.106 4.952Q64.932 4.952 64.809 4.829Q64.686 4.706 64.686 4.532M67.670 4.744Q67.670 4.238 67.799 3.730Q67.929 3.223 68.167 2.761Q68.404 2.300 68.739 1.879L69.385 1.066L68.572 1.066Q67.987 1.066 67.591 1.074Q67.194 1.083 67.170 1.103Q67.068 1.220 66.989 1.746L66.723 1.746L66.969 0.222L67.235 0.222L67.235 0.242Q67.235 0.310 67.311 0.353Q67.386 0.396 67.464 0.403Q67.656 0.427 67.851 0.433Q68.045 0.440 68.237 0.442Q68.428 0.444 68.627 0.444L70.048 0.444L70.048 0.632Q70.038 0.680 70.028 0.690L68.972 2.013Q68.753 2.286 68.630 2.599Q68.507 2.911 68.449 3.260Q68.391 3.609 68.377 3.940Q68.363 4.272 68.363 4.744Q68.363 4.894 68.264 4.993Q68.165 5.092 68.018 5.092Q67.868 5.092 67.769 4.993Q67.670 4.894 67.670 4.744\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(-36.006 -32.432)\">\u003Cpath d=\"M50.778 5.092Q50.265 5.092 49.797 4.899Q49.329 4.706 48.970 4.364Q48.611 4.022 48.406 3.561Q48.201 3.099 48.201 2.587Q48.201 1.900 48.549 1.310Q48.898 0.721 49.493 0.375Q50.087 0.030 50.778 0.030Q51.468 0.030 52.063 0.375Q52.658 0.721 53.006 1.310Q53.355 1.900 53.355 2.587Q53.355 2.952 53.244 3.305Q53.133 3.657 52.924 3.966Q52.716 4.275 52.432 4.508Q52.149 4.740 51.793 4.890Q51.879 5.065 51.976 5.208Q52.073 5.352 52.203 5.442Q52.333 5.533 52.507 5.533Q52.777 5.533 52.989 5.366Q53.201 5.198 53.201 4.938Q53.225 4.853 53.297 4.853Q53.345 4.853 53.370 4.884Q53.396 4.914 53.396 4.966Q53.396 5.273 53.299 5.583Q53.201 5.892 52.991 6.100Q52.781 6.309 52.460 6.309Q52.060 6.309 51.872 6.035Q51.684 5.762 51.561 5.280L51.492 4.993Q51.137 5.092 50.778 5.092M50.351 4.477Q50.351 4.644 50.477 4.742Q50.604 4.839 50.778 4.839Q51.116 4.839 51.414 4.713Q51.321 4.429 51.181 4.267Q51.041 4.104 50.778 4.104Q50.610 4.104 50.481 4.210Q50.351 4.316 50.351 4.477M50.129 4.477Q50.129 4.224 50.325 4.053Q50.522 3.882 50.778 3.882Q51.086 3.882 51.285 4.074Q51.485 4.265 51.653 4.597Q51.991 4.391 52.202 4.079Q52.412 3.766 52.509 3.385Q52.607 3.004 52.607 2.587Q52.607 2.149 52.497 1.741Q52.388 1.332 52.159 1.001Q51.930 0.669 51.583 0.476Q51.236 0.283 50.778 0.283Q50.323 0.283 49.975 0.478Q49.626 0.673 49.400 1.001Q49.175 1.329 49.062 1.739Q48.949 2.149 48.949 2.587Q48.949 3.052 49.076 3.482Q49.202 3.913 49.483 4.244Q49.763 4.576 50.190 4.737Q50.129 4.620 50.129 4.477M59.333 4.145L54.500 4.145Q54.432 4.135 54.386 4.089Q54.339 4.043 54.339 3.971Q54.339 3.906 54.386 3.860Q54.432 3.814 54.500 3.804L59.333 3.804Q59.401 3.814 59.448 3.860Q59.494 3.906 59.494 3.971Q59.494 4.043 59.448 4.089Q59.401 4.135 59.333 4.145M59.333 2.607L54.500 2.607Q54.432 2.597 54.386 2.551Q54.339 2.505 54.339 2.433Q54.339 2.289 54.500 2.265L59.333 2.265Q59.494 2.289 59.494 2.433Q59.494 2.505 59.448 2.551Q59.401 2.597 59.333 2.607M61.979 5.092Q61.343 5.092 60.979 4.747Q60.615 4.402 60.480 3.877Q60.345 3.352 60.345 2.727Q60.345 1.702 60.700 1.003Q61.056 0.304 61.979 0.304Q62.905 0.304 63.257 1.003Q63.609 1.702 63.609 2.727Q63.609 3.352 63.474 3.877Q63.339 4.402 62.977 4.747Q62.614 5.092 61.979 5.092M61.979 4.867Q62.416 4.867 62.630 4.492Q62.843 4.118 62.893 3.651Q62.942 3.185 62.942 2.607Q62.942 2.054 62.893 1.626Q62.843 1.199 62.631 0.864Q62.420 0.529 61.979 0.529Q61.637 0.529 61.433 0.736Q61.230 0.943 61.143 1.255Q61.056 1.568 61.034 1.884Q61.011 2.201 61.011 2.607Q61.011 3.024 61.034 3.366Q61.056 3.708 61.145 4.056Q61.233 4.405 61.439 4.636Q61.644 4.867 61.979 4.867M64.686 4.532Q64.686 4.364 64.809 4.241Q64.932 4.118 65.106 4.118Q65.274 4.118 65.397 4.241Q65.520 4.364 65.520 4.532Q65.520 4.706 65.397 4.829Q65.274 4.952 65.106 4.952Q64.932 4.952 64.809 4.829Q64.686 4.706 64.686 4.532M67.208 4.638Q67.328 4.754 67.505 4.796Q67.683 4.839 67.899 4.839Q68.138 4.839 68.348 4.730Q68.558 4.620 68.712 4.438Q68.866 4.255 68.965 4.022Q69.132 3.595 69.132 2.775Q68.982 3.069 68.719 3.248Q68.456 3.428 68.138 3.428Q67.704 3.428 67.357 3.219Q67.010 3.011 66.812 2.650Q66.613 2.289 66.613 1.866Q66.613 1.531 66.743 1.242Q66.873 0.953 67.104 0.739Q67.335 0.526 67.634 0.415Q67.933 0.304 68.264 0.304Q69.122 0.304 69.478 1.018Q69.833 1.732 69.833 2.689Q69.833 3.106 69.705 3.534Q69.577 3.961 69.320 4.316Q69.064 4.672 68.702 4.882Q68.339 5.092 67.899 5.092Q67.444 5.092 67.126 4.904Q66.808 4.716 66.808 4.292Q66.808 4.142 66.907 4.043Q67.006 3.944 67.157 3.944Q67.225 3.944 67.292 3.971Q67.358 3.998 67.403 4.043Q67.447 4.087 67.475 4.154Q67.502 4.221 67.502 4.292Q67.502 4.422 67.422 4.520Q67.341 4.617 67.208 4.638M68.179 3.202Q68.473 3.202 68.688 3.024Q68.903 2.847 69.011 2.571Q69.119 2.296 69.119 2.006Q69.119 1.961 69.117 1.934Q69.115 1.907 69.112 1.872Q69.115 1.862 69.117 1.855Q69.119 1.848 69.119 1.838Q69.119 1.336 68.920 0.936Q68.722 0.536 68.264 0.536Q67.697 0.536 67.504 0.895Q67.311 1.254 67.311 1.866Q67.311 2.252 67.365 2.535Q67.420 2.819 67.615 3.011Q67.810 3.202 68.179 3.202\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg transform=\"translate(87.468 -32.432)\">\u003Cpath d=\"M50.778 5.092Q50.265 5.092 49.797 4.899Q49.329 4.706 48.970 4.364Q48.611 4.022 48.406 3.561Q48.201 3.099 48.201 2.587Q48.201 1.900 48.549 1.310Q48.898 0.721 49.493 0.375Q50.087 0.030 50.778 0.030Q51.468 0.030 52.063 0.375Q52.658 0.721 53.006 1.310Q53.355 1.900 53.355 2.587Q53.355 2.952 53.244 3.305Q53.133 3.657 52.924 3.966Q52.716 4.275 52.432 4.508Q52.149 4.740 51.793 4.890Q51.879 5.065 51.976 5.208Q52.073 5.352 52.203 5.442Q52.333 5.533 52.507 5.533Q52.777 5.533 52.989 5.366Q53.201 5.198 53.201 4.938Q53.225 4.853 53.297 4.853Q53.345 4.853 53.370 4.884Q53.396 4.914 53.396 4.966Q53.396 5.273 53.299 5.583Q53.201 5.892 52.991 6.100Q52.781 6.309 52.460 6.309Q52.060 6.309 51.872 6.035Q51.684 5.762 51.561 5.280L51.492 4.993Q51.137 5.092 50.778 5.092M50.351 4.477Q50.351 4.644 50.477 4.742Q50.604 4.839 50.778 4.839Q51.116 4.839 51.414 4.713Q51.321 4.429 51.181 4.267Q51.041 4.104 50.778 4.104Q50.610 4.104 50.481 4.210Q50.351 4.316 50.351 4.477M50.129 4.477Q50.129 4.224 50.325 4.053Q50.522 3.882 50.778 3.882Q51.086 3.882 51.285 4.074Q51.485 4.265 51.653 4.597Q51.991 4.391 52.202 4.079Q52.412 3.766 52.509 3.385Q52.607 3.004 52.607 2.587Q52.607 2.149 52.497 1.741Q52.388 1.332 52.159 1.001Q51.930 0.669 51.583 0.476Q51.236 0.283 50.778 0.283Q50.323 0.283 49.975 0.478Q49.626 0.673 49.400 1.001Q49.175 1.329 49.062 1.739Q48.949 2.149 48.949 2.587Q48.949 3.052 49.076 3.482Q49.202 3.913 49.483 4.244Q49.763 4.576 50.190 4.737Q50.129 4.620 50.129 4.477M59.333 4.145L54.500 4.145Q54.432 4.135 54.386 4.089Q54.339 4.043 54.339 3.971Q54.339 3.906 54.386 3.860Q54.432 3.814 54.500 3.804L59.333 3.804Q59.401 3.814 59.448 3.860Q59.494 3.906 59.494 3.971Q59.494 4.043 59.448 4.089Q59.401 4.135 59.333 4.145M59.333 2.607L54.500 2.607Q54.432 2.597 54.386 2.551Q54.339 2.505 54.339 2.433Q54.339 2.289 54.500 2.265L59.333 2.265Q59.494 2.289 59.494 2.433Q59.494 2.505 59.448 2.551Q59.401 2.597 59.333 2.607M61.979 5.092Q61.343 5.092 60.979 4.747Q60.615 4.402 60.480 3.877Q60.345 3.352 60.345 2.727Q60.345 1.702 60.700 1.003Q61.056 0.304 61.979 0.304Q62.905 0.304 63.257 1.003Q63.609 1.702 63.609 2.727Q63.609 3.352 63.474 3.877Q63.339 4.402 62.977 4.747Q62.614 5.092 61.979 5.092M61.979 4.867Q62.416 4.867 62.630 4.492Q62.843 4.118 62.893 3.651Q62.942 3.185 62.942 2.607Q62.942 2.054 62.893 1.626Q62.843 1.199 62.631 0.864Q62.420 0.529 61.979 0.529Q61.637 0.529 61.433 0.736Q61.230 0.943 61.143 1.255Q61.056 1.568 61.034 1.884Q61.011 2.201 61.011 2.607Q61.011 3.024 61.034 3.366Q61.056 3.708 61.145 4.056Q61.233 4.405 61.439 4.636Q61.644 4.867 61.979 4.867M64.686 4.532Q64.686 4.364 64.809 4.241Q64.932 4.118 65.106 4.118Q65.274 4.118 65.397 4.241Q65.520 4.364 65.520 4.532Q65.520 4.706 65.397 4.829Q65.274 4.952 65.106 4.952Q64.932 4.952 64.809 4.829Q64.686 4.706 64.686 4.532M67.041 4.190L67.010 4.190Q67.147 4.487 67.444 4.663Q67.741 4.839 68.069 4.839Q68.432 4.839 68.659 4.661Q68.886 4.484 68.980 4.195Q69.074 3.906 69.074 3.544Q69.074 3.229 69.020 2.944Q68.965 2.659 68.792 2.453Q68.620 2.248 68.305 2.248Q68.032 2.248 67.849 2.315Q67.666 2.382 67.562 2.471Q67.458 2.559 67.362 2.669Q67.266 2.778 67.222 2.788L67.143 2.788Q67.071 2.771 67.054 2.700L67.054 0.382Q67.054 0.348 67.078 0.326Q67.102 0.304 67.136 0.304L67.164 0.304Q67.451 0.420 67.719 0.474Q67.987 0.529 68.264 0.529Q68.541 0.529 68.811 0.474Q69.081 0.420 69.361 0.304L69.385 0.304Q69.420 0.304 69.443 0.327Q69.467 0.351 69.467 0.382L69.467 0.451Q69.467 0.478 69.447 0.498Q69.173 0.813 68.789 0.989Q68.404 1.165 67.991 1.165Q67.652 1.165 67.335 1.079L67.335 2.361Q67.731 2.026 68.305 2.026Q68.709 2.026 69.045 2.236Q69.382 2.447 69.575 2.799Q69.768 3.151 69.768 3.551Q69.768 3.882 69.628 4.168Q69.488 4.453 69.243 4.663Q68.999 4.873 68.697 4.983Q68.394 5.092 68.076 5.092Q67.717 5.092 67.391 4.928Q67.065 4.764 66.870 4.472Q66.675 4.180 66.675 3.817Q66.675 3.667 66.781 3.561Q66.887 3.455 67.041 3.455Q67.194 3.455 67.299 3.559Q67.403 3.663 67.403 3.817Q67.403 3.974 67.299 4.082Q67.194 4.190 67.041 4.190\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M-31.956 36.25h11.381V24.869h-11.38Z\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M42.022 36.25h11.38V24.869h-11.38Z\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-soft-neutral)\">\u003Cpath d=\"M115.999 36.25h11.38V24.869H116Z\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-dasharray:3.0,3.0\">\u003Cpath fill=\"none\" d=\"M-26.265-20.455v43.124\"\u002F>\u003Cpath stroke=\"none\" d=\"m-26.265 24.669 1.6-3.2-1.6 1.2-1.6-1.2\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-dasharray:3.0,3.0\">\u003Cpath fill=\"none\" d=\"M47.712-20.455v43.124\"\u002F>\u003Cpath stroke=\"none\" d=\"m47.712 24.669 1.6-3.2-1.6 1.2-1.6-1.2\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-dasharray:3.0,3.0\">\u003Cpath fill=\"none\" d=\"M121.69-20.455v43.124\"\u002F>\u003Cpath stroke=\"none\" d=\"m121.69 24.669 1.6-3.2-1.6 1.2-1.6-1.2\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(13.492 4.595)\">\u003Cpath d=\"M49.824 4.952L48.091 4.952L48.091 4.672Q48.317 4.672 48.466 4.638Q48.614 4.603 48.614 4.463L48.614 2.214L48.026 2.214L48.026 1.934L48.614 1.934L48.614 1.117Q48.614 0.799 48.792 0.551Q48.970 0.304 49.260 0.163Q49.551 0.023 49.862 0.023Q50.118 0.023 50.322 0.165Q50.525 0.307 50.525 0.550Q50.525 0.686 50.426 0.785Q50.327 0.885 50.190 0.885Q50.053 0.885 49.954 0.785Q49.855 0.686 49.855 0.550Q49.855 0.369 49.995 0.276Q49.917 0.249 49.817 0.249Q49.609 0.249 49.455 0.382Q49.301 0.515 49.221 0.719Q49.141 0.922 49.141 1.131L49.141 1.934L50.029 1.934L50.029 2.214L49.168 2.214L49.168 4.463Q49.168 4.672 49.824 4.672L49.824 4.952M50.463 3.469Q50.463 3.127 50.598 2.828Q50.733 2.529 50.973 2.305Q51.212 2.081 51.530 1.956Q51.848 1.831 52.179 1.831Q52.624 1.831 53.024 2.047Q53.423 2.262 53.658 2.640Q53.892 3.017 53.892 3.469Q53.892 3.810 53.750 4.094Q53.608 4.378 53.364 4.585Q53.119 4.791 52.810 4.906Q52.501 5.020 52.179 5.020Q51.749 5.020 51.347 4.819Q50.945 4.617 50.704 4.265Q50.463 3.913 50.463 3.469M52.179 4.771Q52.781 4.771 53.005 4.393Q53.229 4.015 53.229 3.383Q53.229 2.771 52.994 2.412Q52.760 2.054 52.179 2.054Q51.127 2.054 51.127 3.383Q51.127 4.015 51.352 4.393Q51.578 4.771 52.179 4.771M56.154 4.952L54.551 4.952L54.551 4.672Q54.777 4.672 54.926 4.638Q55.074 4.603 55.074 4.463L55.074 0.844Q55.074 0.574 54.967 0.512Q54.859 0.451 54.551 0.451L54.551 0.170L55.628 0.095L55.628 4.463Q55.628 4.600 55.778 4.636Q55.929 4.672 56.154 4.672L56.154 4.952M58.417 4.952L56.814 4.952L56.814 4.672Q57.040 4.672 57.188 4.638Q57.337 4.603 57.337 4.463L57.337 0.844Q57.337 0.574 57.229 0.512Q57.122 0.451 56.814 0.451L56.814 0.170L57.891 0.095L57.891 4.463Q57.891 4.600 58.041 4.636Q58.191 4.672 58.417 4.672L58.417 4.952M58.971 3.469Q58.971 3.127 59.106 2.828Q59.241 2.529 59.480 2.305Q59.719 2.081 60.037 1.956Q60.355 1.831 60.687 1.831Q61.131 1.831 61.531 2.047Q61.931 2.262 62.165 2.640Q62.399 3.017 62.399 3.469Q62.399 3.810 62.257 4.094Q62.115 4.378 61.871 4.585Q61.627 4.791 61.317 4.906Q61.008 5.020 60.687 5.020Q60.256 5.020 59.854 4.819Q59.453 4.617 59.212 4.265Q58.971 3.913 58.971 3.469M60.687 4.771Q61.288 4.771 61.512 4.393Q61.736 4.015 61.736 3.383Q61.736 2.771 61.502 2.412Q61.268 2.054 60.687 2.054Q59.634 2.054 59.634 3.383Q59.634 4.015 59.859 4.393Q60.085 4.771 60.687 4.771\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 4.595)\">\u003Cpath d=\"M64.178 4.925L63.197 2.426Q63.136 2.283 63.018 2.248Q62.900 2.214 62.684 2.214L62.684 1.934L64.164 1.934L64.164 2.214Q63.785 2.214 63.785 2.375Q63.785 2.385 63.799 2.426L64.513 4.258L65.186 2.553Q65.156 2.481 65.156 2.453Q65.156 2.426 65.128 2.426Q65.067 2.279 64.949 2.247Q64.831 2.214 64.619 2.214L64.619 1.934L66.017 1.934L66.017 2.214Q65.641 2.214 65.641 2.375Q65.641 2.406 65.648 2.426L66.403 4.364L67.090 2.614Q67.111 2.563 67.111 2.508Q67.111 2.368 66.998 2.291Q66.885 2.214 66.745 2.214L66.745 1.934L67.965 1.934L67.965 2.214Q67.760 2.214 67.605 2.320Q67.449 2.426 67.377 2.614L66.472 4.925Q66.437 5.020 66.325 5.020L66.256 5.020Q66.147 5.020 66.109 4.925L65.327 2.922L64.540 4.925Q64.506 5.020 64.393 5.020L64.325 5.020Q64.216 5.020 64.178 4.925\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 4.595)\">\u003Cpath d=\"M72.943 4.952L71.207 4.952L71.207 4.672Q71.436 4.672 71.585 4.638Q71.733 4.603 71.733 4.463L71.733 2.614Q71.733 2.344 71.626 2.283Q71.518 2.221 71.207 2.221L71.207 1.941L72.236 1.866L72.236 2.573Q72.366 2.265 72.608 2.066Q72.851 1.866 73.169 1.866Q73.388 1.866 73.559 1.990Q73.730 2.115 73.730 2.327Q73.730 2.464 73.630 2.563Q73.531 2.662 73.398 2.662Q73.261 2.662 73.162 2.563Q73.063 2.464 73.063 2.327Q73.063 2.187 73.162 2.088Q72.872 2.088 72.672 2.284Q72.472 2.481 72.379 2.775Q72.287 3.069 72.287 3.349L72.287 4.463Q72.287 4.672 72.943 4.672L72.943 4.952M74.273 3.469Q74.273 3.127 74.408 2.828Q74.543 2.529 74.782 2.305Q75.022 2.081 75.339 1.956Q75.657 1.831 75.989 1.831Q76.433 1.831 76.833 2.047Q77.233 2.262 77.467 2.640Q77.701 3.017 77.701 3.469Q77.701 3.810 77.559 4.094Q77.418 4.378 77.173 4.585Q76.929 4.791 76.619 4.906Q76.310 5.020 75.989 5.020Q75.558 5.020 75.157 4.819Q74.755 4.617 74.514 4.265Q74.273 3.913 74.273 3.469M75.989 4.771Q76.590 4.771 76.814 4.393Q77.038 4.015 77.038 3.383Q77.038 2.771 76.804 2.412Q76.570 2.054 75.989 2.054Q74.936 2.054 74.936 3.383Q74.936 4.015 75.162 4.393Q75.387 4.771 75.989 4.771M79.964 4.952L78.361 4.952L78.361 4.672Q78.587 4.672 78.735 4.638Q78.884 4.603 78.884 4.463L78.884 0.844Q78.884 0.574 78.776 0.512Q78.669 0.451 78.361 0.451L78.361 0.170L79.438 0.095L79.438 4.463Q79.438 4.600 79.588 4.636Q79.738 4.672 79.964 4.672L79.964 4.952M82.227 4.952L80.624 4.952L80.624 4.672Q80.849 4.672 80.998 4.638Q81.147 4.603 81.147 4.463L81.147 0.844Q81.147 0.574 81.039 0.512Q80.931 0.451 80.624 0.451L80.624 0.170L81.700 0.095L81.700 4.463Q81.700 4.600 81.851 4.636Q82.001 4.672 82.227 4.672L82.227 4.952M82.780 3.469Q82.780 3.127 82.915 2.828Q83.050 2.529 83.290 2.305Q83.529 2.081 83.847 1.956Q84.165 1.831 84.496 1.831Q84.941 1.831 85.340 2.047Q85.740 2.262 85.974 2.640Q86.209 3.017 86.209 3.469Q86.209 3.810 86.067 4.094Q85.925 4.378 85.681 4.585Q85.436 4.791 85.127 4.906Q84.817 5.020 84.496 5.020Q84.066 5.020 83.664 4.819Q83.262 4.617 83.021 4.265Q82.780 3.913 82.780 3.469M84.496 4.771Q85.098 4.771 85.322 4.393Q85.546 4.015 85.546 3.383Q85.546 2.771 85.311 2.412Q85.077 2.054 84.496 2.054Q83.443 2.054 83.443 3.383Q83.443 4.015 83.669 4.393Q83.895 4.771 84.496 4.771M87.378 4.118L87.378 2.614Q87.378 2.344 87.270 2.283Q87.162 2.221 86.851 2.221L86.851 1.941L87.959 1.866L87.959 4.098L87.959 4.118Q87.959 4.398 88.010 4.542Q88.061 4.685 88.203 4.742Q88.345 4.798 88.632 4.798Q88.885 4.798 89.090 4.658Q89.295 4.518 89.411 4.292Q89.527 4.067 89.527 3.817L89.527 2.614Q89.527 2.344 89.420 2.283Q89.312 2.221 89.001 2.221L89.001 1.941L90.108 1.866L90.108 4.279Q90.108 4.470 90.161 4.552Q90.214 4.634 90.315 4.653Q90.416 4.672 90.631 4.672L90.631 4.952L89.555 5.020L89.555 4.456Q89.445 4.638 89.300 4.761Q89.155 4.884 88.969 4.952Q88.782 5.020 88.581 5.020Q87.378 5.020 87.378 4.118M91.746 4.111L91.746 2.214L91.107 2.214L91.107 1.992Q91.424 1.992 91.641 1.782Q91.858 1.572 91.959 1.262Q92.060 0.953 92.060 0.645L92.327 0.645L92.327 1.934L93.403 1.934L93.403 2.214L92.327 2.214L92.327 4.098Q92.327 4.374 92.431 4.573Q92.535 4.771 92.795 4.771Q92.952 4.771 93.058 4.667Q93.164 4.562 93.214 4.409Q93.263 4.255 93.263 4.098L93.263 3.684L93.530 3.684L93.530 4.111Q93.530 4.337 93.431 4.547Q93.332 4.757 93.147 4.889Q92.962 5.020 92.733 5.020Q92.296 5.020 92.021 4.783Q91.746 4.545 91.746 4.111\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 4.595)\">\u003Cpath d=\"M98.698 6.309L97.068 6.309L97.068 6.029Q97.297 6.029 97.446 5.994Q97.594 5.960 97.594 5.820L97.594 2.474Q97.594 2.303 97.458 2.262Q97.321 2.221 97.068 2.221L97.068 1.941L98.148 1.866L98.148 2.272Q98.370 2.071 98.657 1.968Q98.945 1.866 99.252 1.866Q99.679 1.866 100.043 2.079Q100.407 2.293 100.621 2.657Q100.835 3.021 100.835 3.441Q100.835 3.886 100.595 4.250Q100.356 4.614 99.963 4.817Q99.570 5.020 99.126 5.020Q98.859 5.020 98.611 4.920Q98.364 4.819 98.176 4.638L98.176 5.820Q98.176 5.957 98.324 5.993Q98.473 6.029 98.698 6.029L98.698 6.309M98.176 2.621L98.176 4.231Q98.309 4.484 98.552 4.641Q98.794 4.798 99.071 4.798Q99.399 4.798 99.652 4.597Q99.905 4.395 100.038 4.077Q100.172 3.759 100.172 3.441Q100.172 3.212 100.107 2.983Q100.042 2.754 99.914 2.556Q99.785 2.358 99.591 2.238Q99.396 2.119 99.163 2.119Q98.869 2.119 98.601 2.248Q98.333 2.378 98.176 2.621\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 4.595)\">\u003Cpath d=\"M101.645 3.469Q101.645 3.127 101.780 2.828Q101.915 2.529 102.155 2.305Q102.394 2.081 102.712 1.956Q103.030 1.831 103.361 1.831Q103.806 1.831 104.205 2.047Q104.605 2.262 104.840 2.640Q105.074 3.017 105.074 3.469Q105.074 3.810 104.932 4.094Q104.790 4.378 104.546 4.585Q104.301 4.791 103.992 4.906Q103.683 5.020 103.361 5.020Q102.931 5.020 102.529 4.819Q102.127 4.617 101.886 4.265Q101.645 3.913 101.645 3.469M103.361 4.771Q103.963 4.771 104.187 4.393Q104.411 4.015 104.411 3.383Q104.411 2.771 104.176 2.412Q103.942 2.054 103.361 2.054Q102.309 2.054 102.309 3.383Q102.309 4.015 102.534 4.393Q102.760 4.771 103.361 4.771M107.336 4.952L105.733 4.952L105.733 4.672Q105.959 4.672 106.108 4.638Q106.256 4.603 106.256 4.463L106.256 0.844Q106.256 0.574 106.149 0.512Q106.041 0.451 105.733 0.451L105.733 0.170L106.810 0.095L106.810 4.463Q106.810 4.600 106.960 4.636Q107.111 4.672 107.336 4.672L107.336 4.952M109.548 4.952L107.996 4.952L107.996 4.672Q108.222 4.672 108.370 4.638Q108.519 4.603 108.519 4.463L108.519 2.614Q108.519 2.426 108.471 2.342Q108.423 2.259 108.326 2.240Q108.228 2.221 108.017 2.221L108.017 1.941L109.073 1.866L109.073 4.463Q109.073 4.603 109.204 4.638Q109.336 4.672 109.548 4.672L109.548 4.952M108.276 0.645Q108.276 0.474 108.399 0.355Q108.522 0.235 108.693 0.235Q108.861 0.235 108.984 0.355Q109.107 0.474 109.107 0.645Q109.107 0.820 108.984 0.943Q108.861 1.066 108.693 1.066Q108.522 1.066 108.399 0.943Q108.276 0.820 108.276 0.645M110.194 3.441Q110.194 3.113 110.329 2.812Q110.464 2.512 110.700 2.291Q110.935 2.071 111.240 1.951Q111.544 1.831 111.869 1.831Q112.374 1.831 112.723 1.934Q113.072 2.036 113.072 2.412Q113.072 2.559 112.974 2.660Q112.877 2.761 112.730 2.761Q112.576 2.761 112.477 2.662Q112.378 2.563 112.378 2.412Q112.378 2.224 112.518 2.132Q112.316 2.081 111.875 2.081Q111.520 2.081 111.291 2.277Q111.062 2.474 110.961 2.783Q110.860 3.093 110.860 3.441Q110.860 3.790 110.987 4.096Q111.113 4.402 111.368 4.586Q111.622 4.771 111.978 4.771Q112.200 4.771 112.385 4.687Q112.569 4.603 112.704 4.448Q112.839 4.292 112.897 4.084Q112.911 4.029 112.966 4.029L113.079 4.029Q113.109 4.029 113.132 4.053Q113.154 4.077 113.154 4.111L113.154 4.132Q113.068 4.419 112.880 4.617Q112.692 4.815 112.427 4.918Q112.163 5.020 111.869 5.020Q111.438 5.020 111.050 4.814Q110.662 4.607 110.428 4.244Q110.194 3.882 110.194 3.441M114.077 6.087Q114.206 6.155 114.343 6.155Q114.514 6.155 114.664 6.066Q114.815 5.977 114.926 5.832Q115.037 5.687 115.116 5.519L115.379 4.952L114.210 2.426Q114.135 2.279 114.005 2.247Q113.875 2.214 113.643 2.214L113.643 1.934L115.164 1.934L115.164 2.214Q114.815 2.214 114.815 2.361Q114.818 2.382 114.820 2.399Q114.822 2.416 114.822 2.426L115.680 4.285L116.452 2.614Q116.486 2.546 116.486 2.467Q116.486 2.354 116.403 2.284Q116.319 2.214 116.206 2.214L116.206 1.934L117.402 1.934L117.402 2.214Q117.184 2.214 117.011 2.318Q116.838 2.423 116.746 2.614L115.410 5.519Q115.239 5.889 114.969 6.135Q114.699 6.381 114.343 6.381Q114.073 6.381 113.854 6.215Q113.636 6.049 113.636 5.786Q113.636 5.649 113.728 5.560Q113.820 5.472 113.960 5.472Q114.097 5.472 114.186 5.560Q114.275 5.649 114.275 5.786Q114.275 5.889 114.222 5.967Q114.169 6.046 114.077 6.087\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg transform=\"translate(-14.653 43.96)\">\u003Cpath d=\"M48.553 4.111L48.553 2.214L47.914 2.214L47.914 1.992Q48.232 1.992 48.449 1.782Q48.666 1.572 48.766 1.262Q48.867 0.953 48.867 0.645L49.134 0.645L49.134 1.934L50.211 1.934L50.211 2.214L49.134 2.214L49.134 4.098Q49.134 4.374 49.238 4.573Q49.342 4.771 49.602 4.771Q49.759 4.771 49.865 4.667Q49.971 4.562 50.021 4.409Q50.070 4.255 50.070 4.098L50.070 3.684L50.337 3.684L50.337 4.111Q50.337 4.337 50.238 4.547Q50.139 4.757 49.954 4.889Q49.770 5.020 49.541 5.020Q49.103 5.020 48.828 4.783Q48.553 4.545 48.553 4.111M51.106 3.417Q51.106 3.096 51.231 2.807Q51.356 2.518 51.581 2.295Q51.807 2.071 52.102 1.951Q52.398 1.831 52.716 1.831Q53.044 1.831 53.306 1.931Q53.567 2.030 53.743 2.212Q53.919 2.395 54.013 2.653Q54.107 2.911 54.107 3.243Q54.107 3.335 54.025 3.356L51.769 3.356L51.769 3.417Q51.769 4.005 52.053 4.388Q52.337 4.771 52.904 4.771Q53.225 4.771 53.493 4.578Q53.762 4.385 53.851 4.070Q53.858 4.029 53.933 4.015L54.025 4.015Q54.107 4.039 54.107 4.111Q54.107 4.118 54.100 4.145Q53.987 4.542 53.617 4.781Q53.246 5.020 52.822 5.020Q52.384 5.020 51.984 4.812Q51.585 4.603 51.345 4.236Q51.106 3.869 51.106 3.417M51.776 3.147L53.591 3.147Q53.591 2.870 53.493 2.618Q53.396 2.365 53.198 2.209Q53 2.054 52.716 2.054Q52.439 2.054 52.225 2.212Q52.012 2.371 51.894 2.626Q51.776 2.881 51.776 3.147M56.445 4.952L54.709 4.952L54.709 4.672Q54.938 4.672 55.086 4.638Q55.235 4.603 55.235 4.463L55.235 2.614Q55.235 2.344 55.127 2.283Q55.020 2.221 54.709 2.221L54.709 1.941L55.737 1.866L55.737 2.573Q55.867 2.265 56.110 2.066Q56.353 1.866 56.670 1.866Q56.889 1.866 57.060 1.990Q57.231 2.115 57.231 2.327Q57.231 2.464 57.132 2.563Q57.033 2.662 56.900 2.662Q56.763 2.662 56.664 2.563Q56.565 2.464 56.565 2.327Q56.565 2.187 56.664 2.088Q56.373 2.088 56.173 2.284Q55.973 2.481 55.881 2.775Q55.789 3.069 55.789 3.349L55.789 4.463Q55.789 4.672 56.445 4.672L56.445 4.952M59.497 4.952L57.863 4.952L57.863 4.672Q58.092 4.672 58.241 4.638Q58.390 4.603 58.390 4.463L58.390 2.614Q58.390 2.344 58.282 2.283Q58.174 2.221 57.863 2.221L57.863 1.941L58.923 1.866L58.923 2.515Q59.094 2.207 59.398 2.036Q59.702 1.866 60.047 1.866Q60.447 1.866 60.724 2.006Q61.001 2.146 61.087 2.494Q61.254 2.201 61.553 2.033Q61.852 1.866 62.197 1.866Q62.703 1.866 62.987 2.089Q63.271 2.313 63.271 2.809L63.271 4.463Q63.271 4.600 63.419 4.636Q63.568 4.672 63.794 4.672L63.794 4.952L62.163 4.952L62.163 4.672Q62.389 4.672 62.539 4.636Q62.690 4.600 62.690 4.463L62.690 2.823Q62.690 2.488 62.570 2.288Q62.450 2.088 62.136 2.088Q61.866 2.088 61.632 2.224Q61.398 2.361 61.259 2.595Q61.121 2.829 61.121 3.103L61.121 4.463Q61.121 4.600 61.269 4.636Q61.418 4.672 61.644 4.672L61.644 4.952L60.013 4.952L60.013 4.672Q60.242 4.672 60.391 4.638Q60.540 4.603 60.540 4.463L60.540 2.823Q60.540 2.488 60.420 2.288Q60.300 2.088 59.986 2.088Q59.716 2.088 59.482 2.224Q59.248 2.361 59.109 2.595Q58.971 2.829 58.971 3.103L58.971 4.463Q58.971 4.600 59.121 4.636Q59.272 4.672 59.497 4.672L59.497 4.952M65.998 4.952L64.446 4.952L64.446 4.672Q64.672 4.672 64.821 4.638Q64.969 4.603 64.969 4.463L64.969 2.614Q64.969 2.426 64.921 2.342Q64.874 2.259 64.776 2.240Q64.679 2.221 64.467 2.221L64.467 1.941L65.523 1.866L65.523 4.463Q65.523 4.603 65.655 4.638Q65.786 4.672 65.998 4.672L65.998 4.952M64.727 0.645Q64.727 0.474 64.850 0.355Q64.973 0.235 65.144 0.235Q65.311 0.235 65.434 0.355Q65.557 0.474 65.557 0.645Q65.557 0.820 65.434 0.943Q65.311 1.066 65.144 1.066Q64.973 1.066 64.850 0.943Q64.727 0.820 64.727 0.645M68.326 4.952L66.692 4.952L66.692 4.672Q66.921 4.672 67.070 4.638Q67.218 4.603 67.218 4.463L67.218 2.614Q67.218 2.344 67.111 2.283Q67.003 2.221 66.692 2.221L66.692 1.941L67.752 1.866L67.752 2.515Q67.922 2.207 68.227 2.036Q68.531 1.866 68.876 1.866Q69.382 1.866 69.666 2.089Q69.949 2.313 69.949 2.809L69.949 4.463Q69.949 4.600 70.098 4.636Q70.247 4.672 70.472 4.672L70.472 4.952L68.842 4.952L68.842 4.672Q69.071 4.672 69.220 4.638Q69.368 4.603 69.368 4.463L69.368 2.823Q69.368 2.488 69.249 2.288Q69.129 2.088 68.815 2.088Q68.545 2.088 68.310 2.224Q68.076 2.361 67.938 2.595Q67.799 2.829 67.799 3.103L67.799 4.463Q67.799 4.600 67.950 4.636Q68.100 4.672 68.326 4.672L68.326 4.952M71.118 4.224Q71.118 3.892 71.342 3.665Q71.566 3.438 71.910 3.310Q72.253 3.181 72.626 3.129Q72.998 3.076 73.302 3.076L73.302 2.823Q73.302 2.618 73.195 2.438Q73.087 2.259 72.906 2.156Q72.725 2.054 72.516 2.054Q72.109 2.054 71.874 2.146Q71.962 2.183 72.009 2.267Q72.055 2.351 72.055 2.453Q72.055 2.549 72.009 2.628Q71.962 2.706 71.882 2.751Q71.802 2.795 71.713 2.795Q71.563 2.795 71.462 2.698Q71.361 2.600 71.361 2.453Q71.361 1.831 72.516 1.831Q72.728 1.831 72.978 1.895Q73.227 1.958 73.429 2.077Q73.630 2.197 73.757 2.382Q73.883 2.566 73.883 2.809L73.883 4.385Q73.883 4.501 73.945 4.597Q74.006 4.692 74.119 4.692Q74.229 4.692 74.294 4.598Q74.358 4.504 74.358 4.385L74.358 3.937L74.625 3.937L74.625 4.385Q74.625 4.655 74.398 4.820Q74.170 4.986 73.890 4.986Q73.682 4.986 73.545 4.832Q73.408 4.679 73.384 4.463Q73.237 4.730 72.955 4.875Q72.673 5.020 72.349 5.020Q72.072 5.020 71.788 4.945Q71.504 4.870 71.311 4.691Q71.118 4.511 71.118 4.224M71.733 4.224Q71.733 4.398 71.834 4.528Q71.935 4.658 72.091 4.728Q72.246 4.798 72.410 4.798Q72.629 4.798 72.837 4.701Q73.046 4.603 73.174 4.422Q73.302 4.241 73.302 4.015L73.302 3.287Q72.978 3.287 72.612 3.378Q72.246 3.469 71.990 3.681Q71.733 3.892 71.733 4.224M76.710 4.952L75.107 4.952L75.107 4.672Q75.333 4.672 75.481 4.638Q75.630 4.603 75.630 4.463L75.630 0.844Q75.630 0.574 75.522 0.512Q75.415 0.451 75.107 0.451L75.107 0.170L76.184 0.095L76.184 4.463Q76.184 4.600 76.334 4.636Q76.484 4.672 76.710 4.672\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(13.492 -66.536)\">\u003Cpath d=\"M49.670 6.309L48.040 6.309L48.040 6.029Q48.269 6.029 48.418 5.994Q48.566 5.960 48.566 5.820L48.566 2.474Q48.566 2.303 48.430 2.262Q48.293 2.221 48.040 2.221L48.040 1.941L49.120 1.866L49.120 2.272Q49.342 2.071 49.629 1.968Q49.917 1.866 50.224 1.866Q50.651 1.866 51.015 2.079Q51.379 2.293 51.593 2.657Q51.807 3.021 51.807 3.441Q51.807 3.886 51.567 4.250Q51.328 4.614 50.935 4.817Q50.542 5.020 50.098 5.020Q49.831 5.020 49.583 4.920Q49.336 4.819 49.148 4.638L49.148 5.820Q49.148 5.957 49.296 5.993Q49.445 6.029 49.670 6.029L49.670 6.309M49.148 2.621L49.148 4.231Q49.281 4.484 49.524 4.641Q49.766 4.798 50.043 4.798Q50.371 4.798 50.624 4.597Q50.877 4.395 51.010 4.077Q51.144 3.759 51.144 3.441Q51.144 3.212 51.079 2.983Q51.014 2.754 50.886 2.556Q50.757 2.358 50.563 2.238Q50.368 2.119 50.135 2.119Q49.841 2.119 49.573 2.248Q49.305 2.378 49.148 2.621M54.059 4.952L52.507 4.952L52.507 4.672Q52.733 4.672 52.882 4.638Q53.030 4.603 53.030 4.463L53.030 2.614Q53.030 2.426 52.983 2.342Q52.935 2.259 52.837 2.240Q52.740 2.221 52.528 2.221L52.528 1.941L53.584 1.866L53.584 4.463Q53.584 4.603 53.716 4.638Q53.847 4.672 54.059 4.672L54.059 4.952M52.788 0.645Q52.788 0.474 52.911 0.355Q53.034 0.235 53.205 0.235Q53.372 0.235 53.495 0.355Q53.618 0.474 53.618 0.645Q53.618 0.820 53.495 0.943Q53.372 1.066 53.205 1.066Q53.034 1.066 52.911 0.943Q52.788 0.820 52.788 0.645M54.705 3.441Q54.705 3.113 54.840 2.812Q54.975 2.512 55.211 2.291Q55.447 2.071 55.751 1.951Q56.055 1.831 56.380 1.831Q56.886 1.831 57.234 1.934Q57.583 2.036 57.583 2.412Q57.583 2.559 57.486 2.660Q57.388 2.761 57.241 2.761Q57.087 2.761 56.988 2.662Q56.889 2.563 56.889 2.412Q56.889 2.224 57.029 2.132Q56.828 2.081 56.387 2.081Q56.031 2.081 55.802 2.277Q55.573 2.474 55.472 2.783Q55.372 3.093 55.372 3.441Q55.372 3.790 55.498 4.096Q55.625 4.402 55.879 4.586Q56.134 4.771 56.489 4.771Q56.712 4.771 56.896 4.687Q57.081 4.603 57.216 4.448Q57.351 4.292 57.409 4.084Q57.422 4.029 57.477 4.029L57.590 4.029Q57.621 4.029 57.643 4.053Q57.665 4.077 57.665 4.111L57.665 4.132Q57.580 4.419 57.392 4.617Q57.204 4.815 56.939 4.918Q56.674 5.020 56.380 5.020Q55.949 5.020 55.561 4.814Q55.173 4.607 54.939 4.244Q54.705 3.882 54.705 3.441\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 -66.536)\">\u003Cpath d=\"M59.644 4.952L58.061 4.952L58.061 4.672Q58.290 4.672 58.439 4.638Q58.587 4.603 58.587 4.463L58.587 0.844Q58.587 0.574 58.480 0.512Q58.372 0.451 58.061 0.451L58.061 0.170L59.141 0.095L59.141 3.383L60.126 2.614Q60.331 2.477 60.331 2.327Q60.331 2.283 60.290 2.248Q60.249 2.214 60.204 2.214L60.204 1.934L61.568 1.934L61.568 2.214Q61.079 2.214 60.560 2.614L60.003 3.048L60.980 4.272Q61.182 4.518 61.315 4.595Q61.448 4.672 61.735 4.672L61.735 4.952L60.303 4.952L60.303 4.672Q60.491 4.672 60.491 4.559Q60.491 4.463 60.337 4.272L59.603 3.363L59.121 3.742L59.121 4.463Q59.121 4.600 59.269 4.636Q59.418 4.672 59.644 4.672\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 -66.536)\">\u003Cpath d=\"M65.750 4.952L65.483 4.952L65.483 0.844Q65.483 0.574 65.376 0.512Q65.268 0.451 64.957 0.451L64.957 0.170L66.037 0.095L66.037 2.265Q66.246 2.074 66.531 1.970Q66.817 1.866 67.114 1.866Q67.432 1.866 67.729 1.987Q68.026 2.108 68.249 2.324Q68.471 2.539 68.597 2.824Q68.724 3.110 68.724 3.441Q68.724 3.886 68.484 4.250Q68.245 4.614 67.852 4.817Q67.459 5.020 67.015 5.020Q66.820 5.020 66.630 4.964Q66.441 4.908 66.280 4.803Q66.119 4.699 65.979 4.538L65.750 4.952M66.065 2.607L66.065 4.224Q66.201 4.484 66.442 4.641Q66.683 4.798 66.960 4.798Q67.254 4.798 67.466 4.691Q67.678 4.583 67.811 4.391Q67.944 4.200 68.003 3.961Q68.061 3.722 68.061 3.441Q68.061 3.082 67.967 2.778Q67.873 2.474 67.645 2.281Q67.418 2.088 67.052 2.088Q66.752 2.088 66.485 2.224Q66.218 2.361 66.065 2.607\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 -66.536)\">\u003Cpath d=\"M69.534 3.417Q69.534 3.096 69.659 2.807Q69.784 2.518 70.010 2.295Q70.235 2.071 70.531 1.951Q70.826 1.831 71.144 1.831Q71.472 1.831 71.734 1.931Q71.995 2.030 72.171 2.212Q72.347 2.395 72.441 2.653Q72.535 2.911 72.535 3.243Q72.535 3.335 72.453 3.356L70.198 3.356L70.198 3.417Q70.198 4.005 70.481 4.388Q70.765 4.771 71.332 4.771Q71.654 4.771 71.922 4.578Q72.190 4.385 72.279 4.070Q72.286 4.029 72.361 4.015L72.453 4.015Q72.535 4.039 72.535 4.111Q72.535 4.118 72.529 4.145Q72.416 4.542 72.045 4.781Q71.674 5.020 71.250 5.020Q70.813 5.020 70.413 4.812Q70.013 4.603 69.774 4.236Q69.534 3.869 69.534 3.417M70.204 3.147L72.019 3.147Q72.019 2.870 71.922 2.618Q71.824 2.365 71.626 2.209Q71.428 2.054 71.144 2.054Q70.867 2.054 70.654 2.212Q70.440 2.371 70.322 2.626Q70.204 2.881 70.204 3.147M73.123 4.945L73.123 3.882Q73.123 3.858 73.151 3.831Q73.178 3.804 73.202 3.804L73.311 3.804Q73.376 3.804 73.390 3.862Q73.486 4.296 73.732 4.547Q73.978 4.798 74.391 4.798Q74.733 4.798 74.986 4.665Q75.239 4.532 75.239 4.224Q75.239 4.067 75.145 3.952Q75.051 3.838 74.913 3.769Q74.774 3.701 74.607 3.663L74.026 3.564Q73.670 3.496 73.397 3.275Q73.123 3.055 73.123 2.713Q73.123 2.464 73.234 2.289Q73.345 2.115 73.532 2.016Q73.718 1.917 73.933 1.874Q74.149 1.831 74.391 1.831Q74.805 1.831 75.085 2.013L75.301 1.838Q75.311 1.835 75.318 1.833Q75.324 1.831 75.335 1.831L75.386 1.831Q75.413 1.831 75.437 1.855Q75.461 1.879 75.461 1.907L75.461 2.754Q75.461 2.775 75.437 2.802Q75.413 2.829 75.386 2.829L75.273 2.829Q75.246 2.829 75.220 2.804Q75.195 2.778 75.195 2.754Q75.195 2.518 75.089 2.354Q74.983 2.190 74.800 2.108Q74.617 2.026 74.385 2.026Q74.056 2.026 73.800 2.129Q73.544 2.231 73.544 2.508Q73.544 2.703 73.727 2.812Q73.909 2.922 74.138 2.963L74.713 3.069Q74.959 3.117 75.172 3.245Q75.386 3.373 75.523 3.576Q75.659 3.780 75.659 4.029Q75.659 4.542 75.294 4.781Q74.928 5.020 74.391 5.020Q73.896 5.020 73.564 4.726L73.298 5Q73.277 5.020 73.250 5.020L73.202 5.020Q73.178 5.020 73.151 4.993Q73.123 4.966 73.123 4.945M76.815 4.111L76.815 2.214L76.176 2.214L76.176 1.992Q76.493 1.992 76.710 1.782Q76.928 1.572 77.028 1.262Q77.129 0.953 77.129 0.645L77.396 0.645L77.396 1.934L78.472 1.934L78.472 2.214L77.396 2.214L77.396 4.098Q77.396 4.374 77.500 4.573Q77.604 4.771 77.864 4.771Q78.021 4.771 78.127 4.667Q78.233 4.562 78.283 4.409Q78.332 4.255 78.332 4.098L78.332 3.684L78.599 3.684L78.599 4.111Q78.599 4.337 78.500 4.547Q78.401 4.757 78.216 4.889Q78.032 5.020 77.803 5.020Q77.365 5.020 77.090 4.783Q76.815 4.545 76.815 4.111\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(13.492 -66.536)\">\u003Cpath d=\"M82.177 4.224Q82.177 3.892 82.400 3.665Q82.624 3.438 82.968 3.310Q83.311 3.181 83.684 3.129Q84.056 3.076 84.361 3.076L84.361 2.823Q84.361 2.618 84.253 2.438Q84.145 2.259 83.964 2.156Q83.783 2.054 83.575 2.054Q83.168 2.054 82.932 2.146Q83.021 2.183 83.067 2.267Q83.113 2.351 83.113 2.453Q83.113 2.549 83.067 2.628Q83.021 2.706 82.940 2.751Q82.860 2.795 82.771 2.795Q82.621 2.795 82.520 2.698Q82.419 2.600 82.419 2.453Q82.419 1.831 83.575 1.831Q83.786 1.831 84.036 1.895Q84.285 1.958 84.487 2.077Q84.689 2.197 84.815 2.382Q84.942 2.566 84.942 2.809L84.942 4.385Q84.942 4.501 85.003 4.597Q85.065 4.692 85.178 4.692Q85.287 4.692 85.352 4.598Q85.417 4.504 85.417 4.385L85.417 3.937L85.683 3.937L85.683 4.385Q85.683 4.655 85.456 4.820Q85.229 4.986 84.949 4.986Q84.740 4.986 84.603 4.832Q84.467 4.679 84.443 4.463Q84.296 4.730 84.014 4.875Q83.732 5.020 83.407 5.020Q83.130 5.020 82.846 4.945Q82.563 4.870 82.370 4.691Q82.177 4.511 82.177 4.224M82.792 4.224Q82.792 4.398 82.893 4.528Q82.993 4.658 83.149 4.728Q83.304 4.798 83.469 4.798Q83.687 4.798 83.896 4.701Q84.104 4.603 84.232 4.422Q84.361 4.241 84.361 4.015L84.361 3.287Q84.036 3.287 83.670 3.378Q83.304 3.469 83.048 3.681Q82.792 3.892 82.792 4.224M86.100 3.441Q86.100 3.113 86.235 2.812Q86.370 2.512 86.606 2.291Q86.842 2.071 87.146 1.951Q87.450 1.831 87.775 1.831Q88.281 1.831 88.630 1.934Q88.978 2.036 88.978 2.412Q88.978 2.559 88.881 2.660Q88.783 2.761 88.637 2.761Q88.483 2.761 88.384 2.662Q88.284 2.563 88.284 2.412Q88.284 2.224 88.425 2.132Q88.223 2.081 87.782 2.081Q87.427 2.081 87.198 2.277Q86.969 2.474 86.868 2.783Q86.767 3.093 86.767 3.441Q86.767 3.790 86.893 4.096Q87.020 4.402 87.274 4.586Q87.529 4.771 87.885 4.771Q88.107 4.771 88.291 4.687Q88.476 4.603 88.611 4.448Q88.746 4.292 88.804 4.084Q88.818 4.029 88.872 4.029L88.985 4.029Q89.016 4.029 89.038 4.053Q89.060 4.077 89.060 4.111L89.060 4.132Q88.975 4.419 88.787 4.617Q88.599 4.815 88.334 4.918Q88.069 5.020 87.775 5.020Q87.345 5.020 86.957 4.814Q86.569 4.607 86.335 4.244Q86.100 3.882 86.100 3.441M90.175 4.111L90.175 2.214L89.535 2.214L89.535 1.992Q89.853 1.992 90.070 1.782Q90.287 1.572 90.388 1.262Q90.489 0.953 90.489 0.645L90.756 0.645L90.756 1.934L91.832 1.934L91.832 2.214L90.756 2.214L90.756 4.098Q90.756 4.374 90.860 4.573Q90.964 4.771 91.224 4.771Q91.381 4.771 91.487 4.667Q91.593 4.562 91.643 4.409Q91.692 4.255 91.692 4.098L91.692 3.684L91.959 3.684L91.959 4.111Q91.959 4.337 91.860 4.547Q91.761 4.757 91.576 4.889Q91.391 5.020 91.162 5.020Q90.725 5.020 90.450 4.783Q90.175 4.545 90.175 4.111M94.386 4.952L92.834 4.952L92.834 4.672Q93.059 4.672 93.208 4.638Q93.357 4.603 93.357 4.463L93.357 2.614Q93.357 2.426 93.309 2.342Q93.261 2.259 93.164 2.240Q93.066 2.221 92.854 2.221L92.854 1.941L93.910 1.866L93.910 4.463Q93.910 4.603 94.042 4.638Q94.174 4.672 94.386 4.672L94.386 4.952M93.114 0.645Q93.114 0.474 93.237 0.355Q93.360 0.235 93.531 0.235Q93.699 0.235 93.822 0.355Q93.945 0.474 93.945 0.645Q93.945 0.820 93.822 0.943Q93.699 1.066 93.531 1.066Q93.360 1.066 93.237 0.943Q93.114 0.820 93.114 0.645M94.991 3.469Q94.991 3.127 95.126 2.828Q95.261 2.529 95.500 2.305Q95.739 2.081 96.057 1.956Q96.375 1.831 96.706 1.831Q97.151 1.831 97.551 2.047Q97.950 2.262 98.185 2.640Q98.419 3.017 98.419 3.469Q98.419 3.810 98.277 4.094Q98.135 4.378 97.891 4.585Q97.646 4.791 97.337 4.906Q97.028 5.020 96.706 5.020Q96.276 5.020 95.874 4.819Q95.472 4.617 95.231 4.265Q94.991 3.913 94.991 3.469M96.706 4.771Q97.308 4.771 97.532 4.393Q97.756 4.015 97.756 3.383Q97.756 2.771 97.522 2.412Q97.287 2.054 96.706 2.054Q95.654 2.054 95.654 3.383Q95.654 4.015 95.879 4.393Q96.105 4.771 96.706 4.771M100.695 4.952L99.061 4.952L99.061 4.672Q99.290 4.672 99.439 4.638Q99.588 4.603 99.588 4.463L99.588 2.614Q99.588 2.344 99.480 2.283Q99.372 2.221 99.061 2.221L99.061 1.941L100.121 1.866L100.121 2.515Q100.292 2.207 100.596 2.036Q100.900 1.866 101.245 1.866Q101.751 1.866 102.035 2.089Q102.319 2.313 102.319 2.809L102.319 4.463Q102.319 4.600 102.467 4.636Q102.616 4.672 102.842 4.672L102.842 4.952L101.211 4.952L101.211 4.672Q101.440 4.672 101.589 4.638Q101.738 4.603 101.738 4.463L101.738 2.823Q101.738 2.488 101.618 2.288Q101.498 2.088 101.184 2.088Q100.914 2.088 100.680 2.224Q100.446 2.361 100.307 2.595Q100.169 2.829 100.169 3.103L100.169 4.463Q100.169 4.600 100.319 4.636Q100.470 4.672 100.695 4.672\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">A rollout at state \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.4306em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">s\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>. For each candidate action \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.4306em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">a\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>, simulate many trajectories that take \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.4306em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">a\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> then follow the rollout policy to termination; average their returns to estimate \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:1em;vertical-align:-0.25em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">Q\u003C\u002Fspan>\u003Cspan class=\"mopen\">(\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">s\u003C\u002Fspan>\u003Cspan class=\"mpunct\">,\u003C\u002Fspan>\u003Cspan class=\"mspace\" style=\"margin-right:0.1667em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">a\u003C\u002Fspan>\u003Cspan class=\"mclose\">)\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>; play the best. Estimates are then discarded.\u003C\u002Ffigcaption>",1785117788901]