[{"data":1,"prerenderedAt":12287},["ShallowReactive",2],{"lesson:\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":3,"course-wordcounts":6516,"ref-card-index":7428,"nav:reinforcement-learning":12110,"tikz:255a766aa5420b5c74a0fa4882d87978036ce77e0f000cf816d3aec005ab0b0c":12282,"tikz:0448c56cd9ece81fac1e886a30bd8fd801cfbcc4a6c831c73f4eecb793837265":12283,"tikz:8d725a2dac64334e87b7f15d92a29d5759b79e91920270ce564da3ac07ce6034":12284,"tikz:0a0860da2d3ccb9e5a038c73b1b599877f0c0f0e859fc8e37b861cd609987826":12285,"tikz:0595d0ddeca6958baf68e16a245173d99f372f6578a05a93856897f935b3f140":12286},{"id":4,"title":5,"blurb":6,"body":7,"brief":6484,"category":6485,"description":6486,"draft":6487,"extension":6488,"meta":6489,"module":6492,"navigation":6493,"path":6494,"practice":6495,"rawbody":6496,"readingTime":6497,"seo":6502,"sources":6503,"status":6510,"stem":6511,"summary":6512,"topics":6513,"__hash__":6515},"course\u002F07.reinforcement-learning\u002F05.modern-deep-rl\u002F20.safe-and-constrained-rl.md","Safe and Constrained RL: The CMDP and Policy Methods","",{"type":8,"value":9,"toc":6476},"minimark",[10,31,53,61,66,241,245,259,278,459,463,575,582,1139,1142,1362,1493,1760,1851,1854,1941,1945,1988,2207,2449,2605,2857,3184,3187,3409,3485,3756,3779,3784,4086,4238,4358,4510,4617,4770,5074,5077,5081,5100,5386,5681,6158,6185,6188,6228,6235,6239,6254,6257,6305,6319,6472],[11,12,13,14,18,19,30],"p",{},"Everything in the course so far has taken a single instruction on faith: find the\npolicy that maximizes expected return. That instruction is complete only if the\nreward function is a perfect statement of what you want. It almost never is. A\nreward is a compression of a designer's intent into one scalar per step, and a\ncapable optimizer exploits every gap between that scalar and the intent. It\noptimizes what you ",[15,16,17],"em",{},"wrote",", not what you meant, and the two\ndiverge exactly where you were not looking. A cleaning robot rewarded for a tidy\nroom learns to sweep dust under the rug; a boat-racing agent rewarded for the\nscore circles a lagoon collecting the same power-ups forever instead of finishing\nthe race.",[20,21,22],"sup",{},[23,24,29],"a",{"href":25,"ariaDescribedBy":26,"dataFootnoteRef":6,"id":28},"#user-content-fn-gaming",[27],"footnote-label","user-content-fnref-gaming","1"," These are not optimizer bugs: the optimizer worked, the\nreward was wrong, and nothing in reward maximization penalizes the difference.",[11,32,33,34,38,39,42,43,47,48,52],{},"This lesson is about the discipline that takes the gap seriously: state, alongside\nthe reward, the ",[35,36,37],"strong",{},"constraints"," a good policy must respect — a collision budget, a\npower limit, a rule it may not break — and optimize return ",[15,40,41],{},"subject to"," them. It\nshares a principle with ",[23,44,46],{"href":45},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl","offline RL",",\nwhere the remedy for unverifiable value estimates was pessimism about what the data\ncannot confirm; here the remedy for an incomplete reward is pessimism about what the\nreward does not measure. And it sharpens the over-optimization story from\n",[23,49,51],{"href":50},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models","RLHF",": the KL\nleash there is one instance of the general move this lesson formalizes — bound how\nhard you push on a proxy, because the proxy stops being right before the optimizer\nstops pushing.",[11,54,55,56,60],{},"This lesson builds the core machinery: the constrained MDP that states the problem, and\nthe two policy-optimization methods that solve it — Lagrangian primal-dual (RCPO) and\nconstrained policy optimization (CPO). Risk-sensitivity, safe exploration, and the\nalignment framing continue in a\n",[23,57,59],{"href":58},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2","companion lesson",".",[62,63,65],"h2",{"id":64},"why-reward-maximization-alone-is-dangerous","Why reward maximization alone is dangerous",[11,67,68,69,72,73,99,100,72,103,158,159,174,175,190,191,232,233],{},"The trouble is structural, not a matter of careless reward design. Call the\nreward you wrote the ",[35,70,71],{},"proxy"," ",[74,75,78],"span",{"className":76},[77],"katex",[74,79,83],{"className":80,"ariaHidden":82},[81],"katex-html","true",[74,84,87,92],{"className":85},[86],"base",[74,88],{"className":89,"style":91},[90],"strut","height:0.4306em;",[74,93,98],{"className":94,"style":97},[95,96],"mord","mathnormal","margin-right:0.0278em;","r"," and the outcome you actually care about the\n",[35,101,102],{},"true objective",[74,104,106],{"className":105},[77],[74,107,109],{"className":108,"ariaHidden":82},[81],[74,110,112,116],{"className":111},[86],[74,113],{"className":114,"style":115},[90],"height:0.6887em;",[74,117,119,122],{"className":118},[95],[74,120,98],{"className":121,"style":97},[95,96],[74,123,126],{"className":124},[125],"msupsub",[74,127,130],{"className":128},[129],"vlist-t",[74,131,134],{"className":132},[133],"vlist-r",[74,135,138],{"className":136,"style":115},[137],"vlist",[74,139,141,146],{"style":140},"top:-3.063em;margin-right:0.05em;",[74,142],{"className":143,"style":145},[144],"pstrut","height:2.7em;",[74,147,153],{"className":148},[149,150,151,152],"sizing","reset-size6","size3","mtight",[74,154,157],{"className":155},[156,152],"mbin","⋆",". The two agree on the behaviors you had in mind when\nyou wrote ",[74,160,162],{"className":161},[77],[74,163,165],{"className":164,"ariaHidden":82},[81],[74,166,168,171],{"className":167},[86],[74,169],{"className":170,"style":91},[90],[74,172,98],{"className":173,"style":97},[95,96]," — the ones near your demonstrations and your imagination — and they\ncan diverge arbitrarily on behaviors you did not consider. Optimization is a search\nfor the highest-reward behavior, so it is drawn precisely toward the regions where\n",[74,176,178],{"className":177},[77],[74,179,181],{"className":180,"ariaHidden":82},[81],[74,182,184,187],{"className":183},[86],[74,185],{"className":186,"style":91},[90],[74,188,98],{"className":189,"style":97},[95,96]," is high for reasons that have nothing to do with ",[74,192,194],{"className":193},[77],[74,195,197],{"className":196,"ariaHidden":82},[81],[74,198,200,203],{"className":199},[86],[74,201],{"className":202,"style":115},[90],[74,204,206,209],{"className":205},[95],[74,207,98],{"className":208,"style":97},[95,96],[74,210,212],{"className":211},[125],[74,213,215],{"className":214},[129],[74,216,218],{"className":217},[133],[74,219,221],{"className":220,"style":115},[137],[74,222,223,226],{"style":140},[74,224],{"className":225,"style":145},[144],[74,227,229],{"className":228},[149,150,151,152],[74,230,157],{"className":231},[156,152],". The better the\noptimizer, the more reliably it finds them.",[20,234,235],{},[23,236,240],{"href":237,"ariaDescribedBy":238,"dataFootnoteRef":6,"id":239},"#user-content-fn-goodhart",[27],"user-content-fnref-goodhart","2",[242,243],"tikz-figure",{"hash":244},"255a766aa5420b5c74a0fa4882d87978036ce77e0f000cf816d3aec005ab0b0c",[246,247,249],"callout",{"type":248},"definition",[11,250,251,254,255,258],{},[35,252,253],{},"Definition (Specification gaming \u002F reward hacking)."," Behavior that scores\nhighly under the specified reward while violating the designer's intent, arising\nbecause the reward is an imperfect proxy for the true objective. A more capable\noptimizer exploits the proxy–objective gap more thoroughly, so gaming tends to\n",[15,256,257],{},"worsen"," with capability rather than improve.",[11,260,261,262,265,266,269,270,273,274,277],{},"The pattern is the same one the ",[23,263,264],{"href":50},"RLHF lesson","\nnamed ",[35,267,268],{},"over-optimization",": a language policy free to maximize a learned reward\nmodel drifts into degenerate text the reward model mistakenly scores highly. There the fix\nwas a KL leash back to the reference model — a soft constraint on how far the\npolicy may move. That is a special case of the general idea. When the thing you\ncannot capture in the reward is ",[15,271,272],{},"how far the policy strays",", a KL bound suffices;\nwhen it is ",[15,275,276],{},"a physical limit"," (energy, collisions, torque), you need an explicit\nconstraint on a measured cost. Both limit how far the optimizer can exploit the\nproxy. The rest of the lesson builds the machinery for the second, harder case.",[11,279,280,281,351,352,405,406,422,423,438,439,454,455,458],{},"A first instinct is to fold the constraint into the reward as a penalty: subtract\n",[74,282,284],{"className":283},[77],[74,285,287],{"className":286,"ariaHidden":82},[81],[74,288,290,294,298,303],{"className":289},[86],[74,291],{"className":292,"style":293},[90],"height:0.8444em;vertical-align:-0.15em;",[74,295,297],{"className":296},[95,96],"λ",[74,299],{"className":300,"style":302},[301],"mspace","margin-right:0.1667em;",[74,304,306,310],{"className":305},[95],[74,307,309],{"className":308},[95,96],"c",[74,311,313],{"className":312},[125],[74,314,317,342],{"className":315},[129,316],"vlist-t2",[74,318,320,337],{"className":319},[133],[74,321,324],{"className":322,"style":323},[137],"height:0.2806em;",[74,325,327,330],{"style":326},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[74,328],{"className":329,"style":145},[144],[74,331,333],{"className":332},[149,150,151,152],[74,334,336],{"className":335},[95,96,152],"t",[74,338,341],{"className":339},[340],"vlist-s","​",[74,343,345],{"className":344},[133],[74,346,349],{"className":347,"style":348},[137],"height:0.15em;",[74,350],{}," from the reward for each unit of cost ",[74,353,355],{"className":354},[77],[74,356,358],{"className":357,"ariaHidden":82},[81],[74,359,361,365],{"className":360},[86],[74,362],{"className":363,"style":364},[90],"height:0.5806em;vertical-align:-0.15em;",[74,366,368,371],{"className":367},[95],[74,369,309],{"className":370},[95,96],[74,372,374],{"className":373},[125],[74,375,377,397],{"className":376},[129,316],[74,378,380,394],{"className":379},[133],[74,381,383],{"className":382,"style":323},[137],[74,384,385,388],{"style":326},[74,386],{"className":387,"style":145},[144],[74,389,391],{"className":390},[149,150,151,152],[74,392,336],{"className":393},[95,96,152],[74,395,341],{"className":396},[340],[74,398,400],{"className":399},[133],[74,401,403],{"className":402,"style":348},[137],[74,404],{}," and tune ",[74,407,409],{"className":408},[77],[74,410,412],{"className":411,"ariaHidden":82},[81],[74,413,415,419],{"className":414},[86],[74,416],{"className":417,"style":418},[90],"height:0.6944em;",[74,420,297],{"className":421},[95,96]," by\nhand. This works when you can find the right ",[74,424,426],{"className":425},[77],[74,427,429],{"className":428,"ariaHidden":82},[81],[74,430,432,435],{"className":431},[86],[74,433],{"className":434,"style":418},[90],[74,436,297],{"className":437},[95,96],", but it hides the constraint\ninside a scalar and gives you no guarantee about the resulting cost. Pick ",[74,440,442],{"className":441},[77],[74,443,445],{"className":444,"ariaHidden":82},[81],[74,446,448,451],{"className":447},[86],[74,449],{"className":450,"style":418},[90],[74,452,297],{"className":453},[95,96],"\ntoo small and the policy pays the penalty and violates the limit anyway; too large\nand it becomes so cautious it abandons the task. The constrained formulation makes\nthe limit a first-class object — a number you ",[15,456,457],{},"specify"," rather than a weight you\ntune by trial and error — and derives the right penalty automatically.",[62,460,462],{"id":461},"the-constrained-mdp","The constrained MDP",[11,464,465,466,60,469,477,478,519,520,523,524,557,558,574],{},"The formalism is the ",[35,467,468],{},"constrained Markov decision process (CMDP)",[20,470,471],{},[23,472,476],{"href":473,"ariaDescribedBy":474,"dataFootnoteRef":6,"id":475},"#user-content-fn-altman",[27],"user-content-fnref-altman","3","\nIt is an ordinary MDP with one addition: alongside the reward ",[74,479,481],{"className":480},[77],[74,482,484],{"className":483,"ariaHidden":82},[81],[74,485,487,491,494,499,503,508,511,514],{"className":486},[86],[74,488],{"className":489,"style":490},[90],"height:1em;vertical-align:-0.25em;",[74,492,98],{"className":493,"style":97},[95,96],[74,495,498],{"className":496},[497],"mopen","(",[74,500,502],{"className":501},[95,96],"s",[74,504,507],{"className":505},[506],"mpunct",",",[74,509],{"className":510,"style":302},[301],[74,512,23],{"className":513},[95,96],[74,515,518],{"className":516},[517],"mclose",")",", each\ntransition emits one or more ",[35,521,522],{},"cost"," signals ",[74,525,527],{"className":526},[77],[74,528,530],{"className":529,"ariaHidden":82},[81],[74,531,533,536,539,542,545,548,551,554],{"className":532},[86],[74,534],{"className":535,"style":490},[90],[74,537,309],{"className":538},[95,96],[74,540,498],{"className":541},[497],[74,543,502],{"className":544},[95,96],[74,546,507],{"className":547},[506],[74,549],{"className":550,"style":302},[301],[74,552,23],{"className":553},[95,96],[74,555,518],{"className":556},[517],", and the policy must keep\nthe expected discounted cost under a threshold ",[74,559,561],{"className":560},[77],[74,562,564],{"className":563,"ariaHidden":82},[81],[74,565,567,570],{"className":566},[86],[74,568],{"className":569,"style":418},[90],[74,571,573],{"className":572},[95,96],"d"," the designer sets.",[11,576,577,578,581],{},"Write the return as before and define an analogous ",[35,579,580],{},"cost return",":",[74,583,586],{"className":584},[585],"katex-display",[74,587,589],{"className":588},[77],[74,590,592,671,951],{"className":591,"ariaHidden":82},[81],[74,593,595,598,642,645,650,653,657,660,665,668],{"className":594},[86],[74,596],{"className":597,"style":490},[90],[74,599,601,606],{"className":600},[95],[74,602,605],{"className":603,"style":604},[95,96],"margin-right:0.0962em;","J",[74,607,609],{"className":608},[125],[74,610,612,634],{"className":611},[129,316],[74,613,615,631],{"className":614},[133],[74,616,619],{"className":617,"style":618},[137],"height:0.1514em;",[74,620,622,625],{"style":621},"top:-2.55em;margin-left:-0.0962em;margin-right:0.05em;",[74,623],{"className":624,"style":145},[144],[74,626,628],{"className":627},[149,150,151,152],[74,629,98],{"className":630,"style":97},[95,96,152],[74,632,341],{"className":633},[340],[74,635,637],{"className":636},[133],[74,638,640],{"className":639,"style":348},[137],[74,641],{},[74,643,498],{"className":644},[497],[74,646,649],{"className":647,"style":648},[95,96],"margin-right:0.0359em;","π",[74,651,518],{"className":652},[517],[74,654],{"className":655,"style":656},[301],"margin-right:0.2778em;",[74,658],{"className":659,"style":656},[301],[74,661,664],{"className":662},[663],"mrel","=",[74,666],{"className":667,"style":656},[301],[74,669],{"className":670,"style":656},[301],[74,672,674,678,720,724,733,791,794,826,829,870,877,880,884,887,927,930,933,936,939,942,945,948],{"className":673},[86],[74,675],{"className":676,"style":677},[90],"height:1.8em;vertical-align:-0.65em;",[74,679,681,686],{"className":680},[95],[74,682,685],{"className":683},[95,684],"mathbb","E",[74,687,689],{"className":688},[125],[74,690,692,712],{"className":691},[129,316],[74,693,695,709],{"className":694},[133],[74,696,698],{"className":697,"style":618},[137],[74,699,700,703],{"style":326},[74,701],{"className":702,"style":145},[144],[74,704,706],{"className":705},[149,150,151,152],[74,707,649],{"className":708,"style":648},[95,96,152],[74,710,341],{"className":711},[340],[74,713,715],{"className":714},[133],[74,716,718],{"className":717,"style":348},[137],[74,719],{},[74,721],{"className":722,"style":723},[301],"margin-right:-0.1667em;",[74,725,727],{"className":726},[497],[74,728,732],{"className":729},[730,731],"delimsizing","size2","[",[74,734,737,744],{"className":735},[736],"mop",[74,738,743],{"className":739,"style":742},[736,740,741],"op-symbol","small-op","position:relative;top:0em;","∑",[74,745,747],{"className":746},[125],[74,748,750,782],{"className":749},[129,316],[74,751,753,779],{"className":752},[133],[74,754,756],{"className":755,"style":618},[137],[74,757,759,762],{"style":758},"top:-2.4003em;margin-left:0em;margin-right:0.05em;",[74,760],{"className":761,"style":145},[144],[74,763,765],{"className":764},[149,150,151,152],[74,766,768,771,775],{"className":767},[95,152],[74,769,336],{"className":770},[95,96,152],[74,772,774],{"className":773},[663,152],"≥",[74,776,778],{"className":777},[95,152],"0",[74,780,341],{"className":781},[340],[74,783,785],{"className":784},[133],[74,786,789],{"className":787,"style":788},[137],"height:0.3949em;",[74,790],{},[74,792],{"className":793,"style":302},[301],[74,795,797,802],{"className":796},[95],[74,798,801],{"className":799,"style":800},[95,96],"margin-right:0.0556em;","γ",[74,803,805],{"className":804},[125],[74,806,808],{"className":807},[129],[74,809,811],{"className":810},[133],[74,812,815],{"className":813,"style":814},[137],"height:0.7936em;",[74,816,817,820],{"style":140},[74,818],{"className":819,"style":145},[144],[74,821,823],{"className":822},[149,150,151,152],[74,824,336],{"className":825},[95,96,152],[74,827],{"className":828,"style":302},[301],[74,830,832,835],{"className":831},[95],[74,833,98],{"className":834,"style":97},[95,96],[74,836,838],{"className":837},[125],[74,839,841,862],{"className":840},[129,316],[74,842,844,859],{"className":843},[133],[74,845,847],{"className":846,"style":323},[137],[74,848,850,853],{"style":849},"top:-2.55em;margin-left:-0.0278em;margin-right:0.05em;",[74,851],{"className":852,"style":145},[144],[74,854,856],{"className":855},[149,150,151,152],[74,857,336],{"className":858},[95,96,152],[74,860,341],{"className":861},[340],[74,863,865],{"className":864},[133],[74,866,868],{"className":867,"style":348},[137],[74,869],{},[74,871,873],{"className":872},[517],[74,874,876],{"className":875},[730,731],"]",[74,878,507],{"className":879},[506],[74,881],{"className":882,"style":883},[301],"margin-right:2em;",[74,885],{"className":886,"style":302},[301],[74,888,890,893],{"className":889},[95],[74,891,605],{"className":892,"style":604},[95,96],[74,894,896],{"className":895},[125],[74,897,899,919],{"className":898},[129,316],[74,900,902,916],{"className":901},[133],[74,903,905],{"className":904,"style":618},[137],[74,906,907,910],{"style":621},[74,908],{"className":909,"style":145},[144],[74,911,913],{"className":912},[149,150,151,152],[74,914,309],{"className":915},[95,96,152],[74,917,341],{"className":918},[340],[74,920,922],{"className":921},[133],[74,923,925],{"className":924,"style":348},[137],[74,926],{},[74,928,498],{"className":929},[497],[74,931,649],{"className":932,"style":648},[95,96],[74,934,518],{"className":935},[517],[74,937],{"className":938,"style":656},[301],[74,940],{"className":941,"style":656},[301],[74,943,664],{"className":944},[663],[74,946],{"className":947,"style":656},[301],[74,949],{"className":950,"style":656},[301],[74,952,954,957,997,1000,1006,1055,1058,1087,1090,1130,1136],{"className":953},[86],[74,955],{"className":956,"style":677},[90],[74,958,960,963],{"className":959},[95],[74,961,685],{"className":962},[95,684],[74,964,966],{"className":965},[125],[74,967,969,989],{"className":968},[129,316],[74,970,972,986],{"className":971},[133],[74,973,975],{"className":974,"style":618},[137],[74,976,977,980],{"style":326},[74,978],{"className":979,"style":145},[144],[74,981,983],{"className":982},[149,150,151,152],[74,984,649],{"className":985,"style":648},[95,96,152],[74,987,341],{"className":988},[340],[74,990,992],{"className":991},[133],[74,993,995],{"className":994,"style":348},[137],[74,996],{},[74,998],{"className":999,"style":723},[301],[74,1001,1003],{"className":1002},[497],[74,1004,732],{"className":1005},[730,731],[74,1007,1009,1012],{"className":1008},[736],[74,1010,743],{"className":1011,"style":742},[736,740,741],[74,1013,1015],{"className":1014},[125],[74,1016,1018,1047],{"className":1017},[129,316],[74,1019,1021,1044],{"className":1020},[133],[74,1022,1024],{"className":1023,"style":618},[137],[74,1025,1026,1029],{"style":758},[74,1027],{"className":1028,"style":145},[144],[74,1030,1032],{"className":1031},[149,150,151,152],[74,1033,1035,1038,1041],{"className":1034},[95,152],[74,1036,336],{"className":1037},[95,96,152],[74,1039,774],{"className":1040},[663,152],[74,1042,778],{"className":1043},[95,152],[74,1045,341],{"className":1046},[340],[74,1048,1050],{"className":1049},[133],[74,1051,1053],{"className":1052,"style":788},[137],[74,1054],{},[74,1056],{"className":1057,"style":302},[301],[74,1059,1061,1064],{"className":1060},[95],[74,1062,801],{"className":1063,"style":800},[95,96],[74,1065,1067],{"className":1066},[125],[74,1068,1070],{"className":1069},[129],[74,1071,1073],{"className":1072},[133],[74,1074,1076],{"className":1075,"style":814},[137],[74,1077,1078,1081],{"style":140},[74,1079],{"className":1080,"style":145},[144],[74,1082,1084],{"className":1083},[149,150,151,152],[74,1085,336],{"className":1086},[95,96,152],[74,1088],{"className":1089,"style":302},[301],[74,1091,1093,1096],{"className":1092},[95],[74,1094,309],{"className":1095},[95,96],[74,1097,1099],{"className":1098},[125],[74,1100,1102,1122],{"className":1101},[129,316],[74,1103,1105,1119],{"className":1104},[133],[74,1106,1108],{"className":1107,"style":323},[137],[74,1109,1110,1113],{"style":326},[74,1111],{"className":1112,"style":145},[144],[74,1114,1116],{"className":1115},[149,150,151,152],[74,1117,336],{"className":1118},[95,96,152],[74,1120,341],{"className":1121},[340],[74,1123,1125],{"className":1124},[133],[74,1126,1128],{"className":1127,"style":348},[137],[74,1129],{},[74,1131,1133],{"className":1132},[517],[74,1134,876],{"className":1135},[730,731],[74,1137,60],{"className":1138},[95],[11,1140,1141],{},"The CMDP problem is then to maximize the reward return subject to the cost return\nstaying within budget:",[74,1143,1145],{"className":1144},[585],[74,1146,1148],{"className":1147},[77],[74,1149,1151,1350],{"className":1150,"ariaHidden":82},[81],[74,1152,1154,1158,1215,1218,1221,1261,1264,1267,1270,1274,1282,1285,1325,1328,1331,1334,1337,1340,1344,1347],{"className":1153},[86],[74,1155],{"className":1156,"style":1157},[90],"height:1.45em;vertical-align:-0.7em;",[74,1159,1162],{"className":1160},[736,1161],"op-limits",[74,1163,1165,1206],{"className":1164},[129,316],[74,1166,1168,1203],{"className":1167},[133],[74,1169,1171,1187],{"className":1170,"style":91},[137],[74,1172,1174,1178],{"style":1173},"top:-2.4em;margin-left:0em;",[74,1175],{"className":1176,"style":1177},[144],"height:3em;",[74,1179,1181],{"className":1180},[149,150,151,152],[74,1182,1184],{"className":1183},[95,152],[74,1185,649],{"className":1186,"style":648},[95,96,152],[74,1188,1190,1193],{"style":1189},"top:-3em;",[74,1191],{"className":1192,"style":1177},[144],[74,1194,1195],{},[74,1196,1198],{"className":1197},[736],[74,1199,1202],{"className":1200},[95,1201],"mathrm","max",[74,1204,341],{"className":1205},[340],[74,1207,1209],{"className":1208},[133],[74,1210,1213],{"className":1211,"style":1212},[137],"height:0.7em;",[74,1214],{},[74,1216],{"className":1217,"style":656},[301],[74,1219],{"className":1220,"style":302},[301],[74,1222,1224,1227],{"className":1223},[95],[74,1225,605],{"className":1226,"style":604},[95,96],[74,1228,1230],{"className":1229},[125],[74,1231,1233,1253],{"className":1232},[129,316],[74,1234,1236,1250],{"className":1235},[133],[74,1237,1239],{"className":1238,"style":618},[137],[74,1240,1241,1244],{"style":621},[74,1242],{"className":1243,"style":145},[144],[74,1245,1247],{"className":1246},[149,150,151,152],[74,1248,98],{"className":1249,"style":97},[95,96,152],[74,1251,341],{"className":1252},[340],[74,1254,1256],{"className":1255},[133],[74,1257,1259],{"className":1258,"style":348},[137],[74,1260],{},[74,1262,498],{"className":1263},[497],[74,1265,649],{"className":1266,"style":648},[95,96],[74,1268,518],{"className":1269},[517],[74,1271],{"className":1272,"style":1273},[301],"margin-right:1em;",[74,1275,1278],{"className":1276},[95,1277],"text",[74,1279,1281],{"className":1280},[95],"subject to",[74,1283],{"className":1284,"style":1273},[301],[74,1286,1288,1291],{"className":1287},[95],[74,1289,605],{"className":1290,"style":604},[95,96],[74,1292,1294],{"className":1293},[125],[74,1295,1297,1317],{"className":1296},[129,316],[74,1298,1300,1314],{"className":1299},[133],[74,1301,1303],{"className":1302,"style":618},[137],[74,1304,1305,1308],{"style":621},[74,1306],{"className":1307,"style":145},[144],[74,1309,1311],{"className":1310},[149,150,151,152],[74,1312,309],{"className":1313},[95,96,152],[74,1315,341],{"className":1316},[340],[74,1318,1320],{"className":1319},[133],[74,1321,1323],{"className":1322,"style":348},[137],[74,1324],{},[74,1326,498],{"className":1327},[497],[74,1329,649],{"className":1330,"style":648},[95,96],[74,1332,518],{"className":1333},[517],[74,1335],{"className":1336,"style":656},[301],[74,1338],{"className":1339,"style":656},[301],[74,1341,1343],{"className":1342},[663],"≤",[74,1345],{"className":1346,"style":656},[301],[74,1348],{"className":1349,"style":656},[301],[74,1351,1353,1356,1359],{"className":1352},[86],[74,1354],{"className":1355,"style":418},[90],[74,1357,573],{"className":1358},[95,96],[74,1360,60],{"className":1361},[95],[11,1363,1364,1365,1419,1420,1472,1473,1476,1477,1492],{},"With several constraints there is one ",[74,1366,1368],{"className":1367},[77],[74,1369,1371],{"className":1370,"ariaHidden":82},[81],[74,1372,1374,1377],{"className":1373},[86],[74,1375],{"className":1376,"style":364},[90],[74,1378,1380,1383],{"className":1379},[95],[74,1381,309],{"className":1382},[95,96],[74,1384,1386],{"className":1385},[125],[74,1387,1389,1411],{"className":1388},[129,316],[74,1390,1392,1408],{"className":1391},[133],[74,1393,1396],{"className":1394,"style":1395},[137],"height:0.3117em;",[74,1397,1398,1401],{"style":326},[74,1399],{"className":1400,"style":145},[144],[74,1402,1404],{"className":1403},[149,150,151,152],[74,1405,1407],{"className":1406},[95,96,152],"i",[74,1409,341],{"className":1410},[340],[74,1412,1414],{"className":1413},[133],[74,1415,1417],{"className":1416,"style":348},[137],[74,1418],{}," and one threshold ",[74,1421,1423],{"className":1422},[77],[74,1424,1426],{"className":1425,"ariaHidden":82},[81],[74,1427,1429,1432],{"className":1428},[86],[74,1430],{"className":1431,"style":293},[90],[74,1433,1435,1438],{"className":1434},[95],[74,1436,573],{"className":1437},[95,96],[74,1439,1441],{"className":1440},[125],[74,1442,1444,1464],{"className":1443},[129,316],[74,1445,1447,1461],{"className":1446},[133],[74,1448,1450],{"className":1449,"style":1395},[137],[74,1451,1452,1455],{"style":326},[74,1453],{"className":1454,"style":145},[144],[74,1456,1458],{"className":1457},[149,150,151,152],[74,1459,1407],{"className":1460},[95,96,152],[74,1462,341],{"className":1463},[340],[74,1465,1467],{"className":1466},[133],[74,1468,1470],{"className":1469,"style":348},[137],[74,1471],{}," per\nrequirement. The cost is not the negative of reward; it is a ",[15,1474,1475],{},"separate","\nmeasurement of something the reward does not price — a count of collisions, joules\nburned, or times a safety envelope was crossed — and ",[74,1478,1480],{"className":1479},[77],[74,1481,1483],{"className":1482,"ariaHidden":82},[81],[74,1484,1486,1489],{"className":1485},[86],[74,1487],{"className":1488,"style":418},[90],[74,1490,573],{"className":1491},[95,96]," says how much of it you\nwill tolerate on average.",[246,1494,1495],{"type":248},[11,1496,1497,1500,1501,1582,1583,1659,1660,1675,1676,1679,1680,1759],{},[35,1498,1499],{},"Definition (Constrained MDP)."," A tuple ",[74,1502,1504],{"className":1503},[77],[74,1505,1507],{"className":1506,"ariaHidden":82},[81],[74,1508,1510,1513,1516,1522,1525,1528,1532,1535,1538,1543,1546,1549,1552,1555,1558,1561,1564,1567,1570,1573,1576,1579],{"className":1509},[86],[74,1511],{"className":1512,"style":490},[90],[74,1514,498],{"className":1515},[497],[74,1517,1521],{"className":1518,"style":1520},[95,1519],"mathcal","margin-right:0.075em;","S",[74,1523,507],{"className":1524},[506],[74,1526],{"className":1527,"style":302},[301],[74,1529,1531],{"className":1530},[95,1519],"A",[74,1533,507],{"className":1534},[506],[74,1536],{"className":1537,"style":302},[301],[74,1539,1542],{"className":1540,"style":1541},[95,96],"margin-right:0.1389em;","P",[74,1544,507],{"className":1545},[506],[74,1547],{"className":1548,"style":302},[301],[74,1550,98],{"className":1551,"style":97},[95,96],[74,1553,507],{"className":1554},[506],[74,1556],{"className":1557,"style":302},[301],[74,1559,309],{"className":1560},[95,96],[74,1562,507],{"className":1563},[506],[74,1565],{"className":1566,"style":302},[301],[74,1568,801],{"className":1569,"style":800},[95,96],[74,1571,507],{"className":1572},[506],[74,1574],{"className":1575,"style":302},[301],[74,1577,573],{"className":1578},[95,96],[74,1580,518],{"className":1581},[517]," extending an MDP with a cost function ",[74,1584,1586],{"className":1585},[77],[74,1587,1589,1607,1628,1648],{"className":1588,"ariaHidden":82},[81],[74,1590,1592,1595,1598,1601,1604],{"className":1591},[86],[74,1593],{"className":1594,"style":91},[90],[74,1596,309],{"className":1597},[95,96],[74,1599],{"className":1600,"style":656},[301],[74,1602,581],{"className":1603},[663],[74,1605],{"className":1606,"style":656},[301],[74,1608,1610,1614,1617,1621,1625],{"className":1609},[86],[74,1611],{"className":1612,"style":1613},[90],"height:0.7667em;vertical-align:-0.0833em;",[74,1615,1521],{"className":1616,"style":1520},[95,1519],[74,1618],{"className":1619,"style":1620},[301],"margin-right:0.2222em;",[74,1622,1624],{"className":1623},[156],"×",[74,1626],{"className":1627,"style":1620},[301],[74,1629,1631,1635,1638,1641,1645],{"className":1630},[86],[74,1632],{"className":1633,"style":1634},[90],"height:0.6833em;",[74,1636,1531],{"className":1637},[95,1519],[74,1639],{"className":1640,"style":656},[301],[74,1642,1644],{"className":1643},[663],"→",[74,1646],{"className":1647,"style":656},[301],[74,1649,1651,1655],{"className":1650},[86],[74,1652],{"className":1653,"style":1654},[90],"height:0.6889em;",[74,1656,1658],{"className":1657},[95,684],"R"," and a threshold ",[74,1661,1663],{"className":1662},[77],[74,1664,1666],{"className":1665,"ariaHidden":82},[81],[74,1667,1669,1672],{"className":1668},[86],[74,1670],{"className":1671,"style":418},[90],[74,1673,573],{"className":1674},[95,96],". A policy is ",[35,1677,1678],{},"feasible"," if its\nexpected discounted cost satisfies ",[74,1681,1683],{"className":1682},[77],[74,1684,1686,1750],{"className":1685,"ariaHidden":82},[81],[74,1687,1689,1692,1732,1735,1738,1741,1744,1747],{"className":1688},[86],[74,1690],{"className":1691,"style":490},[90],[74,1693,1695,1698],{"className":1694},[95],[74,1696,605],{"className":1697,"style":604},[95,96],[74,1699,1701],{"className":1700},[125],[74,1702,1704,1724],{"className":1703},[129,316],[74,1705,1707,1721],{"className":1706},[133],[74,1708,1710],{"className":1709,"style":618},[137],[74,1711,1712,1715],{"style":621},[74,1713],{"className":1714,"style":145},[144],[74,1716,1718],{"className":1717},[149,150,151,152],[74,1719,309],{"className":1720},[95,96,152],[74,1722,341],{"className":1723},[340],[74,1725,1727],{"className":1726},[133],[74,1728,1730],{"className":1729,"style":348},[137],[74,1731],{},[74,1733,498],{"className":1734},[497],[74,1736,649],{"className":1737,"style":648},[95,96],[74,1739,518],{"className":1740},[517],[74,1742],{"className":1743,"style":656},[301],[74,1745,1343],{"className":1746},[663],[74,1748],{"className":1749,"style":656},[301],[74,1751,1753,1756],{"className":1752},[86],[74,1754],{"className":1755,"style":418},[90],[74,1757,573],{"className":1758},[95,96],"; the objective is the\nhighest-return policy among the feasible ones.",[11,1761,1762,1763,1766,1767,1846,1847,1850],{},"The constraint carves the space of all policies into a ",[35,1764,1765],{},"feasible set"," — those\nthat satisfy ",[74,1768,1770],{"className":1769},[77],[74,1771,1773,1837],{"className":1772,"ariaHidden":82},[81],[74,1774,1776,1779,1819,1822,1825,1828,1831,1834],{"className":1775},[86],[74,1777],{"className":1778,"style":490},[90],[74,1780,1782,1785],{"className":1781},[95],[74,1783,605],{"className":1784,"style":604},[95,96],[74,1786,1788],{"className":1787},[125],[74,1789,1791,1811],{"className":1790},[129,316],[74,1792,1794,1808],{"className":1793},[133],[74,1795,1797],{"className":1796,"style":618},[137],[74,1798,1799,1802],{"style":621},[74,1800],{"className":1801,"style":145},[144],[74,1803,1805],{"className":1804},[149,150,151,152],[74,1806,309],{"className":1807},[95,96,152],[74,1809,341],{"className":1810},[340],[74,1812,1814],{"className":1813},[133],[74,1815,1817],{"className":1816,"style":348},[137],[74,1818],{},[74,1820,498],{"className":1821},[497],[74,1823,649],{"className":1824,"style":648},[95,96],[74,1826,518],{"className":1827},[517],[74,1829],{"className":1830,"style":656},[301],[74,1832,1343],{"className":1833},[663],[74,1835],{"className":1836,"style":656},[301],[74,1838,1840,1843],{"className":1839},[86],[74,1841],{"className":1842,"style":418},[90],[74,1844,573],{"className":1845},[95,96]," — and the goal is the best-return policy ",[15,1848,1849],{},"inside"," it,\nwhich is in general different from the unconstrained optimum sitting outside.",[242,1852],{"hash":1853},"0448c56cd9ece81fac1e886a30bd8fd801cfbcc4a6c831c73f4eecb793837265",[11,1855,1856,1857,1860,1861,1940],{},"Because the best feasible policy so often sits ",[15,1858,1859],{},"on"," the boundary ",[74,1862,1864],{"className":1863},[77],[74,1865,1867,1931],{"className":1866,"ariaHidden":82},[81],[74,1868,1870,1873,1913,1916,1919,1922,1925,1928],{"className":1869},[86],[74,1871],{"className":1872,"style":490},[90],[74,1874,1876,1879],{"className":1875},[95],[74,1877,605],{"className":1878,"style":604},[95,96],[74,1880,1882],{"className":1881},[125],[74,1883,1885,1905],{"className":1884},[129,316],[74,1886,1888,1902],{"className":1887},[133],[74,1889,1891],{"className":1890,"style":618},[137],[74,1892,1893,1896],{"style":621},[74,1894],{"className":1895,"style":145},[144],[74,1897,1899],{"className":1898},[149,150,151,152],[74,1900,309],{"className":1901},[95,96,152],[74,1903,341],{"className":1904},[340],[74,1906,1908],{"className":1907},[133],[74,1909,1911],{"className":1910,"style":348},[137],[74,1912],{},[74,1914,498],{"className":1915},[497],[74,1917,649],{"className":1918,"style":648},[95,96],[74,1920,518],{"className":1921},[517],[74,1923],{"className":1924,"style":656},[301],[74,1926,664],{"className":1927},[663],[74,1929],{"className":1930,"style":656},[301],[74,1932,1934,1937],{"className":1933},[86],[74,1935],{"className":1936,"style":418},[90],[74,1938,573],{"className":1939},[95,96],"\n(spend the whole budget, no more), the constraint is typically active, and the two\nmethods that follow are two ways of finding that boundary point.",[62,1942,1944],{"id":1943},"lagrangian-methods-and-rcpo","Lagrangian methods and RCPO",[11,1946,1947,1948,1951,1952,1987],{},"The textbook tool for a constrained optimization is the ",[35,1949,1950],{},"Lagrangian",". Introduce\na multiplier ",[74,1953,1955],{"className":1954},[77],[74,1956,1958,1977],{"className":1957,"ariaHidden":82},[81],[74,1959,1961,1965,1968,1971,1974],{"className":1960},[86],[74,1962],{"className":1963,"style":1964},[90],"height:0.8304em;vertical-align:-0.136em;",[74,1966,297],{"className":1967},[95,96],[74,1969],{"className":1970,"style":656},[301],[74,1972,774],{"className":1973},[663],[74,1975],{"className":1976,"style":656},[301],[74,1978,1980,1984],{"className":1979},[86],[74,1981],{"className":1982,"style":1983},[90],"height:0.6444em;",[74,1985,778],{"className":1986},[95]," on the constraint and fold it into a single objective,",[74,1989,1991],{"className":1990},[585],[74,1992,1994],{"className":1993},[77],[74,1995,1997,2040,2111,2189],{"className":1996,"ariaHidden":82},[81],[74,1998,2000,2003,2007,2010,2013,2016,2019,2022,2025,2028,2031,2034,2037],{"className":1999},[86],[74,2001],{"className":2002,"style":490},[90],[74,2004,2006],{"className":2005},[95,1519],"L",[74,2008,498],{"className":2009},[497],[74,2011,649],{"className":2012,"style":648},[95,96],[74,2014,507],{"className":2015},[506],[74,2017],{"className":2018,"style":302},[301],[74,2020,297],{"className":2021},[95,96],[74,2023,518],{"className":2024},[517],[74,2026],{"className":2027,"style":656},[301],[74,2029],{"className":2030,"style":656},[301],[74,2032,664],{"className":2033},[663],[74,2035],{"className":2036,"style":656},[301],[74,2038],{"className":2039,"style":656},[301],[74,2041,2043,2046,2086,2089,2092,2095,2098,2101,2105,2108],{"className":2042},[86],[74,2044],{"className":2045,"style":490},[90],[74,2047,2049,2052],{"className":2048},[95],[74,2050,605],{"className":2051,"style":604},[95,96],[74,2053,2055],{"className":2054},[125],[74,2056,2058,2078],{"className":2057},[129,316],[74,2059,2061,2075],{"className":2060},[133],[74,2062,2064],{"className":2063,"style":618},[137],[74,2065,2066,2069],{"style":621},[74,2067],{"className":2068,"style":145},[144],[74,2070,2072],{"className":2071},[149,150,151,152],[74,2073,98],{"className":2074,"style":97},[95,96,152],[74,2076,341],{"className":2077},[340],[74,2079,2081],{"className":2080},[133],[74,2082,2084],{"className":2083,"style":348},[137],[74,2085],{},[74,2087,498],{"className":2088},[497],[74,2090,649],{"className":2091,"style":648},[95,96],[74,2093,518],{"className":2094},[517],[74,2096],{"className":2097,"style":656},[301],[74,2099],{"className":2100,"style":1620},[301],[74,2102,2104],{"className":2103},[156],"−",[74,2106],{"className":2107,"style":656},[301],[74,2109],{"className":2110,"style":1620},[301],[74,2112,2114,2118,2121,2124,2131,2171,2174,2177,2180,2183,2186],{"className":2113},[86],[74,2115],{"className":2116,"style":2117},[90],"height:1.2em;vertical-align:-0.35em;",[74,2119,297],{"className":2120},[95,96],[74,2122],{"className":2123,"style":302},[301],[74,2125,2127],{"className":2126},[497],[74,2128,498],{"className":2129},[730,2130],"size1",[74,2132,2134,2137],{"className":2133},[95],[74,2135,605],{"className":2136,"style":604},[95,96],[74,2138,2140],{"className":2139},[125],[74,2141,2143,2163],{"className":2142},[129,316],[74,2144,2146,2160],{"className":2145},[133],[74,2147,2149],{"className":2148,"style":618},[137],[74,2150,2151,2154],{"style":621},[74,2152],{"className":2153,"style":145},[144],[74,2155,2157],{"className":2156},[149,150,151,152],[74,2158,309],{"className":2159},[95,96,152],[74,2161,341],{"className":2162},[340],[74,2164,2166],{"className":2165},[133],[74,2167,2169],{"className":2168,"style":348},[137],[74,2170],{},[74,2172,498],{"className":2173},[497],[74,2175,649],{"className":2176,"style":648},[95,96],[74,2178,518],{"className":2179},[517],[74,2181],{"className":2182,"style":1620},[301],[74,2184,2104],{"className":2185},[156],[74,2187],{"className":2188,"style":1620},[301],[74,2190,2192,2195,2198,2204],{"className":2191},[86],[74,2193],{"className":2194,"style":2117},[90],[74,2196,573],{"className":2197},[95,96],[74,2199,2201],{"className":2200},[517],[74,2202,518],{"className":2203},[730,2130],[74,2205,60],{"className":2206},[95],[11,2208,2209,2210,2213,2214,2229,2230,2245,2246,2261,2262,2376,2377,2392,2393,2396,2397,2412,2413,2428,2429,2444,2445,2448],{},"Read the multiplier as a ",[15,2211,2212],{},"price"," on cost. For a fixed ",[74,2215,2217],{"className":2216},[77],[74,2218,2220],{"className":2219,"ariaHidden":82},[81],[74,2221,2223,2226],{"className":2222},[86],[74,2224],{"className":2225,"style":418},[90],[74,2227,297],{"className":2228},[95,96],", maximizing\n",[74,2231,2233],{"className":2232},[77],[74,2234,2236],{"className":2235,"ariaHidden":82},[81],[74,2237,2239,2242],{"className":2238},[86],[74,2240],{"className":2241,"style":1634},[90],[74,2243,2006],{"className":2244},[95,1519]," over ",[74,2247,2249],{"className":2248},[77],[74,2250,2252],{"className":2251,"ariaHidden":82},[81],[74,2253,2255,2258],{"className":2254},[86],[74,2256],{"className":2257,"style":91},[90],[74,2259,649],{"className":2260,"style":648},[95,96]," is an ordinary unconstrained RL problem with the shaped\nreward ",[74,2263,2265],{"className":2264},[77],[74,2266,2268,2324],{"className":2267,"ariaHidden":82},[81],[74,2269,2271,2275,2315,2318,2321],{"className":2270},[86],[74,2272],{"className":2273,"style":2274},[90],"height:0.7333em;vertical-align:-0.15em;",[74,2276,2278,2281],{"className":2277},[95],[74,2279,98],{"className":2280,"style":97},[95,96],[74,2282,2284],{"className":2283},[125],[74,2285,2287,2307],{"className":2286},[129,316],[74,2288,2290,2304],{"className":2289},[133],[74,2291,2293],{"className":2292,"style":323},[137],[74,2294,2295,2298],{"style":849},[74,2296],{"className":2297,"style":145},[144],[74,2299,2301],{"className":2300},[149,150,151,152],[74,2302,336],{"className":2303},[95,96,152],[74,2305,341],{"className":2306},[340],[74,2308,2310],{"className":2309},[133],[74,2311,2313],{"className":2312,"style":348},[137],[74,2314],{},[74,2316],{"className":2317,"style":1620},[301],[74,2319,2104],{"className":2320},[156],[74,2322],{"className":2323,"style":1620},[301],[74,2325,2327,2330,2333,2336],{"className":2326},[86],[74,2328],{"className":2329,"style":293},[90],[74,2331,297],{"className":2332},[95,96],[74,2334],{"className":2335,"style":302},[301],[74,2337,2339,2342],{"className":2338},[95],[74,2340,309],{"className":2341},[95,96],[74,2343,2345],{"className":2344},[125],[74,2346,2348,2368],{"className":2347},[129,316],[74,2349,2351,2365],{"className":2350},[133],[74,2352,2354],{"className":2353,"style":323},[137],[74,2355,2356,2359],{"style":326},[74,2357],{"className":2358,"style":145},[144],[74,2360,2362],{"className":2361},[149,150,151,152],[74,2363,336],{"className":2364},[95,96,152],[74,2366,341],{"className":2367},[340],[74,2369,2371],{"className":2370},[133],[74,2372,2374],{"className":2373,"style":348},[137],[74,2375],{}," — exactly the hand-penalty from earlier, except now\n",[74,2378,2380],{"className":2379},[77],[74,2381,2383],{"className":2382,"ariaHidden":82},[81],[74,2384,2386,2389],{"className":2385},[86],[74,2387],{"className":2388,"style":418},[90],[74,2390,297],{"className":2391},[95,96]," is not something you guess. The theory of Lagrangian duality says the\nconstrained optimum is a ",[35,2394,2395],{},"saddle point"," of ",[74,2398,2400],{"className":2399},[77],[74,2401,2403],{"className":2402,"ariaHidden":82},[81],[74,2404,2406,2409],{"className":2405},[86],[74,2407],{"className":2408,"style":1634},[90],[74,2410,2006],{"className":2411},[95,1519],": a maximum over ",[74,2414,2416],{"className":2415},[77],[74,2417,2419],{"className":2418,"ariaHidden":82},[81],[74,2420,2422,2425],{"className":2421},[86],[74,2423],{"className":2424,"style":91},[90],[74,2426,649],{"className":2427,"style":648},[95,96],"\nand a minimum over ",[74,2430,2432],{"className":2431},[77],[74,2433,2435],{"className":2434,"ariaHidden":82},[81],[74,2436,2438,2441],{"className":2437},[86],[74,2439],{"className":2440,"style":418},[90],[74,2442,297],{"className":2443},[95,96],". We reach it by ",[35,2446,2447],{},"primal-dual"," optimization —\nalternate improving the policy at the current price and adjusting the price toward\nthe constraint.",[11,2450,2451,2452,2467,2468,2483,2484,2604],{},"The multiplier update is a gradient step on ",[74,2453,2455],{"className":2454},[77],[74,2456,2458],{"className":2457,"ariaHidden":82},[81],[74,2459,2461,2464],{"className":2460},[86],[74,2462],{"className":2463,"style":1634},[90],[74,2465,2006],{"className":2466},[95,1519]," in ",[74,2469,2471],{"className":2470},[77],[74,2472,2474],{"className":2473,"ariaHidden":82},[81],[74,2475,2477,2480],{"className":2476},[86],[74,2478],{"className":2479,"style":418},[90],[74,2481,297],{"className":2482},[95,96],", and\n",[74,2485,2487],{"className":2486},[77],[74,2488,2490,2522,2592],{"className":2489,"ariaHidden":82},[81],[74,2491,2493,2496,2500,2503,2507,2510,2513,2516,2519],{"className":2492},[86],[74,2494],{"className":2495,"style":490},[90],[74,2497,2499],{"className":2498,"style":800},[95],"∂",[74,2501,2006],{"className":2502},[95,1519],[74,2504,2506],{"className":2505},[95],"\u002F",[74,2508,2499],{"className":2509,"style":800},[95],[74,2511,297],{"className":2512},[95,96],[74,2514],{"className":2515,"style":656},[301],[74,2517,664],{"className":2518},[663],[74,2520],{"className":2521,"style":656},[301],[74,2523,2525,2528,2531,2534,2574,2577,2580,2583,2586,2589],{"className":2524},[86],[74,2526],{"className":2527,"style":490},[90],[74,2529,2104],{"className":2530},[95],[74,2532,498],{"className":2533},[497],[74,2535,2537,2540],{"className":2536},[95],[74,2538,605],{"className":2539,"style":604},[95,96],[74,2541,2543],{"className":2542},[125],[74,2544,2546,2566],{"className":2545},[129,316],[74,2547,2549,2563],{"className":2548},[133],[74,2550,2552],{"className":2551,"style":618},[137],[74,2553,2554,2557],{"style":621},[74,2555],{"className":2556,"style":145},[144],[74,2558,2560],{"className":2559},[149,150,151,152],[74,2561,309],{"className":2562},[95,96,152],[74,2564,341],{"className":2565},[340],[74,2567,2569],{"className":2568},[133],[74,2570,2572],{"className":2571,"style":348},[137],[74,2573],{},[74,2575,498],{"className":2576},[497],[74,2578,649],{"className":2579,"style":648},[95,96],[74,2581,518],{"className":2582},[517],[74,2584],{"className":2585,"style":1620},[301],[74,2587,2104],{"className":2588},[156],[74,2590],{"className":2591,"style":1620},[301],[74,2593,2595,2598,2601],{"className":2594},[86],[74,2596],{"className":2597,"style":490},[90],[74,2599,573],{"className":2600},[95,96],[74,2602,518],{"className":2603},[517],", so it is a simple\nfeedback law:",[74,2606,2608],{"className":2607},[585],[74,2609,2611],{"className":2610},[77],[74,2612,2614,2639,2673,2789],{"className":2613,"ariaHidden":82},[81],[74,2615,2617,2620,2623,2626,2629,2633,2636],{"className":2616},[86],[74,2618],{"className":2619,"style":418},[90],[74,2621,297],{"className":2622},[95,96],[74,2624],{"className":2625,"style":656},[301],[74,2627],{"className":2628,"style":656},[301],[74,2630,2632],{"className":2631},[663],"←",[74,2634],{"className":2635,"style":656},[301],[74,2637],{"className":2638,"style":656},[301],[74,2640,2642,2645,2651,2654,2657,2660,2663,2667,2670],{"className":2641},[86],[74,2643],{"className":2644,"style":2117},[90],[74,2646,2648],{"className":2647},[497],[74,2649,732],{"className":2650},[730,2130],[74,2652],{"className":2653,"style":302},[301],[74,2655,297],{"className":2656},[95,96],[74,2658],{"className":2659,"style":656},[301],[74,2661],{"className":2662,"style":1620},[301],[74,2664,2666],{"className":2665},[156],"+",[74,2668],{"className":2669,"style":656},[301],[74,2671],{"className":2672,"style":1620},[301],[74,2674,2676,2679,2722,2725,2731,2771,2774,2777,2780,2783,2786],{"className":2675},[86],[74,2677],{"className":2678,"style":2117},[90],[74,2680,2682,2686],{"className":2681},[95],[74,2683,2685],{"className":2684,"style":648},[95,96],"η",[74,2687,2689],{"className":2688},[125],[74,2690,2692,2714],{"className":2691},[129,316],[74,2693,2695,2711],{"className":2694},[133],[74,2696,2699],{"className":2697,"style":2698},[137],"height:0.3361em;",[74,2700,2702,2705],{"style":2701},"top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;",[74,2703],{"className":2704,"style":145},[144],[74,2706,2708],{"className":2707},[149,150,151,152],[74,2709,297],{"className":2710},[95,96,152],[74,2712,341],{"className":2713},[340],[74,2715,2717],{"className":2716},[133],[74,2718,2720],{"className":2719,"style":348},[137],[74,2721],{},[74,2723],{"className":2724,"style":302},[301],[74,2726,2728],{"className":2727},[497],[74,2729,498],{"className":2730},[730,2130],[74,2732,2734,2737],{"className":2733},[95],[74,2735,605],{"className":2736,"style":604},[95,96],[74,2738,2740],{"className":2739},[125],[74,2741,2743,2763],{"className":2742},[129,316],[74,2744,2746,2760],{"className":2745},[133],[74,2747,2749],{"className":2748,"style":618},[137],[74,2750,2751,2754],{"style":621},[74,2752],{"className":2753,"style":145},[144],[74,2755,2757],{"className":2756},[149,150,151,152],[74,2758,309],{"className":2759},[95,96,152],[74,2761,341],{"className":2762},[340],[74,2764,2766],{"className":2765},[133],[74,2767,2769],{"className":2768,"style":348},[137],[74,2770],{},[74,2772,498],{"className":2773},[497],[74,2775,649],{"className":2776,"style":648},[95,96],[74,2778,518],{"className":2779},[517],[74,2781],{"className":2782,"style":1620},[301],[74,2784,2104],{"className":2785},[156],[74,2787],{"className":2788,"style":1620},[301],[74,2790,2792,2796,2799,2805,2808,2854],{"className":2791},[86],[74,2793],{"className":2794,"style":2795},[90],"height:1.308em;vertical-align:-0.458em;",[74,2797,573],{"className":2798},[95,96],[74,2800,2802],{"className":2801},[517],[74,2803,518],{"className":2804},[730,2130],[74,2806],{"className":2807,"style":302},[301],[74,2809,2811,2817],{"className":2810},[517],[74,2812,2814],{"className":2813},[517],[74,2815,876],{"className":2816},[730,2130],[74,2818,2820],{"className":2819},[125],[74,2821,2823,2845],{"className":2822},[129,316],[74,2824,2826,2842],{"className":2825},[133],[74,2827,2830],{"className":2828,"style":2829},[137],"height:0.0086em;",[74,2831,2833,2836],{"style":2832},"top:-2.3003em;margin-right:0.05em;",[74,2834],{"className":2835,"style":145},[144],[74,2837,2839],{"className":2838},[149,150,151,152],[74,2840,2666],{"className":2841},[156,152],[74,2843,341],{"className":2844},[340],[74,2846,2848],{"className":2847},[133],[74,2849,2852],{"className":2850,"style":2851},[137],"height:0.458em;",[74,2853],{},[74,2855,507],{"className":2856},[506],[11,2858,2859,2860,2921,2922,2937,2938,3010,3011,3026,3027,3010,3098,3113,3114,60],{},"with ",[74,2861,2863],{"className":2862},[77],[74,2864,2866],{"className":2865,"ariaHidden":82},[81],[74,2867,2869,2872,2875,2879],{"className":2868},[86],[74,2870],{"className":2871,"style":490},[90],[74,2873,732],{"className":2874},[497],[74,2876,2878],{"className":2877},[95],"⋅",[74,2880,2882,2885],{"className":2881},[517],[74,2883,876],{"className":2884},[517],[74,2886,2888],{"className":2887},[125],[74,2889,2891,2912],{"className":2890},[129,316],[74,2892,2894,2909],{"className":2893},[133],[74,2895,2898],{"className":2896,"style":2897},[137],"height:0.2583em;",[74,2899,2900,2903],{"style":326},[74,2901],{"className":2902,"style":145},[144],[74,2904,2906],{"className":2905},[149,150,151,152],[74,2907,2666],{"className":2908},[156,152],[74,2910,341],{"className":2911},[340],[74,2913,2915],{"className":2914},[133],[74,2916,2919],{"className":2917,"style":2918},[137],"height:0.2083em;",[74,2920],{}," clamping ",[74,2923,2925],{"className":2924},[77],[74,2926,2928],{"className":2927,"ariaHidden":82},[81],[74,2929,2931,2934],{"className":2930},[86],[74,2932],{"className":2933,"style":418},[90],[74,2935,297],{"className":2936},[95,96]," to be non-negative. When the policy overspends\nits cost budget (",[74,2939,2941],{"className":2940},[77],[74,2942,2944,3001],{"className":2943,"ariaHidden":82},[81],[74,2945,2947,2951,2991,2994,2998],{"className":2946},[86],[74,2948],{"className":2949,"style":2950},[90],"height:0.8333em;vertical-align:-0.15em;",[74,2952,2954,2957],{"className":2953},[95],[74,2955,605],{"className":2956,"style":604},[95,96],[74,2958,2960],{"className":2959},[125],[74,2961,2963,2983],{"className":2962},[129,316],[74,2964,2966,2980],{"className":2965},[133],[74,2967,2969],{"className":2968,"style":618},[137],[74,2970,2971,2974],{"style":621},[74,2972],{"className":2973,"style":145},[144],[74,2975,2977],{"className":2976},[149,150,151,152],[74,2978,309],{"className":2979},[95,96,152],[74,2981,341],{"className":2982},[340],[74,2984,2986],{"className":2985},[133],[74,2987,2989],{"className":2988,"style":348},[137],[74,2990],{},[74,2992],{"className":2993,"style":656},[301],[74,2995,2997],{"className":2996},[663],">",[74,2999],{"className":3000,"style":656},[301],[74,3002,3004,3007],{"className":3003},[86],[74,3005],{"className":3006,"style":418},[90],[74,3008,573],{"className":3009},[95,96],"), ",[74,3012,3014],{"className":3013},[77],[74,3015,3017],{"className":3016,"ariaHidden":82},[81],[74,3018,3020,3023],{"className":3019},[86],[74,3021],{"className":3022,"style":418},[90],[74,3024,297],{"className":3025},[95,96]," rises, the penalty grows, and the\nnext policy update backs off the expensive behavior. When the policy is comfortably\nunder budget (",[74,3028,3030],{"className":3029},[77],[74,3031,3033,3089],{"className":3032,"ariaHidden":82},[81],[74,3034,3036,3039,3079,3082,3086],{"className":3035},[86],[74,3037],{"className":3038,"style":2950},[90],[74,3040,3042,3045],{"className":3041},[95],[74,3043,605],{"className":3044,"style":604},[95,96],[74,3046,3048],{"className":3047},[125],[74,3049,3051,3071],{"className":3050},[129,316],[74,3052,3054,3068],{"className":3053},[133],[74,3055,3057],{"className":3056,"style":618},[137],[74,3058,3059,3062],{"style":621},[74,3060],{"className":3061,"style":145},[144],[74,3063,3065],{"className":3064},[149,150,151,152],[74,3066,309],{"className":3067},[95,96,152],[74,3069,341],{"className":3070},[340],[74,3072,3074],{"className":3073},[133],[74,3075,3077],{"className":3076,"style":348},[137],[74,3078],{},[74,3080],{"className":3081,"style":656},[301],[74,3083,3085],{"className":3084},[663],"\u003C",[74,3087],{"className":3088,"style":656},[301],[74,3090,3092,3095],{"className":3091},[86],[74,3093],{"className":3094,"style":418},[90],[74,3096,573],{"className":3097},[95,96],[74,3099,3101],{"className":3100},[77],[74,3102,3104],{"className":3103,"ariaHidden":82},[81],[74,3105,3107,3110],{"className":3106},[86],[74,3108],{"className":3109,"style":418},[90],[74,3111,297],{"className":3112},[95,96]," falls toward zero, the constraint relaxes, and\nthe policy is free to pursue reward. The price self-tunes until ",[74,3115,3117],{"className":3116},[77],[74,3118,3120,3175],{"className":3119,"ariaHidden":82},[81],[74,3121,3123,3126,3166,3169,3172],{"className":3122},[86],[74,3124],{"className":3125,"style":2950},[90],[74,3127,3129,3132],{"className":3128},[95],[74,3130,605],{"className":3131,"style":604},[95,96],[74,3133,3135],{"className":3134},[125],[74,3136,3138,3158],{"className":3137},[129,316],[74,3139,3141,3155],{"className":3140},[133],[74,3142,3144],{"className":3143,"style":618},[137],[74,3145,3146,3149],{"style":621},[74,3147],{"className":3148,"style":145},[144],[74,3150,3152],{"className":3151},[149,150,151,152],[74,3153,309],{"className":3154},[95,96,152],[74,3156,341],{"className":3157},[340],[74,3159,3161],{"className":3160},[133],[74,3162,3164],{"className":3163,"style":348},[137],[74,3165],{},[74,3167],{"className":3168,"style":656},[301],[74,3170,664],{"className":3171},[663],[74,3173],{"className":3174,"style":656},[301],[74,3176,3178,3181],{"className":3177},[86],[74,3179],{"className":3180,"style":418},[90],[74,3182,573],{"className":3183},[95,96],[242,3185],{"hash":3186},"8d725a2dac64334e87b7f15d92a29d5759b79e91920270ce564da3ac07ce6034",[11,3188,3189,3192,3200,3201,3262,3263,3278,3279,3392,3393,3408],{},[35,3190,3191],{},"Reward Constrained Policy Optimization (RCPO)",[20,3193,3194],{},[23,3195,3199],{"href":3196,"ariaDescribedBy":3197,"dataFootnoteRef":6,"id":3198},"#user-content-fn-rcpo",[27],"user-content-fnref-rcpo","4"," is the actor-critic\nrealization of this idea, with one refinement that makes it practical. Rather than\nwait for a full episode to measure ",[74,3202,3204],{"className":3203},[77],[74,3205,3207],{"className":3206,"ariaHidden":82},[81],[74,3208,3210,3213,3253,3256,3259],{"className":3209},[86],[74,3211],{"className":3212,"style":490},[90],[74,3214,3216,3219],{"className":3215},[95],[74,3217,605],{"className":3218,"style":604},[95,96],[74,3220,3222],{"className":3221},[125],[74,3223,3225,3245],{"className":3224},[129,316],[74,3226,3228,3242],{"className":3227},[133],[74,3229,3231],{"className":3230,"style":618},[137],[74,3232,3233,3236],{"style":621},[74,3234],{"className":3235,"style":145},[144],[74,3237,3239],{"className":3238},[149,150,151,152],[74,3240,309],{"className":3241},[95,96,152],[74,3243,341],{"className":3244},[340],[74,3246,3248],{"className":3247},[133],[74,3249,3251],{"className":3250,"style":348},[137],[74,3252],{},[74,3254,498],{"className":3255},[497],[74,3257,649],{"className":3258,"style":648},[95,96],[74,3260,518],{"className":3261},[517],", RCPO treats ",[74,3264,3266],{"className":3265},[77],[74,3267,3269],{"className":3268,"ariaHidden":82},[81],[74,3270,3272,3275],{"className":3271},[86],[74,3273],{"className":3274,"style":418},[90],[74,3276,297],{"className":3277},[95,96]," as a slowly\nadapting parameter on a separate, slower timescale than the policy and value\nupdates. On the fast timescale the actor and critic optimize the penalized reward\n",[74,3280,3282],{"className":3281},[77],[74,3283,3285,3340],{"className":3284,"ariaHidden":82},[81],[74,3286,3288,3291,3331,3334,3337],{"className":3287},[86],[74,3289],{"className":3290,"style":2274},[90],[74,3292,3294,3297],{"className":3293},[95],[74,3295,98],{"className":3296,"style":97},[95,96],[74,3298,3300],{"className":3299},[125],[74,3301,3303,3323],{"className":3302},[129,316],[74,3304,3306,3320],{"className":3305},[133],[74,3307,3309],{"className":3308,"style":323},[137],[74,3310,3311,3314],{"style":849},[74,3312],{"className":3313,"style":145},[144],[74,3315,3317],{"className":3316},[149,150,151,152],[74,3318,336],{"className":3319},[95,96,152],[74,3321,341],{"className":3322},[340],[74,3324,3326],{"className":3325},[133],[74,3327,3329],{"className":3328,"style":348},[137],[74,3330],{},[74,3332],{"className":3333,"style":1620},[301],[74,3335,2104],{"className":3336},[156],[74,3338],{"className":3339,"style":1620},[301],[74,3341,3343,3346,3349,3352],{"className":3342},[86],[74,3344],{"className":3345,"style":293},[90],[74,3347,297],{"className":3348},[95,96],[74,3350],{"className":3351,"style":302},[301],[74,3353,3355,3358],{"className":3354},[95],[74,3356,309],{"className":3357},[95,96],[74,3359,3361],{"className":3360},[125],[74,3362,3364,3384],{"className":3363},[129,316],[74,3365,3367,3381],{"className":3366},[133],[74,3368,3370],{"className":3369,"style":323},[137],[74,3371,3372,3375],{"style":326},[74,3373],{"className":3374,"style":145},[144],[74,3376,3378],{"className":3377},[149,150,151,152],[74,3379,336],{"className":3380},[95,96,152],[74,3382,341],{"className":3383},[340],[74,3385,3387],{"className":3386},[133],[74,3388,3390],{"className":3389,"style":348},[137],[74,3391],{}," with any standard policy-gradient method; on the slow\ntimescale ",[74,3394,3396],{"className":3395},[77],[74,3397,3399],{"className":3398,"ariaHidden":82},[81],[74,3400,3402,3405],{"className":3401},[86],[74,3403],{"className":3404,"style":418},[90],[74,3406,297],{"className":3407},[95,96]," drifts by the feedback law above. The timescale separation is\nwhat makes the saddle-point search converge: the policy sees a nearly-fixed price\nlong enough to respond to it, and the price sees a nearly-converged policy long\nenough to read its true cost.",[3410,3411,3415],"pre",{"className":3412,"code":3413,"language":3414,"meta":6,"style":6},"language-algorithm shiki shiki-themes Vesper Light - Orange Boost (Quick Open Adjusted) vesper","caption: $\\textsc{RCPO}$ — reward-constrained actor-critic via primal-dual optimization\n$\\lambda \\gets 0$ \u002F\u002F initialize the cost price\ninitialize policy $\\theta$ and value\u002Fcost critics\nrepeat\n  collect trajectories under $\\pi_\\theta$, recording rewards $r_t$ and costs $c_t$\n  $\\tilde r_t \\gets r_t - \\lambda\\, c_t$ \u002F\u002F penalized reward on the fast timescale\n  update critics and $\\theta$ by a policy-gradient step on $\\tilde r_t$\n  $\\hat J_c \\gets$ estimate of $\\mathbb{E}_\\pi[\\sum_t \\gamma^t c_t]$ from the trajectories\n  $\\lambda \\gets [\\, \\lambda + \\eta_\\lambda\\,(\\hat J_c - d)\\,]_+$ \u002F\u002F slow dual step\nuntil policy and $\\lambda$ both converge\nreturn $\\pi_\\theta$\n","algorithm",[3416,3417,3418,3425,3431,3437,3443,3449,3455,3461,3467,3473,3479],"code",{"__ignoreMap":6},[74,3419,3422],{"class":3420,"line":3421},"line",1,[74,3423,3424],{},"caption: $\\textsc{RCPO}$ — reward-constrained actor-critic via primal-dual optimization\n",[74,3426,3428],{"class":3420,"line":3427},2,[74,3429,3430],{},"$\\lambda \\gets 0$ \u002F\u002F initialize the cost price\n",[74,3432,3434],{"class":3420,"line":3433},3,[74,3435,3436],{},"initialize policy $\\theta$ and value\u002Fcost critics\n",[74,3438,3440],{"class":3420,"line":3439},4,[74,3441,3442],{},"repeat\n",[74,3444,3446],{"class":3420,"line":3445},5,[74,3447,3448],{},"  collect trajectories under $\\pi_\\theta$, recording rewards $r_t$ and costs $c_t$\n",[74,3450,3452],{"class":3420,"line":3451},6,[74,3453,3454],{},"  $\\tilde r_t \\gets r_t - \\lambda\\, c_t$ \u002F\u002F penalized reward on the fast timescale\n",[74,3456,3458],{"class":3420,"line":3457},7,[74,3459,3460],{},"  update critics and $\\theta$ by a policy-gradient step on $\\tilde r_t$\n",[74,3462,3464],{"class":3420,"line":3463},8,[74,3465,3466],{},"  $\\hat J_c \\gets$ estimate of $\\mathbb{E}_\\pi[\\sum_t \\gamma^t c_t]$ from the trajectories\n",[74,3468,3470],{"class":3420,"line":3469},9,[74,3471,3472],{},"  $\\lambda \\gets [\\, \\lambda + \\eta_\\lambda\\,(\\hat J_c - d)\\,]_+$ \u002F\u002F slow dual step\n",[74,3474,3476],{"class":3420,"line":3475},10,[74,3477,3478],{},"until policy and $\\lambda$ both converge\n",[74,3480,3482],{"class":3420,"line":3481},11,[74,3483,3484],{},"return $\\pi_\\theta$\n",[246,3486,3487],{"type":248},[11,3488,3489,3492,3493,3526,3527,3715,3716,3719,3720,3723,3724,3739,3740,3755],{},[35,3490,3491],{},"Definition (Lagrangian \u002F primal-dual method)."," A constrained-optimization\nscheme that adjoins the constraint to the objective through a multiplier\n",[74,3494,3496],{"className":3495},[77],[74,3497,3499,3517],{"className":3498,"ariaHidden":82},[81],[74,3500,3502,3505,3508,3511,3514],{"className":3501},[86],[74,3503],{"className":3504,"style":1964},[90],[74,3506,297],{"className":3507},[95,96],[74,3509],{"className":3510,"style":656},[301],[74,3512,774],{"className":3513},[663],[74,3515],{"className":3516,"style":656},[301],[74,3518,3520,3523],{"className":3519},[86],[74,3521],{"className":3522,"style":1983},[90],[74,3524,778],{"className":3525},[95],", forming ",[74,3528,3530],{"className":3529},[77],[74,3531,3533,3569,3633,3703],{"className":3532,"ariaHidden":82},[81],[74,3534,3536,3539,3542,3545,3548,3551,3554,3557,3560,3563,3566],{"className":3535},[86],[74,3537],{"className":3538,"style":490},[90],[74,3540,2006],{"className":3541},[95,1519],[74,3543,498],{"className":3544},[497],[74,3546,649],{"className":3547,"style":648},[95,96],[74,3549,507],{"className":3550},[506],[74,3552],{"className":3553,"style":302},[301],[74,3555,297],{"className":3556},[95,96],[74,3558,518],{"className":3559},[517],[74,3561],{"className":3562,"style":656},[301],[74,3564,664],{"className":3565},[663],[74,3567],{"className":3568,"style":656},[301],[74,3570,3572,3575,3615,3618,3621,3624,3627,3630],{"className":3571},[86],[74,3573],{"className":3574,"style":490},[90],[74,3576,3578,3581],{"className":3577},[95],[74,3579,605],{"className":3580,"style":604},[95,96],[74,3582,3584],{"className":3583},[125],[74,3585,3587,3607],{"className":3586},[129,316],[74,3588,3590,3604],{"className":3589},[133],[74,3591,3593],{"className":3592,"style":618},[137],[74,3594,3595,3598],{"style":621},[74,3596],{"className":3597,"style":145},[144],[74,3599,3601],{"className":3600},[149,150,151,152],[74,3602,98],{"className":3603,"style":97},[95,96,152],[74,3605,341],{"className":3606},[340],[74,3608,3610],{"className":3609},[133],[74,3611,3613],{"className":3612,"style":348},[137],[74,3614],{},[74,3616,498],{"className":3617},[497],[74,3619,649],{"className":3620,"style":648},[95,96],[74,3622,518],{"className":3623},[517],[74,3625],{"className":3626,"style":1620},[301],[74,3628,2104],{"className":3629},[156],[74,3631],{"className":3632,"style":1620},[301],[74,3634,3636,3639,3642,3645,3685,3688,3691,3694,3697,3700],{"className":3635},[86],[74,3637],{"className":3638,"style":490},[90],[74,3640,297],{"className":3641},[95,96],[74,3643,498],{"className":3644},[497],[74,3646,3648,3651],{"className":3647},[95],[74,3649,605],{"className":3650,"style":604},[95,96],[74,3652,3654],{"className":3653},[125],[74,3655,3657,3677],{"className":3656},[129,316],[74,3658,3660,3674],{"className":3659},[133],[74,3661,3663],{"className":3662,"style":618},[137],[74,3664,3665,3668],{"style":621},[74,3666],{"className":3667,"style":145},[144],[74,3669,3671],{"className":3670},[149,150,151,152],[74,3672,309],{"className":3673},[95,96,152],[74,3675,341],{"className":3676},[340],[74,3678,3680],{"className":3679},[133],[74,3681,3683],{"className":3682,"style":348},[137],[74,3684],{},[74,3686,498],{"className":3687},[497],[74,3689,649],{"className":3690,"style":648},[95,96],[74,3692,518],{"className":3693},[517],[74,3695],{"className":3696,"style":1620},[301],[74,3698,2104],{"className":3699},[156],[74,3701],{"className":3702,"style":1620},[301],[74,3704,3706,3709,3712],{"className":3705},[86],[74,3707],{"className":3708,"style":490},[90],[74,3710,573],{"className":3711},[95,96],[74,3713,518],{"className":3714},[517],", then finds its saddle point by alternating a ",[35,3717,3718],{},"primal"," step (improve the\npolicy against the shaped reward) with a ",[35,3721,3722],{},"dual"," step (raise ",[74,3725,3727],{"className":3726},[77],[74,3728,3730],{"className":3729,"ariaHidden":82},[81],[74,3731,3733,3736],{"className":3732},[86],[74,3734],{"className":3735,"style":418},[90],[74,3737,297],{"className":3738},[95,96]," when the\nconstraint is violated, lower it when slack). RCPO is the actor-critic instance\nwith ",[74,3741,3743],{"className":3742},[77],[74,3744,3746],{"className":3745,"ariaHidden":82},[81],[74,3747,3749,3752],{"className":3748},[86],[74,3750],{"className":3751,"style":418},[90],[74,3753,297],{"className":3754},[95,96]," on a slower timescale.",[11,3757,3758,3759,3774,3775,3778],{},"The appeal is that RCPO reuses any policy-gradient method wholesale and adds one\nscalar and one update line. The cost is that the guarantees are asymptotic: during\ntraining, before ",[74,3760,3762],{"className":3761},[77],[74,3763,3765],{"className":3764,"ariaHidden":82},[81],[74,3766,3768,3771],{"className":3767},[86],[74,3769],{"className":3770,"style":418},[90],[74,3772,297],{"className":3773},[95,96]," has caught up, the policy can and does violate the\nconstraint. For a simulator that is harmless. For a physical system where every\nconstraint violation is a real collision, it is not — which motivates methods that\nbound the cost at ",[15,3776,3777],{},"every"," update, not just in the limit.",[3780,3781,3783],"h4",{"id":3782},"worked-example-the-multiplier-finding-the-budget","Worked example: the multiplier finding the budget",[11,3785,3786,3787,3802,3803,3837,3838,3910,3911,3944,3945,3978,3979,4085],{},"Trace ",[74,3788,3790],{"className":3789},[77],[74,3791,3793],{"className":3792,"ariaHidden":82},[81],[74,3794,3796,3799],{"className":3795},[86],[74,3797],{"className":3798,"style":418},[90],[74,3800,297],{"className":3801},[95,96]," over a few dual steps to see the feedback settle. Set the cost\nbudget ",[74,3804,3806],{"className":3805},[77],[74,3807,3809,3827],{"className":3808,"ariaHidden":82},[81],[74,3810,3812,3815,3818,3821,3824],{"className":3811},[86],[74,3813],{"className":3814,"style":418},[90],[74,3816,573],{"className":3817},[95,96],[74,3819],{"className":3820,"style":656},[301],[74,3822,664],{"className":3823},[663],[74,3825],{"className":3826,"style":656},[301],[74,3828,3830,3833],{"className":3829},[86],[74,3831],{"className":3832,"style":1983},[90],[74,3834,3836],{"className":3835},[95],"25"," (say, an average of 25 collisions-worth of cost per episode is\ntolerated) and the dual step ",[74,3839,3841],{"className":3840},[77],[74,3842,3844,3900],{"className":3843,"ariaHidden":82},[81],[74,3845,3847,3851,3891,3894,3897],{"className":3846},[86],[74,3848],{"className":3849,"style":3850},[90],"height:0.625em;vertical-align:-0.1944em;",[74,3852,3854,3857],{"className":3853},[95],[74,3855,2685],{"className":3856,"style":648},[95,96],[74,3858,3860],{"className":3859},[125],[74,3861,3863,3883],{"className":3862},[129,316],[74,3864,3866,3880],{"className":3865},[133],[74,3867,3869],{"className":3868,"style":2698},[137],[74,3870,3871,3874],{"style":2701},[74,3872],{"className":3873,"style":145},[144],[74,3875,3877],{"className":3876},[149,150,151,152],[74,3878,297],{"className":3879},[95,96,152],[74,3881,341],{"className":3882},[340],[74,3884,3886],{"className":3885},[133],[74,3887,3889],{"className":3888,"style":348},[137],[74,3890],{},[74,3892],{"className":3893,"style":656},[301],[74,3895,664],{"className":3896},[663],[74,3898],{"className":3899,"style":656},[301],[74,3901,3903,3906],{"className":3902},[86],[74,3904],{"className":3905,"style":1983},[90],[74,3907,3909],{"className":3908},[95],"0.01",", starting from ",[74,3912,3914],{"className":3913},[77],[74,3915,3917,3935],{"className":3916,"ariaHidden":82},[81],[74,3918,3920,3923,3926,3929,3932],{"className":3919},[86],[74,3921],{"className":3922,"style":418},[90],[74,3924,297],{"className":3925},[95,96],[74,3927],{"className":3928,"style":656},[301],[74,3930,664],{"className":3931},[663],[74,3933],{"className":3934,"style":656},[301],[74,3936,3938,3941],{"className":3937},[86],[74,3939],{"className":3940,"style":1983},[90],[74,3942,778],{"className":3943},[95],".\nWith ",[74,3946,3948],{"className":3947},[77],[74,3949,3951,3969],{"className":3950,"ariaHidden":82},[81],[74,3952,3954,3957,3960,3963,3966],{"className":3953},[86],[74,3955],{"className":3956,"style":418},[90],[74,3958,297],{"className":3959},[95,96],[74,3961],{"className":3962,"style":656},[301],[74,3964,664],{"className":3965},[663],[74,3967],{"className":3968,"style":656},[301],[74,3970,3972,3975],{"className":3971},[86],[74,3973],{"className":3974,"style":1983},[90],[74,3976,778],{"className":3977},[95]," the policy ignores cost entirely, so it overspends badly —\nmeasure ",[74,3980,3982],{"className":3981},[77],[74,3983,3985,4075],{"className":3984,"ariaHidden":82},[81],[74,3986,3988,3992,4066,4069,4072],{"className":3987},[86],[74,3989],{"className":3990,"style":3991},[90],"height:1.0968em;vertical-align:-0.15em;",[74,3993,3995,4032],{"className":3994},[95],[74,3996,3999],{"className":3997},[95,3998],"accent",[74,4000,4002],{"className":4001},[129],[74,4003,4005],{"className":4004},[133],[74,4006,4009,4017],{"className":4007,"style":4008},[137],"height:0.9468em;",[74,4010,4011,4014],{"style":1189},[74,4012],{"className":4013,"style":1177},[144],[74,4015,605],{"className":4016,"style":604},[95,96],[74,4018,4020,4023],{"style":4019},"top:-3.2523em;",[74,4021],{"className":4022,"style":1177},[144],[74,4024,4028],{"className":4025,"style":4027},[4026],"accent-body","left:-0.0833em;",[74,4029,4031],{"className":4030},[95],"^",[74,4033,4035],{"className":4034},[125],[74,4036,4038,4058],{"className":4037},[129,316],[74,4039,4041,4055],{"className":4040},[133],[74,4042,4044],{"className":4043,"style":618},[137],[74,4045,4046,4049],{"style":621},[74,4047],{"className":4048,"style":145},[144],[74,4050,4052],{"className":4051},[149,150,151,152],[74,4053,309],{"className":4054},[95,96,152],[74,4056,341],{"className":4057},[340],[74,4059,4061],{"className":4060},[133],[74,4062,4064],{"className":4063,"style":348},[137],[74,4065],{},[74,4067],{"className":4068,"style":656},[301],[74,4070,664],{"className":4071},[663],[74,4073],{"className":4074,"style":656},[301],[74,4076,4078,4081],{"className":4077},[86],[74,4079],{"className":4080,"style":1983},[90],[74,4082,4084],{"className":4083},[95],"60",". The dual step raises",[74,4087,4089],{"className":4088},[585],[74,4090,4092],{"className":4091},[77],[74,4093,4095,4113,4137,4164,4228],{"className":4094,"ariaHidden":82},[81],[74,4096,4098,4101,4104,4107,4110],{"className":4097},[86],[74,4099],{"className":4100,"style":418},[90],[74,4102,297],{"className":4103},[95,96],[74,4105],{"className":4106,"style":656},[301],[74,4108,2632],{"className":4109},[663],[74,4111],{"className":4112,"style":656},[301],[74,4114,4116,4119,4122,4125,4128,4131,4134],{"className":4115},[86],[74,4117],{"className":4118,"style":490},[90],[74,4120,732],{"className":4121},[497],[74,4123],{"className":4124,"style":302},[301],[74,4126,778],{"className":4127},[95],[74,4129],{"className":4130,"style":1620},[301],[74,4132,2666],{"className":4133},[156],[74,4135],{"className":4136,"style":1620},[301],[74,4138,4140,4143,4146,4149,4152,4155,4158,4161],{"className":4139},[86],[74,4141],{"className":4142,"style":490},[90],[74,4144,3909],{"className":4145},[95],[74,4147],{"className":4148,"style":302},[301],[74,4150,498],{"className":4151},[497],[74,4153,4084],{"className":4154},[95],[74,4156],{"className":4157,"style":1620},[301],[74,4159,2104],{"className":4160},[156],[74,4162],{"className":4163,"style":1620},[301],[74,4165,4167,4170,4173,4176,4179,4219,4222,4225],{"className":4166},[86],[74,4168],{"className":4169,"style":490},[90],[74,4171,3836],{"className":4172},[95],[74,4174,518],{"className":4175},[517],[74,4177],{"className":4178,"style":302},[301],[74,4180,4182,4185],{"className":4181},[517],[74,4183,876],{"className":4184},[517],[74,4186,4188],{"className":4187},[125],[74,4189,4191,4211],{"className":4190},[129,316],[74,4192,4194,4208],{"className":4193},[133],[74,4195,4197],{"className":4196,"style":2897},[137],[74,4198,4199,4202],{"style":326},[74,4200],{"className":4201,"style":145},[144],[74,4203,4205],{"className":4204},[149,150,151,152],[74,4206,2666],{"className":4207},[156,152],[74,4209,341],{"className":4210},[340],[74,4212,4214],{"className":4213},[133],[74,4215,4217],{"className":4216,"style":2918},[137],[74,4218],{},[74,4220],{"className":4221,"style":656},[301],[74,4223,664],{"className":4224},[663],[74,4226],{"className":4227,"style":656},[301],[74,4229,4231,4234],{"className":4230},[86],[74,4232],{"className":4233,"style":1983},[90],[74,4235,4237],{"className":4236},[95],"0.35.",[11,4239,4240,4241,4257,4258,4357],{},"Now cost is priced at ",[74,4242,4244],{"className":4243},[77],[74,4245,4247],{"className":4246,"ariaHidden":82},[81],[74,4248,4250,4253],{"className":4249},[86],[74,4251],{"className":4252,"style":1983},[90],[74,4254,4256],{"className":4255},[95],"0.35"," per unit; the next policy backs off and measures\n",[74,4259,4261],{"className":4260},[77],[74,4262,4264,4347],{"className":4263,"ariaHidden":82},[81],[74,4265,4267,4270,4338,4341,4344],{"className":4266},[86],[74,4268],{"className":4269,"style":3991},[90],[74,4271,4273,4304],{"className":4272},[95],[74,4274,4276],{"className":4275},[95,3998],[74,4277,4279],{"className":4278},[129],[74,4280,4282],{"className":4281},[133],[74,4283,4285,4293],{"className":4284,"style":4008},[137],[74,4286,4287,4290],{"style":1189},[74,4288],{"className":4289,"style":1177},[144],[74,4291,605],{"className":4292,"style":604},[95,96],[74,4294,4295,4298],{"style":4019},[74,4296],{"className":4297,"style":1177},[144],[74,4299,4301],{"className":4300,"style":4027},[4026],[74,4302,4031],{"className":4303},[95],[74,4305,4307],{"className":4306},[125],[74,4308,4310,4330],{"className":4309},[129,316],[74,4311,4313,4327],{"className":4312},[133],[74,4314,4316],{"className":4315,"style":618},[137],[74,4317,4318,4321],{"style":621},[74,4319],{"className":4320,"style":145},[144],[74,4322,4324],{"className":4323},[149,150,151,152],[74,4325,309],{"className":4326},[95,96,152],[74,4328,341],{"className":4329},[340],[74,4331,4333],{"className":4332},[133],[74,4334,4336],{"className":4335,"style":348},[137],[74,4337],{},[74,4339],{"className":4340,"style":656},[301],[74,4342,664],{"className":4343},[663],[74,4345],{"className":4346,"style":656},[301],[74,4348,4350,4353],{"className":4349},[86],[74,4351],{"className":4352,"style":1983},[90],[74,4354,4356],{"className":4355},[95],"32",", still over budget, so",[74,4359,4361],{"className":4360},[585],[74,4362,4364],{"className":4363},[77],[74,4365,4367,4385,4409,4436,4500],{"className":4366,"ariaHidden":82},[81],[74,4368,4370,4373,4376,4379,4382],{"className":4369},[86],[74,4371],{"className":4372,"style":418},[90],[74,4374,297],{"className":4375},[95,96],[74,4377],{"className":4378,"style":656},[301],[74,4380,2632],{"className":4381},[663],[74,4383],{"className":4384,"style":656},[301],[74,4386,4388,4391,4394,4397,4400,4403,4406],{"className":4387},[86],[74,4389],{"className":4390,"style":490},[90],[74,4392,732],{"className":4393},[497],[74,4395],{"className":4396,"style":302},[301],[74,4398,4256],{"className":4399},[95],[74,4401],{"className":4402,"style":1620},[301],[74,4404,2666],{"className":4405},[156],[74,4407],{"className":4408,"style":1620},[301],[74,4410,4412,4415,4418,4421,4424,4427,4430,4433],{"className":4411},[86],[74,4413],{"className":4414,"style":490},[90],[74,4416,3909],{"className":4417},[95],[74,4419],{"className":4420,"style":302},[301],[74,4422,498],{"className":4423},[497],[74,4425,4356],{"className":4426},[95],[74,4428],{"className":4429,"style":1620},[301],[74,4431,2104],{"className":4432},[156],[74,4434],{"className":4435,"style":1620},[301],[74,4437,4439,4442,4445,4448,4451,4491,4494,4497],{"className":4438},[86],[74,4440],{"className":4441,"style":490},[90],[74,4443,3836],{"className":4444},[95],[74,4446,518],{"className":4447},[517],[74,4449],{"className":4450,"style":302},[301],[74,4452,4454,4457],{"className":4453},[517],[74,4455,876],{"className":4456},[517],[74,4458,4460],{"className":4459},[125],[74,4461,4463,4483],{"className":4462},[129,316],[74,4464,4466,4480],{"className":4465},[133],[74,4467,4469],{"className":4468,"style":2897},[137],[74,4470,4471,4474],{"style":326},[74,4472],{"className":4473,"style":145},[144],[74,4475,4477],{"className":4476},[149,150,151,152],[74,4478,2666],{"className":4479},[156,152],[74,4481,341],{"className":4482},[340],[74,4484,4486],{"className":4485},[133],[74,4487,4489],{"className":4488,"style":2918},[137],[74,4490],{},[74,4492],{"className":4493,"style":656},[301],[74,4495,664],{"className":4496},[663],[74,4498],{"className":4499,"style":656},[301],[74,4501,4503,4506],{"className":4502},[86],[74,4504],{"className":4505,"style":1983},[90],[74,4507,4509],{"className":4508},[95],"0.42.",[11,4511,4512,4513,4612,4613,4616],{},"The policy tightens further to ",[74,4514,4516],{"className":4515},[77],[74,4517,4519,4602],{"className":4518,"ariaHidden":82},[81],[74,4520,4522,4525,4593,4596,4599],{"className":4521},[86],[74,4523],{"className":4524,"style":3991},[90],[74,4526,4528,4559],{"className":4527},[95],[74,4529,4531],{"className":4530},[95,3998],[74,4532,4534],{"className":4533},[129],[74,4535,4537],{"className":4536},[133],[74,4538,4540,4548],{"className":4539,"style":4008},[137],[74,4541,4542,4545],{"style":1189},[74,4543],{"className":4544,"style":1177},[144],[74,4546,605],{"className":4547,"style":604},[95,96],[74,4549,4550,4553],{"style":4019},[74,4551],{"className":4552,"style":1177},[144],[74,4554,4556],{"className":4555,"style":4027},[4026],[74,4557,4031],{"className":4558},[95],[74,4560,4562],{"className":4561},[125],[74,4563,4565,4585],{"className":4564},[129,316],[74,4566,4568,4582],{"className":4567},[133],[74,4569,4571],{"className":4570,"style":618},[137],[74,4572,4573,4576],{"style":621},[74,4574],{"className":4575,"style":145},[144],[74,4577,4579],{"className":4578},[149,150,151,152],[74,4580,309],{"className":4581},[95,96,152],[74,4583,341],{"className":4584},[340],[74,4586,4588],{"className":4587},[133],[74,4589,4591],{"className":4590,"style":348},[137],[74,4592],{},[74,4594],{"className":4595,"style":656},[301],[74,4597,664],{"className":4598},[663],[74,4600],{"className":4601,"style":656},[301],[74,4603,4605,4608],{"className":4604},[86],[74,4606],{"className":4607,"style":1983},[90],[74,4609,4611],{"className":4610},[95],"22",", now ",[15,4614,4615],{},"under"," budget, and the\nmultiplier falls:",[74,4618,4620],{"className":4619},[585],[74,4621,4623],{"className":4622},[77],[74,4624,4626,4644,4669,4696,4760],{"className":4625,"ariaHidden":82},[81],[74,4627,4629,4632,4635,4638,4641],{"className":4628},[86],[74,4630],{"className":4631,"style":418},[90],[74,4633,297],{"className":4634},[95,96],[74,4636],{"className":4637,"style":656},[301],[74,4639,2632],{"className":4640},[663],[74,4642],{"className":4643,"style":656},[301],[74,4645,4647,4650,4653,4656,4660,4663,4666],{"className":4646},[86],[74,4648],{"className":4649,"style":490},[90],[74,4651,732],{"className":4652},[497],[74,4654],{"className":4655,"style":302},[301],[74,4657,4659],{"className":4658},[95],"0.42",[74,4661],{"className":4662,"style":1620},[301],[74,4664,2666],{"className":4665},[156],[74,4667],{"className":4668,"style":1620},[301],[74,4670,4672,4675,4678,4681,4684,4687,4690,4693],{"className":4671},[86],[74,4673],{"className":4674,"style":490},[90],[74,4676,3909],{"className":4677},[95],[74,4679],{"className":4680,"style":302},[301],[74,4682,498],{"className":4683},[497],[74,4685,4611],{"className":4686},[95],[74,4688],{"className":4689,"style":1620},[301],[74,4691,2104],{"className":4692},[156],[74,4694],{"className":4695,"style":1620},[301],[74,4697,4699,4702,4705,4708,4711,4751,4754,4757],{"className":4698},[86],[74,4700],{"className":4701,"style":490},[90],[74,4703,3836],{"className":4704},[95],[74,4706,518],{"className":4707},[517],[74,4709],{"className":4710,"style":302},[301],[74,4712,4714,4717],{"className":4713},[517],[74,4715,876],{"className":4716},[517],[74,4718,4720],{"className":4719},[125],[74,4721,4723,4743],{"className":4722},[129,316],[74,4724,4726,4740],{"className":4725},[133],[74,4727,4729],{"className":4728,"style":2897},[137],[74,4730,4731,4734],{"style":326},[74,4732],{"className":4733,"style":145},[144],[74,4735,4737],{"className":4736},[149,150,151,152],[74,4738,2666],{"className":4739},[156,152],[74,4741,341],{"className":4742},[340],[74,4744,4746],{"className":4745},[133],[74,4747,4749],{"className":4748,"style":2918},[137],[74,4750],{},[74,4752],{"className":4753,"style":656},[301],[74,4755,664],{"className":4756},[663],[74,4758],{"className":4759,"style":656},[301],[74,4761,4763,4766],{"className":4762},[86],[74,4764],{"className":4765,"style":1983},[90],[74,4767,4769],{"className":4768},[95],"0.39.",[11,4771,4772,4773,4843,4844,4942,4943,4985,4986,5027,5028,5031,5032,5073],{},"The overshoot-and-correct pattern — ",[74,4774,4776],{"className":4775},[77],[74,4777,4779,4797,4815,4833],{"className":4778,"ariaHidden":82},[81],[74,4780,4782,4785,4788,4791,4794],{"className":4781},[86],[74,4783],{"className":4784,"style":1983},[90],[74,4786,778],{"className":4787},[95],[74,4789],{"className":4790,"style":656},[301],[74,4792,1644],{"className":4793},[663],[74,4795],{"className":4796,"style":656},[301],[74,4798,4800,4803,4806,4809,4812],{"className":4799},[86],[74,4801],{"className":4802,"style":1983},[90],[74,4804,4256],{"className":4805},[95],[74,4807],{"className":4808,"style":656},[301],[74,4810,1644],{"className":4811},[663],[74,4813],{"className":4814,"style":656},[301],[74,4816,4818,4821,4824,4827,4830],{"className":4817},[86],[74,4819],{"className":4820,"style":1983},[90],[74,4822,4659],{"className":4823},[95],[74,4825],{"className":4826,"style":656},[301],[74,4828,1644],{"className":4829},[663],[74,4831],{"className":4832,"style":656},[301],[74,4834,4836,4839],{"className":4835},[86],[74,4837],{"className":4838,"style":1983},[90],[74,4840,4842],{"className":4841},[95],"0.39"," — is the\nfeedback loop converging on the price at which ",[74,4845,4847],{"className":4846},[77],[74,4848,4850,4933],{"className":4849,"ariaHidden":82},[81],[74,4851,4853,4856,4924,4927,4930],{"className":4852},[86],[74,4854],{"className":4855,"style":3991},[90],[74,4857,4859,4890],{"className":4858},[95],[74,4860,4862],{"className":4861},[95,3998],[74,4863,4865],{"className":4864},[129],[74,4866,4868],{"className":4867},[133],[74,4869,4871,4879],{"className":4870,"style":4008},[137],[74,4872,4873,4876],{"style":1189},[74,4874],{"className":4875,"style":1177},[144],[74,4877,605],{"className":4878,"style":604},[95,96],[74,4880,4881,4884],{"style":4019},[74,4882],{"className":4883,"style":1177},[144],[74,4885,4887],{"className":4886,"style":4027},[4026],[74,4888,4031],{"className":4889},[95],[74,4891,4893],{"className":4892},[125],[74,4894,4896,4916],{"className":4895},[129,316],[74,4897,4899,4913],{"className":4898},[133],[74,4900,4902],{"className":4901,"style":618},[137],[74,4903,4904,4907],{"style":621},[74,4905],{"className":4906,"style":145},[144],[74,4908,4910],{"className":4909},[149,150,151,152],[74,4911,309],{"className":4912},[95,96,152],[74,4914,341],{"className":4915},[340],[74,4917,4919],{"className":4918},[133],[74,4920,4922],{"className":4921,"style":348},[137],[74,4923],{},[74,4925],{"className":4926,"style":656},[301],[74,4928,664],{"className":4929},[663],[74,4931],{"className":4932,"style":656},[301],[74,4934,4936,4939],{"className":4935},[86],[74,4937],{"className":4938,"style":418},[90],[74,4940,573],{"className":4941},[95,96],". It\noscillates around the budget and, on the slow timescale, damps toward the\n",[74,4944,4946],{"className":4945},[77],[74,4947,4949],{"className":4948,"ariaHidden":82},[81],[74,4950,4952,4955],{"className":4951},[86],[74,4953],{"className":4954,"style":418},[90],[74,4956,4958,4961],{"className":4957},[95],[74,4959,297],{"className":4960},[95,96],[74,4962,4964],{"className":4963},[125],[74,4965,4967],{"className":4966},[129],[74,4968,4970],{"className":4969},[133],[74,4971,4973],{"className":4972,"style":115},[137],[74,4974,4975,4978],{"style":140},[74,4976],{"className":4977,"style":145},[144],[74,4979,4981],{"className":4980},[149,150,151,152],[74,4982,4984],{"className":4983},[156,152],"∗"," where the constraint is exactly met. That equilibrium ",[74,4987,4989],{"className":4988},[77],[74,4990,4992],{"className":4991,"ariaHidden":82},[81],[74,4993,4995,4998],{"className":4994},[86],[74,4996],{"className":4997,"style":418},[90],[74,4999,5001,5004],{"className":5000},[95],[74,5002,297],{"className":5003},[95,96],[74,5005,5007],{"className":5006},[125],[74,5008,5010],{"className":5009},[129],[74,5011,5013],{"className":5012},[133],[74,5014,5016],{"className":5015,"style":115},[137],[74,5017,5018,5021],{"style":140},[74,5019],{"className":5020,"style":145},[144],[74,5022,5024],{"className":5023},[149,150,151,152],[74,5025,4984],{"className":5026},[156,152],"\nis the ",[15,5029,5030],{},"shadow price"," of the constraint: the marginal reward the policy gives up per\nunit of cost budget, and had you set the hand-penalty of the opening section to\nexactly ",[74,5033,5035],{"className":5034},[77],[74,5036,5038],{"className":5037,"ariaHidden":82},[81],[74,5039,5041,5044],{"className":5040},[86],[74,5042],{"className":5043,"style":418},[90],[74,5045,5047,5050],{"className":5046},[95],[74,5048,297],{"className":5049},[95,96],[74,5051,5053],{"className":5052},[125],[74,5054,5056],{"className":5055},[129],[74,5057,5059],{"className":5058},[133],[74,5060,5062],{"className":5061,"style":115},[137],[74,5063,5064,5067],{"style":140},[74,5065],{"className":5066,"style":145},[144],[74,5068,5070],{"className":5069},[149,150,151,152],[74,5071,4984],{"className":5072},[156,152]," you would have recovered the same policy — the primal-dual\nloop is what finds that number for you instead of making you guess it.",[242,5075],{"hash":5076},"0a0860da2d3ccb9e5a038c73b1b599877f0c0f0e859fc8e37b861cd609987826",[62,5078,5080],{"id":5079},"constrained-policy-optimization-cpo","Constrained policy optimization (CPO)",[11,5082,5083,5086,5094,5095,5099],{},[35,5084,5085],{},"Constrained Policy Optimization (CPO)",[20,5087,5088],{},[23,5089,5093],{"href":5090,"ariaDescribedBy":5091,"dataFootnoteRef":6,"id":5092},"#user-content-fn-cpo",[27],"user-content-fnref-cpo","5"," delivers a per-update guarantee by\ngrafting the constraint onto a trust-region method. Recall the trust-region idea\nfrom ",[23,5096,5098],{"href":5097},"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods","policy-gradient methods",":\nimprove the policy within a small KL ball around the current one, small enough that\na local linear model of the return is trustworthy. TRPO solves, each step,",[74,5101,5103],{"className":5102},[585],[74,5104,5106],{"className":5105},[77],[74,5107,5109,5371],{"className":5108,"ariaHidden":82},[81],[74,5110,5112,5116,5169,5172,5175,5244,5247,5250,5253,5256,5262,5265,5305,5308,5311,5314,5317,5359,5362,5365,5368],{"className":5111},[86],[74,5113],{"className":5114,"style":5115},[90],"height:1.6989em;vertical-align:-0.7521em;",[74,5117,5119],{"className":5118},[736,1161],[74,5120,5122,5160],{"className":5121},[129,316],[74,5123,5125,5157],{"className":5124},[133],[74,5126,5128,5144],{"className":5127,"style":91},[137],[74,5129,5131,5134],{"style":5130},"top:-2.3479em;margin-left:0em;",[74,5132],{"className":5133,"style":1177},[144],[74,5135,5137],{"className":5136},[149,150,151,152],[74,5138,5140],{"className":5139},[95,152],[74,5141,5143],{"className":5142,"style":97},[95,96,152],"θ",[74,5145,5146,5149],{"style":1189},[74,5147],{"className":5148,"style":1177},[144],[74,5150,5151],{},[74,5152,5154],{"className":5153},[736],[74,5155,1202],{"className":5156},[95,1201],[74,5158,341],{"className":5159},[340],[74,5161,5163],{"className":5162},[133],[74,5164,5167],{"className":5165,"style":5166},[137],"height:0.7521em;",[74,5168],{},[74,5170],{"className":5171,"style":656},[301],[74,5173],{"className":5174,"style":302},[301],[74,5176,5178,5210],{"className":5177},[95],[74,5179,5181],{"className":5180},[95,3998],[74,5182,5184],{"className":5183},[129],[74,5185,5187],{"className":5186},[133],[74,5188,5190,5198],{"className":5189,"style":4008},[137],[74,5191,5192,5195],{"style":1189},[74,5193],{"className":5194,"style":1177},[144],[74,5196,1531],{"className":5197},[95,96],[74,5199,5200,5203],{"style":4019},[74,5201],{"className":5202,"style":1177},[144],[74,5204,5207],{"className":5205,"style":5206},[4026],"left:-0.1111em;",[74,5208,4031],{"className":5209},[95],[74,5211,5213],{"className":5212},[125],[74,5214,5216,5236],{"className":5215},[129,316],[74,5217,5219,5233],{"className":5218},[133],[74,5220,5222],{"className":5221,"style":618},[137],[74,5223,5224,5227],{"style":326},[74,5225],{"className":5226,"style":145},[144],[74,5228,5230],{"className":5229},[149,150,151,152],[74,5231,98],{"className":5232,"style":97},[95,96,152],[74,5234,341],{"className":5235},[340],[74,5237,5239],{"className":5238},[133],[74,5240,5242],{"className":5241,"style":348},[137],[74,5243],{},[74,5245,498],{"className":5246},[497],[74,5248,5143],{"className":5249,"style":97},[95,96],[74,5251,518],{"className":5252},[517],[74,5254],{"className":5255,"style":1273},[301],[74,5257,5259],{"className":5258},[95,1277],[74,5260,1281],{"className":5261},[95],[74,5263],{"className":5264,"style":1273},[301],[74,5266,5269],{"className":5267},[95,5268],"overline",[74,5270,5272],{"className":5271},[129],[74,5273,5275],{"className":5274},[133],[74,5276,5279,5294],{"className":5277,"style":5278},[137],"height:0.8833em;",[74,5280,5281,5284],{"style":1189},[74,5282],{"className":5283,"style":1177},[144],[74,5285,5287],{"className":5286},[95],[74,5288,5290],{"className":5289},[95],[74,5291,5293],{"className":5292},[95,1201],"KL",[74,5295,5297,5300],{"style":5296},"top:-3.8033em;",[74,5298],{"className":5299,"style":1177},[144],[74,5301],{"className":5302,"style":5304},[5303],"overline-line","border-bottom-width:0.04em;",[74,5306,498],{"className":5307},[497],[74,5309,5143],{"className":5310,"style":97},[95,96],[74,5312,507],{"className":5313},[506],[74,5315],{"className":5316,"style":302},[301],[74,5318,5320,5323],{"className":5319},[95],[74,5321,5143],{"className":5322,"style":97},[95,96],[74,5324,5326],{"className":5325},[125],[74,5327,5329,5351],{"className":5328},[129,316],[74,5330,5332,5348],{"className":5331},[133],[74,5333,5335],{"className":5334,"style":2698},[137],[74,5336,5337,5340],{"style":849},[74,5338],{"className":5339,"style":145},[144],[74,5341,5343],{"className":5342},[149,150,151,152],[74,5344,5347],{"className":5345,"style":5346},[95,96,152],"margin-right:0.0315em;","k",[74,5349,341],{"className":5350},[340],[74,5352,5354],{"className":5353},[133],[74,5355,5357],{"className":5356,"style":348},[137],[74,5358],{},[74,5360,518],{"className":5361},[517],[74,5363],{"className":5364,"style":656},[301],[74,5366,1343],{"className":5367},[663],[74,5369],{"className":5370,"style":656},[301],[74,5372,5374,5378,5383],{"className":5373},[86],[74,5375],{"className":5376,"style":5377},[90],"height:0.8889em;vertical-align:-0.1944em;",[74,5379,5382],{"className":5380,"style":5381},[95,96],"margin-right:0.0379em;","δ",[74,5384,507],{"className":5385},[506],[11,5387,5388,5389,5469,5470,5485,5486,5488,5489,5680],{},"where ",[74,5390,5392],{"className":5391},[77],[74,5393,5395],{"className":5394,"ariaHidden":82},[81],[74,5396,5398,5401],{"className":5397},[86],[74,5399],{"className":5400,"style":3991},[90],[74,5402,5404,5435],{"className":5403},[95],[74,5405,5407],{"className":5406},[95,3998],[74,5408,5410],{"className":5409},[129],[74,5411,5413],{"className":5412},[133],[74,5414,5416,5424],{"className":5415,"style":4008},[137],[74,5417,5418,5421],{"style":1189},[74,5419],{"className":5420,"style":1177},[144],[74,5422,1531],{"className":5423},[95,96],[74,5425,5426,5429],{"style":4019},[74,5427],{"className":5428,"style":1177},[144],[74,5430,5432],{"className":5431,"style":5206},[4026],[74,5433,4031],{"className":5434},[95],[74,5436,5438],{"className":5437},[125],[74,5439,5441,5461],{"className":5440},[129,316],[74,5442,5444,5458],{"className":5443},[133],[74,5445,5447],{"className":5446,"style":618},[137],[74,5448,5449,5452],{"style":326},[74,5450],{"className":5451,"style":145},[144],[74,5453,5455],{"className":5454},[149,150,151,152],[74,5456,98],{"className":5457,"style":97},[95,96,152],[74,5459,341],{"className":5460},[340],[74,5462,5464],{"className":5463},[133],[74,5465,5467],{"className":5466,"style":348},[137],[74,5468],{}," is the estimated reward advantage of the new policy over the old\nand ",[74,5471,5473],{"className":5472},[77],[74,5474,5476],{"className":5475,"ariaHidden":82},[81],[74,5477,5479,5482],{"className":5478},[86],[74,5480],{"className":5481,"style":418},[90],[74,5483,5382],{"className":5484,"style":5381},[95,96]," is the trust-region radius. CPO adds a second constraint inside the\nsame trust region: a linear model of the ",[15,5487,522],{}," return must stay under budget.\nUsing the surrogate ",[74,5490,5492],{"className":5491},[77],[74,5493,5495,5596],{"className":5494,"ariaHidden":82},[81],[74,5496,5498,5501,5541,5544,5584,5587,5590,5593],{"className":5497},[86],[74,5499],{"className":5500,"style":490},[90],[74,5502,5504,5507],{"className":5503},[95],[74,5505,605],{"className":5506,"style":604},[95,96],[74,5508,5510],{"className":5509},[125],[74,5511,5513,5533],{"className":5512},[129,316],[74,5514,5516,5530],{"className":5515},[133],[74,5517,5519],{"className":5518,"style":618},[137],[74,5520,5521,5524],{"style":621},[74,5522],{"className":5523,"style":145},[144],[74,5525,5527],{"className":5526},[149,150,151,152],[74,5528,309],{"className":5529},[95,96,152],[74,5531,341],{"className":5532},[340],[74,5534,5536],{"className":5535},[133],[74,5537,5539],{"className":5538,"style":348},[137],[74,5540],{},[74,5542,498],{"className":5543},[497],[74,5545,5547,5550],{"className":5546},[95],[74,5548,5143],{"className":5549,"style":97},[95,96],[74,5551,5553],{"className":5552},[125],[74,5554,5556,5576],{"className":5555},[129,316],[74,5557,5559,5573],{"className":5558},[133],[74,5560,5562],{"className":5561,"style":2698},[137],[74,5563,5564,5567],{"style":849},[74,5565],{"className":5566,"style":145},[144],[74,5568,5570],{"className":5569},[149,150,151,152],[74,5571,5347],{"className":5572,"style":5346},[95,96,152],[74,5574,341],{"className":5575},[340],[74,5577,5579],{"className":5578},[133],[74,5580,5582],{"className":5581,"style":348},[137],[74,5583],{},[74,5585,518],{"className":5586},[517],[74,5588],{"className":5589,"style":1620},[301],[74,5591,2666],{"className":5592},[156],[74,5594],{"className":5595,"style":1620},[301],[74,5597,5599,5603,5671,5674,5677],{"className":5598},[86],[74,5600],{"className":5601,"style":5602},[90],"height:1.1968em;vertical-align:-0.25em;",[74,5604,5606,5637],{"className":5605},[95],[74,5607,5609],{"className":5608},[95,3998],[74,5610,5612],{"className":5611},[129],[74,5613,5615],{"className":5614},[133],[74,5616,5618,5626],{"className":5617,"style":4008},[137],[74,5619,5620,5623],{"style":1189},[74,5621],{"className":5622,"style":1177},[144],[74,5624,1531],{"className":5625},[95,96],[74,5627,5628,5631],{"style":4019},[74,5629],{"className":5630,"style":1177},[144],[74,5632,5634],{"className":5633,"style":5206},[4026],[74,5635,4031],{"className":5636},[95],[74,5638,5640],{"className":5639},[125],[74,5641,5643,5663],{"className":5642},[129,316],[74,5644,5646,5660],{"className":5645},[133],[74,5647,5649],{"className":5648,"style":618},[137],[74,5650,5651,5654],{"style":326},[74,5652],{"className":5653,"style":145},[144],[74,5655,5657],{"className":5656},[149,150,151,152],[74,5658,309],{"className":5659},[95,96,152],[74,5661,341],{"className":5662},[340],[74,5664,5666],{"className":5665},[133],[74,5667,5669],{"className":5668,"style":348},[137],[74,5670],{},[74,5672,498],{"className":5673},[497],[74,5675,5143],{"className":5676,"style":97},[95,96],[74,5678,518],{"className":5679},[517]," for the new policy's cost,\nthe CPO subproblem is",[74,5682,5684],{"className":5683},[585],[74,5685,5687],{"className":5686},[77],[74,5688,5690,5937,6029,6146],{"className":5689,"ariaHidden":82},[81],[74,5691,5693,5696,5746,5749,5752,5820,5823,5826,5829,5832,5839,5842,5882,5885,5925,5928,5931,5934],{"className":5692},[86],[74,5694],{"className":5695,"style":5115},[90],[74,5697,5699],{"className":5698},[736,1161],[74,5700,5702,5738],{"className":5701},[129,316],[74,5703,5705,5735],{"className":5704},[133],[74,5706,5708,5722],{"className":5707,"style":91},[137],[74,5709,5710,5713],{"style":5130},[74,5711],{"className":5712,"style":1177},[144],[74,5714,5716],{"className":5715},[149,150,151,152],[74,5717,5719],{"className":5718},[95,152],[74,5720,5143],{"className":5721,"style":97},[95,96,152],[74,5723,5724,5727],{"style":1189},[74,5725],{"className":5726,"style":1177},[144],[74,5728,5729],{},[74,5730,5732],{"className":5731},[736],[74,5733,1202],{"className":5734},[95,1201],[74,5736,341],{"className":5737},[340],[74,5739,5741],{"className":5740},[133],[74,5742,5744],{"className":5743,"style":5166},[137],[74,5745],{},[74,5747],{"className":5748,"style":656},[301],[74,5750],{"className":5751,"style":302},[301],[74,5753,5755,5786],{"className":5754},[95],[74,5756,5758],{"className":5757},[95,3998],[74,5759,5761],{"className":5760},[129],[74,5762,5764],{"className":5763},[133],[74,5765,5767,5775],{"className":5766,"style":4008},[137],[74,5768,5769,5772],{"style":1189},[74,5770],{"className":5771,"style":1177},[144],[74,5773,1531],{"className":5774},[95,96],[74,5776,5777,5780],{"style":4019},[74,5778],{"className":5779,"style":1177},[144],[74,5781,5783],{"className":5782,"style":5206},[4026],[74,5784,4031],{"className":5785},[95],[74,5787,5789],{"className":5788},[125],[74,5790,5792,5812],{"className":5791},[129,316],[74,5793,5795,5809],{"className":5794},[133],[74,5796,5798],{"className":5797,"style":618},[137],[74,5799,5800,5803],{"style":326},[74,5801],{"className":5802,"style":145},[144],[74,5804,5806],{"className":5805},[149,150,151,152],[74,5807,98],{"className":5808,"style":97},[95,96,152],[74,5810,341],{"className":5811},[340],[74,5813,5815],{"className":5814},[133],[74,5816,5818],{"className":5817,"style":348},[137],[74,5819],{},[74,5821,498],{"className":5822},[497],[74,5824,5143],{"className":5825,"style":97},[95,96],[74,5827,518],{"className":5828},[517],[74,5830],{"className":5831,"style":1273},[301],[74,5833,5835],{"className":5834},[95,1277],[74,5836,5838],{"className":5837},[95],"s.t.",[74,5840],{"className":5841,"style":1273},[301],[74,5843,5845,5848],{"className":5844},[95],[74,5846,605],{"className":5847,"style":604},[95,96],[74,5849,5851],{"className":5850},[125],[74,5852,5854,5874],{"className":5853},[129,316],[74,5855,5857,5871],{"className":5856},[133],[74,5858,5860],{"className":5859,"style":618},[137],[74,5861,5862,5865],{"style":621},[74,5863],{"className":5864,"style":145},[144],[74,5866,5868],{"className":5867},[149,150,151,152],[74,5869,309],{"className":5870},[95,96,152],[74,5872,341],{"className":5873},[340],[74,5875,5877],{"className":5876},[133],[74,5878,5880],{"className":5879,"style":348},[137],[74,5881],{},[74,5883,498],{"className":5884},[497],[74,5886,5888,5891],{"className":5887},[95],[74,5889,5143],{"className":5890,"style":97},[95,96],[74,5892,5894],{"className":5893},[125],[74,5895,5897,5917],{"className":5896},[129,316],[74,5898,5900,5914],{"className":5899},[133],[74,5901,5903],{"className":5902,"style":2698},[137],[74,5904,5905,5908],{"style":849},[74,5906],{"className":5907,"style":145},[144],[74,5909,5911],{"className":5910},[149,150,151,152],[74,5912,5347],{"className":5913,"style":5346},[95,96,152],[74,5915,341],{"className":5916},[340],[74,5918,5920],{"className":5919},[133],[74,5921,5923],{"className":5922,"style":348},[137],[74,5924],{},[74,5926,518],{"className":5927},[517],[74,5929],{"className":5930,"style":1620},[301],[74,5932,2666],{"className":5933},[156],[74,5935],{"className":5936,"style":1620},[301],[74,5938,5940,5943,6011,6014,6017,6020,6023,6026],{"className":5939},[86],[74,5941],{"className":5942,"style":5602},[90],[74,5944,5946,5977],{"className":5945},[95],[74,5947,5949],{"className":5948},[95,3998],[74,5950,5952],{"className":5951},[129],[74,5953,5955],{"className":5954},[133],[74,5956,5958,5966],{"className":5957,"style":4008},[137],[74,5959,5960,5963],{"style":1189},[74,5961],{"className":5962,"style":1177},[144],[74,5964,1531],{"className":5965},[95,96],[74,5967,5968,5971],{"style":4019},[74,5969],{"className":5970,"style":1177},[144],[74,5972,5974],{"className":5973,"style":5206},[4026],[74,5975,4031],{"className":5976},[95],[74,5978,5980],{"className":5979},[125],[74,5981,5983,6003],{"className":5982},[129,316],[74,5984,5986,6000],{"className":5985},[133],[74,5987,5989],{"className":5988,"style":618},[137],[74,5990,5991,5994],{"style":326},[74,5992],{"className":5993,"style":145},[144],[74,5995,5997],{"className":5996},[149,150,151,152],[74,5998,309],{"className":5999},[95,96,152],[74,6001,341],{"className":6002},[340],[74,6004,6006],{"className":6005},[133],[74,6007,6009],{"className":6008,"style":348},[137],[74,6010],{},[74,6012,498],{"className":6013},[497],[74,6015,5143],{"className":6016,"style":97},[95,96],[74,6018,518],{"className":6019},[517],[74,6021],{"className":6022,"style":656},[301],[74,6024,1343],{"className":6025},[663],[74,6027],{"className":6028,"style":656},[301],[74,6030,6032,6036,6039,6042,6045,6048,6082,6085,6088,6091,6094,6134,6137,6140,6143],{"className":6031},[86],[74,6033],{"className":6034,"style":6035},[90],"height:1.1333em;vertical-align:-0.25em;",[74,6037,573],{"className":6038},[95,96],[74,6040,507],{"className":6041},[506],[74,6043],{"className":6044,"style":1273},[301],[74,6046],{"className":6047,"style":302},[301],[74,6049,6051],{"className":6050},[95,5268],[74,6052,6054],{"className":6053},[129],[74,6055,6057],{"className":6056},[133],[74,6058,6060,6074],{"className":6059,"style":5278},[137],[74,6061,6062,6065],{"style":1189},[74,6063],{"className":6064,"style":1177},[144],[74,6066,6068],{"className":6067},[95],[74,6069,6071],{"className":6070},[95],[74,6072,5293],{"className":6073},[95,1201],[74,6075,6076,6079],{"style":5296},[74,6077],{"className":6078,"style":1177},[144],[74,6080],{"className":6081,"style":5304},[5303],[74,6083,498],{"className":6084},[497],[74,6086,5143],{"className":6087,"style":97},[95,96],[74,6089,507],{"className":6090},[506],[74,6092],{"className":6093,"style":302},[301],[74,6095,6097,6100],{"className":6096},[95],[74,6098,5143],{"className":6099,"style":97},[95,96],[74,6101,6103],{"className":6102},[125],[74,6104,6106,6126],{"className":6105},[129,316],[74,6107,6109,6123],{"className":6108},[133],[74,6110,6112],{"className":6111,"style":2698},[137],[74,6113,6114,6117],{"style":849},[74,6115],{"className":6116,"style":145},[144],[74,6118,6120],{"className":6119},[149,150,151,152],[74,6121,5347],{"className":6122,"style":5346},[95,96,152],[74,6124,341],{"className":6125},[340],[74,6127,6129],{"className":6128},[133],[74,6130,6132],{"className":6131,"style":348},[137],[74,6133],{},[74,6135,518],{"className":6136},[517],[74,6138],{"className":6139,"style":656},[301],[74,6141,1343],{"className":6142},[663],[74,6144],{"className":6145,"style":656},[301],[74,6147,6149,6152,6155],{"className":6148},[86],[74,6150],{"className":6151,"style":418},[90],[74,6153,5382],{"className":6154,"style":5381},[95,96],[74,6156,60],{"className":6157},[95],[11,6159,6160,6161,6164,6165,6180,6181,6184],{},"Because both the objective and the cost constraint are linearized and the KL\nconstraint is quadratic, the subproblem is a small convex program solvable in\nclosed form (up to a line search). Achiam et al. prove a ",[35,6162,6163],{},"worst-case bound",": the\ntrue cost return of the updated policy exceeds the surrogate by at most a term that\nshrinks with ",[74,6166,6168],{"className":6167},[77],[74,6169,6171],{"className":6170,"ariaHidden":82},[81],[74,6172,6174,6177],{"className":6173},[86],[74,6175],{"className":6176,"style":418},[90],[74,6178,5382],{"className":6179,"style":5381},[95,96],", so with a small enough trust region each CPO update keeps\nthe policy ",[15,6182,6183],{},"approximately feasible"," throughout training, not merely at\nconvergence. That near-monotonic feasibility is the property RCPO lacks and the\nreason CPO is the reference method when violations during learning are costly.",[242,6186],{"hash":6187},"0595d0ddeca6958baf68e16a245173d99f372f6578a05a93856897f935b3f140",[246,6189,6190],{"type":248},[11,6191,6192,6195,6196,6211,6212,6227],{},[35,6193,6194],{},"Definition (Constrained policy optimization)."," A trust-region policy update\nthat maximizes a linear model of the reward advantage subject to two constraints\ninside a KL ball: a linear model of the cost return must stay under budget ",[74,6197,6199],{"className":6198},[77],[74,6200,6202],{"className":6201,"ariaHidden":82},[81],[74,6203,6205,6208],{"className":6204},[86],[74,6206],{"className":6207,"style":418},[90],[74,6209,573],{"className":6210},[95,96],",\nand the KL step size must stay under ",[74,6213,6215],{"className":6214},[77],[74,6216,6218],{"className":6217,"ariaHidden":82},[81],[74,6219,6221,6224],{"className":6220},[86],[74,6222],{"className":6223,"style":418},[90],[74,6225,5382],{"className":6226,"style":5381},[95,96],". The resulting update carries a\nworst-case bound on constraint violation, giving approximate feasibility at every\nstep rather than only at convergence.",[11,6229,6230,6231,6234],{},"When a proposed update finds no feasible point at all — the current policy already\nviolates the budget and no step within the trust region fixes it — CPO falls back\nto a pure ",[35,6232,6233],{},"recovery"," step that decreases cost as fast as the trust region allows,\nignoring reward until the policy is feasible again. That recovery mode is what lets\nCPO start from an infeasible policy and steer it into the feasible set.",[62,6236,6238],{"id":6237},"where-this-leaves-us","Where this leaves us",[11,6240,6241,6242,6246,6247,6250,6251,6253],{},"The honest formulation of ",[6243,6244,6245],"q",{},"behave well"," is now precise. A ",[35,6248,6249],{},"constrained MDP"," keeps the\nreward but adds one or more cost signals, each with a budget, and asks for the policy\nthat maximizes return ",[15,6252,41],{}," keeping expected cost under budget. That single move\nturns the vague demand for safety into an optimization problem with a feasible set.",[11,6255,6256],{},"Two policy-optimization methods solve it:",[6258,6259,6260,6299],"ul",{},[6261,6262,6263,6266,6267,6282,6283,6298],"li",{},[35,6264,6265],{},"Lagrangian primal-dual (RCPO)"," turns the constraint into a penalty with a learned\nmultiplier ",[74,6268,6270],{"className":6269},[77],[74,6271,6273],{"className":6272,"ariaHidden":82},[81],[74,6274,6276,6279],{"className":6275},[86],[74,6277],{"className":6278,"style":418},[90],[74,6280,297],{"className":6281},[95,96],": raise ",[74,6284,6286],{"className":6285},[77],[74,6287,6289],{"className":6288,"ariaHidden":82},[81],[74,6290,6292,6295],{"className":6291},[86],[74,6293],{"className":6294,"style":418},[90],[74,6296,297],{"className":6297},[95,96]," when the cost budget is exceeded, lower it when\nthere is slack, so the penalty self-tunes toward the boundary.",[6261,6300,6301,6304],{},[35,6302,6303],{},"CPO"," builds the cost budget directly into a trust-region update, guaranteeing (to\nfirst order) that each policy step stays feasible rather than only converging to\nfeasibility in the limit.",[11,6306,6307,6308,6311,6312,6315,6316,60],{},"Both control the ",[15,6309,6310],{},"mean"," cost. But a policy safe on average can still be catastrophic in\nthe tail, and a policy that respects a constraint at convergence may violate it wildly\n",[15,6313,6314],{},"while learning",". Optimizing the tail (risk-sensitive RL), staying safe during\nexploration (shields, Lyapunov methods, safety layers), and the connection to alignment\ncontinue in\n",[23,6317,6318],{"href":58},"Safe RL: Risk, Safe Exploration, and Alignment",[6320,6321,6324,6329],"section",{"className":6322,"dataFootnotes":6},[6323],"footnotes",[62,6325,6328],{"className":6326,"id":27},[6327],"sr-only","Footnotes",[6330,6331,6332,6357,6373,6388,6457],"ol",{},[6261,6333,6335,6338,6339,6342,6343,6338,6346,6349,6350],{"id":6334},"user-content-fn-gaming",[35,6336,6337],{},"Krakovna, Uesato, Mikulik, et al. (2020)",", ",[6243,6340,6341],{},"Specification gaming: the flip side of AI ingenuity",", DeepMind — catalogues dozens of documented cases, including the CoastRunners boat that laps a lagoon collecting power-ups instead of finishing the race. See also ",[35,6344,6345],{},"Clark & Amodei (2016)",[6243,6347,6348],{},"Faulty Reward Functions in the Wild",", OpenAI, for the original boat-racing example. ",[23,6351,6356],{"href":6352,"ariaLabel":6353,"className":6354,"dataFootnoteBackref":6},"#user-content-fnref-gaming","Back to reference 1",[6355],"data-footnote-backref","↩",[6261,6358,6360,6361,6338,6364,6367,6368],{"id":6359},"user-content-fn-goodhart","A restatement of Goodhart's law for optimization: when a measure becomes a target it ceases to be a good measure. ",[35,6362,6363],{},"Manheim & Garrabrant (2018)",[6243,6365,6366],{},"Categorizing Variants of Goodhart's Law",", arXiv:1803.04585, formalizes the failure modes; the proxy–objective gap is the mechanism behind specification gaming. ",[23,6369,6356],{"href":6370,"ariaLabel":6371,"className":6372,"dataFootnoteBackref":6},"#user-content-fnref-goodhart","Back to reference 2",[6355],[6261,6374,6376,6338,6379,6382,6383],{"id":6375},"user-content-fn-altman",[35,6377,6378],{},"Altman (1999)",[15,6380,6381],{},"Constrained Markov Decision Processes",", Chapman & Hall — the standard reference formalizing the CMDP: an MDP with additional cost functions and expected-cost constraints, and the linear-program and Lagrangian characterizations of its optimal policy. ",[23,6384,6356],{"href":6385,"ariaLabel":6386,"className":6387,"dataFootnoteBackref":6},"#user-content-fnref-altman","Back to reference 3",[6355],[6261,6389,6391,6338,6394,6397,6398,6413,6414,6451,6452],{"id":6390},"user-content-fn-rcpo",[35,6392,6393],{},"Tessler, Mankowitz, Mannor (2019)",[6243,6395,6396],{},"Reward Constrained Policy Optimization",", ICLR — the multi-timescale actor-critic that learns a penalty multiplier ",[74,6399,6401],{"className":6400},[77],[74,6402,6404],{"className":6403,"ariaHidden":82},[81],[74,6405,6407,6410],{"className":6406},[86],[74,6408],{"className":6409,"style":418},[90],[74,6411,297],{"className":6412},[95,96]," on a slow timescale while optimizing the shaped reward ",[74,6415,6417],{"className":6416},[77],[74,6418,6420,6439],{"className":6419,"ariaHidden":82},[81],[74,6421,6423,6427,6430,6433,6436],{"className":6422},[86],[74,6424],{"className":6425,"style":6426},[90],"height:0.6667em;vertical-align:-0.0833em;",[74,6428,98],{"className":6429,"style":97},[95,96],[74,6431],{"className":6432,"style":1620},[301],[74,6434,2104],{"className":6435},[156],[74,6437],{"className":6438,"style":1620},[301],[74,6440,6442,6445,6448],{"className":6441},[86],[74,6443],{"className":6444,"style":418},[90],[74,6446,297],{"className":6447},[95,96],[74,6449,309],{"className":6450},[95,96]," on a fast one, converging to a constraint-satisfying policy. ",[23,6453,6356],{"href":6454,"ariaLabel":6455,"className":6456,"dataFootnoteBackref":6},"#user-content-fnref-rcpo","Back to reference 4",[6355],[6261,6458,6460,6338,6463,6466,6467],{"id":6459},"user-content-fn-cpo",[35,6461,6462],{},"Achiam, Held, Tamar, Abbeel (2017)",[6243,6464,6465],{},"Constrained Policy Optimization",", ICML — the first general-purpose policy-search method with near-monotonic constraint satisfaction, adding a linearized cost constraint to a TRPO trust-region step with a worst-case bound on violation. ",[23,6468,6356],{"href":6469,"ariaLabel":6470,"className":6471,"dataFootnoteBackref":6},"#user-content-fnref-cpo","Back to reference 5",[6355],[6473,6474,6475],"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":3427,"depth":3427,"links":6477},[6478,6479,6480,6481,6482,6483],{"id":64,"depth":3427,"text":65},{"id":461,"depth":3427,"text":462},{"id":1943,"depth":3427,"text":1944},{"id":5079,"depth":3427,"text":5080},{"id":6237,"depth":3427,"text":6238},{"id":27,"depth":3427,"text":6328},[],"computer-science","Everything in the course so far has taken a single instruction on faith: find the\npolicy that maximizes expected return. That instruction is complete only if the\nreward function is a perfect statement of what you want. It almost never is. A\nreward is a compression of a designer's intent into one scalar per step, and a\ncapable optimizer exploits every gap between that scalar and the intent. It\noptimizes what you wrote, not what you meant, and the two\ndiverge exactly where you were not looking. A cleaning robot rewarded for a tidy\nroom learns to sweep dust under the rug; a boat-racing agent rewarded for the\nscore circles a lagoon collecting the same power-ups forever instead of finishing\nthe race.1 These are not optimizer bugs: the optimizer worked, the\nreward was wrong, and nothing in reward maximization penalizes the difference.",false,"md",{"moduleNumber":3445,"lessonNumber":6490,"order":6491},20,520,"Modern Deep Reinforcement Learning",true,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl",[],"---\ntitle: \"Safe and Constrained RL: The CMDP and Policy Methods\"\nmodule: Modern Deep Reinforcement Learning\nmoduleNumber: 5\nlessonNumber: 20\norder: 520\nsummary: >\n  Maximizing a scalar reward is not the same as behaving well: a capable\n  optimizer will find and exploit any gap between the reward and what its designer\n  actually meant, a failure called specification gaming or reward hacking. The\n  remedy is to add explicit cost constraints — the constrained MDP —\n  maximizing return subject to an expected-cost budget. This lesson builds the\n  core toolkit: the CMDP itself, Lagrangian primal-dual methods that learn a\n  multiplier on the constraint (RCPO), and constrained policy optimization (CPO)\n  with its trust-region cost bound. A companion lesson covers risk-sensitivity,\n  safe exploration, and the alignment framing.\ntopics: [Deep RL]\nsources:\n  - book: Sutton & Barto\n    ref: \"Ch. 13 — Policy Gradient Methods (background for the constrained policy-optimization stage)\"\n  - book: Grokking Deep RL\n    ref: \"Ch. 11–12 — policy-based and actor-critic methods (trust-region and penalty background)\"\n---\n\nEverything in the course so far has taken a single instruction on faith: find the\npolicy that maximizes expected return. That instruction is complete only if the\nreward function is a perfect statement of what you want. It almost never is. A\nreward is a compression of a designer's intent into one scalar per step, and a\ncapable optimizer exploits every gap between that scalar and the intent. It\noptimizes what you _wrote_, not what you meant, and the two\ndiverge exactly where you were not looking. A cleaning robot rewarded for a tidy\nroom learns to sweep dust under the rug; a boat-racing agent rewarded for the\nscore circles a lagoon collecting the same power-ups forever instead of finishing\nthe race.[^gaming] These are not optimizer bugs: the optimizer worked, the\nreward was wrong, and nothing in reward maximization penalizes the difference.\n\nThis lesson is about the discipline that takes the gap seriously: state, alongside\nthe reward, the **constraints** a good policy must respect — a collision budget, a\npower limit, a rule it may not break — and optimize return _subject to_ them. It\nshares a principle with [offline RL](\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl),\nwhere the remedy for unverifiable value estimates was pessimism about what the data\ncannot confirm; here the remedy for an incomplete reward is pessimism about what the\nreward does not measure. And it sharpens the over-optimization story from\n[RLHF](\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models): the KL\nleash there is one instance of the general move this lesson formalizes — bound how\nhard you push on a proxy, because the proxy stops being right before the optimizer\nstops pushing.\n\nThis lesson builds the core machinery: the constrained MDP that states the problem, and\nthe two policy-optimization methods that solve it — Lagrangian primal-dual (RCPO) and\nconstrained policy optimization (CPO). Risk-sensitivity, safe exploration, and the\nalignment framing continue in a\n[companion lesson](\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2).\n\n## Why reward maximization alone is dangerous\n\nThe trouble is structural, not a matter of careless reward design. Call the\nreward you wrote the **proxy** $r$ and the outcome you actually care about the\n**true objective** $r^\\star$. The two agree on the behaviors you had in mind when\nyou wrote $r$ — the ones near your demonstrations and your imagination — and they\ncan diverge arbitrarily on behaviors you did not consider. Optimization is a search\nfor the highest-reward behavior, so it is drawn precisely toward the regions where\n$r$ is high for reasons that have nothing to do with $r^\\star$. The better the\noptimizer, the more reliably it finds them.[^goodhart]\n\n$$\n% caption: Specification gaming. The proxy reward $r$ (solid) agrees with the true\n% objective $r^\\star$ (dashed) on the intended behaviors near the center, then\n% diverges upward on unintended ones; a strong optimizer climbs the proxy straight\n% into the gap, where measured reward is high and true value has collapsed.\n\\begin{tikzpicture}[>=stealth, font=\\small]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\draw[->, black] (-0.2,0) -- (9.4,0) node[anchor=north, black, font=\\footnotesize] {policy behavior};\n  \\draw[->, black] (0,-0.2) -- (0,4.6) node[anchor=east, black, font=\\footnotesize] {value};\n  \\fill[acc!8] (2.0,0) rectangle (4.4,4.4);\n  \\node[acc, font=\\footnotesize, anchor=south] at (3.2,4.35) {intended region};\n  % true objective: a bump peaking in the intended region, low outside\n  \\draw[black, thick, dashed, smooth]\n    plot coordinates {(0.4,0.9)(1.4,1.5)(2.4,2.4)(3.2,2.75)(4.0,2.5)(4.8,1.9)(6.0,1.2)(7.2,0.85)(8.6,0.7)};\n  \\node[black, anchor=west, font=\\footnotesize] at (8.65,0.7) {true objective};\n  % proxy reward: matches inside, then climbs off to the right\n  \\draw[red, thick, smooth]\n    plot coordinates {(0.4,0.9)(1.4,1.5)(2.4,2.4)(3.2,2.75)(4.0,2.6)(4.8,2.5)(6.0,3.2)(7.2,3.9)(8.6,4.3)};\n  \\node[red, anchor=west, font=\\footnotesize] at (5.7,3.4) {proxy reward};\n  % optimizer climbs the proxy into the gap\n  \\fill[red] (8.5,4.28) circle (2.2pt);\n  \\draw[red!70, ->] (7.4,4.1) to[bend left=12] (8.45,4.24);\n  \\node[red, font=\\footnotesize, anchor=east] at (7.4,4.05) {optimum of proxy};\n\\end{tikzpicture}\n$$\n\n> **Definition (Specification gaming \u002F reward hacking).** Behavior that scores\n> highly under the specified reward while violating the designer's intent, arising\n> because the reward is an imperfect proxy for the true objective. A more capable\n> optimizer exploits the proxy–objective gap more thoroughly, so gaming tends to\n> _worsen_ with capability rather than improve.\n\nThe pattern is the same one the [RLHF lesson](\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models)\nnamed **over-optimization**: a language policy free to maximize a learned reward\nmodel drifts into degenerate text the reward model mistakenly scores highly. There the fix\nwas a KL leash back to the reference model — a soft constraint on how far the\npolicy may move. That is a special case of the general idea. When the thing you\ncannot capture in the reward is _how far the policy strays_, a KL bound suffices;\nwhen it is _a physical limit_ (energy, collisions, torque), you need an explicit\nconstraint on a measured cost. Both limit how far the optimizer can exploit the\nproxy. The rest of the lesson builds the machinery for the second, harder case.\n\nA first instinct is to fold the constraint into the reward as a penalty: subtract\n$\\lambda\\,c_t$ from the reward for each unit of cost $c_t$ and tune $\\lambda$ by\nhand. This works when you can find the right $\\lambda$, but it hides the constraint\ninside a scalar and gives you no guarantee about the resulting cost. Pick $\\lambda$\ntoo small and the policy pays the penalty and violates the limit anyway; too large\nand it becomes so cautious it abandons the task. The constrained formulation makes\nthe limit a first-class object — a number you _specify_ rather than a weight you\ntune by trial and error — and derives the right penalty automatically.\n\n## The constrained MDP\n\nThe formalism is the **constrained Markov decision process (CMDP)**.[^altman]\nIt is an ordinary MDP with one addition: alongside the reward $r(s,a)$, each\ntransition emits one or more **cost** signals $c(s,a)$, and the policy must keep\nthe expected discounted cost under a threshold $d$ the designer sets.\n\nWrite the return as before and define an analogous **cost return**:\n\n$$\nJ_r(\\pi) \\;=\\; \\mathbb{E}_\\pi\\!\\Bigl[\\textstyle\\sum_{t\\ge 0} \\gamma^t\\, r_t\\Bigr],\n\\qquad\nJ_c(\\pi) \\;=\\; \\mathbb{E}_\\pi\\!\\Bigl[\\textstyle\\sum_{t\\ge 0} \\gamma^t\\, c_t\\Bigr].\n$$\n\nThe CMDP problem is then to maximize the reward return subject to the cost return\nstaying within budget:\n\n$$\n\\max_{\\pi}\\; J_r(\\pi)\n\\quad\\text{subject to}\\quad\nJ_c(\\pi) \\;\\le\\; d.\n$$\n\nWith several constraints there is one $c_i$ and one threshold $d_i$ per\nrequirement. The cost is not the negative of reward; it is a _separate_\nmeasurement of something the reward does not price — a count of collisions, joules\nburned, or times a safety envelope was crossed — and $d$ says how much of it you\nwill tolerate on average.\n\n> **Definition (Constrained MDP).** A tuple $(\\mathcal{S}, \\mathcal{A}, P, r, c,\n> \\gamma, d)$ extending an MDP with a cost function $c : \\mathcal{S} \\times\n> \\mathcal{A} \\to \\mathbb{R}$ and a threshold $d$. A policy is **feasible** if its\n> expected discounted cost satisfies $J_c(\\pi) \\le d$; the objective is the\n> highest-return policy among the feasible ones.\n\nThe constraint carves the space of all policies into a **feasible set** — those\nthat satisfy $J_c(\\pi) \\le d$ — and the goal is the best-return policy _inside_ it,\nwhich is in general different from the unconstrained optimum sitting outside.\n\n$$\n% caption: The feasible set in policy space. The cost constraint $J_c(\\pi) \\le d$\n% admits the shaded region; the unconstrained reward optimum lies outside it, so\n% the constrained optimum is the highest-reward point on or inside the boundary.\n% Reward increases toward the upper right.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  % ambient policy space\n  \\draw[black] (-0.2,-0.2) rectangle (8.6,5.0);\n  \\node[black!70, anchor=north west, font=\\scriptsize] at (-0.15,4.95) {policy space};\n  % reward contours (increasing toward upper right)\n  \\foreach \\k in {1,2,3,4} {\n    \\draw[black] (8.6,{0.4*\\k}) to[out=200,in=-70] ({0.9*\\k},4.95);\n  }\n  \\node[black, anchor=west, font=\\scriptsize] at (6.0,3.9) {higher reward};\n  % feasible set (shaded blob, lower-left region satisfying the cost budget)\n  \\fill[acc!10] (0.2,0.1) to[out=40,in=200] (3.2,1.3) to[out=20,in=250] (5.0,3.0)\n    to[out=110,in=-30] (3.0,4.4) to[out=210,in=60] (0.6,2.2) to[out=240,in=120] (0.2,0.1);\n  \\draw[acc, thick] (0.2,0.1) to[out=40,in=200] (3.2,1.3) to[out=20,in=250] (5.0,3.0)\n    to[out=110,in=-30] (3.0,4.4) to[out=210,in=60] (0.6,2.2) to[out=240,in=120] (0.2,0.1);\n  \\node[acc, font=\\footnotesize] at (2.0,1.9) {feasible set};\n  \\node[acc, font=\\scriptsize] at (2.4,3.1) {cost $\\le$ d};\n  % unconstrained optimum outside\n  \\fill[red] (7.6,4.4) circle (2.4pt);\n  \\node[red, anchor=east, font=\\scriptsize] at (7.45,4.4) {unconstrained optimum};\n  % constrained optimum on the boundary\n  \\fill[acc] (4.85,2.95) circle (2.4pt);\n  \\node[acc, anchor=west, font=\\scriptsize] at (4.95,2.75) {constrained optimum};\n\\end{tikzpicture}\n$$\n\nBecause the best feasible policy so often sits _on_ the boundary $J_c(\\pi) = d$\n(spend the whole budget, no more), the constraint is typically active, and the two\nmethods that follow are two ways of finding that boundary point.\n\n## Lagrangian methods and RCPO\n\nThe textbook tool for a constrained optimization is the **Lagrangian**. Introduce\na multiplier $\\lambda \\ge 0$ on the constraint and fold it into a single objective,\n\n$$\n\\mathcal{L}(\\pi, \\lambda)\n\\;=\\;\nJ_r(\\pi) \\;-\\; \\lambda\\,\\bigl(J_c(\\pi) - d\\bigr).\n$$\n\nRead the multiplier as a _price_ on cost. For a fixed $\\lambda$, maximizing\n$\\mathcal{L}$ over $\\pi$ is an ordinary unconstrained RL problem with the shaped\nreward $r_t - \\lambda\\, c_t$ — exactly the hand-penalty from earlier, except now\n$\\lambda$ is not something you guess. The theory of Lagrangian duality says the\nconstrained optimum is a **saddle point** of $\\mathcal{L}$: a maximum over $\\pi$\nand a minimum over $\\lambda$. We reach it by **primal-dual** optimization —\nalternate improving the policy at the current price and adjusting the price toward\nthe constraint.\n\nThe multiplier update is a gradient step on $\\mathcal{L}$ in $\\lambda$, and\n$\\partial \\mathcal{L} \u002F \\partial \\lambda = -(J_c(\\pi) - d)$, so it is a simple\nfeedback law:\n\n$$\n\\lambda \\;\\gets\\; \\bigl[\\, \\lambda \\;+\\; \\eta_\\lambda\\,\\bigl(J_c(\\pi) - d\\bigr)\\,\\bigr]_+ ,\n$$\n\nwith $[\\cdot]_+$ clamping $\\lambda$ to be non-negative. When the policy overspends\nits cost budget ($J_c > d$), $\\lambda$ rises, the penalty grows, and the\nnext policy update backs off the expensive behavior. When the policy is comfortably\nunder budget ($J_c \u003C d$), $\\lambda$ falls toward zero, the constraint relaxes, and\nthe policy is free to pursue reward. The price self-tunes until $J_c = d$.\n\n$$\n% caption: The primal-dual loop. The multiplier lambda prices the cost; the policy\n% is improved against the shaped reward r minus lambda times c, then lambda is\n% nudged up when cost exceeds the budget d and down when it falls below, driving\n% the pair to the saddle point where cost equals d.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize,\n  b\u002F.style={draw, minimum width=34mm, minimum height=13mm, align=center}]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\node[b, draw=acc, text=acc, thick] (pi) at (0,0) {primal step:\\\\improve policy on\\\\reward r - lambda c};\n  \\node[b] (lam) at (7.2,0) {dual step:\\\\lambda $\\gets$ lambda + eta (cost - d)};\n  \\draw[->, acc, thick] (pi.north) .. controls (2.4,1.8) and (4.8,1.8) .. (lam.north)\n    node[midway, above, black!70, font=\\scriptsize] {measured cost};\n  \\draw[->, red, thick] (lam.south) .. controls (4.8,-1.8) and (2.4,-1.8) .. (pi.south)\n    node[midway, below, black!70, font=\\scriptsize] {updated price lambda};\n\\end{tikzpicture}\n$$\n\n**Reward Constrained Policy Optimization (RCPO)**[^rcpo] is the actor-critic\nrealization of this idea, with one refinement that makes it practical. Rather than\nwait for a full episode to measure $J_c(\\pi)$, RCPO treats $\\lambda$ as a slowly\nadapting parameter on a separate, slower timescale than the policy and value\nupdates. On the fast timescale the actor and critic optimize the penalized reward\n$r_t - \\lambda\\, c_t$ with any standard policy-gradient method; on the slow\ntimescale $\\lambda$ drifts by the feedback law above. The timescale separation is\nwhat makes the saddle-point search converge: the policy sees a nearly-fixed price\nlong enough to respond to it, and the price sees a nearly-converged policy long\nenough to read its true cost.\n\n```algorithm\ncaption: $\\textsc{RCPO}$ — reward-constrained actor-critic via primal-dual optimization\n$\\lambda \\gets 0$ \u002F\u002F initialize the cost price\ninitialize policy $\\theta$ and value\u002Fcost critics\nrepeat\n  collect trajectories under $\\pi_\\theta$, recording rewards $r_t$ and costs $c_t$\n  $\\tilde r_t \\gets r_t - \\lambda\\, c_t$ \u002F\u002F penalized reward on the fast timescale\n  update critics and $\\theta$ by a policy-gradient step on $\\tilde r_t$\n  $\\hat J_c \\gets$ estimate of $\\mathbb{E}_\\pi[\\sum_t \\gamma^t c_t]$ from the trajectories\n  $\\lambda \\gets [\\, \\lambda + \\eta_\\lambda\\,(\\hat J_c - d)\\,]_+$ \u002F\u002F slow dual step\nuntil policy and $\\lambda$ both converge\nreturn $\\pi_\\theta$\n```\n\n> **Definition (Lagrangian \u002F primal-dual method).** A constrained-optimization\n> scheme that adjoins the constraint to the objective through a multiplier\n> $\\lambda \\ge 0$, forming $\\mathcal{L}(\\pi,\\lambda) = J_r(\\pi) - \\lambda(J_c(\\pi) -\n> d)$, then finds its saddle point by alternating a **primal** step (improve the\n> policy against the shaped reward) with a **dual** step (raise $\\lambda$ when the\n> constraint is violated, lower it when slack). RCPO is the actor-critic instance\n> with $\\lambda$ on a slower timescale.\n\nThe appeal is that RCPO reuses any policy-gradient method wholesale and adds one\nscalar and one update line. The cost is that the guarantees are asymptotic: during\ntraining, before $\\lambda$ has caught up, the policy can and does violate the\nconstraint. For a simulator that is harmless. For a physical system where every\nconstraint violation is a real collision, it is not — which motivates methods that\nbound the cost at _every_ update, not just in the limit.\n\n#### Worked example: the multiplier finding the budget\n\nTrace $\\lambda$ over a few dual steps to see the feedback settle. Set the cost\nbudget $d = 25$ (say, an average of 25 collisions-worth of cost per episode is\ntolerated) and the dual step $\\eta_\\lambda = 0.01$, starting from $\\lambda = 0$.\nWith $\\lambda = 0$ the policy ignores cost entirely, so it overspends badly —\nmeasure $\\hat J_c = 60$. The dual step raises\n\n$$\n\\lambda \\gets [\\,0 + 0.01\\,(60 - 25)\\,]_+ = 0.35.\n$$\n\nNow cost is priced at $0.35$ per unit; the next policy backs off and measures\n$\\hat J_c = 32$, still over budget, so\n\n$$\n\\lambda \\gets [\\,0.35 + 0.01\\,(32 - 25)\\,]_+ = 0.42.\n$$\n\nThe policy tightens further to $\\hat J_c = 22$, now _under_ budget, and the\nmultiplier falls:\n\n$$\n\\lambda \\gets [\\,0.42 + 0.01\\,(22 - 25)\\,]_+ = 0.39.\n$$\n\nThe overshoot-and-correct pattern — $0 \\to 0.35 \\to 0.42 \\to 0.39$ — is the\nfeedback loop converging on the price at which $\\hat J_c = d$. It\noscillates around the budget and, on the slow timescale, damps toward the\n$\\lambda^\\ast$ where the constraint is exactly met. That equilibrium $\\lambda^\\ast$\nis the _shadow price_ of the constraint: the marginal reward the policy gives up per\nunit of cost budget, and had you set the hand-penalty of the opening section to\nexactly $\\lambda^\\ast$ you would have recovered the same policy — the primal-dual\nloop is what finds that number for you instead of making you guess it.\n\n$$\n% caption: The multiplier lambda converging to the budget. Starting from zero (cost\n% ignored, badly over budget), each dual step nudges lambda up while measured cost\n% exceeds d and down once it dips below, so lambda overshoots then damps toward the\n% shadow price where measured cost equals the budget d. The cost trace (right axis,\n% dashed) settles onto d from above.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  \\draw[->, black] (0,0) -- (7.4,0) node[anchor=north, black] {dual steps};\n  \\draw[->, black] (0,0) -- (0,4.0) node[anchor=east, black] {lambda};\n  % lambda trajectory: 0, 0.35, 0.42, 0.39, 0.40 (scaled *8 for height)\n  \\coordinate (l0) at (0.4,0);\n  \\coordinate (l1) at (1.8,2.8);\n  \\coordinate (l2) at (3.2,3.36);\n  \\coordinate (l3) at (4.6,3.12);\n  \\coordinate (l4) at (6.0,3.2);\n  \\draw[acc, very thick] (l0) -- (l1) -- (l2) -- (l3) -- (l4);\n  \\foreach \\p in {(l0),(l1),(l2),(l3),(l4)} { \\fill[acc] \\p circle (2.2pt); }\n  \\node[acc, anchor=north, font=\\scriptsize] at (0.4,-0.1) {0};\n  \\node[acc, anchor=south east, font=\\scriptsize] at (1.8,2.8) {0.35};\n  \\node[acc, anchor=south, font=\\scriptsize] at (3.2,3.4) {0.42};\n  \\node[acc, anchor=north, font=\\scriptsize] at (4.6,3.0) {0.39};\n  % shadow-price dashed target\n  \\draw[red, dashed] (0,3.2) -- (6.4,3.2);\n  \\node[red, anchor=south west, font=\\scriptsize] at (6.15,3.28) {shadow price};\n\\end{tikzpicture}\n$$\n\n## Constrained policy optimization (CPO)\n\n**Constrained Policy Optimization (CPO)**[^cpo] delivers a per-update guarantee by\ngrafting the constraint onto a trust-region method. Recall the trust-region idea\nfrom [policy-gradient methods](\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods):\nimprove the policy within a small KL ball around the current one, small enough that\na local linear model of the return is trustworthy. TRPO solves, each step,\n\n$$\n\\max_{\\theta}\\; \\hat A_r(\\theta)\n\\quad\\text{subject to}\\quad\n\\overline{\\mathrm{KL}}(\\theta, \\theta_k) \\le \\delta,\n$$\n\nwhere $\\hat A_r$ is the estimated reward advantage of the new policy over the old\nand $\\delta$ is the trust-region radius. CPO adds a second constraint inside the\nsame trust region: a linear model of the _cost_ return must stay under budget.\nUsing the surrogate $J_c(\\theta_k) + \\hat A_c(\\theta)$ for the new policy's cost,\nthe CPO subproblem is\n\n$$\n\\max_{\\theta}\\; \\hat A_r(\\theta)\n\\quad\\text{s.t.}\\quad\nJ_c(\\theta_k) + \\hat A_c(\\theta) \\le d,\n\\quad\n\\overline{\\mathrm{KL}}(\\theta, \\theta_k) \\le \\delta.\n$$\n\nBecause both the objective and the cost constraint are linearized and the KL\nconstraint is quadratic, the subproblem is a small convex program solvable in\nclosed form (up to a line search). Achiam et al. prove a **worst-case bound**: the\ntrue cost return of the updated policy exceeds the surrogate by at most a term that\nshrinks with $\\delta$, so with a small enough trust region each CPO update keeps\nthe policy _approximately feasible_ throughout training, not merely at\nconvergence. That near-monotonic feasibility is the property RCPO lacks and the\nreason CPO is the reference method when violations during learning are costly.\n\n$$\n% caption: One CPO update. Inside the KL trust region (circle) around the current\n% policy, the cost constraint cuts off the half that would overspend the budget d;\n% CPO takes the highest-reward point in the surviving feasible wedge, so the step\n% improves reward while keeping the policy approximately within cost.\n\\begin{tikzpicture}[>=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{2348F2}\n  \\definecolor{red}{HTML}{C0392B}\n  % feasible side of the trust region (lower-left of the cost line), clipped to the circle\n  \\begin{scope}\n    \\clip (0,0) circle (2.4);\n    \\fill[acc!10] (-2.8,-2.8) -- (2.8,-2.8) -- (2.8,-1.4) -- (-2.8,1.9) -- cycle;\n  \\end{scope}\n  % trust region\n  \\draw[acc, thick] (0,0) circle (2.4);\n  \\node[acc, anchor=south, font=\\scriptsize] at (0,2.5) {KL trust region};\n  % feasible-set label inside shaded wedge\n  \\node[acc, font=\\scriptsize] at (-1.3,-1.35) {feasible wedge};\n  % current policy at center\n  \\fill[black] (0,0) circle (2.2pt);\n  \\node[black, anchor=north east, font=\\scriptsize] at (-0.1,-0.1) {current policy};\n  % reward-improving direction (arrow up-right, toward the infeasible corner)\n  \\draw[->, black, thick] (0,0) -- (1.6,1.6);\n  \\node[black, anchor=south, font=\\scriptsize] at (1.35,1.7) {reward gradient};\n  % cost constraint line cutting the region (feasible below-left)\n  \\draw[red, thick] (-2.35,1.7) -- (2.35,-1.1);\n  \\node[red, anchor=north west, font=\\scriptsize] at (1.7,-0.7) {cost = d};\n  % chosen CPO step: highest reward inside feasible region, on the cost boundary\n  \\coordinate (step) at (0.95,0.35);\n  \\fill[acc] (step) circle (2.4pt);\n  \\draw[->, acc, very thick] (0,0) -- (step);\n  \\node[acc, anchor=west, font=\\scriptsize] at (1.05,0.4) {CPO step};\n\\end{tikzpicture}\n$$\n\n> **Definition (Constrained policy optimization).** A trust-region policy update\n> that maximizes a linear model of the reward advantage subject to two constraints\n> inside a KL ball: a linear model of the cost return must stay under budget $d$,\n> and the KL step size must stay under $\\delta$. The resulting update carries a\n> worst-case bound on constraint violation, giving approximate feasibility at every\n> step rather than only at convergence.\n\nWhen a proposed update finds no feasible point at all — the current policy already\nviolates the budget and no step within the trust region fixes it — CPO falls back\nto a pure **recovery** step that decreases cost as fast as the trust region allows,\nignoring reward until the policy is feasible again. That recovery mode is what lets\nCPO start from an infeasible policy and steer it into the feasible set.\n\n## Where this leaves us\n\nThe honest formulation of \"behave well\" is now precise. A **constrained MDP** keeps the\nreward but adds one or more cost signals, each with a budget, and asks for the policy\nthat maximizes return _subject to_ keeping expected cost under budget. That single move\nturns the vague demand for safety into an optimization problem with a feasible set.\n\nTwo policy-optimization methods solve it:\n\n- **Lagrangian primal-dual (RCPO)** turns the constraint into a penalty with a learned\n  multiplier $\\lambda$: raise $\\lambda$ when the cost budget is exceeded, lower it when\n  there is slack, so the penalty self-tunes toward the boundary.\n- **CPO** builds the cost budget directly into a trust-region update, guaranteeing (to\n  first order) that each policy step stays feasible rather than only converging to\n  feasibility in the limit.\n\nBoth control the _mean_ cost. But a policy safe on average can still be catastrophic in\nthe tail, and a policy that respects a constraint at convergence may violate it wildly\n_while learning_. Optimizing the tail (risk-sensitive RL), staying safe during\nexploration (shields, Lyapunov methods, safety layers), and the connection to alignment\ncontinue in\n[Safe RL: Risk, Safe Exploration, and Alignment](\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2).\n\n[^gaming]: **Krakovna, Uesato, Mikulik, et al. (2020)**, \"Specification gaming: the flip side of AI ingenuity\", DeepMind — catalogues dozens of documented cases, including the CoastRunners boat that laps a lagoon collecting power-ups instead of finishing the race. See also **Clark & Amodei (2016)**, \"Faulty Reward Functions in the Wild\", OpenAI, for the original boat-racing example.\n[^goodhart]: A restatement of Goodhart's law for optimization: when a measure becomes a target it ceases to be a good measure. **Manheim & Garrabrant (2018)**, \"Categorizing Variants of Goodhart's Law\", arXiv:1803.04585, formalizes the failure modes; the proxy–objective gap is the mechanism behind specification gaming.\n[^altman]: **Altman (1999)**, _Constrained Markov Decision Processes_, Chapman & Hall — the standard reference formalizing the CMDP: an MDP with additional cost functions and expected-cost constraints, and the linear-program and Lagrangian characterizations of its optimal policy.\n[^rcpo]: **Tessler, Mankowitz, Mannor (2019)**, \"Reward Constrained Policy Optimization\", ICLR — the multi-timescale actor-critic that learns a penalty multiplier $\\lambda$ on a slow timescale while optimizing the shaped reward $r - \\lambda c$ on a fast one, converging to a constraint-satisfying policy.\n[^cpo]: **Achiam, Held, Tamar, Abbeel (2017)**, \"Constrained Policy Optimization\", ICML — the first general-purpose policy-search method with near-monotonic constraint satisfaction, adding a linearized cost constraint to a TRPO trust-region step with a worst-case bound on violation.\n",{"text":6498,"minutes":6499,"time":6500,"words":6501},"12 min read",11.7,702000,2340,{"title":5,"description":6486},[6504,6507],{"book":6505,"ref":6506},"Sutton & Barto","Ch. 13 — Policy Gradient Methods (background for the constrained policy-optimization stage)",{"book":6508,"ref":6509},"Grokking Deep RL","Ch. 11–12 — policy-based and actor-critic methods (trust-region and penalty background)","available","07.reinforcement-learning\u002F05.modern-deep-rl\u002F20.safe-and-constrained-rl","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",[6514],"Deep RL","dbWOJvDCp2vjOunwGfm5S4p77gyWKB8sPE6TbBF7wMw",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":6517,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":6518,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":6519,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":6520,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":6521,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":6522,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":6523,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":6524,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":6525,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":6526,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":6527,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":6528,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":6529,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":6530,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":6531,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":6532,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":6533,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":6534,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":6535,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":6536,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":6537,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":6538,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":6539,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":6540,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":6541,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":6542,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":6543,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":6544,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":6545,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":6546,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":6547,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":6548,"\u002Falgorithms\u002Fsequences\u002Ftries":6549,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":6550,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":6551,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":6552,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":6553,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":6554,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":6555,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":6556,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":6557,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":6558,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":6559,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":6560,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":6561,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":6562,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":6563,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":6564,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":6565,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":6566,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":6567,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":6568,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":6569,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":6570,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":6571,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":6572,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":6573,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":6574,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":6575,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":6576,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":6577,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":6578,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":6579,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":6580,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":6581,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":6582,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":6583,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":6584,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":6585,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":6586,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":6587,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":6588,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":6589,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":6590,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":6591,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":6592,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":6593,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":6594,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":6595,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":6596,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":6597,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":6598,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":6599,"\u002Falgorithms":6600,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":6601,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":6602,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":6603,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":6604,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":6605,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":6606,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":6607,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":6608,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":6609,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":6610,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":6611,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":6612,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":6613,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":6614,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":6615,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":6616,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":6617,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":6618,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":6619,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":6620,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":6621,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":6622,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":6623,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":6624,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":6625,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":6626,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":6627,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":6628,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":6629,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":6630,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":6631,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":6632,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":6633,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":6634,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":6615,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":6635,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":6636,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":6637,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":6605,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":6638,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":6639,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":6640,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":6641,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":6642,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":6643,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":6644,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":6645,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":6646,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":6647,"\u002Fcalculus":6648,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":6649,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":6650,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":6651,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":6652,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":6653,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":6654,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":6655,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":6656,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":6657,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":6658,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":6659,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":6660,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":6661,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":6662,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":6663,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":6664,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":6665,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":6666,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":6667,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":6668,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":6669,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":6670,"\u002Fmechanics\u002Frotation\u002Frolling-motion":6671,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":6672,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":6673,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":6674,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":6675,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":6676,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":6677,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":6678,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":6679,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":6680,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":6681,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":6682,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":6683,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":6684,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":6685,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":6686,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":6687,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":6688,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":6689,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":6690,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":6691,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":6692,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":6693,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":6694,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":6695,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":6696,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":6697,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":6698,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":6699,"\u002Fmechanics":6700,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":6701,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":6702,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":6703,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":6704,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":6705,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":6706,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":6707,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":6708,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":6709,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":6710,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":6711,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":6712,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":6689,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":6713,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":6714,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":6715,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":6685,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":6550,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":6716,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":6676,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":6717,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":6718,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":6719,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":6720,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":6721,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":6722,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":6723,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":6724,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":6725,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":6650,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":6726,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":6727,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":6728,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":6729,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":6730,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":6731,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":6732,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":6733,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":6668,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":6667,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":6734,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":6735,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":6736,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":6737,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":6738,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":6739,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":6740,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":6741,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":6742,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":6694,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":6692,"\u002Felectricity-and-magnetism":6743,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":6744,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":6745,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":6746,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":6747,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":6748,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":6749,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":6750,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":6751,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":6752,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":6602,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":6753,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":6754,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":6606,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":6755,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":6756,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":6757,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":6758,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":6759,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":6760,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":6761,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":6762,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":6763,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":6764,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":6765,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":6766,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":6767,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":6768,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":6769,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":6770,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":6771,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":6772,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":6773,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":6774,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":6641,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":6775,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":6776,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":6777,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":6778,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":6779,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":6780,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":6781,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":6782,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":6783,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":6784,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":6785,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":6786,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":6787,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":6788,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":6789,"\u002Flinear-algebra":6790,"\u002Ftheory-of-computation":6791,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":6792,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":6793,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":6794,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":6795,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":6796,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":6797,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":6798,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":6799,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":6800,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":6801,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":6802,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":6803,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":6804,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":6805,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":6806,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":6807,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":6808,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":6809,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":6810,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":6811,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":6812,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":6813,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":6814,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":6815,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":6816,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":6817,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":6818,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":6819,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":6820,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":6821,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":6822,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":6823,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":6824,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":6825,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":6826,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":6827,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":6828,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":6829,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":6830,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":6831,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":6832,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":6833,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":6834,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":6835,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":6836,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":6837,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":6838,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":6839,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":6840,"\u002Fcomputer-architecture":6791,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":6841,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":6842,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":6843,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":6606,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":6844,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":6605,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":6612,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":6845,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":6846,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":6646,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":6847,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":6848,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":6849,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":6850,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":6851,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":6852,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":6853,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":6854,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":6855,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":6856,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":6857,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":6858,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":6853,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":6859,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":6860,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":6861,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":6862,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":6863,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":6864,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":6865,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":6866,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":6867,"\u002Fdifferential-equations":6868,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":6869,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":6870,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":6871,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":6872,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":6751,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":6873,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":6874,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":6875,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":6876,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":6877,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":6878,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":6621,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":6879,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":6880,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":6881,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":6882,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":6883,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":6884,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":6885,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":6886,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":6887,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":6888,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":6843,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":6889,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":6890,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":6891,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":6892,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":6893,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":6772,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":6894,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":6895,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":6782,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":6896,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":6897,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":6898,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":6899,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":6900,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":6901,"\u002Frelativity":6902,"\u002Fphysical-computing":6791,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":6903,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":6882,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":6904,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":6905,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":6906,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":6907,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":6908,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":6909,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":6910,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":6858,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":6782,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":6911,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":6912,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":6913,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":6914,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":6910,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":6915,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":6890,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":6643,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":6916,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":6917,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":6623,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":6918,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":6919,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":6920,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":6921,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":6922,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":6923,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":6924,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":6925,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":6926,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":6882,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":6927,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":6928,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":6929,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":6916,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":6604,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":6930,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":6931,"\u002Fquantum-mechanics":6932,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":6866,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":6933,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":6934,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":6755,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":6935,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":6641,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":6936,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":6937,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":6778,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":6888,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":6938,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":6939,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":6940,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":6941,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":6942,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":6915,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":6943,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":6748,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":6944,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":6945,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":6602,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":6946,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":6947,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":6904,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":6631,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":6782,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":6948,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":6949,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":6767,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":6892,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":6950,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":6951,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":6952,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":6787,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":6953,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":6954,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":6955,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":6955,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":6956,"\u002Freal-analysis":6957,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":6958,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":6959,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":6960,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":6961,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":6962,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":6963,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":6964,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":6965,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":6966,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":6967,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":6931,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":6968,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":6960,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":6877,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":6969,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":6970,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":6971,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":6972,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":6973,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":6974,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":6975,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":6976,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":6970,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":6977,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":6946,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":6978,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":6979,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":6980,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":6981,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":6982,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":6983,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":6984,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":6985,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":6986,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":6987,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":6620,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":6988,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":6989,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":6862,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":6990,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":6991,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":6919,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":6991,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":6992,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":6993,"\u002Fabstract-algebra":6994,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":6995,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":6996,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":6997,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":6998,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":6999,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":6911,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":7000,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":7001,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":7002,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":7003,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":7004,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":7005,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":7006,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":6745,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":6874,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":6620,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":7007,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":6604,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":7008,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":7009,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":6642,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":6936,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":7010,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":7011,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":7012,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":7013,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":7014,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":7015,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":7016,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":7017,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":7018,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":7019,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":7020,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":7021,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":7022,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":7023,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":6967,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":7024,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":7025,"\u002Fatomic-physics":7026,"\u002Fdatabases":6791,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":7027,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":7028,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":7029,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":6958,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":7030,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":7031,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":7032,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":7033,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":7034,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":7035,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":7036,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":7037,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":7038,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":7039,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":7040,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":7041,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":7042,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":7043,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":7044,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":7045,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":7046,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":7047,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":7048,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":7049,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":7040,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":7050,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":7051,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":7052,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":7053,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":7054,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":6999,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":7055,"\u002Fcategory-theory":7056,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":7057,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":7058,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":7059,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":7060,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":7061,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":7062,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":7021,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":7063,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":7064,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":7065,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":7066,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":7067,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":7068,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":7069,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":7070,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":7071,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":7072,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":7073,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":7074,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":7075,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":7076,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":7077,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":7078,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":7079,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":7080,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":7081,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":7082,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":7083,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":7084,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":7085,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":7086,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":7087,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":7088,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":7089,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":7033,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":7090,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":7091,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":7092,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":7093,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":7094,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":7095,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":7096,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":6585,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":7097,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":7098,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":6821,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":7099,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":7100,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":7101,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":7102,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":7103,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":7104,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":7105,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":7106,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":7107,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":7108,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":7109,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":7110,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":6794,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":7111,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":7112,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":7113,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":7114,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":6831,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":7115,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":7116,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":7117,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":7118,"\u002Fdeep-learning":6791,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":7119,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":6916,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":7120,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":7121,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":7122,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":7123,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":7124,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":7125,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":7126,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":7127,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":6963,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":7128,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":7129,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":7130,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":6850,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":6643,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":7131,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":7132,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":7133,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":6777,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":7134,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":7135,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":6855,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":6782,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":7136,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":6751,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":6621,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":6637,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":7137,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":7138,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":7139,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":6769,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":7140,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":6631,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":7141,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":7142,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":7143,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":7144,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":6965,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":7145,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":7146,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":7147,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":7148,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":6911,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":7149,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":6889,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":7150,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":6750,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":7151,"\u002Fstatistical-mechanics":7152,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":7153,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":6616,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":6876,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":7154,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":7155,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":7156,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":7157,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":7158,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":7159,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":6749,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":7160,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":7161,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":7162,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":7163,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":6892,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":7164,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":7165,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":7166,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":7167,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":7168,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":6947,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":6891,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":7169,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":7170,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":7171,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":7172,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":6882,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":7173,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":7174,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":7119,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":7019,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":6746,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":7175,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":6612,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":7176,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":7177,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":6757,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":7178,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":7012,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":7179,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":6604,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":7180,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":6615,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":7181,"\u002Fcondensed-matter":6932,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":7182,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":7183,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":7184,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":7185,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":6629,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":7186,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":7187,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":6629,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":7188,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":7042,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":7189,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":7190,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":7191,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":7189,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":7192,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":7193,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":7194,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":7195,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":7196,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":7197,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":7198,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":7199,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":7120,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":7200,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":7193,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":7201,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":7202,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":6835,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":7203,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":7020,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":7204,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":7205,"\u002Flogic":7206,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":7207,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":7208,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":6821,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":7209,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":7210,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":7211,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":7212,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":7202,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":7213,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":7214,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":7215,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":7113,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":7216,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":7217,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":7218,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":7219,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":7220,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":6838,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":7221,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":7222,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":7223,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":7224,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":7029,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":7225,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":7201,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":7226,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":7227,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":7228,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":6849,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":7229,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":6979,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":7230,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":7231,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":6811,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":7232,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":7233,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":7234,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":7235,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":7236,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":7089,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":7237,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":7238,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":7239,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":7124,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":7240,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":7241,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":7242,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":6838,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":6905,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":7243,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":7244,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":7245,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":7246,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":7247,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":7248,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":7249,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":7250,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":7251,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":7252,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":6501,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":7253,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":7254,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":7255,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":7256,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":7257,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":7258,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":7259,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":7260,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":7261,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":7262,"\u002Freinforcement-learning":6791,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":7263,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":7264,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":7265,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":7266,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":7267,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":7268,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":7269,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":7270,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":7271,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":7272,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":7273,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":7274,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":7275,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":7118,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":6973,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":7276,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":7277,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":7278,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":7279,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":7280,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":7281,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":7100,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":7282,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":7283,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":7284,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":7285,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":7286,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":7287,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":7288,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":7289,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":7290,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":7291,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":7292,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":7293,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":7032,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":7283,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":7294,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":6572,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":7295,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":7296,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":7297,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":7298,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":7299,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":7081,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":7300,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":7301,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":7302,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":7303,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":7304,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":7305,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":7306,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":7307,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":7308,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":7309,"\u002Fartificial-intelligence":6791,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":7048,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":7310,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":6608,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":6606,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":7142,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":7311,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":6634,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":6944,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":7312,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":7313,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":7314,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":7004,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":7315,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":7316,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":7317,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":7203,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":7318,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":7319,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":6618,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":6847,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":7320,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":6948,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":7321,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":7322,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":6843,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":6931,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":7323,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":7324,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":7325,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":6613,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":6988,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":6850,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":7326,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":6898,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":6962,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":7327,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":7328,"\u002Fnuclear-physics":7329,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":7330,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":7331,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":6969,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":7332,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":7333,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":7334,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":6817,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":7335,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":7336,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":7114,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":7337,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":7282,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":7338,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":7339,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":7340,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":7341,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":7342,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":7343,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":7344,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":6795,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":7345,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":7346,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":7288,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":7347,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":7348,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":7349,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":7350,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":7351,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":7352,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":7353,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":7354,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":7213,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":7355,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":7356,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":7357,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":7358,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":7359,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":7360,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":7361,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":7362,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":7363,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":7364,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":7365,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":7366,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":7067,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":7234,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":6823,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":7367,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":7368,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":7369,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":7370,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":7081,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":7371,"\u002Fnatural-language-processing":6791,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":7372,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":6989,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":7373,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":7134,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":7374,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":7375,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":7323,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":7376,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":7377,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":6939,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":6641,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":7378,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":6893,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":7379,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":6926,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":7380,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":7180,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":7381,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":7382,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":7149,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":7383,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":6612,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":7384,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":7385,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":7386,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":6930,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":7146,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":7387,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":7388,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":7005,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":7389,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":7050,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":7390,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":7391,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":6939,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":6972,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":7392,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":7393,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":7394,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":7028,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":7395,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":6769,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":7396,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":6872,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":7397,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":7398,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":7196,"\u002Fparticle-physics":7399,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":6990,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":7144,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":7400,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":6929,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":7401,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":6989,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":6901,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":7402,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":7403,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":7404,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":7405,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":7406,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":7195,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":7126,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":7407,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":7408,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":7409,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":7410,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":7322,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":7411,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":6885,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":6948,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":6930,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":7412,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":7014,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":6630,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":7413,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":7414,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":7145,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":7415,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":7416,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":7417,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":7418,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":6611,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":7419,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":7420,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":6872,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":7421,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":7422,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":7138,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":6793,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":7423,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":7424,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":7050,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":7036,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":7048,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":7145,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":7425,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":6610,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":6802,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":7426,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":6889,"\u002Fastrophysics-cosmology":6994,"\u002Fcolophon":7427,"\u002F":6791},4250,4808,3626,2682,4109,4786,3878,3875,3751,3415,4067,3153,3000,4042,5461,5808,3961,3749,4327,5067,4246,4655,4154,5436,2640,4003,3601,2158,4331,4189,2273,3252,4633,4964,4172,3131,5524,3160,4031,2309,4207,3226,2648,4842,5340,3307,5701,4977,4039,2615,3472,4460,3848,4075,4400,3382,3010,3602,3737,3740,3707,3922,5191,4043,3804,4542,4214,5062,2850,4361,3443,3627,4044,3766,4140,3860,4006,5199,4334,5234,3651,5509,5680,153,1375,1073,1093,1125,1146,1014,1132,876,1541,1189,1173,984,1402,1301,950,1268,1063,1107,1408,1161,925,1012,866,964,1090,1142,1085,1020,1207,973,980,728,764,1225,1329,796,929,801,878,774,1044,1488,1175,1130,890,814,870,154,4073,5140,4961,5127,4870,5382,5195,4955,5369,4501,5576,3824,4132,4289,4307,4570,3403,5084,5105,5201,5116,5341,5175,5368,5188,5211,5499,5155,4981,5125,5415,5255,5304,5130,5167,5552,5164,5094,5239,5036,5190,5004,5099,5035,5159,5088,5026,4937,5023,5264,5244,133,5114,5078,5043,5312,5170,5342,5139,5151,5049,5212,5013,5068,5079,5102,5121,5081,5029,5379,5854,5110,2139,3798,5055,5364,4984,4935,4895,4972,5289,5112,5156,4987,5031,5025,5149,5302,5042,5002,4979,4922,4960,5279,126,1877,1180,1129,907,958,1112,1300,1053,1250,1181,1241,1234,966,1050,734,1190,484,1082,926,733,761,571,607,798,804,952,977,731,784,645,771,1017,742,1004,1000,1562,1254,1288,1101,1011,1486,1061,856,992,1169,988,137,0,2037,1782,2384,2254,2123,2332,1643,1714,2089,1751,1367,1660,2511,1998,1892,1854,1791,2438,2487,1917,2375,2525,2266,1845,2275,1810,1631,2310,2166,2233,2113,2505,2347,2672,2112,2473,2592,2380,3013,2513,3256,3218,2194,2173,2205,2326,2081,3342,3152,1799,1670,1027,960,1095,1291,986,897,1209,1055,1817,1801,1593,1465,1196,1464,1201,1230,1435,1684,1461,1926,1500,1409,1284,1774,1869,162,1487,1122,1188,1001,1351,982,1005,979,1325,1046,943,1279,824,1008,989,1798,1277,1025,987,1043,1211,1074,981,939,1002,739,1139,1108,1013,1070,978,1458,1317,157,1357,1077,2355,1116,1037,1178,1637,1314,1109,1056,1702,1474,1071,1158,832,993,1404,1024,1068,1339,1106,1264,1248,913,1848,1328,1633,1224,1143,135,1378,959,1028,998,911,1527,1203,1266,1483,1165,990,938,965,1257,1418,1099,942,1352,956,1035,1398,1003,1094,1292,138,1721,1827,1449,1354,1148,1184,1285,1281,1213,1290,1271,1252,1274,1778,1591,1503,1437,1571,1584,1957,1117,1781,1648,1342,1667,1510,1965,1607,1365,1849,1259,1303,1356,1238,2208,1564,173,1671,1286,1227,1638,1529,668,1078,918,709,865,880,940,1534,1015,874,922,841,794,1194,822,1105,1658,1359,1296,1438,1921,1844,1570,1429,1324,1400,140,1787,1558,1654,1492,1747,2224,2002,2009,1323,1349,1785,1573,1722,1829,1353,1548,1552,1583,1624,1585,1245,1364,1514,1343,1397,1355,2211,1481,1770,160,2388,2293,2256,2552,2569,2478,2039,2496,2578,2814,2519,2461,2587,2492,2714,3278,2654,3050,2447,2849,2238,2369,2061,2214,2602,2563,2186,2985,2749,3364,2038,2282,2409,2126,2573,2206,2176,2268,2182,2402,2705,2633,2414,2213,2801,3313,3410,3195,1952,2017,1509,2537,2645,2027,2415,2838,2356,1906,3184,2950,2807,2954,1683,1316,1034,1138,1763,1822,1705,1246,1701,1097,1104,1187,1032,1083,1228,916,1489,1033,1652,997,692,837,1023,888,864,1089,1231,1214,1675,1156,1075,1520,1309,139,1205,1051,735,1123,1072,915,567,768,825,1253,983,1007,762,1058,861,862,971,1208,1149,1145,1029,1084,927,810,838,857,807,936,949,2321,1622,1069,1113,1057,854,1958,1528,1618,2049,1432,1679,1796,1685,1346,1275,1476,1505,1610,2018,1599,1215,1838,1909,132,3902,2215,2240,3266,3208,3073,2454,2969,2451,1875,2728,1884,2371,2516,2842,1690,1904,2346,3146,1386,2607,1966,2668,1665,2885,1606,2577,3074,2869,2403,2433,2082,1939,1587,2460,2747,2032,2642,1619,3123,1993,2090,2339,3829,1737,2622,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":7429,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":7434,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":7438,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":7442,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":7446,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":7450,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":7454,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":7459,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":7463,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":7467,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":7471,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":7476,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":7480,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":7484,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":7488,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":7493,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":7497,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":7501,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":7505,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":7509,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":7513,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":7517,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":7521,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":7525,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":7529,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":7533,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":7537,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":7542,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":7546,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":7550,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":7554,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":7558,"\u002Falgorithms\u002Fsequences\u002Ftries":7562,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":7566,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":7570,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":7575,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":7579,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":7583,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":7587,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":7591,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":7595,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":7599,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":7603,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":7607,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":7611,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":7615,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":7619,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":7623,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":7627,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":7632,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":7636,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":7640,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":7644,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":7648,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":7653,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":7657,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":7661,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":7665,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":7669,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":7673,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":7677,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":7681,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":7685,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":7689,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":7693,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":7698,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":7702,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":7706,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":7710,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":7715,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":7719,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":7723,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":7727,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":7731,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":7735,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":7739,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":7744,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":7748,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":7752,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":7756,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":7761,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":7765,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":7769,"\u002Falgorithms":7773,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":7776,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":7781,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":7785,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":7789,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":7793,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":7798,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":7802,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":7806,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":7810,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":7815,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":7819,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":7823,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":7827,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":7832,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":7836,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":7840,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":7845,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":7849,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":7853,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":7858,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":7862,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":7866,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":7871,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":7875,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":7879,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":7883,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":7888,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":7892,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":7896,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":7901,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":7905,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":7909,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":7913,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":7917,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":7922,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":7926,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":7930,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":7934,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":7938,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":7943,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":7946,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":7950,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":7954,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":7958,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":7963,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":7967,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":7971,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":7975,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":7979,"\u002Fcalculus":7983,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":7986,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":7990,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":7994,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":7999,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":8003,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":8007,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":8011,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":8015,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":8020,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":8024,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":8028,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":8032,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":8036,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":8041,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":8045,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":8049,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":8053,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":8057,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":8062,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":8066,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":8070,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":8075,"\u002Fmechanics\u002Frotation\u002Frolling-motion":8079,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":8083,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":8087,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":8091,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":8095,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":8100,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":8104,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":8108,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":8112,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":8116,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":8120,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":8124,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":8129,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":8133,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":8137,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":8141,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":8145,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":8149,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":8153,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":8157,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":8161,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":8165,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":8169,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":8173,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":8178,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":8182,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":8186,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":8190,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":8194,"\u002Fmechanics":8198,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":8201,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":8206,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":8210,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":8214,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":8218,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":8222,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":8227,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":8231,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":8236,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":8240,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":8244,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":8248,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":8252,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":8257,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":8261,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":8265,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":8269,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":8274,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":8278,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":8282,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":8287,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":8291,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":8295,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":8299,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":8303,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":8308,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":8312,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":8316,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":8320,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":8324,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":8328,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":8333,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":8337,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":8341,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":8345,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":8349,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":8353,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":8357,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":8361,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":8366,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":8370,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":8374,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":8378,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":8382,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":8387,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":8391,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":8395,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":8399,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":8403,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":8408,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":8412,"\u002Felectricity-and-magnetism":8416,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":8419,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":8424,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":8428,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":8432,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":8436,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":8440,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":8445,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":8449,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":8453,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":8457,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":8461,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":8466,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":8470,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":8474,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":8479,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":8483,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":8487,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":8491,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":8495,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":8499,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":8503,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":8508,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":8512,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":8516,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":8520,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":8524,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":8528,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":8532,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":8537,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":8541,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":8545,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":8549,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":8553,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":8557,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":8562,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":8566,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":8570,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":8574,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":8578,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":8583,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":8587,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":8591,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":8595,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":8599,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":8603,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":8608,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":8612,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":8616,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":8620,"\u002Flinear-algebra":8624,"\u002Ftheory-of-computation":8627,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":8630,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":8634,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":8638,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":8642,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":8646,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":8650,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":8655,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":8659,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":8663,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":8667,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":8671,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":8675,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":8679,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":8684,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":8688,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":8692,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":8696,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":8700,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":8705,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":8709,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":8713,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":8717,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":8721,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":8726,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":8730,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":8734,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":8738,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":8742,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":8747,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":8751,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":8755,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":8759,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":8763,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":8768,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":8772,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":8776,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":8780,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":8784,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":8789,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":8793,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":8797,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":8802,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":8806,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":8811,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":8815,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":8819,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":8823,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":8827,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":8832,"\u002Fcomputer-architecture":8836,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":8839,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":8843,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":8847,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":8852,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":8856,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":8860,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":8864,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":8868,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":8872,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":8877,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":8881,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":8885,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":8889,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":8893,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":8897,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":8902,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":8906,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":8910,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":8915,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":8919,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":8924,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":8928,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":8932,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":8937,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":8941,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":8946,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":8950,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":8954,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":8959,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":8963,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":8967,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":8972,"\u002Fdifferential-equations":8976,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":8979,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":8984,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":8988,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":8992,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":8996,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":9000,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":9005,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":9009,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":9013,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":9017,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":9022,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":9026,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":9030,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":9034,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":9039,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":9043,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":9047,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":9051,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":9056,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":9060,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":9064,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":9068,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":9072,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":9076,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":9081,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":9085,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":9089,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":9094,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":9098,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":9102,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":9106,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":9111,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":9115,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":9119,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":9124,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":9128,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":9132,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":9137,"\u002Frelativity":9141,"\u002Fphysical-computing":9144,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":9147,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":9152,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":9156,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":9160,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":9164,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":9169,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":9173,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":9177,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":9182,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":9186,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":9190,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":9194,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":9198,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":9202,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":9207,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":9211,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":9215,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":9219,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":9223,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":9227,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":9232,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":9236,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":9240,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":9244,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":9248,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":9252,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":9256,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":9261,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":9265,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":9269,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":9274,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":9278,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":9282,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":9287,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":9291,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":9296,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":9300,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":9304,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":9308,"\u002Fquantum-mechanics":9312,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":9315,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":9320,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":9324,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":9328,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":9332,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":9337,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":9341,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":9345,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":9349,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":9353,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":9357,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":9362,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":9366,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":9370,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":9374,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":9378,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":9382,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":9386,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":9390,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":9394,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":9398,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":9402,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":9407,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":9411,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":9415,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":9419,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":9424,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":9428,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":9432,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":9435,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":9439,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":9444,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":9448,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":9452,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":9456,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":9461,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":9465,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":9469,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":9473,"\u002Freal-analysis":9477,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":9480,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":9484,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":9488,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":9493,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":9497,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":9501,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":9505,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":9510,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":9514,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":9518,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":9522,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":9526,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":9530,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":9535,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":9539,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":9543,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":9547,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":9552,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":9556,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":9560,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":9564,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":9569,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":9573,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":9577,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":9582,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":9586,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":9590,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":9594,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":9599,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":9603,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":9607,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":9611,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":9616,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":9620,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":9624,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":9629,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":9633,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":9637,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":9641,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":9646,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":9650,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":9654,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":9658,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":9662,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":9667,"\u002Fabstract-algebra":9671,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":9674,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":9679,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":9683,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":9687,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":9691,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":9695,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":9700,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":9704,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":9708,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":9712,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":9716,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":9720,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":9724,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":9729,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":9733,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":9737,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":9741,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":9746,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":9750,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":9754,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":9759,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":9763,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":9767,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":9771,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":9775,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":9779,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":9784,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":9788,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":9792,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":9797,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":9801,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":9805,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":9809,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":9814,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":9818,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":9822,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":9827,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":9831,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":9835,"\u002Fatomic-physics":9839,"\u002Fdatabases":9842,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":9845,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":9849,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":9853,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":9857,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":9861,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":9865,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":9869,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":9874,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":9878,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":9882,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":9887,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":9891,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":9895,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":9900,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":9904,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":9908,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":9912,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":9916,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":9921,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":9925,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":9929,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":9933,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":9938,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":9942,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":9946,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":9950,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":9955,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":9959,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":9963,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":9967,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":9972,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":9976,"\u002Fcategory-theory":9980,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":9983,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":9987,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":9991,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":9995,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":9998,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":10002,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":10006,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":10010,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":10015,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":10019,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":10023,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":10027,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":10031,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":10036,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":10040,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":10044,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":10048,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":10052,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":10057,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":10061,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":10065,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":10069,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":10074,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":10078,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":10082,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":10086,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":10090,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":10094,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":10098,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":10102,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":10106,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":10111,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":10115,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":10119,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":10123,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":10127,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":10132,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":10136,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":10140,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":10144,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":10148,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":10152,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":10156,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":10161,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":10165,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":10169,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":10174,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":10178,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":10182,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":10186,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":10190,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":10194,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":10198,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":10203,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":10207,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":10211,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":10215,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":10219,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":10223,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":10227,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":10231,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":10235,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":10239,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":10243,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":10248,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":10252,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":10256,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":10260,"\u002Fdeep-learning":10264,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":10267,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":10271,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":10275,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":10279,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":10283,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":10287,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":10292,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":10296,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":10300,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":10304,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":10309,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":10313,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":10317,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":10321,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":10326,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":10330,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":10334,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":10338,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":10342,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":10347,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":10351,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":10355,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":10360,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":10364,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":10368,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":10373,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":10377,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":10381,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":10385,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":10390,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":10394,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":10398,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":10402,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":10406,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":10410,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":10415,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":10419,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":10423,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":10427,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":10432,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":10436,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":10440,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":10445,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":10449,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":10453,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":10457,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":10461,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":10466,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":10470,"\u002Fstatistical-mechanics":10474,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":10477,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":10482,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":10486,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":10490,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":10494,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":10499,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":10503,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":10507,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":10511,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":10516,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":10520,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":10524,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":10528,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":10533,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":10537,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":10541,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":10545,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":10550,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":10554,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":10558,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":10562,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":10567,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":10571,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":10575,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":10579,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":10584,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":10588,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":10592,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":10596,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":10600,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":10605,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":10609,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":10614,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":10618,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":10622,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":10626,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":10631,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":10635,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":10639,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":10643,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":10647,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":10652,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":10656,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":10660,"\u002Fcondensed-matter":10664,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":10667,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":10671,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":10676,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":10680,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":10684,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":10688,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":10692,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":10696,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":10700,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":10705,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":10709,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":10713,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":10717,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":10722,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":10726,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":10730,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":10734,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":10739,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":10743,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":10747,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":10751,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":10756,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":10760,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":10764,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":10768,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":10773,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":10777,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":10781,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":10786,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":10790,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":10795,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":10799,"\u002Flogic":10803,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":10806,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":10810,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":10814,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":10818,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":10822,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":10826,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":10830,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":10834,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":10838,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":10842,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":10846,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":10850,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":10854,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":10858,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":10862,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":10866,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":10870,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":10874,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":10878,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":10883,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":10887,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":10891,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":10895,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":10899,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":10903,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":10907,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":10911,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":10914,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":10918,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":10922,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":10926,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":10930,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":10934,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":10938,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":10942,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":10946,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":10950,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":10954,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":10958,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":10962,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":10966,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":10970,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":10974,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":10978,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":10982,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":10986,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":10990,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":10994,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":10998,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":11001,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":11005,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":11009,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":11013,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":11017,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":11021,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":11025,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":11029,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":11032,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":11036,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":11040,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":11041,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":11043,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":11047,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":11052,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":11056,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":11060,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":11064,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":11068,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":11072,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":11076,"\u002Freinforcement-learning":11080,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":11082,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":11086,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":11090,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":11094,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":11098,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":11103,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":11107,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":11111,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":11115,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":11119,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":11123,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":11127,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":11131,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":11135,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":11139,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":11143,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":11147,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":11152,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":11156,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":11160,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":11164,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":11168,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":11172,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":11176,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":11180,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":11184,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":11188,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":11192,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":11196,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":11201,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":11205,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":11209,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":11213,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":11217,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":11221,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":11225,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":11228,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":11232,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":11236,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":11241,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":11245,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":11249,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":11253,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":11256,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":11260,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":11264,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":11268,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":11273,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":11277,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":11281,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":11285,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":11289,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":11293,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":11297,"\u002Fartificial-intelligence":11301,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":11304,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":11309,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":11313,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":11317,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":11321,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":11325,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":11330,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":11334,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":11338,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":11342,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":11347,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":11351,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":11355,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":11359,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":11364,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":11368,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":11373,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":11377,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":11382,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":11386,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":11390,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":11394,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":11399,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":11403,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":11407,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":11412,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":11416,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":11420,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":11425,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":11429,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":11434,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":11438,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":11442,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":11447,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":11451,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":11455,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":11459,"\u002Fnuclear-physics":11463,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":11466,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":11470,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":11474,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":11478,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":11482,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":11486,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":11491,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":11495,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":11499,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":11503,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":11508,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":11512,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":11516,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":11520,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":11524,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":11528,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":11532,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":11535,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":11538,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":11542,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":11546,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":11550,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":11555,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":11559,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":11563,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":11567,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":11571,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":11575,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":11579,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":11583,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":11587,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":11591,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":11595,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":11599,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":11603,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":11607,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":11611,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":11615,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":11619,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":11623,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":11627,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":11631,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":11635,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":11639,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":11643,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":11647,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":11651,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":11655,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":11659,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":11663,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":11668,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":11672,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":11676,"\u002Fnatural-language-processing":11680,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":11683,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":11687,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":11691,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":11695,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":11700,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":11704,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":11708,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":11712,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":11717,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":11721,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":11725,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":11729,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":11734,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":11738,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":11742,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":11746,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":11751,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":11755,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":11759,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":11764,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":11768,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":11772,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":11776,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":11781,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":11785,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":11789,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":11793,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":11798,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":11802,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":11806,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":11810,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":11815,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":11819,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":11823,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":11827,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":11831,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":11836,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":11840,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":11844,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":11849,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":11853,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":11857,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":11861,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":11865,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":11869,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":11873,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":11877,"\u002Fparticle-physics":11881,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":11884,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":11889,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":11893,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":11897,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":11902,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":11906,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":11910,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":11914,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":11919,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":11923,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":11927,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":11931,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":11936,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":11940,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":11944,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":11948,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":11953,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":11957,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":11961,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":11965,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":11970,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":11974,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":11978,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":11983,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":11987,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":11991,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":11995,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":11999,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":12003,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":12007,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":12011,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":12015,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":12020,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":12024,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":12028,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":12032,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":12037,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":12041,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":12045,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":12049,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":12053,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":12058,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":12062,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":12065,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":12069,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":12073,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":12078,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":12082,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":12086,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":12090,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":12094,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":12098,"\u002Fastrophysics-cosmology":12102,"\u002Fcolophon":12105,"\u002F":12108},{"path":7430,"title":7431,"module":7432,"summary":7433},"\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":7435,"title":7436,"module":7432,"summary":7437},"\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":7439,"title":7440,"module":7432,"summary":7441},"\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":7443,"title":7444,"module":7432,"summary":7445},"\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":7447,"title":7448,"module":7432,"summary":7449},"\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":7451,"title":7452,"module":7432,"summary":7453},"\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":7455,"title":7456,"module":7457,"summary":7458},"\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":7460,"title":7461,"module":7457,"summary":7462},"\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":7464,"title":7465,"module":7457,"summary":7466},"\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":7468,"title":7469,"module":7457,"summary":7470},"\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":7472,"title":7473,"module":7474,"summary":7475},"\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":7477,"title":7478,"module":7474,"summary":7479},"\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":7481,"title":7482,"module":7474,"summary":7483},"\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":7485,"title":7486,"module":7474,"summary":7487},"\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":7489,"title":7490,"module":7491,"summary":7492},"\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":7494,"title":7495,"module":7491,"summary":7496},"\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":7498,"title":7499,"module":7491,"summary":7500},"\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":7502,"title":7503,"module":7491,"summary":7504},"\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":7506,"title":7507,"module":7491,"summary":7508},"\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":7510,"title":7511,"module":7491,"summary":7512},"\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":7514,"title":7515,"module":7491,"summary":7516},"\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":7518,"title":7519,"module":7491,"summary":7520},"\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":7522,"title":7523,"module":7491,"summary":7524},"\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":7526,"title":7527,"module":7491,"summary":7528},"\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":7530,"title":7531,"module":7491,"summary":7532},"\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":7534,"title":7535,"module":7491,"summary":7536},"\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":7538,"title":7539,"module":7540,"summary":7541},"\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":7543,"title":7544,"module":7540,"summary":7545},"\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":7547,"title":7548,"module":7540,"summary":7549},"\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":7551,"title":7552,"module":7540,"summary":7553},"\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":7555,"title":7556,"module":7540,"summary":7557},"\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":7559,"title":7560,"module":7540,"summary":7561},"\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":7563,"title":7564,"module":7540,"summary":7565},"\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":7567,"title":7568,"module":7540,"summary":7569},"\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":7571,"title":7572,"module":7573,"summary":7574},"\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":7576,"title":7577,"module":7573,"summary":7578},"\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":7580,"title":7581,"module":7573,"summary":7582},"\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":7584,"title":7585,"module":7573,"summary":7586},"\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":7588,"title":7589,"module":7573,"summary":7590},"\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":7592,"title":7593,"module":7573,"summary":7594},"\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":7596,"title":7597,"module":7573,"summary":7598},"\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":7600,"title":7601,"module":7573,"summary":7602},"\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":7604,"title":7605,"module":7573,"summary":7606},"\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":7608,"title":7609,"module":7573,"summary":7610},"\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":7612,"title":7613,"module":7573,"summary":7614},"\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":7616,"title":7617,"module":7573,"summary":7618},"\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":7620,"title":7621,"module":7573,"summary":7622},"\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":7624,"title":7625,"module":7573,"summary":7626},"\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":7628,"title":7629,"module":7630,"summary":7631},"\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":7633,"title":7634,"module":7630,"summary":7635},"\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":7637,"title":7638,"module":7630,"summary":7639},"\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":7641,"title":7642,"module":7630,"summary":7643},"\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":7645,"title":7646,"module":7630,"summary":7647},"\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":7649,"title":7650,"module":7651,"summary":7652},"\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":7654,"title":7655,"module":7651,"summary":7656},"\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":7658,"title":7659,"module":7651,"summary":7660},"\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":7662,"title":7663,"module":7651,"summary":7664},"\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":7666,"title":7667,"module":7651,"summary":7668},"\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":7670,"title":7671,"module":7651,"summary":7672},"\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":7674,"title":7675,"module":7651,"summary":7676},"\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":7678,"title":7679,"module":7651,"summary":7680},"\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":7682,"title":7683,"module":7651,"summary":7684},"\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":7686,"title":7687,"module":7651,"summary":7688},"\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":7690,"title":7691,"module":7651,"summary":7692},"\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":7694,"title":7695,"module":7696,"summary":7697},"\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":7699,"title":7700,"module":7696,"summary":7701},"\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":7703,"title":7704,"module":7696,"summary":7705},"\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":7707,"title":7708,"module":7696,"summary":7709},"\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":7711,"title":7712,"module":7713,"summary":7714},"\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":7716,"title":7717,"module":7713,"summary":7718},"\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":7720,"title":7721,"module":7713,"summary":7722},"\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":7724,"title":7725,"module":7713,"summary":7726},"\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":7728,"title":7729,"module":7713,"summary":7730},"\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":7732,"title":7733,"module":7713,"summary":7734},"\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":7736,"title":7737,"module":7713,"summary":7738},"\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":7740,"title":7741,"module":7742,"summary":7743},"\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":7745,"title":7746,"module":7742,"summary":7747},"\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":7749,"title":7750,"module":7742,"summary":7751},"\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":7753,"title":7754,"module":7742,"summary":7755},"\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":7757,"title":7758,"module":7759,"summary":7760},"\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":7762,"title":7763,"module":7759,"summary":7764},"\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":7766,"title":7767,"module":7759,"summary":7768},"\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":7770,"title":7771,"module":7759,"summary":7772},"\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":7774,"title":7775,"module":6,"summary":6},"\u002Falgorithms","Algorithms",{"path":7777,"title":7778,"module":7779,"summary":7780},"\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":7782,"title":7783,"module":7779,"summary":7784},"\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":7786,"title":7787,"module":7779,"summary":7788},"\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":7790,"title":7791,"module":7779,"summary":7792},"\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":7794,"title":7795,"module":7796,"summary":7797},"\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":7799,"title":7800,"module":7796,"summary":7801},"\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":7803,"title":7804,"module":7796,"summary":7805},"\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":7807,"title":7808,"module":7796,"summary":7809},"\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":7811,"title":7812,"module":7813,"summary":7814},"\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":7816,"title":7817,"module":7813,"summary":7818},"\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":7820,"title":7821,"module":7813,"summary":7822},"\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":7824,"title":7825,"module":7813,"summary":7826},"\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":7828,"title":7829,"module":7830,"summary":7831},"\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":7833,"title":7834,"module":7830,"summary":7835},"\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":7837,"title":7838,"module":7830,"summary":7839},"\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":7841,"title":7842,"module":7843,"summary":7844},"\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":7846,"title":7847,"module":7843,"summary":7848},"\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":7850,"title":7851,"module":7843,"summary":7852},"\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":7854,"title":7855,"module":7856,"summary":7857},"\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":7859,"title":7860,"module":7856,"summary":7861},"\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":7863,"title":7864,"module":7856,"summary":7865},"\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":7867,"title":7868,"module":7869,"summary":7870},"\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":7872,"title":7873,"module":7869,"summary":7874},"\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":7876,"title":7877,"module":7869,"summary":7878},"\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":7880,"title":7881,"module":7869,"summary":7882},"\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":7884,"title":7885,"module":7886,"summary":7887},"\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":7889,"title":7890,"module":7886,"summary":7891},"\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":7893,"title":7894,"module":7886,"summary":7895},"\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":7897,"title":7898,"module":7899,"summary":7900},"\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":7902,"title":7903,"module":7899,"summary":7904},"\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":7906,"title":7907,"module":7899,"summary":7908},"\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":7910,"title":7911,"module":7899,"summary":7912},"\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":7914,"title":7915,"module":7899,"summary":7916},"\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":7918,"title":7919,"module":7920,"summary":7921},"\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":7923,"title":7924,"module":7920,"summary":7925},"\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":7927,"title":7928,"module":7920,"summary":7929},"\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":7931,"title":7932,"module":7920,"summary":7933},"\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":7935,"title":7936,"module":7920,"summary":7937},"\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":7939,"title":7940,"module":7941,"summary":7942},"\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":7944,"title":7941,"module":7941,"summary":7945},"\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":7947,"title":7948,"module":7941,"summary":7949},"\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":7951,"title":7952,"module":7941,"summary":7953},"\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":7955,"title":7956,"module":7941,"summary":7957},"\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":7959,"title":7960,"module":7961,"summary":7962},"\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":7964,"title":7965,"module":7961,"summary":7966},"\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":7968,"title":7969,"module":7961,"summary":7970},"\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":7972,"title":7973,"module":7961,"summary":7974},"\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":7976,"title":7977,"module":7961,"summary":7978},"\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":7980,"title":7981,"module":7961,"summary":7982},"\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":7984,"title":7985,"module":6,"summary":6},"\u002Fcalculus","Calculus",{"path":7987,"title":7988,"module":7432,"summary":7989},"\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":7991,"title":7992,"module":7432,"summary":7993},"\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":7995,"title":7996,"module":7997,"summary":7998},"\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":8000,"title":8001,"module":7997,"summary":8002},"\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":8004,"title":8005,"module":7997,"summary":8006},"\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":8008,"title":8009,"module":7997,"summary":8010},"\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":8012,"title":8013,"module":7997,"summary":8014},"\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":8016,"title":8017,"module":8018,"summary":8019},"\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":8021,"title":8022,"module":8018,"summary":8023},"\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":8025,"title":8026,"module":8018,"summary":8027},"\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":8029,"title":8030,"module":8018,"summary":8031},"\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":8033,"title":8034,"module":8018,"summary":8035},"\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":8037,"title":8038,"module":8039,"summary":8040},"\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":8042,"title":8043,"module":8039,"summary":8044},"\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":8046,"title":8047,"module":8039,"summary":8048},"\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":8050,"title":8051,"module":8039,"summary":8052},"\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":8054,"title":8055,"module":8039,"summary":8056},"\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":8058,"title":8059,"module":8060,"summary":8061},"\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":8063,"title":8064,"module":8060,"summary":8065},"\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":8067,"title":8068,"module":8060,"summary":8069},"\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":8071,"title":8072,"module":8073,"summary":8074},"\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":8076,"title":8077,"module":8073,"summary":8078},"\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":8080,"title":8081,"module":8073,"summary":8082},"\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":8084,"title":8085,"module":8073,"summary":8086},"\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":8088,"title":8089,"module":8073,"summary":8090},"\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":8092,"title":8093,"module":8073,"summary":8094},"\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":8096,"title":8097,"module":8098,"summary":8099},"\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":8101,"title":8102,"module":8098,"summary":8103},"\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":8105,"title":8106,"module":8098,"summary":8107},"\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":8109,"title":8110,"module":8098,"summary":8111},"\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":8113,"title":8114,"module":8098,"summary":8115},"\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":8117,"title":8118,"module":8098,"summary":8119},"\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":8121,"title":8122,"module":8098,"summary":8123},"\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":8125,"title":8126,"module":8127,"summary":8128},"\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":8130,"title":8131,"module":8127,"summary":8132},"\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":8134,"title":8135,"module":8127,"summary":8136},"\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":8138,"title":8139,"module":8127,"summary":8140},"\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":8142,"title":8143,"module":8127,"summary":8144},"\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":8146,"title":8147,"module":8127,"summary":8148},"\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":8150,"title":8151,"module":8127,"summary":8152},"\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":8154,"title":8155,"module":8127,"summary":8156},"\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":8158,"title":8159,"module":8127,"summary":8160},"\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":8162,"title":8163,"module":8127,"summary":8164},"\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":8166,"title":8167,"module":8127,"summary":8168},"\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":8170,"title":8171,"module":8127,"summary":8172},"\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":8174,"title":8175,"module":8176,"summary":8177},"\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":8179,"title":8180,"module":8176,"summary":8181},"\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":8183,"title":8184,"module":8176,"summary":8185},"\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":8187,"title":8188,"module":8176,"summary":8189},"\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":8191,"title":8192,"module":8176,"summary":8193},"\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":8195,"title":8196,"module":8176,"summary":8197},"\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":8199,"title":8200,"module":6,"summary":6},"\u002Fmechanics","Mechanics & Dynamics",{"path":8202,"title":8203,"module":8204,"summary":8205},"\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":8207,"title":8208,"module":8204,"summary":8209},"\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":8211,"title":8212,"module":8204,"summary":8213},"\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":8215,"title":8216,"module":8204,"summary":8217},"\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":8219,"title":8220,"module":8204,"summary":8221},"\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":8223,"title":8224,"module":8225,"summary":8226},"\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":8228,"title":8229,"module":8225,"summary":8230},"\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":8232,"title":8233,"module":8234,"summary":8235},"\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":8237,"title":8238,"module":8234,"summary":8239},"\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":8241,"title":8242,"module":8234,"summary":8243},"\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":8245,"title":8246,"module":8234,"summary":8247},"\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":8249,"title":8250,"module":8234,"summary":8251},"\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":8253,"title":8254,"module":8255,"summary":8256},"\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":8258,"title":8259,"module":8255,"summary":8260},"\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":8262,"title":8263,"module":8255,"summary":8264},"\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":8266,"title":8267,"module":8255,"summary":8268},"\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":8270,"title":8271,"module":8272,"summary":8273},"\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":8275,"title":8276,"module":8272,"summary":8277},"\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":8279,"title":8280,"module":8272,"summary":8281},"\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":8283,"title":8284,"module":8285,"summary":8286},"\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":8288,"title":8289,"module":8285,"summary":8290},"\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":8292,"title":8293,"module":8285,"summary":8294},"\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":8296,"title":8297,"module":8285,"summary":8298},"\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":8300,"title":8301,"module":8285,"summary":8302},"\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":8304,"title":8305,"module":8306,"summary":8307},"\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":8309,"title":8310,"module":8306,"summary":8311},"\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":8313,"title":8314,"module":8306,"summary":8315},"\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":8317,"title":8318,"module":8306,"summary":8319},"\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":8321,"title":8322,"module":8306,"summary":8323},"\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":8325,"title":8326,"module":8306,"summary":8327},"\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":8329,"title":8330,"module":8331,"summary":8332},"\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":8334,"title":8335,"module":8331,"summary":8336},"\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":8338,"title":8339,"module":8331,"summary":8340},"\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":8342,"title":8343,"module":8331,"summary":8344},"\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":8346,"title":8347,"module":8331,"summary":8348},"\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":8350,"title":8351,"module":8331,"summary":8352},"\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":8354,"title":8355,"module":8331,"summary":8356},"\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":8358,"title":8359,"module":8331,"summary":8360},"\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":8362,"title":8363,"module":8364,"summary":8365},"\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":8367,"title":8368,"module":8364,"summary":8369},"\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":8371,"title":8372,"module":8364,"summary":8373},"\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":8375,"title":8376,"module":8364,"summary":8377},"\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":8379,"title":8380,"module":8364,"summary":8381},"\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":8383,"title":8384,"module":8385,"summary":8386},"\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":8388,"title":8389,"module":8385,"summary":8390},"\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":8392,"title":8393,"module":8385,"summary":8394},"\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":8396,"title":8397,"module":8385,"summary":8398},"\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":8400,"title":8401,"module":8385,"summary":8402},"\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":8404,"title":8405,"module":8406,"summary":8407},"\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":8409,"title":8410,"module":8406,"summary":8411},"\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":8413,"title":8414,"module":8406,"summary":8415},"\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":8417,"title":8418,"module":6,"summary":6},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":8420,"title":8421,"module":8422,"summary":8423},"\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":8425,"title":8426,"module":8422,"summary":8427},"\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":8429,"title":8430,"module":8422,"summary":8431},"\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":8433,"title":8434,"module":8422,"summary":8435},"\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":8437,"title":8438,"module":8422,"summary":8439},"\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":8441,"title":8442,"module":8443,"summary":8444},"\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":8446,"title":8447,"module":8443,"summary":8448},"\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":8450,"title":8451,"module":8443,"summary":8452},"\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":8454,"title":8455,"module":8443,"summary":8456},"\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":8458,"title":8459,"module":8443,"summary":8460},"\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":8462,"title":8463,"module":8464,"summary":8465},"\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":8467,"title":8468,"module":8464,"summary":8469},"\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":8471,"title":8472,"module":8464,"summary":8473},"\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":8475,"title":8476,"module":8477,"summary":8478},"\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":8480,"title":8481,"module":8477,"summary":8482},"\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":8484,"title":8485,"module":8477,"summary":8486},"\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":8488,"title":8489,"module":8477,"summary":8490},"\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":8492,"title":8493,"module":8477,"summary":8494},"\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":8496,"title":8497,"module":8477,"summary":8498},"\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":8500,"title":8501,"module":8477,"summary":8502},"\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":8504,"title":8505,"module":8506,"summary":8507},"\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":8509,"title":8510,"module":8506,"summary":8511},"\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":8513,"title":8514,"module":8506,"summary":8515},"\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":8517,"title":8518,"module":8506,"summary":8519},"\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":8521,"title":8522,"module":8506,"summary":8523},"\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":8525,"title":8526,"module":8506,"summary":8527},"\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":8529,"title":8530,"module":8506,"summary":8531},"\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":8533,"title":8534,"module":8535,"summary":8536},"\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":8538,"title":8539,"module":8535,"summary":8540},"\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":8542,"title":8543,"module":8535,"summary":8544},"\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":8546,"title":8547,"module":8535,"summary":8548},"\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":8550,"title":8551,"module":8535,"summary":8552},"\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":8554,"title":8555,"module":8535,"summary":8556},"\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":8558,"title":8559,"module":8560,"summary":8561},"\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":8563,"title":8564,"module":8560,"summary":8565},"\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":8567,"title":8568,"module":8560,"summary":8569},"\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":8571,"title":8572,"module":8560,"summary":8573},"\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":8575,"title":8576,"module":8560,"summary":8577},"\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":8579,"title":8580,"module":8581,"summary":8582},"\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":8584,"title":8585,"module":8581,"summary":8586},"\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":8588,"title":8589,"module":8581,"summary":8590},"\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":8592,"title":8593,"module":8581,"summary":8594},"\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":8596,"title":8597,"module":8581,"summary":8598},"\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":8600,"title":8601,"module":8581,"summary":8602},"\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":8604,"title":8605,"module":8606,"summary":8607},"\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":8609,"title":8610,"module":8606,"summary":8611},"\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":8613,"title":8614,"module":8606,"summary":8615},"\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":8617,"title":8618,"module":8606,"summary":8619},"\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":8621,"title":8622,"module":8606,"summary":8623},"\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":8625,"title":8626,"module":6,"summary":6},"\u002Flinear-algebra","Linear Algebra",{"path":8628,"title":8629,"module":6,"summary":6},"\u002Ftheory-of-computation","Theory of Computation",{"path":8631,"title":8632,"module":7432,"summary":8633},"\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":8635,"title":8636,"module":7432,"summary":8637},"\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":8639,"title":8640,"module":7432,"summary":8641},"\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":8643,"title":8644,"module":7432,"summary":8645},"\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":8647,"title":8648,"module":7432,"summary":8649},"\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":8651,"title":8652,"module":8653,"summary":8654},"\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":8656,"title":8657,"module":8653,"summary":8658},"\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":8660,"title":8661,"module":8653,"summary":8662},"\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":8664,"title":8665,"module":8653,"summary":8666},"\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":8668,"title":8669,"module":8653,"summary":8670},"\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":8672,"title":8673,"module":8653,"summary":8674},"\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":8676,"title":8677,"module":8653,"summary":8678},"\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":8680,"title":8681,"module":8682,"summary":8683},"\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":8685,"title":8686,"module":8682,"summary":8687},"\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":8689,"title":8690,"module":8682,"summary":8691},"\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":8693,"title":8694,"module":8682,"summary":8695},"\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":8697,"title":8698,"module":8682,"summary":8699},"\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":8701,"title":8702,"module":8703,"summary":8704},"\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":8706,"title":8707,"module":8703,"summary":8708},"\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":8710,"title":8711,"module":8703,"summary":8712},"\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":8714,"title":8715,"module":8703,"summary":8716},"\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":8718,"title":8719,"module":8703,"summary":8720},"\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":8722,"title":8723,"module":8724,"summary":8725},"\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":8727,"title":8728,"module":8724,"summary":8729},"\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":8731,"title":8732,"module":8724,"summary":8733},"\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":8735,"title":8736,"module":8724,"summary":8737},"\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":8739,"title":8740,"module":8724,"summary":8741},"\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":8743,"title":8744,"module":8745,"summary":8746},"\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":8748,"title":8749,"module":8745,"summary":8750},"\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":8752,"title":8753,"module":8745,"summary":8754},"\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":8756,"title":8757,"module":8745,"summary":8758},"\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":8760,"title":8761,"module":8745,"summary":8762},"\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":8764,"title":8765,"module":8766,"summary":8767},"\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":8769,"title":8770,"module":8766,"summary":8771},"\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":8773,"title":8774,"module":8766,"summary":8775},"\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":8777,"title":8778,"module":8766,"summary":8779},"\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":8781,"title":8782,"module":8766,"summary":8783},"\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":8785,"title":8786,"module":8787,"summary":8788},"\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":8790,"title":8791,"module":8787,"summary":8792},"\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":8794,"title":8795,"module":8787,"summary":8796},"\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":8798,"title":8799,"module":8800,"summary":8801},"\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":8803,"title":8804,"module":8800,"summary":8805},"\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":8807,"title":8808,"module":8809,"summary":8810},"\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":8812,"title":8813,"module":8809,"summary":8814},"\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":8816,"title":8817,"module":8809,"summary":8818},"\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":8820,"title":8821,"module":8809,"summary":8822},"\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":8824,"title":8825,"module":8809,"summary":8826},"\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":8828,"title":8829,"module":8830,"summary":8831},"\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":8833,"title":8834,"module":8830,"summary":8835},"\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":8837,"title":8838,"module":6,"summary":6},"\u002Fcomputer-architecture","Computer Architecture",{"path":8840,"title":8841,"module":7432,"summary":8842},"\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":8844,"title":8845,"module":7432,"summary":8846},"\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":8848,"title":8849,"module":8850,"summary":8851},"\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":8853,"title":8854,"module":8850,"summary":8855},"\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":8857,"title":8858,"module":8850,"summary":8859},"\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":8861,"title":8862,"module":8850,"summary":8863},"\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":8865,"title":8866,"module":8850,"summary":8867},"\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":8869,"title":8870,"module":8850,"summary":8871},"\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":8873,"title":8874,"module":8875,"summary":8876},"\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":8878,"title":8879,"module":8875,"summary":8880},"\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":8882,"title":8883,"module":8875,"summary":8884},"\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":8886,"title":8887,"module":8875,"summary":8888},"\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":8890,"title":8891,"module":8875,"summary":8892},"\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":8894,"title":8895,"module":8875,"summary":8896},"\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":8898,"title":8899,"module":8900,"summary":8901},"\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":8903,"title":8904,"module":8900,"summary":8905},"\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":8907,"title":8908,"module":8900,"summary":8909},"\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":8911,"title":8912,"module":8913,"summary":8914},"\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":8916,"title":8917,"module":8913,"summary":8918},"\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":8920,"title":8921,"module":8922,"summary":8923},"\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":8925,"title":8926,"module":8922,"summary":8927},"\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":8929,"title":8930,"module":8922,"summary":8931},"\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":8933,"title":8934,"module":8935,"summary":8936},"\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":8938,"title":8939,"module":8935,"summary":8940},"\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":8942,"title":8943,"module":8944,"summary":8945},"\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":8947,"title":8948,"module":8944,"summary":8949},"\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":8951,"title":8952,"module":8944,"summary":8953},"\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":8955,"title":8956,"module":8957,"summary":8958},"\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":8960,"title":8961,"module":8957,"summary":8962},"\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":8964,"title":8965,"module":8957,"summary":8966},"\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":8968,"title":8969,"module":8970,"summary":8971},"\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":8973,"title":8974,"module":8970,"summary":8975},"\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":8977,"title":8978,"module":6,"summary":6},"\u002Fdifferential-equations","Differential Equations",{"path":8980,"title":8981,"module":8982,"summary":8983},"\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":8985,"title":8986,"module":8982,"summary":8987},"\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":8989,"title":8990,"module":8982,"summary":8991},"\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":8993,"title":8994,"module":8982,"summary":8995},"\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":8997,"title":8998,"module":8982,"summary":8999},"\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":9001,"title":9002,"module":9003,"summary":9004},"\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":9006,"title":9007,"module":9003,"summary":9008},"\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":9010,"title":9011,"module":9003,"summary":9012},"\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":9014,"title":9015,"module":9003,"summary":9016},"\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":9018,"title":9019,"module":9020,"summary":9021},"\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":9023,"title":9024,"module":9020,"summary":9025},"\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":9027,"title":9028,"module":9020,"summary":9029},"\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":9031,"title":9032,"module":9020,"summary":9033},"\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":9035,"title":9036,"module":9037,"summary":9038},"\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":9040,"title":9041,"module":9037,"summary":9042},"\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":9044,"title":9045,"module":9037,"summary":9046},"\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":9048,"title":9049,"module":9037,"summary":9050},"\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":9052,"title":9053,"module":9054,"summary":9055},"\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":9057,"title":9058,"module":9054,"summary":9059},"\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":9061,"title":9062,"module":9054,"summary":9063},"\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":9065,"title":9066,"module":9054,"summary":9067},"\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":9069,"title":9070,"module":9054,"summary":9071},"\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":9073,"title":9074,"module":9054,"summary":9075},"\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":9077,"title":9078,"module":9079,"summary":9080},"\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":9082,"title":9083,"module":9079,"summary":9084},"\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":9086,"title":9087,"module":9079,"summary":9088},"\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":9090,"title":9091,"module":9092,"summary":9093},"\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":9095,"title":9096,"module":9092,"summary":9097},"\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":9099,"title":9100,"module":9092,"summary":9101},"\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":9103,"title":9104,"module":9092,"summary":9105},"\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":9107,"title":9108,"module":9109,"summary":9110},"\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":9112,"title":9113,"module":9109,"summary":9114},"\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":9116,"title":9117,"module":9109,"summary":9118},"\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":9120,"title":9121,"module":9122,"summary":9123},"\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":9125,"title":9126,"module":9122,"summary":9127},"\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":9129,"title":9130,"module":9122,"summary":9131},"\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":9133,"title":9134,"module":9135,"summary":9136},"\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":9138,"title":9139,"module":9135,"summary":9140},"\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":9142,"title":9143,"module":6,"summary":6},"\u002Frelativity","Relativity",{"path":9145,"title":9146,"module":6,"summary":6},"\u002Fphysical-computing","Physical Computing",{"path":9148,"title":9149,"module":9150,"summary":9151},"\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":9153,"title":9154,"module":9150,"summary":9155},"\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":9157,"title":9158,"module":9150,"summary":9159},"\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":9161,"title":9162,"module":9150,"summary":9163},"\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":9165,"title":9166,"module":9167,"summary":9168},"\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":9170,"title":9171,"module":9167,"summary":9172},"\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":9174,"title":9175,"module":9167,"summary":9176},"\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":9178,"title":9179,"module":9180,"summary":9181},"\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":9183,"title":9184,"module":9180,"summary":9185},"\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":9187,"title":9188,"module":9180,"summary":9189},"\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":9191,"title":9192,"module":9180,"summary":9193},"\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":9195,"title":9196,"module":9180,"summary":9197},"\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":9199,"title":9200,"module":9180,"summary":9201},"\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":9203,"title":9204,"module":9205,"summary":9206},"\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":9208,"title":9209,"module":9205,"summary":9210},"\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":9212,"title":9213,"module":9205,"summary":9214},"\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":9216,"title":9217,"module":9205,"summary":9218},"\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":9220,"title":9221,"module":9205,"summary":9222},"\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":9224,"title":9225,"module":9205,"summary":9226},"\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":9228,"title":9229,"module":9230,"summary":9231},"\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":9233,"title":9234,"module":9230,"summary":9235},"\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":9237,"title":9238,"module":9230,"summary":9239},"\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":9241,"title":9242,"module":9230,"summary":9243},"\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":9245,"title":9246,"module":8085,"summary":9247},"\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":9249,"title":9250,"module":8085,"summary":9251},"\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":9253,"title":9254,"module":8085,"summary":9255},"\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":9257,"title":9258,"module":9259,"summary":9260},"\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":9262,"title":9263,"module":9259,"summary":9264},"\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":9266,"title":9267,"module":9259,"summary":9268},"\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":9270,"title":9271,"module":9272,"summary":9273},"\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":9275,"title":9276,"module":9272,"summary":9277},"\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":9279,"title":9280,"module":9272,"summary":9281},"\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":9283,"title":9284,"module":9285,"summary":9286},"\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":9288,"title":9289,"module":9285,"summary":9290},"\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":9292,"title":9293,"module":9294,"summary":9295},"\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":9297,"title":9298,"module":9294,"summary":9299},"\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":9301,"title":9302,"module":9294,"summary":9303},"\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":9305,"title":9306,"module":9294,"summary":9307},"\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":9309,"title":9310,"module":9294,"summary":9311},"\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":9313,"title":9314,"module":6,"summary":6},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":9316,"title":9317,"module":9318,"summary":9319},"\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":9321,"title":9322,"module":9318,"summary":9323},"\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":9325,"title":9326,"module":9318,"summary":9327},"\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":9329,"title":9330,"module":9318,"summary":9331},"\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":9333,"title":9334,"module":9335,"summary":9336},"\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":9338,"title":9339,"module":9335,"summary":9340},"\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":9342,"title":9343,"module":9335,"summary":9344},"\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":9346,"title":9347,"module":9335,"summary":9348},"\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":9350,"title":9351,"module":9335,"summary":9352},"\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":9354,"title":9355,"module":9335,"summary":9356},"\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":9358,"title":9359,"module":9360,"summary":9361},"\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":9363,"title":9364,"module":9360,"summary":9365},"\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":9367,"title":9368,"module":9360,"summary":9369},"\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":9371,"title":9372,"module":9360,"summary":9373},"\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":9375,"title":9376,"module":9360,"summary":9377},"\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":9379,"title":9380,"module":7779,"summary":9381},"\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":9383,"title":9384,"module":7779,"summary":9385},"\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":9387,"title":9388,"module":7779,"summary":9389},"\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":9391,"title":9392,"module":7779,"summary":9393},"\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":9395,"title":9396,"module":7779,"summary":9397},"\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":9399,"title":9400,"module":7779,"summary":9401},"\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":9403,"title":9404,"module":9405,"summary":9406},"\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":9408,"title":9409,"module":9405,"summary":9410},"\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":9412,"title":9413,"module":9405,"summary":9414},"\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":9416,"title":9417,"module":9405,"summary":9418},"\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":9420,"title":9421,"module":9422,"summary":9423},"\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":9425,"title":9426,"module":9422,"summary":9427},"\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":9429,"title":9430,"module":9422,"summary":9431},"\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":9433,"title":7834,"module":9422,"summary":9434},"\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":9436,"title":9437,"module":9422,"summary":9438},"\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":9440,"title":9441,"module":9442,"summary":9443},"\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":9445,"title":9446,"module":9442,"summary":9447},"\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":9449,"title":9450,"module":9442,"summary":9451},"\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":9453,"title":9454,"module":9442,"summary":9455},"\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":9457,"title":9458,"module":9459,"summary":9460},"\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":9462,"title":9463,"module":9459,"summary":9464},"\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":9466,"title":9467,"module":9459,"summary":9468},"\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":9470,"title":9471,"module":9459,"summary":9472},"\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":9474,"title":9475,"module":9459,"summary":9476},"\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":9478,"title":9479,"module":6,"summary":6},"\u002Freal-analysis","Real Analysis",{"path":9481,"title":9482,"module":7432,"summary":9483},"\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":9485,"title":9486,"module":7432,"summary":9487},"\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":9489,"title":9490,"module":9491,"summary":9492},"\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":9494,"title":9495,"module":9491,"summary":9496},"\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":9498,"title":9499,"module":9491,"summary":9500},"\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":9502,"title":9503,"module":9491,"summary":9504},"\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":9506,"title":9507,"module":9508,"summary":9509},"\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":9511,"title":9512,"module":9508,"summary":9513},"\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":9515,"title":9516,"module":9508,"summary":9517},"\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":9519,"title":9520,"module":9508,"summary":9521},"\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":9523,"title":9524,"module":9508,"summary":9525},"\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":9527,"title":9528,"module":9508,"summary":9529},"\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":9531,"title":9532,"module":9533,"summary":9534},"\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":9536,"title":9537,"module":9533,"summary":9538},"\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":9540,"title":9541,"module":9533,"summary":9542},"\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":9544,"title":9545,"module":9533,"summary":9546},"\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":9548,"title":9549,"module":9550,"summary":9551},"\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":9553,"title":9554,"module":9550,"summary":9555},"\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":9557,"title":9558,"module":9550,"summary":9559},"\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":9561,"title":9562,"module":9550,"summary":9563},"\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":9565,"title":9566,"module":9567,"summary":9568},"\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":9570,"title":9571,"module":9567,"summary":9572},"\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":9574,"title":9575,"module":9567,"summary":9576},"\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":9578,"title":9579,"module":9580,"summary":9581},"\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":9583,"title":9584,"module":9580,"summary":9585},"\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":9587,"title":9588,"module":9580,"summary":9589},"\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":9591,"title":9592,"module":9580,"summary":9593},"\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":9595,"title":9596,"module":9597,"summary":9598},"\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":9600,"title":9601,"module":9597,"summary":9602},"\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":9604,"title":9605,"module":9597,"summary":9606},"\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":9608,"title":9609,"module":9597,"summary":9610},"\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":9612,"title":9613,"module":9614,"summary":9615},"\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":9617,"title":9618,"module":9614,"summary":9619},"\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":9621,"title":9622,"module":9614,"summary":9623},"\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":9625,"title":9626,"module":9627,"summary":9628},"\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":9630,"title":9631,"module":9627,"summary":9632},"\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":9634,"title":9635,"module":9627,"summary":9636},"\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":9638,"title":9639,"module":9627,"summary":9640},"\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":9642,"title":9643,"module":9644,"summary":9645},"\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":9647,"title":9648,"module":9644,"summary":9649},"\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":9651,"title":9652,"module":9644,"summary":9653},"\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":9655,"title":9656,"module":9644,"summary":9657},"\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":9659,"title":9660,"module":9644,"summary":9661},"\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":9663,"title":9664,"module":9665,"summary":9666},"\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":9668,"title":9669,"module":9665,"summary":9670},"\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":9672,"title":9673,"module":6,"summary":6},"\u002Fabstract-algebra","Abstract Algebra",{"path":9675,"title":9676,"module":9677,"summary":9678},"\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":9680,"title":9681,"module":9677,"summary":9682},"\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":9684,"title":9685,"module":9677,"summary":9686},"\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":9688,"title":9689,"module":9677,"summary":9690},"\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":9692,"title":9693,"module":9677,"summary":9694},"\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":9696,"title":9697,"module":9698,"summary":9699},"\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":9701,"title":9702,"module":9698,"summary":9703},"\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":9705,"title":9706,"module":9698,"summary":9707},"\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":9709,"title":9710,"module":9698,"summary":9711},"\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":9713,"title":9714,"module":9698,"summary":9715},"\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":9717,"title":9718,"module":9698,"summary":9719},"\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":9721,"title":9722,"module":9698,"summary":9723},"\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":9725,"title":9726,"module":9727,"summary":9728},"\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":9730,"title":9731,"module":9727,"summary":9732},"\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":9734,"title":9735,"module":9727,"summary":9736},"\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":9738,"title":9739,"module":9727,"summary":9740},"\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":9742,"title":9743,"module":9744,"summary":9745},"\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":9747,"title":9748,"module":9744,"summary":9749},"\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":9751,"title":9752,"module":9744,"summary":9753},"\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":9755,"title":9756,"module":9757,"summary":9758},"\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":9760,"title":9761,"module":9757,"summary":9762},"\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":9764,"title":9765,"module":9757,"summary":9766},"\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":9768,"title":9769,"module":9757,"summary":9770},"\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":9772,"title":9773,"module":9757,"summary":9774},"\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":9776,"title":9777,"module":9757,"summary":9778},"\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":9780,"title":9781,"module":9782,"summary":9783},"\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":9785,"title":9786,"module":9782,"summary":9787},"\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":9789,"title":9790,"module":9782,"summary":9791},"\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":9793,"title":9794,"module":9795,"summary":9796},"\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":9798,"title":9799,"module":9795,"summary":9800},"\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":9802,"title":9803,"module":9795,"summary":9804},"\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":9806,"title":9807,"module":9795,"summary":9808},"\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":9810,"title":9811,"module":9812,"summary":9813},"\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":9815,"title":9816,"module":9812,"summary":9817},"\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":9819,"title":9820,"module":9812,"summary":9821},"\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":9823,"title":9824,"module":9825,"summary":9826},"\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":9828,"title":9829,"module":9825,"summary":9830},"\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":9832,"title":9833,"module":9825,"summary":9834},"\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":9836,"title":9837,"module":9825,"summary":9838},"\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":9840,"title":9841,"module":6,"summary":6},"\u002Fatomic-physics","Atomic Physics",{"path":9843,"title":9844,"module":6,"summary":6},"\u002Fdatabases","Databases",{"path":9846,"title":9847,"module":7432,"summary":9848},"\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":9850,"title":9851,"module":7432,"summary":9852},"\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":9854,"title":9855,"module":7432,"summary":9856},"\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":9858,"title":9859,"module":7432,"summary":9860},"\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":9862,"title":9863,"module":7432,"summary":9864},"\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":9866,"title":9867,"module":7432,"summary":9868},"\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":9870,"title":9871,"module":9872,"summary":9873},"\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":9875,"title":9876,"module":9872,"summary":9877},"\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":9879,"title":9880,"module":9872,"summary":9881},"\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":9883,"title":9884,"module":9885,"summary":9886},"\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":9888,"title":9889,"module":9885,"summary":9890},"\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":9892,"title":9893,"module":9885,"summary":9894},"\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":9896,"title":9897,"module":9898,"summary":9899},"\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":9901,"title":9902,"module":9898,"summary":9903},"\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":9905,"title":9906,"module":9898,"summary":9907},"\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":9909,"title":9910,"module":9898,"summary":9911},"\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":9913,"title":9914,"module":9898,"summary":9915},"\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":9917,"title":9918,"module":9919,"summary":9920},"\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":9922,"title":9923,"module":9919,"summary":9924},"\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":9926,"title":9927,"module":9919,"summary":9928},"\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":9930,"title":9931,"module":9919,"summary":9932},"\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":9934,"title":9935,"module":9936,"summary":9937},"\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":9939,"title":9940,"module":9936,"summary":9941},"\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":9943,"title":9944,"module":9936,"summary":9945},"\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":9947,"title":9948,"module":9936,"summary":9949},"\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":9951,"title":9952,"module":9953,"summary":9954},"\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":9956,"title":9957,"module":9953,"summary":9958},"\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":9960,"title":9961,"module":9953,"summary":9962},"\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":9964,"title":9965,"module":9953,"summary":9966},"\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":9968,"title":9969,"module":9970,"summary":9971},"\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":9973,"title":9974,"module":9970,"summary":9975},"\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":9977,"title":9978,"module":9970,"summary":9979},"\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":9981,"title":9982,"module":6,"summary":6},"\u002Fcategory-theory","Category Theory",{"path":9984,"title":8626,"module":9985,"summary":9986},"\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":9988,"title":9989,"module":9985,"summary":9990},"\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":9992,"title":9993,"module":9985,"summary":9994},"\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":9996,"title":7985,"module":9985,"summary":9997},"\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":9999,"title":10000,"module":7432,"summary":10001},"\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":10003,"title":10004,"module":7432,"summary":10005},"\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":10007,"title":10008,"module":7432,"summary":10009},"\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":10011,"title":10012,"module":10013,"summary":10014},"\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":10016,"title":10017,"module":10013,"summary":10018},"\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":10020,"title":10021,"module":10013,"summary":10022},"\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":10024,"title":10025,"module":10013,"summary":10026},"\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":10028,"title":10029,"module":10013,"summary":10030},"\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":10032,"title":10033,"module":10034,"summary":10035},"\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":10037,"title":10038,"module":10034,"summary":10039},"\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":10041,"title":10042,"module":10034,"summary":10043},"\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":10045,"title":10046,"module":10034,"summary":10047},"\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":10049,"title":10050,"module":10034,"summary":10051},"\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":10053,"title":10054,"module":10055,"summary":10056},"\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":10058,"title":10059,"module":10055,"summary":10060},"\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":10062,"title":10063,"module":10055,"summary":10064},"\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":10066,"title":10067,"module":10055,"summary":10068},"\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":10070,"title":10071,"module":10072,"summary":10073},"\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":10075,"title":10076,"module":10072,"summary":10077},"\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":10079,"title":10080,"module":10072,"summary":10081},"\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":10083,"title":10084,"module":10072,"summary":10085},"\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":10087,"title":10088,"module":10072,"summary":10089},"\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":10091,"title":10092,"module":10072,"summary":10093},"\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":10095,"title":10096,"module":10072,"summary":10097},"\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":10099,"title":10100,"module":10072,"summary":10101},"\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":10103,"title":10104,"module":10072,"summary":10105},"\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":10107,"title":10108,"module":10109,"summary":10110},"\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":10112,"title":10113,"module":10109,"summary":10114},"\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":10116,"title":10117,"module":10109,"summary":10118},"\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":10120,"title":10121,"module":10109,"summary":10122},"\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":10124,"title":10125,"module":10109,"summary":10126},"\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":10128,"title":10129,"module":10130,"summary":10131},"\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":10133,"title":10134,"module":10130,"summary":10135},"\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":10137,"title":10138,"module":10130,"summary":10139},"\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":10141,"title":10142,"module":10130,"summary":10143},"\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":10145,"title":10146,"module":10130,"summary":10147},"\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":10149,"title":10150,"module":10130,"summary":10151},"\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":10153,"title":10154,"module":10130,"summary":10155},"\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":10157,"title":10158,"module":10159,"summary":10160},"\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":10162,"title":10163,"module":10159,"summary":10164},"\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":10166,"title":10167,"module":10159,"summary":10168},"\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":10170,"title":10171,"module":10172,"summary":10173},"\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":10175,"title":10176,"module":10172,"summary":10177},"\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":10179,"title":10180,"module":10172,"summary":10181},"\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":10183,"title":10184,"module":10172,"summary":10185},"\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":10187,"title":10188,"module":10172,"summary":10189},"\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":10191,"title":10192,"module":10172,"summary":10193},"\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":10195,"title":10196,"module":10172,"summary":10197},"\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":10199,"title":10200,"module":10201,"summary":10202},"\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":10204,"title":10205,"module":10201,"summary":10206},"\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":10208,"title":10209,"module":10201,"summary":10210},"\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":10212,"title":10213,"module":10201,"summary":10214},"\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":10216,"title":10217,"module":10201,"summary":10218},"\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":10220,"title":10221,"module":10201,"summary":10222},"\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":10224,"title":10225,"module":10201,"summary":10226},"\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":10228,"title":10229,"module":10201,"summary":10230},"\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":10232,"title":10233,"module":10201,"summary":10234},"\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":10236,"title":10237,"module":10201,"summary":10238},"\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":10240,"title":10241,"module":10201,"summary":10242},"\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":10244,"title":10245,"module":10246,"summary":10247},"\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":10249,"title":10250,"module":10246,"summary":10251},"\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":10253,"title":10254,"module":10246,"summary":10255},"\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":10257,"title":10258,"module":10246,"summary":10259},"\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":10261,"title":10262,"module":10246,"summary":10263},"\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":10265,"title":10266,"module":6,"summary":6},"\u002Fdeep-learning","Deep Learning",{"path":10268,"title":10269,"module":8176,"summary":10270},"\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":10272,"title":10273,"module":8176,"summary":10274},"\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":10276,"title":10277,"module":8176,"summary":10278},"\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":10280,"title":10281,"module":8176,"summary":10282},"\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":10284,"title":10285,"module":8176,"summary":10286},"\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":10288,"title":10289,"module":10290,"summary":10291},"\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":10293,"title":10294,"module":10290,"summary":10295},"\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":10297,"title":10298,"module":10290,"summary":10299},"\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":10301,"title":10302,"module":10290,"summary":10303},"\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":10305,"title":10306,"module":10307,"summary":10308},"\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":10310,"title":10311,"module":10307,"summary":10312},"\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":10314,"title":10315,"module":10307,"summary":10316},"\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":10318,"title":10319,"module":10307,"summary":10320},"\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":10322,"title":10323,"module":10324,"summary":10325},"\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":10327,"title":10328,"module":10324,"summary":10329},"\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":10331,"title":10332,"module":10324,"summary":10333},"\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":10335,"title":10336,"module":10324,"summary":10337},"\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":10339,"title":10340,"module":10324,"summary":10341},"\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":10343,"title":10344,"module":10345,"summary":10346},"\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":10348,"title":10349,"module":10345,"summary":10350},"\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":10352,"title":10353,"module":10345,"summary":10354},"\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":10356,"title":10357,"module":10358,"summary":10359},"\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":10361,"title":10362,"module":10358,"summary":10363},"\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":10365,"title":10366,"module":10358,"summary":10367},"\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":10369,"title":10370,"module":10371,"summary":10372},"\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":10374,"title":10375,"module":10371,"summary":10376},"\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":10378,"title":10379,"module":10371,"summary":10380},"\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":10382,"title":10383,"module":10371,"summary":10384},"\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":10386,"title":10387,"module":10388,"summary":10389},"\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":10391,"title":10392,"module":10388,"summary":10393},"\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":10395,"title":10396,"module":10388,"summary":10397},"\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":10399,"title":10400,"module":10388,"summary":10401},"\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":10403,"title":10404,"module":10388,"summary":10405},"\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":10407,"title":10408,"module":10388,"summary":10409},"\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":10411,"title":10412,"module":10413,"summary":10414},"\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":10416,"title":10417,"module":10413,"summary":10418},"\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":10420,"title":10421,"module":10413,"summary":10422},"\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":10424,"title":10425,"module":10413,"summary":10426},"\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":10428,"title":10429,"module":10430,"summary":10431},"\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":10433,"title":10434,"module":10430,"summary":10435},"\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":10437,"title":10438,"module":10430,"summary":10439},"\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":10441,"title":10442,"module":10443,"summary":10444},"\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":10446,"title":10447,"module":10443,"summary":10448},"\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":10450,"title":10451,"module":10443,"summary":10452},"\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":10454,"title":10455,"module":10443,"summary":10456},"\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":10458,"title":10459,"module":10443,"summary":10460},"\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":10462,"title":10463,"module":10464,"summary":10465},"\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":10467,"title":10468,"module":10464,"summary":10469},"\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":10471,"title":10472,"module":10464,"summary":10473},"\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":10475,"title":10476,"module":6,"summary":6},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":10478,"title":10479,"module":10480,"summary":10481},"\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":10483,"title":10484,"module":10480,"summary":10485},"\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":10487,"title":10488,"module":10480,"summary":10489},"\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":10491,"title":10492,"module":10480,"summary":10493},"\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":10495,"title":10496,"module":10497,"summary":10498},"\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":10500,"title":10501,"module":10497,"summary":10502},"\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":10504,"title":10505,"module":10497,"summary":10506},"\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":10508,"title":10509,"module":10497,"summary":10510},"\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":10512,"title":10513,"module":10514,"summary":10515},"\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":10517,"title":10518,"module":10514,"summary":10519},"\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":10521,"title":10522,"module":10514,"summary":10523},"\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":10525,"title":10526,"module":10514,"summary":10527},"\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":10529,"title":10530,"module":10531,"summary":10532},"\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":10534,"title":10535,"module":10531,"summary":10536},"\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":10538,"title":10539,"module":10531,"summary":10540},"\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":10542,"title":10543,"module":10531,"summary":10544},"\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":10546,"title":10547,"module":10548,"summary":10549},"\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":10551,"title":10552,"module":10548,"summary":10553},"\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":10555,"title":10556,"module":10548,"summary":10557},"\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":10559,"title":10560,"module":10548,"summary":10561},"\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":10563,"title":10564,"module":10565,"summary":10566},"\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":10568,"title":10569,"module":10565,"summary":10570},"\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":10572,"title":10573,"module":10565,"summary":10574},"\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":10576,"title":10577,"module":10565,"summary":10578},"\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":10580,"title":10581,"module":10582,"summary":10583},"\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":10585,"title":10586,"module":10582,"summary":10587},"\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":10589,"title":10590,"module":10582,"summary":10591},"\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":10593,"title":10594,"module":10582,"summary":10595},"\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":10597,"title":10598,"module":10582,"summary":10599},"\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":10601,"title":10602,"module":10603,"summary":10604},"\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":10606,"title":10607,"module":10603,"summary":10608},"\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":10610,"title":10611,"module":10612,"summary":10613},"\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":10615,"title":10616,"module":10612,"summary":10617},"\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":10619,"title":10620,"module":10612,"summary":10621},"\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":10623,"title":10624,"module":10612,"summary":10625},"\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":10627,"title":10628,"module":10629,"summary":10630},"\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":10632,"title":10633,"module":10629,"summary":10634},"\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":10636,"title":10637,"module":10629,"summary":10638},"\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":10640,"title":10641,"module":10629,"summary":10642},"\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":10644,"title":10645,"module":10629,"summary":10646},"\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":10648,"title":10649,"module":10650,"summary":10651},"\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":10653,"title":10654,"module":10650,"summary":10655},"\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":10657,"title":10658,"module":10650,"summary":10659},"\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":10661,"title":10662,"module":10650,"summary":10663},"\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":10665,"title":10666,"module":6,"summary":6},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":10668,"title":10669,"module":7432,"summary":10670},"\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":10672,"title":10673,"module":10674,"summary":10675},"\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":10677,"title":10678,"module":10674,"summary":10679},"\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":10681,"title":10682,"module":10674,"summary":10683},"\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":10685,"title":10686,"module":10674,"summary":10687},"\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":10689,"title":10690,"module":10674,"summary":10691},"\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":10693,"title":10694,"module":10674,"summary":10695},"\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":10697,"title":10698,"module":10674,"summary":10699},"\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":10701,"title":10702,"module":10703,"summary":10704},"\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":10706,"title":10707,"module":10703,"summary":10708},"\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":10710,"title":10711,"module":10703,"summary":10712},"\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":10714,"title":10715,"module":10703,"summary":10716},"\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":10718,"title":10719,"module":10720,"summary":10721},"\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":10723,"title":10724,"module":10720,"summary":10725},"\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":10727,"title":10728,"module":10720,"summary":10729},"\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":10731,"title":10732,"module":10720,"summary":10733},"\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":10735,"title":10736,"module":10737,"summary":10738},"\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":10740,"title":10741,"module":10737,"summary":10742},"\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":10744,"title":10745,"module":10737,"summary":10746},"\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":10748,"title":10749,"module":10737,"summary":10750},"\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":10752,"title":10753,"module":10754,"summary":10755},"\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":10757,"title":10758,"module":10754,"summary":10759},"\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":10761,"title":10762,"module":10754,"summary":10763},"\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":10765,"title":10766,"module":10754,"summary":10767},"\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":10769,"title":10770,"module":10771,"summary":10772},"\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":10774,"title":10775,"module":10771,"summary":10776},"\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":10778,"title":10779,"module":10771,"summary":10780},"\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":10782,"title":10783,"module":10784,"summary":10785},"\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":10787,"title":10788,"module":10784,"summary":10789},"\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":10791,"title":10792,"module":10793,"summary":10794},"\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":10796,"title":10797,"module":10793,"summary":10798},"\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":10800,"title":10801,"module":10793,"summary":10802},"\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":10804,"title":10805,"module":6,"summary":6},"\u002Flogic","Logic",{"path":10807,"title":10808,"module":7432,"summary":10809},"\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":10811,"title":10812,"module":7432,"summary":10813},"\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":10815,"title":10816,"module":7432,"summary":10817},"\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":10819,"title":10820,"module":7432,"summary":10821},"\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":10823,"title":10824,"module":7432,"summary":10825},"\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":10827,"title":10828,"module":7432,"summary":10829},"\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":10831,"title":7651,"module":10832,"summary":10833},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming","Tabular Solution Methods","Dynamic programming computes optimal policies when a perfect model of the MDP is given, by turning the Bellman equations into assignment statements. We build up iterative policy evaluation (the expected update), the policy improvement theorem, and the two classic algorithms that alternate them — policy iteration and value iteration — worked on the gridworld, a two-state MDP, Jack's car rental, and the gambler's problem.\n",{"path":10835,"title":10836,"module":10832,"summary":10837},"\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":10839,"title":10840,"module":10832,"summary":10841},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods","Monte Carlo Methods","Monte Carlo methods learn value functions and optimal policies from complete sampled episodes, with no model of the environment: they simply average the returns that actually followed each state. We build prediction (first-visit and every-visit averaging), see why estimating action values forces the exploration question, and answer it two ways on-policy — exploring starts and epsilon-soft control. Throughout, Monte Carlo samples one whole trajectory to termination and never bootstraps.\n",{"path":10843,"title":10844,"module":10832,"summary":10845},"\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":10847,"title":10848,"module":10832,"summary":10849},"\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":10851,"title":10852,"module":10832,"summary":10853},"\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":10855,"title":10856,"module":10832,"summary":10857},"\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":10859,"title":10860,"module":10832,"summary":10861},"\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":10863,"title":10864,"module":10832,"summary":10865},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning","Planning and Learning","Planning and learning are the same operation run on two kinds of experience. A model turns states and actions into simulated transitions; planning backs up values over that simulated experience exactly as learning backs them up over real experience. We build the Dyna architecture that interleaves acting, model-learning, direct RL, and planning in one loop, trace a single Dyna-Q step by hand, and patch the architecture for when the model goes stale.\n",{"path":10867,"title":10868,"module":10832,"summary":10869},"\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":10871,"title":10872,"module":10832,"summary":10873},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning","Decision-Time Planning","Planning need not build a global policy. Decision-time planning runs a fresh lookahead every time a state arrives and returns just one action, then throws the work away. We start from real-time dynamic programming — asynchronous value iteration on the states the agent actually visits — then move through heuristic search and rollout algorithms, each a one-step policy improvement applied on the fly to the current state.\n",{"path":10875,"title":10876,"module":10832,"summary":10877},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search","Monte Carlo Tree Search","Monte Carlo Tree Search is a rollout algorithm with memory: it accumulates value estimates across simulations and steers later ones toward promising branches. We work through the four steps — selection, expansion, simulation, backup — the UCT selection rule computed on real numbers, the asymmetric growing tree, and the full pseudocode. We close past Sutton & Barto with the lineage from UCT to AlphaGo, AlphaZero, and MuZero, where a learned network stands in for the leaf value and the rollout.\n",{"path":10879,"title":10880,"module":10881,"summary":10882},"\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":10884,"title":10885,"module":10881,"summary":10886},"\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":10888,"title":10889,"module":10881,"summary":10890},"\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":10892,"title":10893,"module":10881,"summary":10894},"\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":10896,"title":10897,"module":10881,"summary":10898},"\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":10900,"title":10901,"module":10881,"summary":10902},"\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":10904,"title":10905,"module":10881,"summary":10906},"\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":10908,"title":10909,"module":10881,"summary":10910},"\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":5097,"title":10912,"module":10881,"summary":10913},"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":10915,"title":10916,"module":10881,"summary":10917},"\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":10919,"title":10920,"module":10881,"summary":10921},"\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":10923,"title":10924,"module":10881,"summary":10925},"\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":10927,"title":10928,"module":10881,"summary":10929},"\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":10931,"title":10932,"module":10881,"summary":10933},"\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":10935,"title":10254,"module":10936,"summary":10937},"\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":10939,"title":10940,"module":10936,"summary":10941},"\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":10943,"title":10944,"module":10936,"summary":10945},"\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":10947,"title":10948,"module":10936,"summary":10949},"\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":10951,"title":10952,"module":10936,"summary":10953},"\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":10955,"title":10956,"module":10936,"summary":10957},"\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":10959,"title":10960,"module":10936,"summary":10961},"\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":10963,"title":10964,"module":10936,"summary":10965},"\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":10967,"title":10968,"module":6492,"summary":10969},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow","Sharpening DQN: Improvements and the Distributional Idea","In the years after the 2015 DQN paper, a stream of focused improvements each fixed one weakness of the baseline without disturbing its frame. This lesson recaps five that keep the scalar $Q$-value — Double DQN, multi-step returns, dueling networks, prioritized replay, and NoisyNets, each changing a different slot of the same Q-learning loop — then develops the sixth, distributional RL, which changes the objective itself: learn the whole return distribution $Z(s,a)$. We build the distributional Bellman equation and the C51 categorical algorithm, projection step and all, worked end to end on real numbers. A companion lesson takes up QR-DQN, Rainbow, and the modern distributional line.\n",{"path":10971,"title":10972,"module":6492,"summary":10973},"\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":10975,"title":10976,"module":6492,"summary":10977},"\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":10979,"title":10980,"module":6492,"summary":10981},"\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":10983,"title":10984,"module":6492,"summary":10985},"\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":10987,"title":10988,"module":6492,"summary":10989},"\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":10991,"title":10992,"module":6492,"summary":10993},"\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":10995,"title":10996,"module":6492,"summary":10997},"\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":45,"title":10999,"module":6492,"summary":11000},"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":11002,"title":11003,"module":6492,"summary":11004},"\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":11006,"title":11007,"module":6492,"summary":11008},"\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":11010,"title":11011,"module":6492,"summary":11012},"\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":11014,"title":11015,"module":6492,"summary":11016},"\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":11018,"title":11019,"module":6492,"summary":11020},"\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":11022,"title":11023,"module":6492,"summary":11024},"\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":11026,"title":11027,"module":6492,"summary":11028},"\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":50,"title":11030,"module":6492,"summary":11031},"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":11033,"title":11034,"module":6492,"summary":11035},"\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":11037,"title":11038,"module":6492,"summary":11039},"\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":6494,"title":5,"module":6492,"summary":6512},{"path":58,"title":6318,"module":6492,"summary":11042},"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":11044,"title":11045,"module":6492,"summary":11046},"\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":11048,"title":11049,"module":11050,"summary":11051},"\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":11053,"title":11054,"module":11050,"summary":11055},"\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":11057,"title":11058,"module":11050,"summary":11059},"\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":11061,"title":11062,"module":11050,"summary":11063},"\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":11065,"title":11066,"module":11050,"summary":11067},"\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":11069,"title":11070,"module":11050,"summary":11071},"\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":11073,"title":11074,"module":11050,"summary":11075},"\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":11077,"title":11078,"module":11050,"summary":11079},"\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":11081,"title":10246,"module":6,"summary":6},"\u002Freinforcement-learning",{"path":11083,"title":11084,"module":7432,"summary":11085},"\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":11087,"title":11088,"module":7432,"summary":11089},"\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":11091,"title":11092,"module":7432,"summary":11093},"\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":11095,"title":11096,"module":7432,"summary":11097},"\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":11099,"title":11100,"module":11101,"summary":11102},"\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":11104,"title":11105,"module":11101,"summary":11106},"\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":11108,"title":11109,"module":11101,"summary":11110},"\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":11112,"title":11113,"module":11101,"summary":11114},"\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":11116,"title":11117,"module":11101,"summary":11118},"\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":11120,"title":11121,"module":11101,"summary":11122},"\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":11124,"title":11125,"module":11101,"summary":11126},"\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":11128,"title":11129,"module":11101,"summary":11130},"\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":11132,"title":11133,"module":11101,"summary":11134},"\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":11136,"title":11137,"module":11101,"summary":11138},"\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":11140,"title":11141,"module":11101,"summary":11142},"\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":11144,"title":11145,"module":11101,"summary":11146},"\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":11148,"title":11149,"module":11150,"summary":11151},"\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":11153,"title":11154,"module":11150,"summary":11155},"\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":11157,"title":11158,"module":11150,"summary":11159},"\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":11161,"title":11162,"module":11150,"summary":11163},"\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":11165,"title":11166,"module":11150,"summary":11167},"\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":11169,"title":11170,"module":11150,"summary":11171},"\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":11173,"title":11174,"module":11150,"summary":11175},"\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":11177,"title":11178,"module":11150,"summary":11179},"\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":11181,"title":11182,"module":11150,"summary":11183},"\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":11185,"title":11186,"module":11150,"summary":11187},"\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":11189,"title":11190,"module":11150,"summary":11191},"\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":11193,"title":11194,"module":11150,"summary":11195},"\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":11197,"title":11198,"module":11199,"summary":11200},"\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":11202,"title":11203,"module":11199,"summary":11204},"\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":11206,"title":11207,"module":11199,"summary":11208},"\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":11210,"title":11211,"module":11199,"summary":11212},"\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":11214,"title":11215,"module":11199,"summary":11216},"\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":11218,"title":11219,"module":11199,"summary":11220},"\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":11222,"title":11223,"module":11199,"summary":11224},"\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":11226,"title":10824,"module":11199,"summary":11227},"\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":11229,"title":11230,"module":11199,"summary":11231},"\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":11233,"title":11234,"module":11199,"summary":11235},"\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":11237,"title":11238,"module":11239,"summary":11240},"\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":11242,"title":11243,"module":11239,"summary":11244},"\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":11246,"title":11247,"module":11239,"summary":11248},"\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":11250,"title":11251,"module":11239,"summary":11252},"\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":11254,"title":10246,"module":11239,"summary":11255},"\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":11257,"title":11258,"module":11239,"summary":11259},"\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":11261,"title":11262,"module":11239,"summary":11263},"\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":11265,"title":11266,"module":11239,"summary":11267},"\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":11269,"title":11270,"module":11271,"summary":11272},"\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":11274,"title":11275,"module":11271,"summary":11276},"\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":11278,"title":11279,"module":11271,"summary":11280},"\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":11282,"title":11283,"module":11271,"summary":11284},"\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":11286,"title":11287,"module":11271,"summary":11288},"\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":11290,"title":11291,"module":11271,"summary":11292},"\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":11294,"title":11295,"module":11271,"summary":11296},"\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":11298,"title":11299,"module":11271,"summary":11300},"\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":11302,"title":11303,"module":6,"summary":6},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":11305,"title":11306,"module":11307,"summary":11308},"\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":11310,"title":11311,"module":11307,"summary":11312},"\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":11314,"title":11315,"module":11307,"summary":11316},"\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":11318,"title":11319,"module":11307,"summary":11320},"\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":11322,"title":11323,"module":11307,"summary":11324},"\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":11326,"title":11327,"module":11328,"summary":11329},"\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":11331,"title":11332,"module":11328,"summary":11333},"\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":11335,"title":11336,"module":11328,"summary":11337},"\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":11339,"title":11340,"module":11328,"summary":11341},"\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":11343,"title":11344,"module":11345,"summary":11346},"\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":11348,"title":11349,"module":11345,"summary":11350},"\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":11352,"title":11353,"module":11345,"summary":11354},"\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":11356,"title":11357,"module":11345,"summary":11358},"\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":11360,"title":11361,"module":11362,"summary":11363},"\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":11365,"title":11366,"module":11362,"summary":11367},"\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":11369,"title":11370,"module":11371,"summary":11372},"\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":11374,"title":11375,"module":11371,"summary":11376},"\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":11378,"title":11379,"module":11380,"summary":11381},"\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":11383,"title":11384,"module":11380,"summary":11385},"\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":11387,"title":11388,"module":11380,"summary":11389},"\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":11391,"title":11392,"module":11380,"summary":11393},"\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":11395,"title":11396,"module":11397,"summary":11398},"\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":11400,"title":11401,"module":11397,"summary":11402},"\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":11404,"title":11405,"module":11397,"summary":11406},"\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":11408,"title":11409,"module":11410,"summary":11411},"\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":11413,"title":11414,"module":11410,"summary":11415},"\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":11417,"title":11418,"module":11410,"summary":11419},"\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":11421,"title":11422,"module":11423,"summary":11424},"\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":11426,"title":11427,"module":11423,"summary":11428},"\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":11430,"title":11431,"module":11432,"summary":11433},"\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":11435,"title":11436,"module":11432,"summary":11437},"\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":11439,"title":11440,"module":11432,"summary":11441},"\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":11443,"title":11444,"module":11445,"summary":11446},"\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":11448,"title":11449,"module":11445,"summary":11450},"\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":11452,"title":11453,"module":11445,"summary":11454},"\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":11456,"title":11457,"module":11445,"summary":11458},"\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":11460,"title":11461,"module":11445,"summary":11462},"\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":11464,"title":11465,"module":6,"summary":6},"\u002Fnuclear-physics","Nuclear Physics",{"path":11467,"title":11468,"module":7432,"summary":11469},"\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":11471,"title":11472,"module":7432,"summary":11473},"\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":11475,"title":11476,"module":7432,"summary":11477},"\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":11479,"title":11480,"module":7432,"summary":11481},"\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":11483,"title":11484,"module":7432,"summary":11485},"\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":11487,"title":11488,"module":11489,"summary":11490},"\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":11492,"title":11493,"module":11489,"summary":11494},"\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":11496,"title":11497,"module":11489,"summary":11498},"\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":11500,"title":11501,"module":11489,"summary":11502},"\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":11504,"title":11505,"module":11506,"summary":11507},"\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":11509,"title":11510,"module":11506,"summary":11511},"\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":11513,"title":11514,"module":11506,"summary":11515},"\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":11517,"title":11518,"module":7898,"summary":11519},"\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":11521,"title":11522,"module":7898,"summary":11523},"\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":11525,"title":11526,"module":7898,"summary":11527},"\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":11529,"title":11530,"module":8380,"summary":11531},"\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":11533,"title":10092,"module":8380,"summary":11534},"\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":11536,"title":10200,"module":8380,"summary":11537},"\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":11539,"title":11540,"module":8380,"summary":11541},"\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":11543,"title":11544,"module":8380,"summary":11545},"\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":11547,"title":11548,"module":8380,"summary":11549},"\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":11551,"title":11552,"module":11553,"summary":11554},"\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":11556,"title":11557,"module":11553,"summary":11558},"\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":11560,"title":11561,"module":11553,"summary":11562},"\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":11564,"title":11565,"module":11553,"summary":11566},"\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":11568,"title":11569,"module":11553,"summary":11570},"\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":11572,"title":11573,"module":11553,"summary":11574},"\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":11576,"title":11577,"module":11553,"summary":11578},"\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":11580,"title":11581,"module":11553,"summary":11582},"\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":11584,"title":11585,"module":11553,"summary":11586},"\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":11588,"title":11589,"module":11553,"summary":11590},"\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":11592,"title":11593,"module":11553,"summary":11594},"\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":11596,"title":11597,"module":11553,"summary":11598},"\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":11600,"title":11601,"module":11553,"summary":11602},"\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":11604,"title":11605,"module":11553,"summary":11606},"\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":11608,"title":11609,"module":11553,"summary":11610},"\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":11612,"title":11613,"module":11553,"summary":11614},"\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":11616,"title":11617,"module":11553,"summary":11618},"\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":11620,"title":11621,"module":11553,"summary":11622},"\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":11624,"title":11625,"module":11553,"summary":11626},"\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":11628,"title":11629,"module":11553,"summary":11630},"\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":11632,"title":11633,"module":10188,"summary":11634},"\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":11636,"title":11637,"module":10188,"summary":11638},"\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":11640,"title":11641,"module":10188,"summary":11642},"\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":11644,"title":11645,"module":10188,"summary":11646},"\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":11648,"title":11649,"module":10188,"summary":11650},"\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":11652,"title":11653,"module":10188,"summary":11654},"\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":11656,"title":11657,"module":10188,"summary":11658},"\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":11660,"title":11661,"module":10188,"summary":11662},"\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":11664,"title":11665,"module":11666,"summary":11667},"\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":11669,"title":11670,"module":11666,"summary":11671},"\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":11673,"title":11674,"module":11666,"summary":11675},"\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":11677,"title":11678,"module":11666,"summary":11679},"\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":11681,"title":11682,"module":6,"summary":6},"\u002Fnatural-language-processing","Natural Language Processing",{"path":11684,"title":11685,"module":7432,"summary":11686},"\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":11688,"title":11689,"module":7432,"summary":11690},"\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":11692,"title":11693,"module":7432,"summary":11694},"\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":11696,"title":11697,"module":11698,"summary":11699},"\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":11701,"title":11702,"module":11698,"summary":11703},"\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":11705,"title":11706,"module":11698,"summary":11707},"\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":11709,"title":11710,"module":11698,"summary":11711},"\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":11713,"title":11714,"module":11715,"summary":11716},"\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":11718,"title":11719,"module":11715,"summary":11720},"\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":11722,"title":11723,"module":11715,"summary":11724},"\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":11726,"title":11727,"module":11715,"summary":11728},"\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":11730,"title":11731,"module":11732,"summary":11733},"\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":11735,"title":11736,"module":11732,"summary":11737},"\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":11739,"title":11740,"module":11732,"summary":11741},"\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":11743,"title":11744,"module":11732,"summary":11745},"\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":11747,"title":11748,"module":11749,"summary":11750},"\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":11752,"title":11753,"module":11749,"summary":11754},"\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":11756,"title":11757,"module":11749,"summary":11758},"\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":11760,"title":11761,"module":11762,"summary":11763},"\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":11765,"title":11766,"module":11762,"summary":11767},"\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":11769,"title":11770,"module":11762,"summary":11771},"\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":11773,"title":11774,"module":11762,"summary":11775},"\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":11777,"title":11778,"module":11779,"summary":11780},"\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":11782,"title":11783,"module":11779,"summary":11784},"\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":11786,"title":11787,"module":11779,"summary":11788},"\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":11790,"title":11791,"module":11779,"summary":11792},"\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":11794,"title":11795,"module":11796,"summary":11797},"\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":11799,"title":11800,"module":11796,"summary":11801},"\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":11803,"title":11804,"module":11796,"summary":11805},"\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":11807,"title":11808,"module":11796,"summary":11809},"\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":11811,"title":11812,"module":11813,"summary":11814},"\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":11816,"title":11817,"module":11813,"summary":11818},"\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":11820,"title":11821,"module":11813,"summary":11822},"\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":11824,"title":11825,"module":11813,"summary":11826},"\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":11828,"title":11829,"module":11813,"summary":11830},"\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":11832,"title":11833,"module":11834,"summary":11835},"\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":11837,"title":11838,"module":11834,"summary":11839},"\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":11841,"title":11842,"module":11834,"summary":11843},"\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":11845,"title":11846,"module":11847,"summary":11848},"\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":11850,"title":11851,"module":11847,"summary":11852},"\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":11854,"title":11855,"module":11847,"summary":11856},"\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":11858,"title":11859,"module":11859,"summary":11860},"\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":11862,"title":11863,"module":11859,"summary":11864},"\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":11866,"title":11867,"module":11859,"summary":11868},"\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":11870,"title":11871,"module":11859,"summary":11872},"\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":11874,"title":11875,"module":11859,"summary":11876},"\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":11878,"title":11879,"module":11859,"summary":11880},"\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":11882,"title":11883,"module":6,"summary":6},"\u002Fparticle-physics","Particle Physics",{"path":11885,"title":11886,"module":11887,"summary":11888},"\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":11890,"title":11891,"module":11887,"summary":11892},"\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":11894,"title":11895,"module":11887,"summary":11896},"\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":11898,"title":11899,"module":11900,"summary":11901},"\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":11903,"title":11904,"module":11900,"summary":11905},"\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":11907,"title":11908,"module":11900,"summary":11909},"\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":11911,"title":11912,"module":11900,"summary":11913},"\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":11915,"title":11916,"module":11917,"summary":11918},"\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":11920,"title":11921,"module":11917,"summary":11922},"\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":11924,"title":11925,"module":11917,"summary":11926},"\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":11928,"title":11929,"module":11917,"summary":11930},"\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":11932,"title":11933,"module":11934,"summary":11935},"\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":11937,"title":11938,"module":11934,"summary":11939},"\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":11941,"title":11942,"module":11934,"summary":11943},"\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":11945,"title":11946,"module":11934,"summary":11947},"\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":11949,"title":11950,"module":11951,"summary":11952},"\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":11954,"title":11955,"module":11951,"summary":11956},"\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":11958,"title":11959,"module":11951,"summary":11960},"\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":11962,"title":11963,"module":11951,"summary":11964},"\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":11966,"title":11967,"module":11968,"summary":11969},"\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":11971,"title":11972,"module":11968,"summary":11973},"\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":11975,"title":11976,"module":11968,"summary":11977},"\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":11979,"title":11980,"module":11981,"summary":11982},"\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":11984,"title":11985,"module":11981,"summary":11986},"\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":11988,"title":11989,"module":11981,"summary":11990},"\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":11992,"title":11993,"module":11981,"summary":11994},"\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":11996,"title":10421,"module":11997,"summary":11998},"\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":12000,"title":12001,"module":11997,"summary":12002},"\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":12004,"title":12005,"module":11997,"summary":12006},"\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":12008,"title":12009,"module":11997,"summary":12010},"\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":12012,"title":12013,"module":11997,"summary":12014},"\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":12016,"title":12017,"module":12018,"summary":12019},"\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":12021,"title":12022,"module":12018,"summary":12023},"\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":12025,"title":12026,"module":12018,"summary":12027},"\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":12029,"title":12030,"module":12018,"summary":12031},"\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":12033,"title":12034,"module":12035,"summary":12036},"\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":12038,"title":12039,"module":12035,"summary":12040},"\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":12042,"title":12043,"module":12035,"summary":12044},"\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":12046,"title":12047,"module":12035,"summary":12048},"\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":12050,"title":12051,"module":12035,"summary":12052},"\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":12054,"title":12055,"module":12056,"summary":12057},"\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":12059,"title":12060,"module":12056,"summary":12061},"\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":12063,"title":9139,"module":12056,"summary":12064},"\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":12066,"title":12067,"module":12056,"summary":12068},"\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":12070,"title":12071,"module":12056,"summary":12072},"\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":12074,"title":12075,"module":12076,"summary":12077},"\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":12079,"title":12080,"module":12076,"summary":12081},"\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":12083,"title":12084,"module":12076,"summary":12085},"\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":12087,"title":12088,"module":12076,"summary":12089},"\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":12091,"title":12092,"module":12076,"summary":12093},"\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":12095,"title":12096,"module":12076,"summary":12097},"\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":12099,"title":12100,"module":12076,"summary":12101},"\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":12103,"title":12104,"module":6,"summary":6},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":12106,"title":12107,"module":6,"summary":6},"\u002Fcolophon","Colophon",{"path":2506,"title":12109,"module":6,"summary":6},"Study Notes",[12111,12126,12155,12189,12208,12262],{"module":7432,"moduleNumber":3421,"slug":12112,"lessons":12113},"foundations",[12114,12116,12118,12120,12122,12124],{"title":10808,"path":10807,"lessonNumber":3421,"topics":12115,"summary":10809},[7432],{"title":10812,"path":10811,"lessonNumber":3427,"topics":12117,"summary":10813},[7432],{"title":10816,"path":10815,"lessonNumber":3433,"topics":12119,"summary":10817},[7432],{"title":10820,"path":10819,"lessonNumber":3439,"topics":12121,"summary":10821},[7432],{"title":10824,"path":10823,"lessonNumber":3445,"topics":12123,"summary":10825},[7432],{"title":10828,"path":10827,"lessonNumber":3451,"topics":12125,"summary":10829},[7432],{"module":10832,"moduleNumber":3427,"slug":12127,"lessons":12128},"tabular-methods",[12129,12132,12134,12136,12138,12140,12142,12144,12146,12148,12150,12152],{"title":7651,"path":10831,"lessonNumber":3421,"topics":12130,"summary":10833},[12131],"Tabular Methods",{"title":10836,"path":10835,"lessonNumber":3427,"topics":12133,"summary":10837},[12131],{"title":10840,"path":10839,"lessonNumber":3433,"topics":12135,"summary":10841},[12131],{"title":10844,"path":10843,"lessonNumber":3439,"topics":12137,"summary":10845},[12131],{"title":10848,"path":10847,"lessonNumber":3445,"topics":12139,"summary":10849},[12131],{"title":10852,"path":10851,"lessonNumber":3451,"topics":12141,"summary":10853},[12131],{"title":10856,"path":10855,"lessonNumber":3457,"topics":12143,"summary":10857},[12131],{"title":10860,"path":10859,"lessonNumber":3463,"topics":12145,"summary":10861},[12131],{"title":10864,"path":10863,"lessonNumber":3469,"topics":12147,"summary":10865},[12131],{"title":10868,"path":10867,"lessonNumber":3475,"topics":12149,"summary":10869},[12131],{"title":10872,"path":10871,"lessonNumber":3481,"topics":12151,"summary":10873},[12131],{"title":10876,"path":10875,"lessonNumber":12153,"topics":12154,"summary":10877},12,[12131],{"module":10881,"moduleNumber":3433,"slug":12156,"lessons":12157},"approximation",[12158,12161,12163,12165,12167,12169,12171,12173,12175,12177,12179,12181,12183,12186],{"title":10880,"path":10879,"lessonNumber":3421,"topics":12159,"summary":10882},[12160],"Approximation",{"title":10885,"path":10884,"lessonNumber":3427,"topics":12162,"summary":10886},[12160],{"title":10889,"path":10888,"lessonNumber":3433,"topics":12164,"summary":10890},[12160],{"title":10893,"path":10892,"lessonNumber":3439,"topics":12166,"summary":10894},[12160],{"title":10897,"path":10896,"lessonNumber":3445,"topics":12168,"summary":10898},[12160],{"title":10901,"path":10900,"lessonNumber":3451,"topics":12170,"summary":10902},[12160],{"title":10905,"path":10904,"lessonNumber":3457,"topics":12172,"summary":10906},[12160],{"title":10909,"path":10908,"lessonNumber":3463,"topics":12174,"summary":10910},[12160],{"title":10912,"path":5097,"lessonNumber":3469,"topics":12176,"summary":10913},[12160],{"title":10916,"path":10915,"lessonNumber":3475,"topics":12178,"summary":10917},[12160],{"title":10920,"path":10919,"lessonNumber":3481,"topics":12180,"summary":10921},[12160],{"title":10924,"path":10923,"lessonNumber":12153,"topics":12182,"summary":10925},[12160],{"title":10928,"path":10927,"lessonNumber":12184,"topics":12185,"summary":10929},13,[12160],{"title":10932,"path":10931,"lessonNumber":12187,"topics":12188,"summary":10933},14,[12160],{"module":10936,"moduleNumber":3439,"slug":12190,"lessons":12191},"deep-rl",[12192,12194,12196,12198,12200,12202,12204,12206],{"title":10254,"path":10935,"lessonNumber":3421,"topics":12193,"summary":10937},[6514],{"title":10940,"path":10939,"lessonNumber":3427,"topics":12195,"summary":10941},[6514],{"title":10944,"path":10943,"lessonNumber":3433,"topics":12197,"summary":10945},[6514],{"title":10948,"path":10947,"lessonNumber":3439,"topics":12199,"summary":10949},[6514],{"title":10952,"path":10951,"lessonNumber":3445,"topics":12201,"summary":10953},[6514],{"title":10956,"path":10955,"lessonNumber":3451,"topics":12203,"summary":10957},[6514],{"title":10960,"path":10959,"lessonNumber":3457,"topics":12205,"summary":10961},[6514],{"title":10964,"path":10963,"lessonNumber":3463,"topics":12207,"summary":10965},[6514],{"module":6492,"moduleNumber":3445,"slug":12209,"lessons":12210},"modern-deep-rl",[12211,12213,12215,12217,12219,12221,12223,12225,12227,12229,12231,12233,12235,12237,12239,12242,12245,12248,12251,12254,12256,12259],{"title":10968,"path":10967,"lessonNumber":3421,"topics":12212,"summary":10969},[6514],{"title":10972,"path":10971,"lessonNumber":3427,"topics":12214,"summary":10973},[6514],{"title":10976,"path":10975,"lessonNumber":3433,"topics":12216,"summary":10977},[6514],{"title":10980,"path":10979,"lessonNumber":3439,"topics":12218,"summary":10981},[6514],{"title":10984,"path":10983,"lessonNumber":3445,"topics":12220,"summary":10985},[6514],{"title":10988,"path":10987,"lessonNumber":3451,"topics":12222,"summary":10989},[6514],{"title":10992,"path":10991,"lessonNumber":3457,"topics":12224,"summary":10993},[6514],{"title":10996,"path":10995,"lessonNumber":3463,"topics":12226,"summary":10997},[6514],{"title":10999,"path":45,"lessonNumber":3469,"topics":12228,"summary":11000},[6514],{"title":11003,"path":11002,"lessonNumber":3475,"topics":12230,"summary":11004},[6514],{"title":11007,"path":11006,"lessonNumber":3481,"topics":12232,"summary":11008},[6514],{"title":11011,"path":11010,"lessonNumber":12153,"topics":12234,"summary":11012},[6514],{"title":11015,"path":11014,"lessonNumber":12184,"topics":12236,"summary":11016},[6514],{"title":11019,"path":11018,"lessonNumber":12187,"topics":12238,"summary":11020},[6514],{"title":11023,"path":11022,"lessonNumber":12240,"topics":12241,"summary":11024},15,[6514],{"title":11027,"path":11026,"lessonNumber":12243,"topics":12244,"summary":11028},16,[6514],{"title":11030,"path":50,"lessonNumber":12246,"topics":12247,"summary":11031},17,[6514],{"title":11034,"path":11033,"lessonNumber":12249,"topics":12250,"summary":11035},18,[6514],{"title":11038,"path":11037,"lessonNumber":12252,"topics":12253,"summary":11039},19,[6514],{"title":5,"path":6494,"lessonNumber":6490,"topics":12255,"summary":6512},[6514],{"title":6318,"path":58,"lessonNumber":12257,"topics":12258,"summary":11042},21,[6514],{"title":11045,"path":11044,"lessonNumber":12260,"topics":12261,"summary":11046},22,[6514],{"module":11050,"moduleNumber":3451,"slug":12263,"lessons":12264},"minds-and-brains",[12265,12268,12270,12272,12274,12276,12278,12280],{"title":11049,"path":11048,"lessonNumber":3421,"topics":12266,"summary":11051},[12267],"Minds and Brains",{"title":11054,"path":11053,"lessonNumber":3427,"topics":12269,"summary":11055},[12267],{"title":11058,"path":11057,"lessonNumber":3433,"topics":12271,"summary":11059},[12267],{"title":11062,"path":11061,"lessonNumber":3439,"topics":12273,"summary":11063},[12267],{"title":11066,"path":11065,"lessonNumber":3445,"topics":12275,"summary":11067},[12267],{"title":11070,"path":11069,"lessonNumber":3451,"topics":12277,"summary":11071},[12267],{"title":11074,"path":11073,"lessonNumber":3457,"topics":12279,"summary":11075},[12267],{"title":11078,"path":11077,"lessonNumber":3463,"topics":12281,"summary":11079},[12267],"\u003Csvg style=\"width:100%;max-width:457.178px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 342.884 157.724\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-45.303 65.477h271.147\"\u002F>\u003Cpath stroke=\"none\" d=\"m227.843 65.477-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(239 9.089)\">\u003Cpath d=\"M-37.491 67.028L-39.346 67.028L-39.346 66.735Q-39.077 66.735-38.909 66.690Q-38.741 66.645-38.741 66.469L-38.741 62.645Q-38.741 62.438-38.897 62.385Q-39.053 62.332-39.346 62.332L-39.346 62.036L-38.124 61.950L-38.124 62.415Q-37.893 62.192-37.579 62.071Q-37.264 61.950-36.925 61.950Q-36.452 61.950-36.048 62.196Q-35.643 62.442-35.411 62.858Q-35.178 63.274-35.178 63.750Q-35.178 64.125-35.327 64.454Q-35.475 64.782-35.745 65.034Q-36.014 65.286-36.358 65.420Q-36.702 65.555-37.061 65.555Q-37.350 65.555-37.622 65.434Q-37.893 65.313-38.100 65.102L-38.100 66.469Q-38.100 66.645-37.932 66.690Q-37.764 66.735-37.491 66.735L-37.491 67.028M-38.100 62.813L-38.100 64.653Q-37.948 64.942-37.686 65.122Q-37.425 65.301-37.116 65.301Q-36.831 65.301-36.608 65.163Q-36.385 65.024-36.233 64.793Q-36.081 64.563-36.003 64.291Q-35.925 64.020-35.925 63.750Q-35.925 63.418-36.050 63.061Q-36.175 62.704-36.423 62.467Q-36.671 62.231-37.018 62.231Q-37.342 62.231-37.637 62.387Q-37.932 62.543-38.100 62.813\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(239 9.089)\">\u003Cpath d=\"M-34.416 63.782Q-34.416 63.278-34.160 62.846Q-33.904 62.415-33.468 62.163Q-33.033 61.911-32.533 61.911Q-32.146 61.911-31.804 62.055Q-31.463 62.200-31.201 62.461Q-30.939 62.723-30.797 63.059Q-30.654 63.395-30.654 63.782Q-30.654 64.274-30.918 64.684Q-31.181 65.094-31.611 65.325Q-32.041 65.555-32.533 65.555Q-33.025 65.555-33.459 65.323Q-33.892 65.090-34.154 64.682Q-34.416 64.274-34.416 63.782M-32.533 65.278Q-32.076 65.278-31.824 65.055Q-31.572 64.832-31.484 64.481Q-31.396 64.129-31.396 63.684Q-31.396 63.254-31.490 62.916Q-31.584 62.579-31.838 62.372Q-32.092 62.165-32.533 62.165Q-33.181 62.165-33.425 62.581Q-33.670 62.997-33.670 63.684Q-33.670 64.129-33.582 64.481Q-33.494 64.832-33.242 65.055Q-32.990 65.278-32.533 65.278M-28.256 65.477L-30.088 65.477L-30.088 65.180Q-29.814 65.180-29.646 65.133Q-29.478 65.086-29.478 64.918L-29.478 60.758Q-29.478 60.543-29.541 60.448Q-29.603 60.352-29.722 60.331Q-29.842 60.309-30.088 60.309L-30.088 60.012L-28.865 59.926L-28.865 64.918Q-28.865 65.086-28.697 65.133Q-28.529 65.180-28.256 65.180L-28.256 65.477M-25.951 65.477L-27.728 65.477L-27.728 65.180Q-27.455 65.180-27.287 65.133Q-27.119 65.086-27.119 64.918L-27.119 62.782Q-27.119 62.567-27.175 62.471Q-27.232 62.375-27.345 62.354Q-27.459 62.332-27.705 62.332L-27.705 62.036L-26.506 61.950L-26.506 64.918Q-26.506 65.086-26.359 65.133Q-26.213 65.180-25.951 65.180L-25.951 65.477M-27.392 60.555Q-27.392 60.364-27.258 60.233Q-27.123 60.102-26.927 60.102Q-26.806 60.102-26.703 60.165Q-26.599 60.227-26.537 60.331Q-26.474 60.434-26.474 60.555Q-26.474 60.750-26.605 60.885Q-26.736 61.020-26.927 61.020Q-27.127 61.020-27.259 60.887Q-27.392 60.754-27.392 60.555M-25.408 63.750Q-25.408 63.254-25.158 62.829Q-24.908 62.403-24.488 62.157Q-24.068 61.911-23.568 61.911Q-23.029 61.911-22.638 62.036Q-22.248 62.161-22.248 62.575Q-22.248 62.680-22.299 62.772Q-22.349 62.864-22.441 62.915Q-22.533 62.965-22.642 62.965Q-22.748 62.965-22.840 62.915Q-22.931 62.864-22.982 62.772Q-23.033 62.680-23.033 62.575Q-23.033 62.352-22.865 62.247Q-23.088 62.188-23.560 62.188Q-23.857 62.188-24.072 62.327Q-24.287 62.465-24.418 62.696Q-24.549 62.926-24.607 63.196Q-24.666 63.465-24.666 63.750Q-24.666 64.145-24.533 64.495Q-24.400 64.844-24.129 65.061Q-23.857 65.278-23.459 65.278Q-23.084 65.278-22.808 65.061Q-22.533 64.844-22.431 64.485Q-22.416 64.422-22.353 64.422L-22.248 64.422Q-22.213 64.422-22.187 64.450Q-22.162 64.477-22.162 64.516L-22.162 64.540Q-22.295 65.020-22.679 65.288Q-23.064 65.555-23.568 65.555Q-23.931 65.555-24.265 65.418Q-24.599 65.282-24.859 65.032Q-25.119 64.782-25.263 64.446Q-25.408 64.110-25.408 63.750M-21.256 66.774Q-21.142 66.852-20.967 66.852Q-20.677 66.852-20.457 66.639Q-20.236 66.426-20.111 66.125L-19.822 65.477L-21.095 62.590Q-21.177 62.415-21.322 62.370Q-21.467 62.325-21.736 62.325L-21.736 62.028L-20.017 62.028L-20.017 62.325Q-20.439 62.325-20.439 62.508Q-20.439 62.520-20.424 62.590L-19.486 64.715L-18.654 62.805Q-18.615 62.715-18.615 62.637Q-18.615 62.497-18.717 62.411Q-18.818 62.325-18.959 62.325L-18.959 62.028L-17.607 62.028L-17.607 62.325Q-17.861 62.325-18.054 62.450Q-18.248 62.575-18.353 62.805L-19.799 66.125Q-19.912 66.379-20.078 66.602Q-20.244 66.825-20.472 66.967Q-20.701 67.110-20.967 67.110Q-21.263 67.110-21.504 66.918Q-21.744 66.727-21.744 66.438Q-21.744 66.282-21.638 66.180Q-21.533 66.079-21.384 66.079Q-21.279 66.079-21.199 66.125Q-21.119 66.172-21.072 66.250Q-21.025 66.329-21.025 66.438Q-21.025 66.559-21.086 66.647Q-21.146 66.735-21.256 66.774\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(239 9.089)\">\u003Cpath d=\"M-13.432 65.477L-13.713 65.477L-13.713 60.758Q-13.713 60.543-13.775 60.448Q-13.838 60.352-13.955 60.331Q-14.072 60.309-14.318 60.309L-14.318 60.012L-13.096 59.926L-13.096 62.415Q-12.619 61.950-11.920 61.950Q-11.439 61.950-11.031 62.194Q-10.623 62.438-10.387 62.852Q-10.150 63.266-10.150 63.750Q-10.150 64.125-10.299 64.454Q-10.447 64.782-10.717 65.034Q-10.986 65.286-11.330 65.420Q-11.674 65.555-12.033 65.555Q-12.354 65.555-12.652 65.407Q-12.951 65.258-13.158 64.997L-13.432 65.477M-13.072 62.805L-13.072 64.645Q-12.920 64.942-12.660 65.122Q-12.400 65.301-12.088 65.301Q-11.662 65.301-11.395 65.082Q-11.127 64.864-11.012 64.518Q-10.896 64.172-10.896 63.750Q-10.896 63.102-11.145 62.653Q-11.393 62.204-11.990 62.204Q-12.326 62.204-12.615 62.362Q-12.904 62.520-13.072 62.805\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(239 9.089)\">\u003Cpath d=\"M-9.388 63.723Q-9.388 63.243-9.155 62.827Q-8.923 62.411-8.513 62.161Q-8.103 61.911-7.626 61.911Q-6.896 61.911-6.497 62.352Q-6.099 62.793-6.099 63.524Q-6.099 63.629-6.192 63.653L-8.642 63.653L-8.642 63.723Q-8.642 64.133-8.521 64.489Q-8.399 64.844-8.128 65.061Q-7.856 65.278-7.427 65.278Q-7.063 65.278-6.767 65.049Q-6.470 64.821-6.368 64.469Q-6.360 64.422-6.274 64.407L-6.192 64.407Q-6.099 64.434-6.099 64.516Q-6.099 64.524-6.106 64.555Q-6.169 64.782-6.308 64.965Q-6.446 65.149-6.638 65.282Q-6.829 65.415-7.048 65.485Q-7.267 65.555-7.505 65.555Q-7.876 65.555-8.214 65.418Q-8.552 65.282-8.819 65.030Q-9.087 64.778-9.237 64.438Q-9.388 64.098-9.388 63.723M-8.634 63.415L-6.673 63.415Q-6.673 63.110-6.774 62.819Q-6.876 62.528-7.093 62.346Q-7.310 62.165-7.626 62.165Q-7.927 62.165-8.157 62.352Q-8.388 62.540-8.511 62.831Q-8.634 63.122-8.634 63.415M-3.681 65.477L-5.536 65.477L-5.536 65.180Q-5.263 65.180-5.095 65.133Q-4.927 65.086-4.927 64.918L-4.927 60.758Q-4.927 60.543-4.989 60.448Q-5.052 60.352-5.171 60.331Q-5.290 60.309-5.536 60.309L-5.536 60.012L-4.313 59.926L-4.313 62.629Q-4.188 62.418-4.001 62.268Q-3.813 62.118-3.587 62.034Q-3.360 61.950-3.114 61.950Q-1.946 61.950-1.946 63.028L-1.946 64.918Q-1.946 65.086-1.776 65.133Q-1.606 65.180-1.337 65.180L-1.337 65.477L-3.192 65.477L-3.192 65.180Q-2.919 65.180-2.751 65.133Q-2.583 65.086-2.583 64.918L-2.583 63.043Q-2.583 62.661-2.704 62.432Q-2.825 62.204-3.177 62.204Q-3.489 62.204-3.743 62.366Q-3.997 62.528-4.144 62.797Q-4.290 63.067-4.290 63.364L-4.290 64.918Q-4.290 65.086-4.120 65.133Q-3.950 65.180-3.681 65.180L-3.681 65.477M-0.794 64.645Q-0.794 64.161-0.392 63.866Q0.011 63.571 0.562 63.452Q1.112 63.332 1.604 63.332L1.604 63.043Q1.604 62.817 1.489 62.610Q1.374 62.403 1.177 62.284Q0.979 62.165 0.749 62.165Q0.323 62.165 0.038 62.270Q0.108 62.297 0.155 62.352Q0.202 62.407 0.228 62.477Q0.253 62.547 0.253 62.622Q0.253 62.727 0.202 62.819Q0.151 62.911 0.060 62.961Q-0.032 63.012-0.138 63.012Q-0.243 63.012-0.335 62.961Q-0.427 62.911-0.478 62.819Q-0.528 62.727-0.528 62.622Q-0.528 62.204-0.140 62.057Q0.249 61.911 0.749 61.911Q1.081 61.911 1.435 62.041Q1.788 62.172 2.017 62.426Q2.245 62.680 2.245 63.028L2.245 64.829Q2.245 64.961 2.317 65.071Q2.390 65.180 2.519 65.180Q2.644 65.180 2.712 65.075Q2.780 64.969 2.780 64.829L2.780 64.317L3.062 64.317L3.062 64.829Q3.062 65.032 2.944 65.190Q2.827 65.348 2.645 65.432Q2.464 65.516 2.261 65.516Q2.030 65.516 1.878 65.344Q1.726 65.172 1.694 64.942Q1.534 65.223 1.226 65.389Q0.917 65.555 0.565 65.555Q0.054 65.555-0.370 65.332Q-0.794 65.110-0.794 64.645M-0.106 64.645Q-0.106 64.930 0.120 65.116Q0.347 65.301 0.640 65.301Q0.886 65.301 1.110 65.184Q1.335 65.067 1.470 64.864Q1.604 64.661 1.604 64.407L1.604 63.575Q1.339 63.575 1.054 63.629Q0.769 63.684 0.497 63.813Q0.226 63.942 0.060 64.149Q-0.106 64.356-0.106 64.645\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(239 9.089)\">\u003Cpath d=\"M4.927 65.446L3.704 62.590Q3.622 62.415 3.478 62.370Q3.333 62.325 3.064 62.325L3.064 62.028L4.775 62.028L4.775 62.325Q4.353 62.325 4.353 62.508Q4.353 62.543 4.368 62.590L5.314 64.782L6.154 62.805Q6.193 62.727 6.193 62.637Q6.193 62.497 6.087 62.411Q5.982 62.325 5.841 62.325L5.841 62.028L7.193 62.028L7.193 62.325Q6.669 62.325 6.454 62.805L5.329 65.446Q5.267 65.555 5.161 65.555L5.095 65.555Q4.982 65.555 4.927 65.446M9.466 65.477L7.689 65.477L7.689 65.180Q7.962 65.180 8.130 65.133Q8.298 65.086 8.298 64.918L8.298 62.782Q8.298 62.567 8.242 62.471Q8.185 62.375 8.072 62.354Q7.958 62.332 7.712 62.332L7.712 62.036L8.911 61.950L8.911 64.918Q8.911 65.086 9.058 65.133Q9.204 65.180 9.466 65.180L9.466 65.477M8.025 60.555Q8.025 60.364 8.159 60.233Q8.294 60.102 8.490 60.102Q8.611 60.102 8.714 60.165Q8.818 60.227 8.880 60.331Q8.943 60.434 8.943 60.555Q8.943 60.750 8.812 60.885Q8.681 61.020 8.490 61.020Q8.290 61.020 8.158 60.887Q8.025 60.754 8.025 60.555M9.966 63.782Q9.966 63.278 10.222 62.846Q10.478 62.415 10.913 62.163Q11.349 61.911 11.849 61.911Q12.236 61.911 12.577 62.055Q12.919 62.200 13.181 62.461Q13.443 62.723 13.585 63.059Q13.728 63.395 13.728 63.782Q13.728 64.274 13.464 64.684Q13.200 65.094 12.771 65.325Q12.341 65.555 11.849 65.555Q11.357 65.555 10.923 65.323Q10.490 65.090 10.228 64.682Q9.966 64.274 9.966 63.782M11.849 65.278Q12.306 65.278 12.558 65.055Q12.810 64.832 12.898 64.481Q12.986 64.129 12.986 63.684Q12.986 63.254 12.892 62.916Q12.798 62.579 12.544 62.372Q12.290 62.165 11.849 62.165Q11.200 62.165 10.956 62.581Q10.712 62.997 10.712 63.684Q10.712 64.129 10.800 64.481Q10.888 64.832 11.140 65.055Q11.392 65.278 11.849 65.278M16.220 65.477L14.240 65.477L14.240 65.180Q14.509 65.180 14.677 65.135Q14.845 65.090 14.845 64.918L14.845 62.782Q14.845 62.567 14.783 62.471Q14.720 62.375 14.603 62.354Q14.486 62.332 14.240 62.332L14.240 62.036L15.408 61.950L15.408 62.735Q15.486 62.524 15.638 62.338Q15.790 62.153 15.990 62.051Q16.189 61.950 16.415 61.950Q16.661 61.950 16.853 62.094Q17.044 62.239 17.044 62.469Q17.044 62.625 16.939 62.735Q16.833 62.844 16.677 62.844Q16.521 62.844 16.411 62.735Q16.302 62.625 16.302 62.469Q16.302 62.309 16.408 62.204Q16.083 62.204 15.868 62.432Q15.654 62.661 15.558 63Q15.462 63.340 15.462 63.645L15.462 64.918Q15.462 65.086 15.689 65.133Q15.915 65.180 16.220 65.180\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-39.612 71.167V-63.406\"\u002F>\u003Cpath stroke=\"none\" d=\"m-39.612-65.406-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-22.658 -128.105)\">\u003Cpath d=\"M-37.573 65.446L-38.796 62.590Q-38.878 62.415-39.022 62.370Q-39.167 62.325-39.436 62.325L-39.436 62.028L-37.725 62.028L-37.725 62.325Q-38.147 62.325-38.147 62.508Q-38.147 62.543-38.132 62.590L-37.186 64.782L-36.346 62.805Q-36.307 62.727-36.307 62.637Q-36.307 62.497-36.413 62.411Q-36.518 62.325-36.659 62.325L-36.659 62.028L-35.307 62.028L-35.307 62.325Q-35.831 62.325-36.046 62.805L-37.171 65.446Q-37.233 65.555-37.339 65.555L-37.405 65.555Q-37.518 65.555-37.573 65.446\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-22.658 -128.105)\">\u003Cpath d=\"M-35.262 64.645Q-35.262 64.161-34.860 63.866Q-34.457 63.571-33.907 63.452Q-33.356 63.332-32.864 63.332L-32.864 63.043Q-32.864 62.817-32.979 62.610Q-33.094 62.403-33.291 62.284Q-33.489 62.165-33.719 62.165Q-34.145 62.165-34.430 62.270Q-34.360 62.297-34.313 62.352Q-34.266 62.407-34.241 62.477Q-34.215 62.547-34.215 62.622Q-34.215 62.727-34.266 62.819Q-34.317 62.911-34.409 62.961Q-34.500 63.012-34.606 63.012Q-34.711 63.012-34.803 62.961Q-34.895 62.911-34.946 62.819Q-34.996 62.727-34.996 62.622Q-34.996 62.204-34.608 62.057Q-34.219 61.911-33.719 61.911Q-33.387 61.911-33.034 62.041Q-32.680 62.172-32.452 62.426Q-32.223 62.680-32.223 63.028L-32.223 64.829Q-32.223 64.961-32.151 65.071Q-32.078 65.180-31.950 65.180Q-31.825 65.180-31.756 65.075Q-31.688 64.969-31.688 64.829L-31.688 64.317L-31.407 64.317L-31.407 64.829Q-31.407 65.032-31.524 65.190Q-31.641 65.348-31.823 65.432Q-32.004 65.516-32.207 65.516Q-32.438 65.516-32.590 65.344Q-32.743 65.172-32.774 64.942Q-32.934 65.223-33.243 65.389Q-33.551 65.555-33.903 65.555Q-34.414 65.555-34.838 65.332Q-35.262 65.110-35.262 64.645M-34.575 64.645Q-34.575 64.930-34.348 65.116Q-34.121 65.301-33.828 65.301Q-33.582 65.301-33.358 65.184Q-33.133 65.067-32.998 64.864Q-32.864 64.661-32.864 64.407L-32.864 63.575Q-33.129 63.575-33.414 63.629Q-33.700 63.684-33.971 63.813Q-34.243 63.942-34.409 64.149Q-34.575 64.356-34.575 64.645M-29.200 65.477L-31.032 65.477L-31.032 65.180Q-30.758 65.180-30.590 65.133Q-30.422 65.086-30.422 64.918L-30.422 60.758Q-30.422 60.543-30.485 60.448Q-30.547 60.352-30.666 60.331Q-30.785 60.309-31.032 60.309L-31.032 60.012L-29.809 59.926L-29.809 64.918Q-29.809 65.086-29.641 65.133Q-29.473 65.180-29.200 65.180L-29.200 65.477M-28.071 64.524L-28.071 62.782Q-28.071 62.567-28.133 62.471Q-28.196 62.375-28.315 62.354Q-28.434 62.332-28.680 62.332L-28.680 62.036L-27.434 61.950L-27.434 64.500L-27.434 64.524Q-27.434 64.836-27.379 64.998Q-27.325 65.161-27.174 65.231Q-27.024 65.301-26.703 65.301Q-26.274 65.301-26 64.963Q-25.727 64.625-25.727 64.180L-25.727 62.782Q-25.727 62.567-25.789 62.471Q-25.852 62.375-25.971 62.354Q-26.090 62.332-26.336 62.332L-26.336 62.036L-25.090 61.950L-25.090 64.735Q-25.090 64.946-25.028 65.041Q-24.965 65.137-24.846 65.159Q-24.727 65.180-24.481 65.180L-24.481 65.477L-25.703 65.555L-25.703 64.934Q-25.871 65.223-26.153 65.389Q-26.434 65.555-26.754 65.555Q-28.071 65.555-28.071 64.524M-24.035 63.723Q-24.035 63.243-23.803 62.827Q-23.571 62.411-23.160 62.161Q-22.750 61.911-22.274 61.911Q-21.543 61.911-21.145 62.352Q-20.746 62.793-20.746 63.524Q-20.746 63.629-20.840 63.653L-23.289 63.653L-23.289 63.723Q-23.289 64.133-23.168 64.489Q-23.047 64.844-22.776 65.061Q-22.504 65.278-22.075 65.278Q-21.711 65.278-21.414 65.049Q-21.118 64.821-21.016 64.469Q-21.008 64.422-20.922 64.407L-20.840 64.407Q-20.746 64.434-20.746 64.516Q-20.746 64.524-20.754 64.555Q-20.817 64.782-20.955 64.965Q-21.094 65.149-21.285 65.282Q-21.477 65.415-21.696 65.485Q-21.914 65.555-22.153 65.555Q-22.524 65.555-22.862 65.418Q-23.200 65.282-23.467 65.030Q-23.735 64.778-23.885 64.438Q-24.035 64.098-24.035 63.723M-23.282 63.415L-21.321 63.415Q-21.321 63.110-21.422 62.819Q-21.524 62.528-21.741 62.346Q-21.957 62.165-22.274 62.165Q-22.575 62.165-22.805 62.352Q-23.035 62.540-23.159 62.831Q-23.282 63.122-23.282 63.415\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M17.293 65.477V-59.715H85.58V65.477ZM85.58-59.715\"\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(62.357 -128.858)\">\u003Cpath d=\"M-37.514 65.477L-39.292 65.477L-39.292 65.180Q-39.018 65.180-38.850 65.133Q-38.682 65.086-38.682 64.918L-38.682 62.782Q-38.682 62.567-38.739 62.471Q-38.796 62.375-38.909 62.354Q-39.022 62.332-39.268 62.332L-39.268 62.036L-38.069 61.950L-38.069 64.918Q-38.069 65.086-37.923 65.133Q-37.776 65.180-37.514 65.180L-37.514 65.477M-38.956 60.555Q-38.956 60.364-38.821 60.233Q-38.686 60.102-38.491 60.102Q-38.370 60.102-38.266 60.165Q-38.163 60.227-38.100 60.331Q-38.038 60.434-38.038 60.555Q-38.038 60.750-38.169 60.885Q-38.300 61.020-38.491 61.020Q-38.690 61.020-38.823 60.887Q-38.956 60.754-38.956 60.555M-35.085 65.477L-36.940 65.477L-36.940 65.180Q-36.667 65.180-36.499 65.133Q-36.331 65.086-36.331 64.918L-36.331 62.782Q-36.331 62.567-36.393 62.471Q-36.456 62.375-36.575 62.354Q-36.694 62.332-36.940 62.332L-36.940 62.036L-35.749 61.950L-35.749 62.684Q-35.635 62.469-35.442 62.301Q-35.249 62.133-35.010 62.041Q-34.772 61.950-34.518 61.950Q-33.350 61.950-33.350 63.028L-33.350 64.918Q-33.350 65.086-33.180 65.133Q-33.010 65.180-32.741 65.180L-32.741 65.477L-34.596 65.477L-34.596 65.180Q-34.323 65.180-34.155 65.133Q-33.987 65.086-33.987 64.918L-33.987 63.043Q-33.987 62.661-34.108 62.432Q-34.229 62.204-34.581 62.204Q-34.893 62.204-35.147 62.366Q-35.401 62.528-35.548 62.797Q-35.694 63.067-35.694 63.364L-35.694 64.918Q-35.694 65.086-35.524 65.133Q-35.354 65.180-35.085 65.180\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(62.357 -128.858)\">\u003Cpath d=\"M-31.902 64.516L-31.902 62.325L-32.605 62.325L-32.605 62.071Q-32.249 62.071-32.007 61.838Q-31.765 61.606-31.654 61.258Q-31.542 60.911-31.542 60.555L-31.261 60.555L-31.261 62.028L-30.085 62.028L-30.085 62.325L-31.261 62.325L-31.261 64.500Q-31.261 64.821-31.142 65.049Q-31.023 65.278-30.742 65.278Q-30.562 65.278-30.445 65.155Q-30.328 65.032-30.275 64.852Q-30.222 64.672-30.222 64.500L-30.222 64.028L-29.941 64.028L-29.941 64.516Q-29.941 64.770-30.046 65.010Q-30.152 65.250-30.349 65.403Q-30.546 65.555-30.804 65.555Q-31.120 65.555-31.372 65.432Q-31.624 65.309-31.763 65.075Q-31.902 64.840-31.902 64.516M-29.222 63.723Q-29.222 63.243-28.990 62.827Q-28.757 62.411-28.347 62.161Q-27.937 61.911-27.460 61.911Q-26.730 61.911-26.331 62.352Q-25.933 62.793-25.933 63.524Q-25.933 63.629-26.027 63.653L-28.476 63.653L-28.476 63.723Q-28.476 64.133-28.355 64.489Q-28.234 64.844-27.962 65.061Q-27.691 65.278-27.261 65.278Q-26.898 65.278-26.601 65.049Q-26.304 64.821-26.203 64.469Q-26.195 64.422-26.109 64.407L-26.027 64.407Q-25.933 64.434-25.933 64.516Q-25.933 64.524-25.941 64.555Q-26.003 64.782-26.142 64.965Q-26.281 65.149-26.472 65.282Q-26.663 65.415-26.882 65.485Q-27.101 65.555-27.339 65.555Q-27.710 65.555-28.048 65.418Q-28.386 65.282-28.654 65.030Q-28.921 64.778-29.072 64.438Q-29.222 64.098-29.222 63.723M-28.468 63.415L-26.507 63.415Q-26.507 63.110-26.609 62.819Q-26.710 62.528-26.927 62.346Q-27.144 62.165-27.460 62.165Q-27.761 62.165-27.992 62.352Q-28.222 62.540-28.345 62.831Q-28.468 63.122-28.468 63.415M-23.515 65.477L-25.370 65.477L-25.370 65.180Q-25.097 65.180-24.929 65.133Q-24.761 65.086-24.761 64.918L-24.761 62.782Q-24.761 62.567-24.824 62.471Q-24.886 62.375-25.005 62.354Q-25.124 62.332-25.370 62.332L-25.370 62.036L-24.179 61.950L-24.179 62.684Q-24.066 62.469-23.872 62.301Q-23.679 62.133-23.441 62.041Q-23.203 61.950-22.949 61.950Q-21.781 61.950-21.781 63.028L-21.781 64.918Q-21.781 65.086-21.611 65.133Q-21.441 65.180-21.171 65.180L-21.171 65.477L-23.027 65.477L-23.027 65.180Q-22.753 65.180-22.585 65.133Q-22.417 65.086-22.417 64.918L-22.417 63.043Q-22.417 62.661-22.538 62.432Q-22.660 62.204-23.011 62.204Q-23.324 62.204-23.578 62.366Q-23.831 62.528-23.978 62.797Q-24.124 63.067-24.124 63.364L-24.124 64.918Q-24.124 65.086-23.954 65.133Q-23.785 65.180-23.515 65.180L-23.515 65.477M-18.910 65.555Q-19.390 65.555-19.798 65.311Q-20.206 65.067-20.445 64.653Q-20.683 64.239-20.683 63.750Q-20.683 63.258-20.425 62.842Q-20.167 62.426-19.736 62.188Q-19.304 61.950-18.812 61.950Q-18.191 61.950-17.742 62.387L-17.742 60.758Q-17.742 60.543-17.804 60.448Q-17.867 60.352-17.984 60.331Q-18.101 60.309-18.347 60.309L-18.347 60.012L-17.124 59.926L-17.124 64.735Q-17.124 64.946-17.062 65.041Q-16.999 65.137-16.882 65.159Q-16.765 65.180-16.515 65.180L-16.515 65.477L-17.765 65.555L-17.765 65.071Q-18.230 65.555-18.910 65.555M-18.843 65.301Q-18.503 65.301-18.210 65.110Q-17.917 64.918-17.765 64.622L-17.765 62.790Q-17.913 62.516-18.175 62.360Q-18.437 62.204-18.749 62.204Q-19.374 62.204-19.658 62.651Q-19.941 63.098-19.941 63.758Q-19.941 64.403-19.689 64.852Q-19.437 65.301-18.843 65.301M-16.007 63.723Q-16.007 63.243-15.775 62.827Q-15.542 62.411-15.132 62.161Q-14.722 61.911-14.245 61.911Q-13.515 61.911-13.117 62.352Q-12.718 62.793-12.718 63.524Q-12.718 63.629-12.812 63.653L-15.261 63.653L-15.261 63.723Q-15.261 64.133-15.140 64.489Q-15.019 64.844-14.747 65.061Q-14.476 65.278-14.046 65.278Q-13.683 65.278-13.386 65.049Q-13.089 64.821-12.988 64.469Q-12.980 64.422-12.894 64.407L-12.812 64.407Q-12.718 64.434-12.718 64.516Q-12.718 64.524-12.726 64.555Q-12.788 64.782-12.927 64.965Q-13.066 65.149-13.257 65.282Q-13.449 65.415-13.667 65.485Q-13.886 65.555-14.124 65.555Q-14.495 65.555-14.833 65.418Q-15.171 65.282-15.439 65.030Q-15.706 64.778-15.857 64.438Q-16.007 64.098-16.007 63.723M-15.253 63.415L-13.292 63.415Q-13.292 63.110-13.394 62.819Q-13.495 62.528-13.712 62.346Q-13.929 62.165-14.245 62.165Q-14.546 62.165-14.777 62.352Q-15.007 62.540-15.130 62.831Q-15.253 63.122-15.253 63.415M-10.413 65.555Q-10.894 65.555-11.302 65.311Q-11.710 65.067-11.949 64.653Q-12.187 64.239-12.187 63.750Q-12.187 63.258-11.929 62.842Q-11.671 62.426-11.240 62.188Q-10.808 61.950-10.316 61.950Q-9.695 61.950-9.245 62.387L-9.245 60.758Q-9.245 60.543-9.308 60.448Q-9.370 60.352-9.488 60.331Q-9.605 60.309-9.851 60.309L-9.851 60.012L-8.628 59.926L-8.628 64.735Q-8.628 64.946-8.566 65.041Q-8.503 65.137-8.386 65.159Q-8.269 65.180-8.019 65.180L-8.019 65.477L-9.269 65.555L-9.269 65.071Q-9.734 65.555-10.413 65.555M-10.347 65.301Q-10.007 65.301-9.714 65.110Q-9.421 64.918-9.269 64.622L-9.269 62.790Q-9.417 62.516-9.679 62.360Q-9.941 62.204-10.253 62.204Q-10.878 62.204-11.161 62.651Q-11.445 63.098-11.445 63.758Q-11.445 64.403-11.193 64.852Q-10.941 65.301-10.347 65.301\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(62.357 -128.858)\">\u003Cpath d=\"M-2.657 65.477L-4.637 65.477L-4.637 65.180Q-4.368 65.180-4.200 65.135Q-4.032 65.090-4.032 64.918L-4.032 62.782Q-4.032 62.567-4.094 62.471Q-4.157 62.375-4.274 62.354Q-4.391 62.332-4.637 62.332L-4.637 62.036L-3.469 61.950L-3.469 62.735Q-3.391 62.524-3.239 62.338Q-3.087 62.153-2.887 62.051Q-2.688 61.950-2.462 61.950Q-2.215 61.950-2.024 62.094Q-1.833 62.239-1.833 62.469Q-1.833 62.625-1.938 62.735Q-2.044 62.844-2.200 62.844Q-2.356 62.844-2.465 62.735Q-2.575 62.625-2.575 62.469Q-2.575 62.309-2.469 62.204Q-2.794 62.204-3.008 62.432Q-3.223 62.661-3.319 63Q-3.415 63.340-3.415 63.645L-3.415 64.918Q-3.415 65.086-3.188 65.133Q-2.962 65.180-2.657 65.180L-2.657 65.477M-1.352 63.723Q-1.352 63.243-1.120 62.827Q-0.887 62.411-0.477 62.161Q-0.067 61.911 0.410 61.911Q1.140 61.911 1.538 62.352Q1.937 62.793 1.937 63.524Q1.937 63.629 1.843 63.653L-0.606 63.653L-0.606 63.723Q-0.606 64.133-0.485 64.489Q-0.364 64.844-0.092 65.061Q0.179 65.278 0.609 65.278Q0.972 65.278 1.269 65.049Q1.566 64.821 1.667 64.469Q1.675 64.422 1.761 64.407L1.843 64.407Q1.937 64.434 1.937 64.516Q1.937 64.524 1.929 64.555Q1.867 64.782 1.728 64.965Q1.589 65.149 1.398 65.282Q1.206 65.415 0.988 65.485Q0.769 65.555 0.531 65.555Q0.160 65.555-0.178 65.418Q-0.516 65.282-0.784 65.030Q-1.051 64.778-1.202 64.438Q-1.352 64.098-1.352 63.723M-0.598 63.415L1.363 63.415Q1.363 63.110 1.261 62.819Q1.160 62.528 0.943 62.346Q0.726 62.165 0.410 62.165Q0.109 62.165-0.122 62.352Q-0.352 62.540-0.475 62.831Q-0.598 63.122-0.598 63.415M2.425 66.086Q2.425 65.805 2.636 65.594Q2.847 65.383 3.132 65.293Q2.976 65.168 2.898 64.979Q2.820 64.790 2.820 64.590Q2.820 64.235 3.050 63.942Q2.683 63.602 2.683 63.133Q2.683 62.782 2.886 62.512Q3.089 62.243 3.410 62.096Q3.730 61.950 4.074 61.950Q4.593 61.950 4.964 62.231Q5.327 61.860 5.874 61.860Q6.054 61.860 6.181 61.987Q6.308 62.114 6.308 62.293Q6.308 62.399 6.230 62.477Q6.152 62.555 6.042 62.555Q5.933 62.555 5.857 62.479Q5.781 62.403 5.781 62.293Q5.781 62.192 5.820 62.141Q5.827 62.133 5.831 62.127Q5.835 62.122 5.835 62.118Q5.460 62.118 5.140 62.372Q5.460 62.711 5.460 63.133Q5.460 63.403 5.343 63.620Q5.226 63.836 5.021 63.995Q4.816 64.153 4.574 64.235Q4.331 64.317 4.074 64.317Q3.855 64.317 3.642 64.258Q3.429 64.200 3.234 64.079Q3.140 64.219 3.140 64.399Q3.140 64.606 3.277 64.758Q3.413 64.911 3.620 64.911L4.316 64.911Q4.804 64.911 5.216 64.995Q5.628 65.079 5.908 65.336Q6.187 65.594 6.187 66.086Q6.187 66.450 5.867 66.682Q5.546 66.915 5.105 67.016Q4.663 67.118 4.308 67.118Q3.952 67.118 3.509 67.016Q3.066 66.915 2.745 66.682Q2.425 66.450 2.425 66.086M2.929 66.086Q2.929 66.282 3.074 66.430Q3.218 66.579 3.431 66.668Q3.644 66.758 3.884 66.805Q4.124 66.852 4.308 66.852Q4.550 66.852 4.880 66.774Q5.210 66.696 5.447 66.522Q5.683 66.348 5.683 66.086Q5.683 65.680 5.273 65.571Q4.863 65.461 4.300 65.461L3.620 65.461Q3.351 65.461 3.140 65.639Q2.929 65.817 2.929 66.086M4.074 64.051Q4.796 64.051 4.796 63.133Q4.796 62.211 4.074 62.211Q3.347 62.211 3.347 63.133Q3.347 64.051 4.074 64.051M8.531 65.477L6.753 65.477L6.753 65.180Q7.027 65.180 7.195 65.133Q7.363 65.086 7.363 64.918L7.363 62.782Q7.363 62.567 7.306 62.471Q7.249 62.375 7.136 62.354Q7.023 62.332 6.777 62.332L6.777 62.036L7.976 61.950L7.976 64.918Q7.976 65.086 8.122 65.133Q8.269 65.180 8.531 65.180L8.531 65.477M7.089 60.555Q7.089 60.364 7.224 60.233Q7.359 60.102 7.554 60.102Q7.675 60.102 7.779 60.165Q7.882 60.227 7.945 60.331Q8.007 60.434 8.007 60.555Q8.007 60.750 7.876 60.885Q7.745 61.020 7.554 61.020Q7.355 61.020 7.222 60.887Q7.089 60.754 7.089 60.555M9.031 63.782Q9.031 63.278 9.286 62.846Q9.542 62.415 9.978 62.163Q10.413 61.911 10.913 61.911Q11.300 61.911 11.642 62.055Q11.984 62.200 12.245 62.461Q12.507 62.723 12.650 63.059Q12.792 63.395 12.792 63.782Q12.792 64.274 12.529 64.684Q12.265 65.094 11.835 65.325Q11.406 65.555 10.913 65.555Q10.421 65.555 9.988 65.323Q9.554 65.090 9.292 64.682Q9.031 64.274 9.031 63.782M10.913 65.278Q11.370 65.278 11.622 65.055Q11.874 64.832 11.962 64.481Q12.050 64.129 12.050 63.684Q12.050 63.254 11.956 62.916Q11.863 62.579 11.609 62.372Q11.355 62.165 10.913 62.165Q10.265 62.165 10.021 62.581Q9.777 62.997 9.777 63.684Q9.777 64.129 9.865 64.481Q9.952 64.832 10.204 65.055Q10.456 65.278 10.913 65.278M15.206 65.477L13.351 65.477L13.351 65.180Q13.624 65.180 13.792 65.133Q13.960 65.086 13.960 64.918L13.960 62.782Q13.960 62.567 13.898 62.471Q13.835 62.375 13.716 62.354Q13.597 62.332 13.351 62.332L13.351 62.036L14.542 61.950L14.542 62.684Q14.656 62.469 14.849 62.301Q15.042 62.133 15.281 62.041Q15.519 61.950 15.773 61.950Q16.941 61.950 16.941 63.028L16.941 64.918Q16.941 65.086 17.111 65.133Q17.281 65.180 17.550 65.180L17.550 65.477L15.695 65.477L15.695 65.180Q15.968 65.180 16.136 65.133Q16.304 65.086 16.304 64.918L16.304 63.043Q16.304 62.661 16.183 62.432Q16.062 62.204 15.710 62.204Q15.398 62.204 15.144 62.366Q14.890 62.528 14.743 62.797Q14.597 63.067 14.597 63.364L14.597 64.918Q14.597 65.086 14.767 65.133Q14.937 65.180 15.206 65.180\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-28.231 39.87S-7.674 28.72.222 22.797C8.117 16.876 21.568 2.125 28.674-2.81c7.106-4.934 16.446-9.564 22.763-9.958 6.316-.395 16.445 3.757 22.762 7.113C80.515-2.3 89.066 6.285 96.96 11.417c7.896 5.132 24.669 15.771 34.143 19.916 9.475 4.146 23.88 7.985 34.144 9.959s39.834 4.268 39.834 4.268\" style=\"stroke-dasharray:3.0,3.0;stroke-width:.8\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(249.649 -17.917)\">\u003Cpath d=\"M-38.749 64.516L-38.749 62.325L-39.452 62.325L-39.452 62.071Q-39.096 62.071-38.854 61.838Q-38.612 61.606-38.501 61.258Q-38.389 60.911-38.389 60.555L-38.108 60.555L-38.108 62.028L-36.932 62.028L-36.932 62.325L-38.108 62.325L-38.108 64.500Q-38.108 64.821-37.989 65.049Q-37.870 65.278-37.589 65.278Q-37.409 65.278-37.292 65.155Q-37.175 65.032-37.122 64.852Q-37.069 64.672-37.069 64.500L-37.069 64.028L-36.788 64.028L-36.788 64.516Q-36.788 64.770-36.893 65.010Q-36.999 65.250-37.196 65.403Q-37.393 65.555-37.651 65.555Q-37.967 65.555-38.219 65.432Q-38.471 65.309-38.610 65.075Q-38.749 64.840-38.749 64.516M-34.061 65.477L-36.042 65.477L-36.042 65.180Q-35.772 65.180-35.604 65.135Q-35.436 65.090-35.436 64.918L-35.436 62.782Q-35.436 62.567-35.499 62.471Q-35.561 62.375-35.678 62.354Q-35.796 62.332-36.042 62.332L-36.042 62.036L-34.874 61.950L-34.874 62.735Q-34.796 62.524-34.643 62.338Q-34.491 62.153-34.292 62.051Q-34.092 61.950-33.866 61.950Q-33.620 61.950-33.428 62.094Q-33.237 62.239-33.237 62.469Q-33.237 62.625-33.342 62.735Q-33.448 62.844-33.604 62.844Q-33.760 62.844-33.870 62.735Q-33.979 62.625-33.979 62.469Q-33.979 62.309-33.874 62.204Q-34.198 62.204-34.413 62.432Q-34.628 62.661-34.723 63Q-34.819 63.340-34.819 63.645L-34.819 64.918Q-34.819 65.086-34.592 65.133Q-34.366 65.180-34.061 65.180L-34.061 65.477M-32.073 64.524L-32.073 62.782Q-32.073 62.567-32.135 62.471Q-32.198 62.375-32.317 62.354Q-32.436 62.332-32.682 62.332L-32.682 62.036L-31.436 61.950L-31.436 64.500L-31.436 64.524Q-31.436 64.836-31.382 64.998Q-31.327 65.161-31.176 65.231Q-31.026 65.301-30.706 65.301Q-30.276 65.301-30.003 64.963Q-29.729 64.625-29.729 64.180L-29.729 62.782Q-29.729 62.567-29.792 62.471Q-29.854 62.375-29.973 62.354Q-30.092 62.332-30.339 62.332L-30.339 62.036L-29.092 61.950L-29.092 64.735Q-29.092 64.946-29.030 65.041Q-28.967 65.137-28.848 65.159Q-28.729 65.180-28.483 65.180L-28.483 65.477L-29.706 65.555L-29.706 64.934Q-29.874 65.223-30.155 65.389Q-30.436 65.555-30.757 65.555Q-32.073 65.555-32.073 64.524M-28.038 63.723Q-28.038 63.243-27.805 62.827Q-27.573 62.411-27.163 62.161Q-26.753 61.911-26.276 61.911Q-25.546 61.911-25.147 62.352Q-24.749 62.793-24.749 63.524Q-24.749 63.629-24.842 63.653L-27.292 63.653L-27.292 63.723Q-27.292 64.133-27.171 64.489Q-27.050 64.844-26.778 65.061Q-26.507 65.278-26.077 65.278Q-25.714 65.278-25.417 65.049Q-25.120 64.821-25.018 64.469Q-25.010 64.422-24.925 64.407L-24.842 64.407Q-24.749 64.434-24.749 64.516Q-24.749 64.524-24.757 64.555Q-24.819 64.782-24.958 64.965Q-25.096 65.149-25.288 65.282Q-25.479 65.415-25.698 65.485Q-25.917 65.555-26.155 65.555Q-26.526 65.555-26.864 65.418Q-27.202 65.282-27.469 65.030Q-27.737 64.778-27.887 64.438Q-28.038 64.098-28.038 63.723M-27.284 63.415L-25.323 63.415Q-25.323 63.110-25.425 62.819Q-25.526 62.528-25.743 62.346Q-25.960 62.165-26.276 62.165Q-26.577 62.165-26.807 62.352Q-27.038 62.540-27.161 62.831Q-27.284 63.122-27.284 63.415\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(249.649 -17.917)\">\u003Cpath d=\"M-21.422 63.782Q-21.422 63.278-21.166 62.846Q-20.910 62.415-20.474 62.163Q-20.039 61.911-19.539 61.911Q-19.152 61.911-18.810 62.055Q-18.469 62.200-18.207 62.461Q-17.945 62.723-17.803 63.059Q-17.660 63.395-17.660 63.782Q-17.660 64.274-17.924 64.684Q-18.187 65.094-18.617 65.325Q-19.047 65.555-19.539 65.555Q-20.031 65.555-20.465 65.323Q-20.898 65.090-21.160 64.682Q-21.422 64.274-21.422 63.782M-19.539 65.278Q-19.082 65.278-18.830 65.055Q-18.578 64.832-18.490 64.481Q-18.402 64.129-18.402 63.684Q-18.402 63.254-18.496 62.916Q-18.590 62.579-18.844 62.372Q-19.098 62.165-19.539 62.165Q-20.187 62.165-20.431 62.581Q-20.676 62.997-20.676 63.684Q-20.676 64.129-20.588 64.481Q-20.500 64.832-20.248 65.055Q-19.996 65.278-19.539 65.278M-16.262 65.477L-16.543 65.477L-16.543 60.758Q-16.543 60.543-16.605 60.448Q-16.668 60.352-16.785 60.331Q-16.902 60.309-17.148 60.309L-17.148 60.012L-15.926 59.926L-15.926 62.415Q-15.449 61.950-14.750 61.950Q-14.269 61.950-13.861 62.194Q-13.453 62.438-13.217 62.852Q-12.980 63.266-12.980 63.750Q-12.980 64.125-13.129 64.454Q-13.277 64.782-13.547 65.034Q-13.816 65.286-14.160 65.420Q-14.504 65.555-14.863 65.555Q-15.183 65.555-15.482 65.407Q-15.781 65.258-15.988 64.997L-16.262 65.477M-15.902 62.805L-15.902 64.645Q-15.750 64.942-15.490 65.122Q-15.230 65.301-14.918 65.301Q-14.492 65.301-14.224 65.082Q-13.957 64.864-13.842 64.518Q-13.726 64.172-13.726 63.750Q-13.726 63.102-13.974 62.653Q-14.223 62.204-14.820 62.204Q-15.156 62.204-15.445 62.362Q-15.734 62.520-15.902 62.805\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(249.649 -17.917)\">\u003Cpath d=\"M-12.536 66.454Q-12.536 66.348-12.486 66.256Q-12.435 66.165-12.343 66.114Q-12.251 66.063-12.146 66.063Q-12.036 66.063-11.945 66.114Q-11.853 66.165-11.802 66.256Q-11.751 66.348-11.751 66.454Q-11.751 66.668-11.943 66.790Q-11.786 66.852-11.560 66.852Q-11.259 66.852-11.130 66.543Q-11.001 66.235-11.001 65.868L-11.001 62.782Q-11.001 62.477-11.148 62.405Q-11.294 62.332-11.673 62.332L-11.673 62.036L-10.384 61.950L-10.384 65.891Q-10.384 66.211-10.544 66.495Q-10.704 66.778-10.982 66.944Q-11.259 67.110-11.575 67.110Q-11.935 67.110-12.236 66.946Q-12.536 66.782-12.536 66.454M-11.306 60.555Q-11.306 60.372-11.167 60.237Q-11.028 60.102-10.841 60.102Q-10.653 60.102-10.519 60.233Q-10.384 60.364-10.384 60.555Q-10.384 60.754-10.517 60.887Q-10.650 61.020-10.841 61.020Q-11.032 61.020-11.169 60.883Q-11.306 60.747-11.306 60.555M-9.384 63.723Q-9.384 63.243-9.152 62.827Q-8.919 62.411-8.509 62.161Q-8.099 61.911-7.622 61.911Q-6.892 61.911-6.493 62.352Q-6.095 62.793-6.095 63.524Q-6.095 63.629-6.189 63.653L-8.638 63.653L-8.638 63.723Q-8.638 64.133-8.517 64.489Q-8.396 64.844-8.124 65.061Q-7.853 65.278-7.423 65.278Q-7.060 65.278-6.763 65.049Q-6.466 64.821-6.364 64.469Q-6.357 64.422-6.271 64.407L-6.189 64.407Q-6.095 64.434-6.095 64.516Q-6.095 64.524-6.103 64.555Q-6.165 64.782-6.304 64.965Q-6.443 65.149-6.634 65.282Q-6.825 65.415-7.044 65.485Q-7.263 65.555-7.501 65.555Q-7.872 65.555-8.210 65.418Q-8.548 65.282-8.816 65.030Q-9.083 64.778-9.234 64.438Q-9.384 64.098-9.384 63.723M-8.630 63.415L-6.669 63.415Q-6.669 63.110-6.771 62.819Q-6.872 62.528-7.089 62.346Q-7.306 62.165-7.622 62.165Q-7.923 62.165-8.153 62.352Q-8.384 62.540-8.507 62.831Q-8.630 63.122-8.630 63.415M-5.564 63.750Q-5.564 63.254-5.314 62.829Q-5.064 62.403-4.644 62.157Q-4.224 61.911-3.724 61.911Q-3.185 61.911-2.794 62.036Q-2.403 62.161-2.403 62.575Q-2.403 62.680-2.454 62.772Q-2.505 62.864-2.597 62.915Q-2.689 62.965-2.798 62.965Q-2.903 62.965-2.995 62.915Q-3.087 62.864-3.138 62.772Q-3.189 62.680-3.189 62.575Q-3.189 62.352-3.021 62.247Q-3.243 62.188-3.716 62.188Q-4.013 62.188-4.228 62.327Q-4.443 62.465-4.573 62.696Q-4.704 62.926-4.763 63.196Q-4.821 63.465-4.821 63.750Q-4.821 64.145-4.689 64.495Q-4.556 64.844-4.284 65.061Q-4.013 65.278-3.614 65.278Q-3.239 65.278-2.964 65.061Q-2.689 64.844-2.587 64.485Q-2.571 64.422-2.509 64.422L-2.403 64.422Q-2.368 64.422-2.343 64.450Q-2.318 64.477-2.318 64.516L-2.318 64.540Q-2.450 65.020-2.835 65.288Q-3.220 65.555-3.724 65.555Q-4.087 65.555-4.421 65.418Q-4.755 65.282-5.015 65.032Q-5.275 64.782-5.419 64.446Q-5.564 64.110-5.564 63.750M-1.204 64.516L-1.204 62.325L-1.907 62.325L-1.907 62.071Q-1.552 62.071-1.310 61.838Q-1.068 61.606-0.956 61.258Q-0.845 60.911-0.845 60.555L-0.564 60.555L-0.564 62.028L0.612 62.028L0.612 62.325L-0.564 62.325L-0.564 64.500Q-0.564 64.821-0.445 65.049Q-0.325 65.278-0.044 65.278Q0.136 65.278 0.253 65.155Q0.370 65.032 0.423 64.852Q0.475 64.672 0.475 64.500L0.475 64.028L0.757 64.028L0.757 64.516Q0.757 64.770 0.651 65.010Q0.546 65.250 0.348 65.403Q0.151 65.555-0.107 65.555Q-0.423 65.555-0.675 65.432Q-0.927 65.309-1.066 65.075Q-1.204 64.840-1.204 64.516M3.335 65.477L1.557 65.477L1.557 65.180Q1.831 65.180 1.999 65.133Q2.167 65.086 2.167 64.918L2.167 62.782Q2.167 62.567 2.110 62.471Q2.054 62.375 1.940 62.354Q1.827 62.332 1.581 62.332L1.581 62.036L2.780 61.950L2.780 64.918Q2.780 65.086 2.927 65.133Q3.073 65.180 3.335 65.180L3.335 65.477M1.893 60.555Q1.893 60.364 2.028 60.233Q2.163 60.102 2.358 60.102Q2.479 60.102 2.583 60.165Q2.686 60.227 2.749 60.331Q2.811 60.434 2.811 60.555Q2.811 60.750 2.680 60.885Q2.550 61.020 2.358 61.020Q2.159 61.020 2.026 60.887Q1.893 60.754 1.893 60.555M5.636 65.446L4.413 62.590Q4.331 62.415 4.186 62.370Q4.042 62.325 3.772 62.325L3.772 62.028L5.483 62.028L5.483 62.325Q5.061 62.325 5.061 62.508Q5.061 62.543 5.077 62.590L6.022 64.782L6.862 62.805Q6.901 62.727 6.901 62.637Q6.901 62.497 6.796 62.411Q6.690 62.325 6.550 62.325L6.550 62.028L7.901 62.028L7.901 62.325Q7.378 62.325 7.163 62.805L6.038 65.446Q5.975 65.555 5.870 65.555L5.804 65.555Q5.690 65.555 5.636 65.446\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(249.649 -17.917)\">\u003Cpath d=\"M8.092 63.723Q8.092 63.243 8.325 62.827Q8.557 62.411 8.967 62.161Q9.377 61.911 9.854 61.911Q10.584 61.911 10.983 62.352Q11.381 62.793 11.381 63.524Q11.381 63.629 11.288 63.653L8.838 63.653L8.838 63.723Q8.838 64.133 8.959 64.489Q9.081 64.844 9.352 65.061Q9.624 65.278 10.053 65.278Q10.416 65.278 10.713 65.049Q11.010 64.821 11.112 64.469Q11.120 64.422 11.206 64.407L11.288 64.407Q11.381 64.434 11.381 64.516Q11.381 64.524 11.374 64.555Q11.311 64.782 11.172 64.965Q11.034 65.149 10.842 65.282Q10.651 65.415 10.432 65.485Q10.213 65.555 9.975 65.555Q9.604 65.555 9.266 65.418Q8.928 65.282 8.661 65.030Q8.393 64.778 8.243 64.438Q8.092 64.098 8.092 63.723M8.846 63.415L10.807 63.415Q10.807 63.110 10.706 62.819Q10.604 62.528 10.387 62.346Q10.170 62.165 9.854 62.165Q9.553 62.165 9.323 62.352Q9.092 62.540 8.969 62.831Q8.846 63.122 8.846 63.415\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-warn)\" d=\"M-28.231 39.87S-7.674 28.72.222 22.797C8.117 16.876 21.568 2.125 28.674-2.81c7.106-4.934 16.446-9.169 22.763-9.958 6.316-.79 16.445 3.28 22.762 4.267 6.316.987 14.867 5.214 22.762 2.846 7.896-2.369 24.669-14.39 34.143-19.917s23.88-15.574 34.144-19.917c10.264-4.342 39.834-11.381 39.834-11.381\" style=\"stroke-width:.8\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(165.714 -94.74)\">\u003Cpath d=\"M-37.491 67.028L-39.346 67.028L-39.346 66.735Q-39.077 66.735-38.909 66.690Q-38.741 66.645-38.741 66.469L-38.741 62.645Q-38.741 62.438-38.897 62.385Q-39.053 62.332-39.346 62.332L-39.346 62.036L-38.124 61.950L-38.124 62.415Q-37.893 62.192-37.579 62.071Q-37.264 61.950-36.925 61.950Q-36.452 61.950-36.048 62.196Q-35.643 62.442-35.411 62.858Q-35.178 63.274-35.178 63.750Q-35.178 64.125-35.327 64.454Q-35.475 64.782-35.745 65.034Q-36.014 65.286-36.358 65.420Q-36.702 65.555-37.061 65.555Q-37.350 65.555-37.622 65.434Q-37.893 65.313-38.100 65.102L-38.100 66.469Q-38.100 66.645-37.932 66.690Q-37.764 66.735-37.491 66.735L-37.491 67.028M-38.100 62.813L-38.100 64.653Q-37.948 64.942-37.686 65.122Q-37.425 65.301-37.116 65.301Q-36.831 65.301-36.608 65.163Q-36.385 65.024-36.233 64.793Q-36.081 64.563-36.003 64.291Q-35.925 64.020-35.925 63.750Q-35.925 63.418-36.050 63.061Q-36.175 62.704-36.423 62.467Q-36.671 62.231-37.018 62.231Q-37.342 62.231-37.637 62.387Q-37.932 62.543-38.100 62.813M-32.647 65.477L-34.628 65.477L-34.628 65.180Q-34.358 65.180-34.190 65.135Q-34.022 65.090-34.022 64.918L-34.022 62.782Q-34.022 62.567-34.085 62.471Q-34.147 62.375-34.264 62.354Q-34.382 62.332-34.628 62.332L-34.628 62.036L-33.460 61.950L-33.460 62.735Q-33.382 62.524-33.229 62.338Q-33.077 62.153-32.878 62.051Q-32.678 61.950-32.452 61.950Q-32.206 61.950-32.014 62.094Q-31.823 62.239-31.823 62.469Q-31.823 62.625-31.928 62.735Q-32.034 62.844-32.190 62.844Q-32.346 62.844-32.456 62.735Q-32.565 62.625-32.565 62.469Q-32.565 62.309-32.460 62.204Q-32.784 62.204-32.999 62.432Q-33.214 62.661-33.309 63Q-33.405 63.340-33.405 63.645L-33.405 64.918Q-33.405 65.086-33.178 65.133Q-32.952 65.180-32.647 65.180L-32.647 65.477M-31.342 63.782Q-31.342 63.278-31.087 62.846Q-30.831 62.415-30.395 62.163Q-29.960 61.911-29.460 61.911Q-29.073 61.911-28.731 62.055Q-28.389 62.200-28.128 62.461Q-27.866 62.723-27.723 63.059Q-27.581 63.395-27.581 63.782Q-27.581 64.274-27.844 64.684Q-28.108 65.094-28.538 65.325Q-28.967 65.555-29.460 65.555Q-29.952 65.555-30.385 65.323Q-30.819 65.090-31.081 64.682Q-31.342 64.274-31.342 63.782M-29.460 65.278Q-29.003 65.278-28.751 65.055Q-28.499 64.832-28.411 64.481Q-28.323 64.129-28.323 63.684Q-28.323 63.254-28.417 62.916Q-28.510 62.579-28.764 62.372Q-29.018 62.165-29.460 62.165Q-30.108 62.165-30.352 62.581Q-30.596 62.997-30.596 63.684Q-30.596 64.129-30.508 64.481Q-30.421 64.832-30.169 65.055Q-29.917 65.278-29.460 65.278\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(165.714 -94.74)\">\u003Cpath d=\"M-25.938 65.477L-27.434 65.477L-27.434 65.180Q-26.801 65.180-26.379 64.700L-25.610 63.790L-26.602 62.590Q-26.758 62.411-26.920 62.368Q-27.083 62.325-27.387 62.325L-27.387 62.028L-25.700 62.028L-25.700 62.325Q-25.793 62.325-25.870 62.368Q-25.946 62.411-25.946 62.500Q-25.946 62.543-25.915 62.590L-25.258 63.379L-24.778 62.805Q-24.661 62.668-24.661 62.532Q-24.661 62.442-24.711 62.383Q-24.762 62.325-24.844 62.325L-24.844 62.028L-23.356 62.028L-23.356 62.325Q-23.993 62.325-24.403 62.805L-25.083 63.606L-23.997 64.918Q-23.836 65.094-23.676 65.137Q-23.516 65.180-23.211 65.180L-23.211 65.477L-24.899 65.477L-24.899 65.180Q-24.809 65.180-24.731 65.137Q-24.653 65.094-24.653 65.004Q-24.653 64.981-24.684 64.918L-25.426 64.012L-26.012 64.700Q-26.129 64.836-26.129 64.973Q-26.129 65.059-26.079 65.120Q-26.028 65.180-25.938 65.180L-25.938 65.477M-22.426 66.774Q-22.313 66.852-22.137 66.852Q-21.848 66.852-21.627 66.639Q-21.407 66.426-21.282 66.125L-20.993 65.477L-22.266 62.590Q-22.348 62.415-22.493 62.370Q-22.637 62.325-22.907 62.325L-22.907 62.028L-21.188 62.028L-21.188 62.325Q-21.610 62.325-21.610 62.508Q-21.610 62.520-21.594 62.590L-20.657 64.715L-19.825 62.805Q-19.786 62.715-19.786 62.637Q-19.786 62.497-19.887 62.411Q-19.989 62.325-20.129 62.325L-20.129 62.028L-18.778 62.028L-18.778 62.325Q-19.032 62.325-19.225 62.450Q-19.418 62.575-19.524 62.805L-20.969 66.125Q-21.083 66.379-21.249 66.602Q-21.415 66.825-21.643 66.967Q-21.872 67.110-22.137 67.110Q-22.434 67.110-22.674 66.918Q-22.915 66.727-22.915 66.438Q-22.915 66.282-22.809 66.180Q-22.704 66.079-22.555 66.079Q-22.450 66.079-22.370 66.125Q-22.290 66.172-22.243 66.250Q-22.196 66.329-22.196 66.438Q-22.196 66.559-22.256 66.647Q-22.317 66.735-22.426 66.774\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(165.714 -94.74)\">\u003Cpath d=\"M-13.512 65.477L-15.492 65.477L-15.492 65.180Q-15.223 65.180-15.055 65.135Q-14.887 65.090-14.887 64.918L-14.887 62.782Q-14.887 62.567-14.949 62.471Q-15.012 62.375-15.129 62.354Q-15.246 62.332-15.492 62.332L-15.492 62.036L-14.324 61.950L-14.324 62.735Q-14.246 62.524-14.094 62.338Q-13.942 62.153-13.742 62.051Q-13.543 61.950-13.317 61.950Q-13.070 61.950-12.879 62.094Q-12.688 62.239-12.688 62.469Q-12.688 62.625-12.793 62.735Q-12.899 62.844-13.055 62.844Q-13.211 62.844-13.320 62.735Q-13.430 62.625-13.430 62.469Q-13.430 62.309-13.324 62.204Q-13.649 62.204-13.863 62.432Q-14.078 62.661-14.174 63Q-14.270 63.340-14.270 63.645L-14.270 64.918Q-14.270 65.086-14.043 65.133Q-13.817 65.180-13.512 65.180L-13.512 65.477M-12.207 63.723Q-12.207 63.243-11.975 62.827Q-11.742 62.411-11.332 62.161Q-10.922 61.911-10.445 61.911Q-9.715 61.911-9.317 62.352Q-8.918 62.793-8.918 63.524Q-8.918 63.629-9.012 63.653L-11.461 63.653L-11.461 63.723Q-11.461 64.133-11.340 64.489Q-11.219 64.844-10.947 65.061Q-10.676 65.278-10.246 65.278Q-9.883 65.278-9.586 65.049Q-9.289 64.821-9.188 64.469Q-9.180 64.422-9.094 64.407L-9.012 64.407Q-8.918 64.434-8.918 64.516Q-8.918 64.524-8.926 64.555Q-8.988 64.782-9.127 64.965Q-9.266 65.149-9.457 65.282Q-9.649 65.415-9.867 65.485Q-10.086 65.555-10.324 65.555Q-10.695 65.555-11.033 65.418Q-11.371 65.282-11.639 65.030Q-11.906 64.778-12.057 64.438Q-12.207 64.098-12.207 63.723M-11.453 63.415L-9.492 63.415Q-9.492 63.110-9.594 62.819Q-9.695 62.528-9.912 62.346Q-10.129 62.165-10.445 62.165Q-10.746 62.165-10.977 62.352Q-11.207 62.540-11.330 62.831Q-11.453 63.122-11.453 63.415M-6.844 65.446L-7.914 62.590Q-7.981 62.411-8.112 62.368Q-8.242 62.325-8.500 62.325L-8.500 62.028L-6.820 62.028L-6.820 62.325Q-7.270 62.325-7.270 62.524Q-7.266 62.540-7.264 62.557Q-7.262 62.575-7.262 62.590L-6.469 64.684L-5.758 62.774Q-5.793 62.680-5.793 62.635Q-5.793 62.590-5.828 62.590Q-5.895 62.411-6.026 62.368Q-6.156 62.325-6.410 62.325L-6.410 62.028L-4.820 62.028L-4.820 62.325Q-5.270 62.325-5.270 62.524Q-5.266 62.543-5.264 62.561Q-5.262 62.579-5.262 62.590L-4.430 64.805L-3.676 62.805Q-3.653 62.747-3.653 62.676Q-3.653 62.516-3.789 62.420Q-3.926 62.325-4.094 62.325L-4.094 62.028L-2.707 62.028L-2.707 62.325Q-2.942 62.325-3.119 62.452Q-3.297 62.579-3.379 62.805L-4.363 65.446Q-4.418 65.555-4.531 65.555L-4.590 65.555Q-4.703 65.555-4.746 65.446L-5.606 63.172L-6.461 65.446Q-6.500 65.555-6.621 65.555L-6.676 65.555Q-6.789 65.555-6.844 65.446\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(165.714 -94.74)\">\u003Cpath d=\"M-2.428 64.645Q-2.428 64.161-2.026 63.866Q-1.623 63.571-1.073 63.452Q-0.522 63.332-0.030 63.332L-0.030 63.043Q-0.030 62.817-0.145 62.610Q-0.260 62.403-0.457 62.284Q-0.655 62.165-0.885 62.165Q-1.311 62.165-1.596 62.270Q-1.526 62.297-1.479 62.352Q-1.432 62.407-1.407 62.477Q-1.381 62.547-1.381 62.622Q-1.381 62.727-1.432 62.819Q-1.483 62.911-1.575 62.961Q-1.666 63.012-1.772 63.012Q-1.877 63.012-1.969 62.961Q-2.061 62.911-2.112 62.819Q-2.162 62.727-2.162 62.622Q-2.162 62.204-1.774 62.057Q-1.385 61.911-0.885 61.911Q-0.553 61.911-0.200 62.041Q0.154 62.172 0.382 62.426Q0.611 62.680 0.611 63.028L0.611 64.829Q0.611 64.961 0.683 65.071Q0.756 65.180 0.884 65.180Q1.009 65.180 1.078 65.075Q1.146 64.969 1.146 64.829L1.146 64.317L1.427 64.317L1.427 64.829Q1.427 65.032 1.310 65.190Q1.193 65.348 1.011 65.432Q0.830 65.516 0.627 65.516Q0.396 65.516 0.244 65.344Q0.091 65.172 0.060 64.942Q-0.100 65.223-0.409 65.389Q-0.717 65.555-1.069 65.555Q-1.580 65.555-2.004 65.332Q-2.428 65.110-2.428 64.645M-1.741 64.645Q-1.741 64.930-1.514 65.116Q-1.287 65.301-0.994 65.301Q-0.748 65.301-0.524 65.184Q-0.299 65.067-0.164 64.864Q-0.030 64.661-0.030 64.407L-0.030 63.575Q-0.295 63.575-0.580 63.629Q-0.866 63.684-1.137 63.813Q-1.409 63.942-1.575 64.149Q-1.741 64.356-1.741 64.645M3.728 65.477L1.748 65.477L1.748 65.180Q2.017 65.180 2.185 65.135Q2.353 65.090 2.353 64.918L2.353 62.782Q2.353 62.567 2.291 62.471Q2.228 62.375 2.111 62.354Q1.994 62.332 1.748 62.332L1.748 62.036L2.916 61.950L2.916 62.735Q2.994 62.524 3.146 62.338Q3.299 62.153 3.498 62.051Q3.697 61.950 3.924 61.950Q4.170 61.950 4.361 62.094Q4.552 62.239 4.552 62.469Q4.552 62.625 4.447 62.735Q4.341 62.844 4.185 62.844Q4.029 62.844 3.920 62.735Q3.810 62.625 3.810 62.469Q3.810 62.309 3.916 62.204Q3.591 62.204 3.377 62.432Q3.162 62.661 3.066 63Q2.970 63.340 2.970 63.645L2.970 64.918Q2.970 65.086 3.197 65.133Q3.424 65.180 3.728 65.180L3.728 65.477M6.849 65.555Q6.369 65.555 5.961 65.311Q5.552 65.067 5.314 64.653Q5.076 64.239 5.076 63.750Q5.076 63.258 5.334 62.842Q5.591 62.426 6.023 62.188Q6.455 61.950 6.947 61.950Q7.568 61.950 8.017 62.387L8.017 60.758Q8.017 60.543 7.955 60.448Q7.892 60.352 7.775 60.331Q7.658 60.309 7.412 60.309L7.412 60.012L8.634 59.926L8.634 64.735Q8.634 64.946 8.697 65.041Q8.759 65.137 8.877 65.159Q8.994 65.180 9.244 65.180L9.244 65.477L7.994 65.555L7.994 65.071Q7.529 65.555 6.849 65.555M6.916 65.301Q7.256 65.301 7.549 65.110Q7.841 64.918 7.994 64.622L7.994 62.790Q7.845 62.516 7.584 62.360Q7.322 62.204 7.009 62.204Q6.384 62.204 6.101 62.651Q5.818 63.098 5.818 63.758Q5.818 64.403 6.070 64.852Q6.322 65.301 6.916 65.301\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-warn)\" stroke=\"none\" d=\"M204.436-56.301a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0m-2.2 0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cpath fill=\"none\" d=\"M170.938-51.18c11.105-3.953 18.123-4.889 27.882-4.137\"\u002F>\u003Cpath stroke=\"none\" d=\"m200.813-55.163-3.067-1.841 1.074 1.687-1.32 1.503\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(140.19 -113.234)\">\u003Cpath d=\"M-39.374 63.782Q-39.374 63.278-39.118 62.846Q-38.862 62.415-38.426 62.163Q-37.991 61.911-37.491 61.911Q-37.104 61.911-36.762 62.055Q-36.421 62.200-36.159 62.461Q-35.897 62.723-35.755 63.059Q-35.612 63.395-35.612 63.782Q-35.612 64.274-35.876 64.684Q-36.139 65.094-36.569 65.325Q-36.999 65.555-37.491 65.555Q-37.983 65.555-38.417 65.323Q-38.850 65.090-39.112 64.682Q-39.374 64.274-39.374 63.782M-37.491 65.278Q-37.034 65.278-36.782 65.055Q-36.530 64.832-36.442 64.481Q-36.354 64.129-36.354 63.684Q-36.354 63.254-36.448 62.916Q-36.542 62.579-36.796 62.372Q-37.050 62.165-37.491 62.165Q-38.139 62.165-38.383 62.581Q-38.628 62.997-38.628 63.684Q-38.628 64.129-38.540 64.481Q-38.452 64.832-38.200 65.055Q-37.948 65.278-37.491 65.278M-33.245 67.028L-35.100 67.028L-35.100 66.735Q-34.831 66.735-34.663 66.690Q-34.495 66.645-34.495 66.469L-34.495 62.645Q-34.495 62.438-34.651 62.385Q-34.807 62.332-35.100 62.332L-35.100 62.036L-33.878 61.950L-33.878 62.415Q-33.647 62.192-33.333 62.071Q-33.018 61.950-32.678 61.950Q-32.206 61.950-31.801 62.196Q-31.397 62.442-31.165 62.858Q-30.932 63.274-30.932 63.750Q-30.932 64.125-31.081 64.454Q-31.229 64.782-31.499 65.034Q-31.768 65.286-32.112 65.420Q-32.456 65.555-32.815 65.555Q-33.104 65.555-33.376 65.434Q-33.647 65.313-33.854 65.102L-33.854 66.469Q-33.854 66.645-33.686 66.690Q-33.518 66.735-33.245 66.735L-33.245 67.028M-33.854 62.813L-33.854 64.653Q-33.702 64.942-33.440 65.122Q-33.178 65.301-32.870 65.301Q-32.585 65.301-32.362 65.163Q-32.139 65.024-31.987 64.793Q-31.835 64.563-31.757 64.291Q-31.678 64.020-31.678 63.750Q-31.678 63.418-31.803 63.061Q-31.928 62.704-32.176 62.467Q-32.425 62.231-32.772 62.231Q-33.096 62.231-33.391 62.387Q-33.686 62.543-33.854 62.813M-29.784 64.516L-29.784 62.325L-30.487 62.325L-30.487 62.071Q-30.132 62.071-29.889 61.838Q-29.647 61.606-29.536 61.258Q-29.425 60.911-29.425 60.555L-29.143 60.555L-29.143 62.028L-27.967 62.028L-27.967 62.325L-29.143 62.325L-29.143 64.500Q-29.143 64.821-29.024 65.049Q-28.905 65.278-28.624 65.278Q-28.444 65.278-28.327 65.155Q-28.210 65.032-28.157 64.852Q-28.104 64.672-28.104 64.500L-28.104 64.028L-27.823 64.028L-27.823 64.516Q-27.823 64.770-27.928 65.010Q-28.034 65.250-28.231 65.403Q-28.428 65.555-28.686 65.555Q-29.003 65.555-29.255 65.432Q-29.507 65.309-29.645 65.075Q-29.784 64.840-29.784 64.516M-25.245 65.477L-27.022 65.477L-27.022 65.180Q-26.749 65.180-26.581 65.133Q-26.413 65.086-26.413 64.918L-26.413 62.782Q-26.413 62.567-26.469 62.471Q-26.526 62.375-26.639 62.354Q-26.753 62.332-26.999 62.332L-26.999 62.036L-25.800 61.950L-25.800 64.918Q-25.800 65.086-25.653 65.133Q-25.507 65.180-25.245 65.180L-25.245 65.477M-26.686 60.555Q-26.686 60.364-26.551 60.233Q-26.417 60.102-26.221 60.102Q-26.100 60.102-25.997 60.165Q-25.893 60.227-25.831 60.331Q-25.768 60.434-25.768 60.555Q-25.768 60.750-25.899 60.885Q-26.030 61.020-26.221 61.020Q-26.421 61.020-26.553 60.887Q-26.686 60.754-26.686 60.555M-22.815 65.477L-24.671 65.477L-24.671 65.180Q-24.397 65.180-24.229 65.133Q-24.061 65.086-24.061 64.918L-24.061 62.782Q-24.061 62.567-24.124 62.471Q-24.186 62.375-24.305 62.354Q-24.425 62.332-24.671 62.332L-24.671 62.036L-23.479 61.950L-23.479 62.684Q-23.366 62.469-23.173 62.301Q-22.979 62.133-22.741 62.041Q-22.503 61.950-22.249 61.950Q-21.288 61.950-21.112 62.661Q-20.928 62.332-20.600 62.141Q-20.272 61.950-19.893 61.950Q-18.717 61.950-18.717 63.028L-18.717 64.918Q-18.717 65.086-18.550 65.133Q-18.382 65.180-18.112 65.180L-18.112 65.477L-19.967 65.477L-19.967 65.180Q-19.694 65.180-19.526 65.135Q-19.358 65.090-19.358 64.918L-19.358 63.043Q-19.358 62.657-19.483 62.430Q-19.608 62.204-19.960 62.204Q-20.264 62.204-20.520 62.366Q-20.776 62.528-20.925 62.797Q-21.073 63.067-21.073 63.364L-21.073 64.918Q-21.073 65.086-20.903 65.133Q-20.733 65.180-20.464 65.180L-20.464 65.477L-22.319 65.477L-22.319 65.180Q-22.046 65.180-21.878 65.133Q-21.710 65.086-21.710 64.918L-21.710 63.043Q-21.710 62.657-21.835 62.430Q-21.960 62.204-22.311 62.204Q-22.616 62.204-22.872 62.366Q-23.128 62.528-23.276 62.797Q-23.425 63.067-23.425 63.364L-23.425 64.918Q-23.425 65.086-23.255 65.133Q-23.085 65.180-22.815 65.180\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(140.19 -113.234)\">\u003Cpath d=\"M-17.204 64.524L-17.204 62.782Q-17.204 62.567-17.267 62.471Q-17.329 62.375-17.448 62.354Q-17.567 62.332-17.814 62.332L-17.814 62.036L-16.567 61.950L-16.567 64.500L-16.567 64.524Q-16.567 64.836-16.513 64.998Q-16.458 65.161-16.308 65.231Q-16.157 65.301-15.837 65.301Q-15.407 65.301-15.134 64.963Q-14.860 64.625-14.860 64.180L-14.860 62.782Q-14.860 62.567-14.923 62.471Q-14.985 62.375-15.105 62.354Q-15.224 62.332-15.470 62.332L-15.470 62.036L-14.224 61.950L-14.224 64.735Q-14.224 64.946-14.161 65.041Q-14.099 65.137-13.980 65.159Q-13.860 65.180-13.614 65.180L-13.614 65.477L-14.837 65.555L-14.837 64.934Q-15.005 65.223-15.286 65.389Q-15.567 65.555-15.888 65.555Q-17.204 65.555-17.204 64.524M-11.239 65.477L-13.095 65.477L-13.095 65.180Q-12.821 65.180-12.653 65.133Q-12.485 65.086-12.485 64.918L-12.485 62.782Q-12.485 62.567-12.548 62.471Q-12.610 62.375-12.730 62.354Q-12.849 62.332-13.095 62.332L-13.095 62.036L-11.903 61.950L-11.903 62.684Q-11.790 62.469-11.597 62.301Q-11.403 62.133-11.165 62.041Q-10.927 61.950-10.673 61.950Q-9.712 61.950-9.536 62.661Q-9.353 62.332-9.024 62.141Q-8.696 61.950-8.317 61.950Q-7.142 61.950-7.142 63.028L-7.142 64.918Q-7.142 65.086-6.974 65.133Q-6.806 65.180-6.536 65.180L-6.536 65.477L-8.392 65.477L-8.392 65.180Q-8.118 65.180-7.950 65.135Q-7.782 65.090-7.782 64.918L-7.782 63.043Q-7.782 62.657-7.907 62.430Q-8.032 62.204-8.384 62.204Q-8.689 62.204-8.944 62.366Q-9.200 62.528-9.349 62.797Q-9.497 63.067-9.497 63.364L-9.497 64.918Q-9.497 65.086-9.327 65.133Q-9.157 65.180-8.888 65.180L-8.888 65.477L-10.743 65.477L-10.743 65.180Q-10.470 65.180-10.302 65.133Q-10.134 65.086-10.134 64.918L-10.134 63.043Q-10.134 62.657-10.259 62.430Q-10.384 62.204-10.735 62.204Q-11.040 62.204-11.296 62.366Q-11.552 62.528-11.700 62.797Q-11.849 63.067-11.849 63.364L-11.849 64.918Q-11.849 65.086-11.679 65.133Q-11.509 65.180-11.239 65.180\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(140.19 -113.234)\">\u003Cpath d=\"M-3.249 63.782Q-3.249 63.278-2.993 62.846Q-2.737 62.415-2.301 62.163Q-1.866 61.911-1.366 61.911Q-0.979 61.911-0.637 62.055Q-0.296 62.200-0.034 62.461Q0.228 62.723 0.370 63.059Q0.513 63.395 0.513 63.782Q0.513 64.274 0.249 64.684Q-0.014 65.094-0.444 65.325Q-0.874 65.555-1.366 65.555Q-1.858 65.555-2.292 65.323Q-2.725 65.090-2.987 64.682Q-3.249 64.274-3.249 63.782M-1.366 65.278Q-0.909 65.278-0.657 65.055Q-0.405 64.832-0.317 64.481Q-0.229 64.129-0.229 63.684Q-0.229 63.254-0.323 62.916Q-0.417 62.579-0.671 62.372Q-0.925 62.165-1.366 62.165Q-2.014 62.165-2.258 62.581Q-2.503 62.997-2.503 63.684Q-2.503 64.129-2.415 64.481Q-2.327 64.832-2.075 65.055Q-1.823 65.278-1.366 65.278M3.064 65.477L1.079 65.477L1.079 65.180Q1.353 65.180 1.521 65.133Q1.689 65.086 1.689 64.918L1.689 62.325L1.048 62.325L1.048 62.028L1.689 62.028L1.689 61.094Q1.689 60.829 1.806 60.592Q1.923 60.356 2.117 60.192Q2.310 60.028 2.558 59.936Q2.806 59.844 3.072 59.844Q3.357 59.844 3.581 60.002Q3.806 60.161 3.806 60.438Q3.806 60.594 3.700 60.704Q3.595 60.813 3.431 60.813Q3.275 60.813 3.165 60.704Q3.056 60.594 3.056 60.438Q3.056 60.231 3.216 60.125Q3.118 60.102 3.025 60.102Q2.794 60.102 2.622 60.258Q2.450 60.415 2.365 60.651Q2.279 60.887 2.279 61.110L2.279 62.028L3.247 62.028L3.247 62.325L2.302 62.325L2.302 64.918Q2.302 65.086 2.529 65.133Q2.755 65.180 3.064 65.180\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(140.19 -113.234)\">\u003Cpath d=\"M8.315 67.028L6.460 67.028L6.460 66.735Q6.729 66.735 6.897 66.690Q7.065 66.645 7.065 66.469L7.065 62.645Q7.065 62.438 6.909 62.385Q6.753 62.332 6.460 62.332L6.460 62.036L7.682 61.950L7.682 62.415Q7.913 62.192 8.227 62.071Q8.542 61.950 8.881 61.950Q9.354 61.950 9.758 62.196Q10.163 62.442 10.395 62.858Q10.628 63.274 10.628 63.750Q10.628 64.125 10.479 64.454Q10.331 64.782 10.061 65.034Q9.792 65.286 9.448 65.420Q9.104 65.555 8.745 65.555Q8.456 65.555 8.184 65.434Q7.913 65.313 7.706 65.102L7.706 66.469Q7.706 66.645 7.874 66.690Q8.042 66.735 8.315 66.735L8.315 67.028M7.706 62.813L7.706 64.653Q7.858 64.942 8.120 65.122Q8.381 65.301 8.690 65.301Q8.975 65.301 9.198 65.163Q9.421 65.024 9.573 64.793Q9.725 64.563 9.803 64.291Q9.881 64.020 9.881 63.750Q9.881 63.418 9.756 63.061Q9.631 62.704 9.383 62.467Q9.135 62.231 8.788 62.231Q8.464 62.231 8.169 62.387Q7.874 62.543 7.706 62.813M13.159 65.477L11.178 65.477L11.178 65.180Q11.448 65.180 11.616 65.135Q11.784 65.090 11.784 64.918L11.784 62.782Q11.784 62.567 11.721 62.471Q11.659 62.375 11.542 62.354Q11.424 62.332 11.178 62.332L11.178 62.036L12.346 61.950L12.346 62.735Q12.424 62.524 12.577 62.338Q12.729 62.153 12.928 62.051Q13.128 61.950 13.354 61.950Q13.600 61.950 13.792 62.094Q13.983 62.239 13.983 62.469Q13.983 62.625 13.878 62.735Q13.772 62.844 13.616 62.844Q13.460 62.844 13.350 62.735Q13.241 62.625 13.241 62.469Q13.241 62.309 13.346 62.204Q13.022 62.204 12.807 62.432Q12.592 62.661 12.497 63Q12.401 63.340 12.401 63.645L12.401 64.918Q12.401 65.086 12.628 65.133Q12.854 65.180 13.159 65.180L13.159 65.477M14.464 63.782Q14.464 63.278 14.719 62.846Q14.975 62.415 15.411 62.163Q15.846 61.911 16.346 61.911Q16.733 61.911 17.075 62.055Q17.417 62.200 17.678 62.461Q17.940 62.723 18.083 63.059Q18.225 63.395 18.225 63.782Q18.225 64.274 17.962 64.684Q17.698 65.094 17.268 65.325Q16.839 65.555 16.346 65.555Q15.854 65.555 15.421 65.323Q14.987 65.090 14.725 64.682Q14.464 64.274 14.464 63.782M16.346 65.278Q16.803 65.278 17.055 65.055Q17.307 64.832 17.395 64.481Q17.483 64.129 17.483 63.684Q17.483 63.254 17.389 62.916Q17.296 62.579 17.042 62.372Q16.788 62.165 16.346 62.165Q15.698 62.165 15.454 62.581Q15.210 62.997 15.210 63.684Q15.210 64.129 15.298 64.481Q15.385 64.832 15.637 65.055Q15.889 65.278 16.346 65.278\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(140.19 -113.234)\">\u003Cpath d=\"M19.868 65.477L18.372 65.477L18.372 65.180Q19.005 65.180 19.427 64.700L20.196 63.790L19.204 62.590Q19.048 62.411 18.886 62.368Q18.723 62.325 18.419 62.325L18.419 62.028L20.106 62.028L20.106 62.325Q20.013 62.325 19.936 62.368Q19.860 62.411 19.860 62.500Q19.860 62.543 19.891 62.590L20.548 63.379L21.028 62.805Q21.145 62.668 21.145 62.532Q21.145 62.442 21.095 62.383Q21.044 62.325 20.962 62.325L20.962 62.028L22.450 62.028L22.450 62.325Q21.813 62.325 21.403 62.805L20.723 63.606L21.809 64.918Q21.970 65.094 22.130 65.137Q22.290 65.180 22.595 65.180L22.595 65.477L20.907 65.477L20.907 65.180Q20.997 65.180 21.075 65.137Q21.153 65.094 21.153 65.004Q21.153 64.981 21.122 64.918L20.380 64.012L19.794 64.700Q19.677 64.836 19.677 64.973Q19.677 65.059 19.727 65.120Q19.778 65.180 19.868 65.180L19.868 65.477M23.380 66.774Q23.493 66.852 23.669 66.852Q23.958 66.852 24.179 66.639Q24.399 66.426 24.524 66.125L24.813 65.477L23.540 62.590Q23.458 62.415 23.313 62.370Q23.169 62.325 22.899 62.325L22.899 62.028L24.618 62.028L24.618 62.325Q24.196 62.325 24.196 62.508Q24.196 62.520 24.212 62.590L25.149 64.715L25.981 62.805Q26.020 62.715 26.020 62.637Q26.020 62.497 25.919 62.411Q25.817 62.325 25.677 62.325L25.677 62.028L27.028 62.028L27.028 62.325Q26.774 62.325 26.581 62.450Q26.388 62.575 26.282 62.805L24.837 66.125Q24.723 66.379 24.557 66.602Q24.391 66.825 24.163 66.967Q23.934 67.110 23.669 67.110Q23.372 67.110 23.132 66.918Q22.891 66.727 22.891 66.438Q22.891 66.282 22.997 66.180Q23.102 66.079 23.251 66.079Q23.356 66.079 23.436 66.125Q23.516 66.172 23.563 66.250Q23.610 66.329 23.610 66.438Q23.610 66.559 23.550 66.647Q23.489 66.735 23.380 66.774\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Specification gaming. The proxy reward \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\" style=\"margin-right:0.0278em;\">r\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> (solid) agrees with the true objective \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6887em;\">\u003C\u002Fspan>\u003Cspan class=\"mord\">\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0278em;\">r\u003C\u002Fspan>\u003Cspan class=\"msupsub\">\u003Cspan class=\"vlist-t\">\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.6887em;\">\u003Cspan style=\"top:-3.063em;margin-right:0.05em;\">\u003Cspan class=\"pstrut\" style=\"height:2.7em;\">\u003C\u002Fspan>\u003Cspan class=\"sizing reset-size6 size3 mtight\">\u003Cspan class=\"mbin mtight\">⋆\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> (dashed) on the intended behaviors near the center, then diverges upward on unintended ones; a strong optimizer climbs the proxy straight into the gap, where measured reward is high and true value has collapsed.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:352.202px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 264.152 171.265\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-64.703 75.884V-72.07h250.385V75.884ZM185.682-72.07\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(-.735 -132.447)\">\u003Cpath d=\"M-57.054 71.551L-58.684 71.551L-58.684 71.271Q-58.455 71.271-58.306 71.236Q-58.158 71.202-58.158 71.062L-58.158 67.716Q-58.158 67.545-58.294 67.504Q-58.431 67.463-58.684 67.463L-58.684 67.183L-57.604 67.108L-57.604 67.514Q-57.382 67.313-57.095 67.210Q-56.807 67.108-56.500 67.108Q-56.073 67.108-55.709 67.321Q-55.345 67.535-55.131 67.899Q-54.917 68.263-54.917 68.683Q-54.917 69.128-55.157 69.492Q-55.396 69.856-55.789 70.059Q-56.182 70.262-56.626 70.262Q-56.893 70.262-57.141 70.162Q-57.388 70.061-57.576 69.880L-57.576 71.062Q-57.576 71.199-57.428 71.235Q-57.279 71.271-57.054 71.271L-57.054 71.551M-57.576 67.863L-57.576 69.473Q-57.443 69.726-57.200 69.883Q-56.958 70.040-56.681 70.040Q-56.353 70.040-56.100 69.839Q-55.847 69.637-55.714 69.319Q-55.580 69.001-55.580 68.683Q-55.580 68.454-55.645 68.225Q-55.710 67.996-55.838 67.798Q-55.967 67.600-56.161 67.480Q-56.356 67.361-56.589 67.361Q-56.883 67.361-57.151 67.490Q-57.419 67.620-57.576 67.863\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-.735 -132.447)\">\u003Cpath d=\"M-54.107 68.711Q-54.107 68.369-53.972 68.070Q-53.837 67.771-53.597 67.547Q-53.358 67.323-53.040 67.198Q-52.722 67.073-52.391 67.073Q-51.946 67.073-51.547 67.289Q-51.147 67.504-50.912 67.882Q-50.678 68.259-50.678 68.711Q-50.678 69.052-50.820 69.336Q-50.962 69.620-51.206 69.827Q-51.451 70.033-51.760 70.148Q-52.069 70.262-52.391 70.262Q-52.821 70.262-53.223 70.061Q-53.625 69.859-53.866 69.507Q-54.107 69.155-54.107 68.711M-52.391 70.013Q-51.789 70.013-51.565 69.635Q-51.341 69.257-51.341 68.625Q-51.341 68.013-51.576 67.654Q-51.810 67.296-52.391 67.296Q-53.443 67.296-53.443 68.625Q-53.443 69.257-53.218 69.635Q-52.992 70.013-52.391 70.013M-48.416 70.194L-50.019 70.194L-50.019 69.914Q-49.793 69.914-49.644 69.880Q-49.496 69.845-49.496 69.705L-49.496 66.086Q-49.496 65.816-49.603 65.754Q-49.711 65.693-50.019 65.693L-50.019 65.412L-48.942 65.337L-48.942 69.705Q-48.942 69.842-48.792 69.878Q-48.641 69.914-48.416 69.914L-48.416 70.194M-46.204 70.194L-47.756 70.194L-47.756 69.914Q-47.530 69.914-47.382 69.880Q-47.233 69.845-47.233 69.705L-47.233 67.856Q-47.233 67.668-47.281 67.584Q-47.329 67.501-47.426 67.482Q-47.524 67.463-47.735 67.463L-47.735 67.183L-46.679 67.108L-46.679 69.705Q-46.679 69.845-46.548 69.880Q-46.416 69.914-46.204 69.914L-46.204 70.194M-47.476 65.887Q-47.476 65.716-47.353 65.597Q-47.230 65.477-47.059 65.477Q-46.891 65.477-46.768 65.597Q-46.645 65.716-46.645 65.887Q-46.645 66.062-46.768 66.185Q-46.891 66.308-47.059 66.308Q-47.230 66.308-47.353 66.185Q-47.476 66.062-47.476 65.887M-45.558 68.683Q-45.558 68.355-45.423 68.054Q-45.288 67.754-45.052 67.533Q-44.817 67.313-44.512 67.193Q-44.208 67.073-43.883 67.073Q-43.378 67.073-43.029 67.176Q-42.680 67.278-42.680 67.654Q-42.680 67.801-42.778 67.902Q-42.875 68.003-43.022 68.003Q-43.176 68.003-43.275 67.904Q-43.374 67.805-43.374 67.654Q-43.374 67.466-43.234 67.374Q-43.436 67.323-43.877 67.323Q-44.232 67.323-44.461 67.519Q-44.690 67.716-44.791 68.025Q-44.892 68.335-44.892 68.683Q-44.892 69.032-44.765 69.338Q-44.639 69.644-44.384 69.828Q-44.130 70.013-43.774 70.013Q-43.552 70.013-43.367 69.929Q-43.183 69.845-43.048 69.690Q-42.913 69.534-42.855 69.326Q-42.841 69.271-42.786 69.271L-42.673 69.271Q-42.643 69.271-42.620 69.295Q-42.598 69.319-42.598 69.353L-42.598 69.374Q-42.684 69.661-42.872 69.859Q-43.060 70.057-43.325 70.160Q-43.589 70.262-43.883 70.262Q-44.314 70.262-44.702 70.056Q-45.090 69.849-45.324 69.486Q-45.558 69.124-45.558 68.683M-41.675 71.329Q-41.546 71.397-41.409 71.397Q-41.238 71.397-41.088 71.308Q-40.937 71.219-40.826 71.074Q-40.715 70.929-40.636 70.761L-40.373 70.194L-41.542 67.668Q-41.617 67.521-41.747 67.489Q-41.877 67.456-42.109 67.456L-42.109 67.176L-40.588 67.176L-40.588 67.456Q-40.937 67.456-40.937 67.603Q-40.934 67.624-40.932 67.641Q-40.930 67.658-40.930 67.668L-40.072 69.527L-39.300 67.856Q-39.266 67.788-39.266 67.709Q-39.266 67.596-39.349 67.526Q-39.433 67.456-39.546 67.456L-39.546 67.176L-38.350 67.176L-38.350 67.456Q-38.568 67.456-38.741 67.560Q-38.914 67.665-39.006 67.856L-40.342 70.761Q-40.513 71.131-40.783 71.377Q-41.053 71.623-41.409 71.623Q-41.679 71.623-41.898 71.457Q-42.116 71.291-42.116 71.028Q-42.116 70.891-42.024 70.802Q-41.932 70.714-41.792 70.714Q-41.655 70.714-41.566 70.802Q-41.477 70.891-41.477 71.028Q-41.477 71.131-41.530 71.209Q-41.583 71.288-41.675 71.329\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-.735 -132.447)\">\u003Cpath d=\"M-35.101 70.187L-35.101 69.124Q-35.101 69.100-35.073 69.073Q-35.046 69.046-35.022 69.046L-34.913 69.046Q-34.848 69.046-34.834 69.104Q-34.738 69.538-34.492 69.789Q-34.246 70.040-33.832 70.040Q-33.491 70.040-33.238 69.907Q-32.985 69.774-32.985 69.466Q-32.985 69.309-33.079 69.194Q-33.173 69.080-33.311 69.011Q-33.450 68.943-33.617 68.905L-34.198 68.806Q-34.554 68.738-34.827 68.517Q-35.101 68.297-35.101 67.955Q-35.101 67.706-34.989 67.531Q-34.878 67.357-34.692 67.258Q-34.506 67.159-34.290 67.116Q-34.075 67.073-33.832 67.073Q-33.419 67.073-33.139 67.255L-32.923 67.080Q-32.913 67.077-32.906 67.075Q-32.899 67.073-32.889 67.073L-32.838 67.073Q-32.811 67.073-32.787 67.097Q-32.763 67.121-32.763 67.149L-32.763 67.996Q-32.763 68.017-32.787 68.044Q-32.811 68.071-32.838 68.071L-32.951 68.071Q-32.978 68.071-33.004 68.046Q-33.029 68.020-33.029 67.996Q-33.029 67.760-33.135 67.596Q-33.241 67.432-33.424 67.350Q-33.607 67.268-33.839 67.268Q-34.167 67.268-34.424 67.371Q-34.680 67.473-34.680 67.750Q-34.680 67.945-34.497 68.054Q-34.314 68.164-34.085 68.205L-33.511 68.311Q-33.265 68.359-33.051 68.487Q-32.838 68.615-32.701 68.818Q-32.564 69.022-32.564 69.271Q-32.564 69.784-32.930 70.023Q-33.296 70.262-33.832 70.262Q-34.328 70.262-34.660 69.968L-34.926 70.242Q-34.947 70.262-34.974 70.262L-35.022 70.262Q-35.046 70.262-35.073 70.235Q-35.101 70.208-35.101 70.187M-30.291 71.551L-31.922 71.551L-31.922 71.271Q-31.693 71.271-31.544 71.236Q-31.395 71.202-31.395 71.062L-31.395 67.716Q-31.395 67.545-31.532 67.504Q-31.669 67.463-31.922 67.463L-31.922 67.183L-30.842 67.108L-30.842 67.514Q-30.620 67.313-30.332 67.210Q-30.045 67.108-29.738 67.108Q-29.311 67.108-28.946 67.321Q-28.582 67.535-28.369 67.899Q-28.155 68.263-28.155 68.683Q-28.155 69.128-28.394 69.492Q-28.634 69.856-29.027 70.059Q-29.420 70.262-29.864 70.262Q-30.131 70.262-30.379 70.162Q-30.626 70.061-30.814 69.880L-30.814 71.062Q-30.814 71.199-30.666 71.235Q-30.517 71.271-30.291 71.271L-30.291 71.551M-30.814 67.863L-30.814 69.473Q-30.681 69.726-30.438 69.883Q-30.196 70.040-29.919 70.040Q-29.591 70.040-29.338 69.839Q-29.085 69.637-28.952 69.319Q-28.818 69.001-28.818 68.683Q-28.818 68.454-28.883 68.225Q-28.948 67.996-29.076 67.798Q-29.205 67.600-29.399 67.480Q-29.594 67.361-29.827 67.361Q-30.121 67.361-30.389 67.490Q-30.657 67.620-30.814 67.863M-27.461 69.466Q-27.461 69.134-27.238 68.907Q-27.014 68.680-26.670 68.552Q-26.327 68.423-25.954 68.371Q-25.582 68.318-25.277 68.318L-25.277 68.065Q-25.277 67.860-25.385 67.680Q-25.493 67.501-25.674 67.398Q-25.855 67.296-26.063 67.296Q-26.470 67.296-26.706 67.388Q-26.617 67.425-26.571 67.509Q-26.525 67.593-26.525 67.695Q-26.525 67.791-26.571 67.870Q-26.617 67.948-26.697 67.993Q-26.778 68.037-26.867 68.037Q-27.017 68.037-27.118 67.940Q-27.219 67.842-27.219 67.695Q-27.219 67.073-26.063 67.073Q-25.852 67.073-25.602 67.137Q-25.352 67.200-25.151 67.319Q-24.949 67.439-24.823 67.624Q-24.696 67.808-24.696 68.051L-24.696 69.627Q-24.696 69.743-24.635 69.839Q-24.573 69.934-24.460 69.934Q-24.351 69.934-24.286 69.840Q-24.221 69.746-24.221 69.627L-24.221 69.179L-23.955 69.179L-23.955 69.627Q-23.955 69.897-24.182 70.062Q-24.409 70.228-24.689 70.228Q-24.898 70.228-25.035 70.074Q-25.171 69.921-25.195 69.705Q-25.342 69.972-25.624 70.117Q-25.906 70.262-26.231 70.262Q-26.508 70.262-26.791 70.187Q-27.075 70.112-27.268 69.933Q-27.461 69.753-27.461 69.466M-26.846 69.466Q-26.846 69.640-26.745 69.770Q-26.644 69.900-26.489 69.970Q-26.333 70.040-26.169 70.040Q-25.951 70.040-25.742 69.943Q-25.534 69.845-25.405 69.664Q-25.277 69.483-25.277 69.257L-25.277 68.529Q-25.602 68.529-25.968 68.620Q-26.333 68.711-26.590 68.923Q-26.846 69.134-26.846 69.466M-23.538 68.683Q-23.538 68.355-23.403 68.054Q-23.268 67.754-23.032 67.533Q-22.796 67.313-22.492 67.193Q-22.187 67.073-21.863 67.073Q-21.357 67.073-21.008 67.176Q-20.660 67.278-20.660 67.654Q-20.660 67.801-20.757 67.902Q-20.854 68.003-21.001 68.003Q-21.155 68.003-21.254 67.904Q-21.353 67.805-21.353 67.654Q-21.353 67.466-21.213 67.374Q-21.415 67.323-21.856 67.323Q-22.211 67.323-22.440 67.519Q-22.669 67.716-22.770 68.025Q-22.871 68.335-22.871 68.683Q-22.871 69.032-22.745 69.338Q-22.618 69.644-22.363 69.828Q-22.109 70.013-21.753 70.013Q-21.531 70.013-21.347 69.929Q-21.162 69.845-21.027 69.690Q-20.892 69.534-20.834 69.326Q-20.820 69.271-20.766 69.271L-20.653 69.271Q-20.622 69.271-20.600 69.295Q-20.578 69.319-20.578 69.353L-20.578 69.374Q-20.663 69.661-20.851 69.859Q-21.039 70.057-21.304 70.160Q-21.569 70.262-21.863 70.262Q-22.293 70.262-22.681 70.056Q-23.069 69.849-23.303 69.486Q-23.538 69.124-23.538 68.683M-20.031 68.659Q-20.031 68.338-19.906 68.049Q-19.781 67.760-19.556 67.537Q-19.330 67.313-19.034 67.193Q-18.739 67.073-18.421 67.073Q-18.093 67.073-17.831 67.173Q-17.570 67.272-17.394 67.454Q-17.218 67.637-17.124 67.895Q-17.030 68.153-17.030 68.485Q-17.030 68.577-17.112 68.598L-19.368 68.598L-19.368 68.659Q-19.368 69.247-19.084 69.630Q-18.800 70.013-18.233 70.013Q-17.912 70.013-17.643 69.820Q-17.375 69.627-17.286 69.312Q-17.279 69.271-17.204 69.257L-17.112 69.257Q-17.030 69.281-17.030 69.353Q-17.030 69.360-17.037 69.387Q-17.149 69.784-17.520 70.023Q-17.891 70.262-18.315 70.262Q-18.752 70.262-19.152 70.054Q-19.552 69.845-19.791 69.478Q-20.031 69.111-20.031 68.659M-19.361 68.389L-17.546 68.389Q-17.546 68.112-17.643 67.860Q-17.741 67.607-17.939 67.451Q-18.137 67.296-18.421 67.296Q-18.698 67.296-18.911 67.454Q-19.125 67.613-19.243 67.868Q-19.361 68.123-19.361 68.389\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M185.682 58.813C92.318 92.795.577 22.716-33.405-70.647\"\u002F>\u003Cpath fill=\"none\" d=\"M185.682 47.432C102.478 77.716 22.486 12.557-7.798-70.648\"\u002F>\u003Cpath fill=\"none\" d=\"M185.682 36.051C112.487 62.691 44.45 2.547 17.81-70.647\"\u002F>\u003Cpath fill=\"none\" d=\"M185.682 24.67C122.779 47.565 66.312-7.744 43.417-70.647\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(174.25 -109.216)\">\u003Cpath d=\"M-57.016 70.194L-58.650 70.194L-58.650 69.914Q-58.421 69.914-58.272 69.880Q-58.123 69.845-58.123 69.705L-58.123 66.086Q-58.123 65.816-58.231 65.754Q-58.339 65.693-58.650 65.693L-58.650 65.412L-57.570 65.337L-57.570 67.723Q-57.464 67.538-57.286 67.396Q-57.108 67.255-56.900 67.181Q-56.691 67.108-56.466 67.108Q-55.960 67.108-55.676 67.331Q-55.392 67.555-55.392 68.051L-55.392 69.705Q-55.392 69.842-55.244 69.878Q-55.095 69.914-54.869 69.914L-54.869 70.194L-56.500 70.194L-56.500 69.914Q-56.271 69.914-56.122 69.880Q-55.973 69.845-55.973 69.705L-55.973 68.065Q-55.973 67.730-56.093 67.530Q-56.213 67.330-56.527 67.330Q-56.797 67.330-57.031 67.466Q-57.265 67.603-57.404 67.837Q-57.542 68.071-57.542 68.345L-57.542 69.705Q-57.542 69.842-57.392 69.878Q-57.241 69.914-57.016 69.914L-57.016 70.194M-52.665 70.194L-54.217 70.194L-54.217 69.914Q-53.991 69.914-53.842 69.880Q-53.694 69.845-53.694 69.705L-53.694 67.856Q-53.694 67.668-53.741 67.584Q-53.789 67.501-53.887 67.482Q-53.984 67.463-54.196 67.463L-54.196 67.183L-53.140 67.108L-53.140 69.705Q-53.140 69.845-53.008 69.880Q-52.877 69.914-52.665 69.914L-52.665 70.194M-53.936 65.887Q-53.936 65.716-53.813 65.597Q-53.690 65.477-53.519 65.477Q-53.352 65.477-53.229 65.597Q-53.106 65.716-53.106 65.887Q-53.106 66.062-53.229 66.185Q-53.352 66.308-53.519 66.308Q-53.690 66.308-53.813 66.185Q-53.936 66.062-53.936 65.887M-52.060 70.727Q-52.060 70.481-51.863 70.297Q-51.667 70.112-51.410 70.033Q-51.547 69.921-51.619 69.760Q-51.691 69.599-51.691 69.418Q-51.691 69.097-51.479 68.851Q-51.814 68.553-51.814 68.143Q-51.814 67.682-51.424 67.395Q-51.034 67.108-50.556 67.108Q-50.084 67.108-49.749 67.354Q-49.575 67.200-49.365 67.118Q-49.155 67.036-48.926 67.036Q-48.762 67.036-48.640 67.143Q-48.519 67.251-48.519 67.415Q-48.519 67.511-48.591 67.583Q-48.662 67.654-48.755 67.654Q-48.854 67.654-48.924 67.581Q-48.994 67.507-48.994 67.408Q-48.994 67.354-48.980 67.323L-48.973 67.309Q-48.967 67.289-48.958 67.278Q-48.950 67.268-48.946 67.261Q-49.302 67.261-49.589 67.484Q-49.302 67.777-49.302 68.143Q-49.302 68.458-49.486 68.690Q-49.671 68.923-49.960 69.051Q-50.248 69.179-50.556 69.179Q-50.758 69.179-50.949 69.129Q-51.140 69.080-51.318 68.970Q-51.410 69.097-51.410 69.240Q-51.410 69.422-51.282 69.557Q-51.154 69.692-50.970 69.692L-50.337 69.692Q-49.889 69.692-49.520 69.763Q-49.151 69.835-48.891 70.064Q-48.632 70.293-48.632 70.727Q-48.632 71.048-48.927 71.250Q-49.223 71.452-49.626 71.541Q-50.030 71.630-50.344 71.630Q-50.662 71.630-51.065 71.541Q-51.469 71.452-51.764 71.250Q-52.060 71.048-52.060 70.727M-51.605 70.727Q-51.605 70.956-51.387 71.105Q-51.168 71.254-50.876 71.322Q-50.583 71.390-50.344 71.390Q-50.180 71.390-49.971 71.354Q-49.763 71.319-49.556 71.238Q-49.349 71.158-49.218 71.030Q-49.086 70.902-49.086 70.727Q-49.086 70.375-49.467 70.281Q-49.848 70.187-50.351 70.187L-50.970 70.187Q-51.209 70.187-51.407 70.338Q-51.605 70.488-51.605 70.727M-50.556 68.940Q-49.889 68.940-49.889 68.143Q-49.889 67.343-50.556 67.343Q-51.226 67.343-51.226 68.143Q-51.226 68.940-50.556 68.940M-46.355 70.194L-47.989 70.194L-47.989 69.914Q-47.760 69.914-47.611 69.880Q-47.463 69.845-47.463 69.705L-47.463 66.086Q-47.463 65.816-47.570 65.754Q-47.678 65.693-47.989 65.693L-47.989 65.412L-46.909 65.337L-46.909 67.723Q-46.803 67.538-46.625 67.396Q-46.448 67.255-46.239 67.181Q-46.031 67.108-45.805 67.108Q-45.299 67.108-45.015 67.331Q-44.732 67.555-44.732 68.051L-44.732 69.705Q-44.732 69.842-44.583 69.878Q-44.434 69.914-44.209 69.914L-44.209 70.194L-45.839 70.194L-45.839 69.914Q-45.610 69.914-45.461 69.880Q-45.313 69.845-45.313 69.705L-45.313 68.065Q-45.313 67.730-45.432 67.530Q-45.552 67.330-45.866 67.330Q-46.137 67.330-46.371 67.466Q-46.605 67.603-46.743 67.837Q-46.882 68.071-46.882 68.345L-46.882 69.705Q-46.882 69.842-46.731 69.878Q-46.581 69.914-46.355 69.914L-46.355 70.194M-43.662 68.659Q-43.662 68.338-43.537 68.049Q-43.412 67.760-43.187 67.537Q-42.961 67.313-42.666 67.193Q-42.370 67.073-42.052 67.073Q-41.724 67.073-41.462 67.173Q-41.201 67.272-41.025 67.454Q-40.849 67.637-40.755 67.895Q-40.661 68.153-40.661 68.485Q-40.661 68.577-40.743 68.598L-42.999 68.598L-42.999 68.659Q-42.999 69.247-42.715 69.630Q-42.431 70.013-41.864 70.013Q-41.543 70.013-41.274 69.820Q-41.006 69.627-40.917 69.312Q-40.910 69.271-40.835 69.257L-40.743 69.257Q-40.661 69.281-40.661 69.353Q-40.661 69.360-40.668 69.387Q-40.781 69.784-41.151 70.023Q-41.522 70.262-41.946 70.262Q-42.384 70.262-42.783 70.054Q-43.183 69.845-43.423 69.478Q-43.662 69.111-43.662 68.659M-42.992 68.389L-41.177 68.389Q-41.177 68.112-41.274 67.860Q-41.372 67.607-41.570 67.451Q-41.768 67.296-42.052 67.296Q-42.329 67.296-42.543 67.454Q-42.756 67.613-42.874 67.868Q-42.992 68.123-42.992 68.389M-38.323 70.194L-40.059 70.194L-40.059 69.914Q-39.830 69.914-39.682 69.880Q-39.533 69.845-39.533 69.705L-39.533 67.856Q-39.533 67.586-39.641 67.525Q-39.748 67.463-40.059 67.463L-40.059 67.183L-39.031 67.108L-39.031 67.815Q-38.901 67.507-38.658 67.308Q-38.415 67.108-38.097 67.108Q-37.879 67.108-37.708 67.232Q-37.537 67.357-37.537 67.569Q-37.537 67.706-37.636 67.805Q-37.735 67.904-37.868 67.904Q-38.005 67.904-38.104 67.805Q-38.203 67.706-38.203 67.569Q-38.203 67.429-38.104 67.330Q-38.395 67.330-38.595 67.526Q-38.795 67.723-38.887 68.017Q-38.979 68.311-38.979 68.591L-38.979 69.705Q-38.979 69.914-38.323 69.914\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(174.25 -109.216)\">\u003Cpath d=\"M-32.490 70.194L-34.226 70.194L-34.226 69.914Q-33.997 69.914-33.848 69.880Q-33.700 69.845-33.700 69.705L-33.700 67.856Q-33.700 67.586-33.807 67.525Q-33.915 67.463-34.226 67.463L-34.226 67.183L-33.197 67.108L-33.197 67.815Q-33.067 67.507-32.825 67.308Q-32.582 67.108-32.264 67.108Q-32.045 67.108-31.874 67.232Q-31.703 67.357-31.703 67.569Q-31.703 67.706-31.803 67.805Q-31.902 67.904-32.035 67.904Q-32.172 67.904-32.271 67.805Q-32.370 67.706-32.370 67.569Q-32.370 67.429-32.271 67.330Q-32.561 67.330-32.761 67.526Q-32.961 67.723-33.054 68.017Q-33.146 68.311-33.146 68.591L-33.146 69.705Q-33.146 69.914-32.490 69.914L-32.490 70.194M-31.160 68.659Q-31.160 68.338-31.035 68.049Q-30.910 67.760-30.685 67.537Q-30.459 67.313-30.164 67.193Q-29.868 67.073-29.550 67.073Q-29.222 67.073-28.960 67.173Q-28.699 67.272-28.523 67.454Q-28.347 67.637-28.253 67.895Q-28.159 68.153-28.159 68.485Q-28.159 68.577-28.241 68.598L-30.497 68.598L-30.497 68.659Q-30.497 69.247-30.213 69.630Q-29.929 70.013-29.362 70.013Q-29.041 70.013-28.773 69.820Q-28.504 69.627-28.415 69.312Q-28.408 69.271-28.333 69.257L-28.241 69.257Q-28.159 69.281-28.159 69.353Q-28.159 69.360-28.166 69.387Q-28.279 69.784-28.649 70.023Q-29.020 70.262-29.444 70.262Q-29.882 70.262-30.282 70.054Q-30.681 69.845-30.921 69.478Q-31.160 69.111-31.160 68.659M-30.490 68.389L-28.675 68.389Q-28.675 68.112-28.773 67.860Q-28.870 67.607-29.068 67.451Q-29.266 67.296-29.550 67.296Q-29.827 67.296-30.041 67.454Q-30.254 67.613-30.372 67.868Q-30.490 68.123-30.490 68.389M-26.183 70.167L-27.164 67.668Q-27.226 67.525-27.344 67.490Q-27.462 67.456-27.677 67.456L-27.677 67.176L-26.197 67.176L-26.197 67.456Q-26.576 67.456-26.576 67.617Q-26.576 67.627-26.563 67.668L-25.848 69.500L-25.175 67.795Q-25.206 67.723-25.206 67.695Q-25.206 67.668-25.233 67.668Q-25.295 67.521-25.413 67.489Q-25.531 67.456-25.742 67.456L-25.742 67.176L-24.345 67.176L-24.345 67.456Q-24.721 67.456-24.721 67.617Q-24.721 67.648-24.714 67.668L-23.958 69.606L-23.271 67.856Q-23.251 67.805-23.251 67.750Q-23.251 67.610-23.364 67.533Q-23.476 67.456-23.617 67.456L-23.617 67.176L-22.396 67.176L-22.396 67.456Q-22.601 67.456-22.757 67.562Q-22.912 67.668-22.984 67.856L-23.890 70.167Q-23.924 70.262-24.037 70.262L-24.105 70.262Q-24.215 70.262-24.252 70.167L-25.035 68.164L-25.821 70.167Q-25.855 70.262-25.968 70.262L-26.036 70.262Q-26.146 70.262-26.183 70.167\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(174.25 -109.216)\">\u003Cpath d=\"M-22.007 69.466Q-22.007 69.134-21.784 68.907Q-21.560 68.680-21.216 68.552Q-20.873 68.423-20.500 68.371Q-20.128 68.318-19.823 68.318L-19.823 68.065Q-19.823 67.860-19.931 67.680Q-20.039 67.501-20.220 67.398Q-20.401 67.296-20.609 67.296Q-21.016 67.296-21.252 67.388Q-21.163 67.425-21.117 67.509Q-21.071 67.593-21.071 67.695Q-21.071 67.791-21.117 67.870Q-21.163 67.948-21.244 67.993Q-21.324 68.037-21.413 68.037Q-21.563 68.037-21.664 67.940Q-21.765 67.842-21.765 67.695Q-21.765 67.073-20.609 67.073Q-20.398 67.073-20.148 67.137Q-19.899 67.200-19.697 67.319Q-19.495 67.439-19.369 67.624Q-19.242 67.808-19.242 68.051L-19.242 69.627Q-19.242 69.743-19.181 69.839Q-19.119 69.934-19.006 69.934Q-18.897 69.934-18.832 69.840Q-18.767 69.746-18.767 69.627L-18.767 69.179L-18.501 69.179L-18.501 69.627Q-18.501 69.897-18.728 70.062Q-18.955 70.228-19.235 70.228Q-19.444 70.228-19.581 70.074Q-19.717 69.921-19.741 69.705Q-19.888 69.972-20.170 70.117Q-20.452 70.262-20.777 70.262Q-21.054 70.262-21.338 70.187Q-21.621 70.112-21.814 69.933Q-22.007 69.753-22.007 69.466M-21.392 69.466Q-21.392 69.640-21.291 69.770Q-21.191 69.900-21.035 69.970Q-20.880 70.040-20.715 70.040Q-20.497 70.040-20.288 69.943Q-20.080 69.845-19.952 69.664Q-19.823 69.483-19.823 69.257L-19.823 68.529Q-20.148 68.529-20.514 68.620Q-20.880 68.711-21.136 68.923Q-21.392 69.134-21.392 69.466M-16.334 70.194L-18.070 70.194L-18.070 69.914Q-17.841 69.914-17.692 69.880Q-17.544 69.845-17.544 69.705L-17.544 67.856Q-17.544 67.586-17.651 67.525Q-17.759 67.463-18.070 67.463L-18.070 67.183L-17.041 67.108L-17.041 67.815Q-16.911 67.507-16.669 67.308Q-16.426 67.108-16.108 67.108Q-15.889 67.108-15.718 67.232Q-15.547 67.357-15.547 67.569Q-15.547 67.706-15.647 67.805Q-15.746 67.904-15.879 67.904Q-16.016 67.904-16.115 67.805Q-16.214 67.706-16.214 67.569Q-16.214 67.429-16.115 67.330Q-16.405 67.330-16.605 67.526Q-16.805 67.723-16.898 68.017Q-16.990 68.311-16.990 68.591L-16.990 69.705Q-16.990 69.914-16.334 69.914L-16.334 70.194M-14.963 68.683Q-14.963 68.345-14.823 68.054Q-14.683 67.764-14.438 67.550Q-14.194 67.337-13.890 67.222Q-13.586 67.108-13.261 67.108Q-12.991 67.108-12.728 67.207Q-12.464 67.306-12.273 67.484L-12.273 66.086Q-12.273 65.816-12.381 65.754Q-12.488 65.693-12.799 65.693L-12.799 65.412L-11.723 65.337L-11.723 69.521Q-11.723 69.709-11.668 69.792Q-11.613 69.876-11.513 69.895Q-11.412 69.914-11.196 69.914L-11.196 70.194L-12.304 70.262L-12.304 69.845Q-12.721 70.262-13.346 70.262Q-13.777 70.262-14.150 70.050Q-14.522 69.839-14.743 69.478Q-14.963 69.117-14.963 68.683M-13.288 70.040Q-13.080 70.040-12.893 69.968Q-12.707 69.897-12.553 69.760Q-12.400 69.623-12.304 69.445L-12.304 67.836Q-12.389 67.689-12.535 67.569Q-12.680 67.449-12.849 67.390Q-13.018 67.330-13.199 67.330Q-13.760 67.330-14.028 67.719Q-14.297 68.109-14.297 68.690Q-14.297 69.261-14.062 69.651Q-13.828 70.040-13.288 70.040\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M-53.322 67.348C-25.787 44.243-1.74 45.5 32.036 33.205c25.933-9.439 41.777-22.437 51.216-48.37-9.29-25.52-33.386-26.254-56.906-39.833C-5.014-36.893-23.835-23.762-41.94 7.598c-11.882 20.58-23.263 39.17-11.382 59.75\"\u002F>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-53.322 67.348C-25.787 44.243-1.74 45.5 32.036 33.205c25.933-9.439 41.777-22.437 51.216-48.37-9.29-25.52-33.386-26.254-56.906-39.833C-5.014-36.893-23.835-23.762-41.94 7.598c-11.882 20.58-23.263 39.17-11.382 59.75\" 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(36.67 -51.282)\">\u003Cpath d=\"M-56.707 70.194L-58.692 70.194L-58.692 69.897Q-58.418 69.897-58.250 69.850Q-58.082 69.803-58.082 69.635L-58.082 67.042L-58.723 67.042L-58.723 66.745L-58.082 66.745L-58.082 65.811Q-58.082 65.546-57.965 65.309Q-57.848 65.073-57.655 64.909Q-57.461 64.745-57.213 64.653Q-56.965 64.561-56.700 64.561Q-56.414 64.561-56.190 64.719Q-55.965 64.878-55.965 65.155Q-55.965 65.311-56.071 65.421Q-56.176 65.530-56.340 65.530Q-56.496 65.530-56.606 65.421Q-56.715 65.311-56.715 65.155Q-56.715 64.948-56.555 64.842Q-56.653 64.819-56.746 64.819Q-56.977 64.819-57.149 64.975Q-57.321 65.132-57.407 65.368Q-57.492 65.604-57.492 65.827L-57.492 66.745L-56.524 66.745L-56.524 67.042L-57.469 67.042L-57.469 69.635Q-57.469 69.803-57.242 69.850Q-57.016 69.897-56.707 69.897L-56.707 70.194M-56.180 68.440Q-56.180 67.960-55.948 67.544Q-55.715 67.128-55.305 66.878Q-54.895 66.628-54.418 66.628Q-53.688 66.628-53.289 67.069Q-52.891 67.510-52.891 68.241Q-52.891 68.346-52.985 68.370L-55.434 68.370L-55.434 68.440Q-55.434 68.850-55.313 69.206Q-55.192 69.561-54.920 69.778Q-54.649 69.995-54.219 69.995Q-53.856 69.995-53.559 69.766Q-53.262 69.538-53.160 69.186Q-53.153 69.139-53.067 69.124L-52.985 69.124Q-52.891 69.151-52.891 69.233Q-52.891 69.241-52.899 69.272Q-52.961 69.499-53.100 69.682Q-53.239 69.866-53.430 69.999Q-53.621 70.132-53.840 70.202Q-54.059 70.272-54.297 70.272Q-54.668 70.272-55.006 70.135Q-55.344 69.999-55.612 69.747Q-55.879 69.495-56.030 69.155Q-56.180 68.815-56.180 68.440M-55.426 68.132L-53.465 68.132Q-53.465 67.827-53.567 67.536Q-53.668 67.245-53.885 67.063Q-54.102 66.882-54.418 66.882Q-54.719 66.882-54.950 67.069Q-55.180 67.257-55.303 67.548Q-55.426 67.839-55.426 68.132M-52.305 69.362Q-52.305 68.878-51.903 68.583Q-51.500 68.288-50.950 68.169Q-50.399 68.049-49.907 68.049L-49.907 67.760Q-49.907 67.534-50.022 67.327Q-50.137 67.120-50.334 67.001Q-50.532 66.882-50.762 66.882Q-51.188 66.882-51.473 66.987Q-51.403 67.014-51.356 67.069Q-51.309 67.124-51.283 67.194Q-51.258 67.264-51.258 67.339Q-51.258 67.444-51.309 67.536Q-51.360 67.628-51.451 67.678Q-51.543 67.729-51.649 67.729Q-51.754 67.729-51.846 67.678Q-51.938 67.628-51.989 67.536Q-52.039 67.444-52.039 67.339Q-52.039 66.921-51.651 66.774Q-51.262 66.628-50.762 66.628Q-50.430 66.628-50.076 66.758Q-49.723 66.889-49.494 67.143Q-49.266 67.397-49.266 67.745L-49.266 69.546Q-49.266 69.678-49.194 69.788Q-49.121 69.897-48.992 69.897Q-48.867 69.897-48.799 69.792Q-48.731 69.686-48.731 69.546L-48.731 69.034L-48.450 69.034L-48.450 69.546Q-48.450 69.749-48.567 69.907Q-48.684 70.065-48.866 70.149Q-49.047 70.233-49.250 70.233Q-49.481 70.233-49.633 70.061Q-49.785 69.889-49.817 69.659Q-49.977 69.940-50.285 70.106Q-50.594 70.272-50.946 70.272Q-51.457 70.272-51.881 70.049Q-52.305 69.827-52.305 69.362M-51.617 69.362Q-51.617 69.647-51.391 69.833Q-51.164 70.018-50.871 70.018Q-50.625 70.018-50.401 69.901Q-50.176 69.784-50.041 69.581Q-49.907 69.378-49.907 69.124L-49.907 68.292Q-50.172 68.292-50.457 68.346Q-50.742 68.401-51.014 68.530Q-51.285 68.659-51.451 68.866Q-51.617 69.073-51.617 69.362M-48.114 70.186L-48.114 68.964Q-48.114 68.936-48.082 68.905Q-48.051 68.874-48.028 68.874L-47.922 68.874Q-47.852 68.874-47.836 68.936Q-47.774 69.257-47.635 69.497Q-47.496 69.737-47.264 69.878Q-47.032 70.018-46.723 70.018Q-46.485 70.018-46.276 69.958Q-46.067 69.897-45.930 69.749Q-45.793 69.600-45.793 69.354Q-45.793 69.100-46.004 68.934Q-46.215 68.768-46.485 68.714L-47.106 68.600Q-47.512 68.522-47.813 68.266Q-48.114 68.010-48.114 67.635Q-48.114 67.268-47.912 67.046Q-47.711 66.823-47.387 66.725Q-47.063 66.628-46.723 66.628Q-46.258 66.628-45.961 66.835L-45.739 66.651Q-45.715 66.628-45.684 66.628L-45.633 66.628Q-45.602 66.628-45.575 66.655Q-45.547 66.682-45.547 66.714L-45.547 67.698Q-45.547 67.729-45.573 67.758Q-45.598 67.788-45.633 67.788L-45.739 67.788Q-45.774 67.788-45.801 67.760Q-45.828 67.733-45.828 67.698Q-45.828 67.299-46.080 67.079Q-46.332 66.858-46.731 66.858Q-47.086 66.858-47.369 66.981Q-47.653 67.104-47.653 67.409Q-47.653 67.628-47.451 67.760Q-47.250 67.893-47.004 67.936L-46.379 68.049Q-45.950 68.139-45.641 68.436Q-45.332 68.733-45.332 69.147Q-45.332 69.717-45.731 69.995Q-46.129 70.272-46.723 70.272Q-47.274 70.272-47.625 69.936L-47.922 70.249Q-47.946 70.272-47.981 70.272L-48.028 70.272Q-48.051 70.272-48.082 70.241Q-48.114 70.210-48.114 70.186M-42.946 70.194L-44.723 70.194L-44.723 69.897Q-44.450 69.897-44.282 69.850Q-44.114 69.803-44.114 69.635L-44.114 67.499Q-44.114 67.284-44.170 67.188Q-44.227 67.092-44.340 67.071Q-44.453 67.049-44.700 67.049L-44.700 66.753L-43.500 66.667L-43.500 69.635Q-43.500 69.803-43.354 69.850Q-43.207 69.897-42.946 69.897L-42.946 70.194M-44.387 65.272Q-44.387 65.081-44.252 64.950Q-44.117 64.819-43.922 64.819Q-43.801 64.819-43.698 64.882Q-43.594 64.944-43.532 65.048Q-43.469 65.151-43.469 65.272Q-43.469 65.467-43.600 65.602Q-43.731 65.737-43.922 65.737Q-44.121 65.737-44.254 65.604Q-44.387 65.471-44.387 65.272M-41.532 70.194L-41.813 70.194L-41.813 65.475Q-41.813 65.260-41.875 65.165Q-41.938 65.069-42.055 65.048Q-42.172 65.026-42.418 65.026L-42.418 64.729L-41.196 64.643L-41.196 67.132Q-40.719 66.667-40.020 66.667Q-39.539 66.667-39.131 66.911Q-38.723 67.155-38.487 67.569Q-38.250 67.983-38.250 68.467Q-38.250 68.842-38.399 69.171Q-38.547 69.499-38.817 69.751Q-39.086 70.003-39.430 70.137Q-39.774 70.272-40.133 70.272Q-40.453 70.272-40.752 70.124Q-41.051 69.975-41.258 69.714L-41.532 70.194M-41.172 67.522L-41.172 69.362Q-41.020 69.659-40.760 69.839Q-40.500 70.018-40.188 70.018Q-39.762 70.018-39.494 69.799Q-39.227 69.581-39.112 69.235Q-38.996 68.889-38.996 68.467Q-38.996 67.819-39.244 67.370Q-39.492 66.921-40.090 66.921Q-40.426 66.921-40.715 67.079Q-41.004 67.237-41.172 67.522M-35.813 70.194L-37.645 70.194L-37.645 69.897Q-37.371 69.897-37.203 69.850Q-37.035 69.803-37.035 69.635L-37.035 65.475Q-37.035 65.260-37.098 65.165Q-37.160 65.069-37.280 65.048Q-37.399 65.026-37.645 65.026L-37.645 64.729L-36.422 64.643L-36.422 69.635Q-36.422 69.803-36.254 69.850Q-36.086 69.897-35.813 69.897L-35.813 70.194M-35.367 68.440Q-35.367 67.960-35.135 67.544Q-34.903 67.128-34.492 66.878Q-34.082 66.628-33.606 66.628Q-32.875 66.628-32.477 67.069Q-32.078 67.510-32.078 68.241Q-32.078 68.346-32.172 68.370L-34.621 68.370L-34.621 68.440Q-34.621 68.850-34.500 69.206Q-34.379 69.561-34.108 69.778Q-33.836 69.995-33.407 69.995Q-33.043 69.995-32.746 69.766Q-32.450 69.538-32.348 69.186Q-32.340 69.139-32.254 69.124L-32.172 69.124Q-32.078 69.151-32.078 69.233Q-32.078 69.241-32.086 69.272Q-32.149 69.499-32.287 69.682Q-32.426 69.866-32.617 69.999Q-32.809 70.132-33.028 70.202Q-33.246 70.272-33.485 70.272Q-33.856 70.272-34.194 70.135Q-34.532 69.999-34.799 69.747Q-35.067 69.495-35.217 69.155Q-35.367 68.815-35.367 68.440M-34.614 68.132L-32.653 68.132Q-32.653 67.827-32.754 67.536Q-32.856 67.245-33.073 67.063Q-33.289 66.882-33.606 66.882Q-33.907 66.882-34.137 67.069Q-34.367 67.257-34.491 67.548Q-34.614 67.839-34.614 68.132\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(36.67 -51.282)\">\u003Cpath d=\"M-28.697 70.186L-28.697 68.964Q-28.697 68.936-28.666 68.905Q-28.634 68.874-28.611 68.874L-28.505 68.874Q-28.435 68.874-28.419 68.936Q-28.357 69.257-28.218 69.497Q-28.080 69.737-27.847 69.878Q-27.615 70.018-27.306 70.018Q-27.068 70.018-26.859 69.958Q-26.650 69.897-26.513 69.749Q-26.376 69.600-26.376 69.354Q-26.376 69.100-26.587 68.934Q-26.798 68.768-27.068 68.714L-27.689 68.600Q-28.095 68.522-28.396 68.266Q-28.697 68.010-28.697 67.635Q-28.697 67.268-28.496 67.046Q-28.294 66.823-27.970 66.725Q-27.646 66.628-27.306 66.628Q-26.841 66.628-26.544 66.835L-26.322 66.651Q-26.298 66.628-26.267 66.628L-26.216 66.628Q-26.185 66.628-26.158 66.655Q-26.130 66.682-26.130 66.714L-26.130 67.698Q-26.130 67.729-26.156 67.758Q-26.181 67.788-26.216 67.788L-26.322 67.788Q-26.357 67.788-26.384 67.760Q-26.412 67.733-26.412 67.698Q-26.412 67.299-26.664 67.079Q-26.916 66.858-27.314 66.858Q-27.669 66.858-27.953 66.981Q-28.236 67.104-28.236 67.409Q-28.236 67.628-28.035 67.760Q-27.833 67.893-27.587 67.936L-26.962 68.049Q-26.533 68.139-26.224 68.436Q-25.916 68.733-25.916 69.147Q-25.916 69.717-26.314 69.995Q-26.712 70.272-27.306 70.272Q-27.857 70.272-28.208 69.936L-28.505 70.249Q-28.529 70.272-28.564 70.272L-28.611 70.272Q-28.634 70.272-28.666 70.241Q-28.697 70.210-28.697 70.186M-25.388 68.440Q-25.388 67.960-25.156 67.544Q-24.923 67.128-24.513 66.878Q-24.103 66.628-23.626 66.628Q-22.896 66.628-22.498 67.069Q-22.099 67.510-22.099 68.241Q-22.099 68.346-22.193 68.370L-24.642 68.370L-24.642 68.440Q-24.642 68.850-24.521 69.206Q-24.400 69.561-24.128 69.778Q-23.857 69.995-23.427 69.995Q-23.064 69.995-22.767 69.766Q-22.470 69.538-22.369 69.186Q-22.361 69.139-22.275 69.124L-22.193 69.124Q-22.099 69.151-22.099 69.233Q-22.099 69.241-22.107 69.272Q-22.169 69.499-22.308 69.682Q-22.447 69.866-22.638 69.999Q-22.830 70.132-23.048 70.202Q-23.267 70.272-23.505 70.272Q-23.876 70.272-24.214 70.135Q-24.552 69.999-24.820 69.747Q-25.087 69.495-25.238 69.155Q-25.388 68.815-25.388 68.440M-24.634 68.132L-22.673 68.132Q-22.673 67.827-22.775 67.536Q-22.876 67.245-23.093 67.063Q-23.310 66.882-23.626 66.882Q-23.927 66.882-24.158 67.069Q-24.388 67.257-24.511 67.548Q-24.634 67.839-24.634 68.132M-20.986 69.233L-20.986 67.042L-21.689 67.042L-21.689 66.788Q-21.333 66.788-21.091 66.555Q-20.849 66.323-20.738 65.975Q-20.626 65.628-20.626 65.272L-20.345 65.272L-20.345 66.745L-19.169 66.745L-19.169 67.042L-20.345 67.042L-20.345 69.217Q-20.345 69.538-20.226 69.766Q-20.107 69.995-19.826 69.995Q-19.646 69.995-19.529 69.872Q-19.412 69.749-19.359 69.569Q-19.306 69.389-19.306 69.217L-19.306 68.745L-19.025 68.745L-19.025 69.233Q-19.025 69.487-19.130 69.727Q-19.236 69.967-19.433 70.120Q-19.630 70.272-19.888 70.272Q-20.205 70.272-20.457 70.149Q-20.708 70.026-20.847 69.792Q-20.986 69.557-20.986 69.233\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-size=\"7\">\u003Cg transform=\"translate(53.341 -86.422)\">\u003Cpath d=\"M-58.698 68.683Q-58.698 68.355-58.563 68.054Q-58.428 67.754-58.192 67.533Q-57.956 67.313-57.652 67.193Q-57.347 67.073-57.023 67.073Q-56.517 67.073-56.168 67.176Q-55.820 67.278-55.820 67.654Q-55.820 67.801-55.917 67.902Q-56.014 68.003-56.161 68.003Q-56.315 68.003-56.414 67.904Q-56.513 67.805-56.513 67.654Q-56.513 67.466-56.373 67.374Q-56.575 67.323-57.016 67.323Q-57.371 67.323-57.600 67.519Q-57.829 67.716-57.930 68.025Q-58.031 68.335-58.031 68.683Q-58.031 69.032-57.905 69.338Q-57.778 69.644-57.523 69.828Q-57.269 70.013-56.913 70.013Q-56.691 70.013-56.507 69.929Q-56.322 69.845-56.187 69.690Q-56.052 69.534-55.994 69.326Q-55.980 69.271-55.926 69.271L-55.813 69.271Q-55.782 69.271-55.760 69.295Q-55.738 69.319-55.738 69.353L-55.738 69.374Q-55.823 69.661-56.011 69.859Q-56.199 70.057-56.464 70.160Q-56.729 70.262-57.023 70.262Q-57.453 70.262-57.841 70.056Q-58.229 69.849-58.463 69.486Q-58.698 69.124-58.698 68.683M-55.191 68.711Q-55.191 68.369-55.056 68.070Q-54.921 67.771-54.681 67.547Q-54.442 67.323-54.124 67.198Q-53.806 67.073-53.475 67.073Q-53.031 67.073-52.631 67.289Q-52.231 67.504-51.997 67.882Q-51.762 68.259-51.762 68.711Q-51.762 69.052-51.904 69.336Q-52.046 69.620-52.291 69.827Q-52.535 70.033-52.844 70.148Q-53.154 70.262-53.475 70.262Q-53.906 70.262-54.307 70.061Q-54.709 69.859-54.950 69.507Q-55.191 69.155-55.191 68.711M-53.475 70.013Q-52.873 70.013-52.649 69.635Q-52.426 69.257-52.426 68.625Q-52.426 68.013-52.660 67.654Q-52.894 67.296-53.475 67.296Q-54.528 67.296-54.528 68.625Q-54.528 69.257-54.302 69.635Q-54.076 70.013-53.475 70.013M-51.168 70.187L-51.168 69.124Q-51.168 69.100-51.140 69.073Q-51.113 69.046-51.089 69.046L-50.980 69.046Q-50.915 69.046-50.901 69.104Q-50.805 69.538-50.559 69.789Q-50.313 70.040-49.900 70.040Q-49.558 70.040-49.305 69.907Q-49.052 69.774-49.052 69.466Q-49.052 69.309-49.146 69.194Q-49.240 69.080-49.378 69.011Q-49.517 68.943-49.684 68.905L-50.265 68.806Q-50.621 68.738-50.894 68.517Q-51.168 68.297-51.168 67.955Q-51.168 67.706-51.057 67.531Q-50.946 67.357-50.759 67.258Q-50.573 67.159-50.358 67.116Q-50.142 67.073-49.900 67.073Q-49.486 67.073-49.206 67.255L-48.991 67.080Q-48.980 67.077-48.973 67.075Q-48.967 67.073-48.956 67.073L-48.905 67.073Q-48.878 67.073-48.854 67.097Q-48.830 67.121-48.830 67.149L-48.830 67.996Q-48.830 68.017-48.854 68.044Q-48.878 68.071-48.905 68.071L-49.018 68.071Q-49.045 68.071-49.071 68.046Q-49.096 68.020-49.096 67.996Q-49.096 67.760-49.202 67.596Q-49.308 67.432-49.491 67.350Q-49.674 67.268-49.907 67.268Q-50.235 67.268-50.491 67.371Q-50.747 67.473-50.747 67.750Q-50.747 67.945-50.564 68.054Q-50.382 68.164-50.153 68.205L-49.578 68.311Q-49.332 68.359-49.119 68.487Q-48.905 68.615-48.768 68.818Q-48.632 69.022-48.632 69.271Q-48.632 69.784-48.997 70.023Q-49.363 70.262-49.900 70.262Q-50.395 70.262-50.727 69.968L-50.993 70.242Q-51.014 70.262-51.041 70.262L-51.089 70.262Q-51.113 70.262-51.140 70.235Q-51.168 70.208-51.168 70.187M-47.476 69.353L-47.476 67.456L-48.116 67.456L-48.116 67.234Q-47.798 67.234-47.581 67.024Q-47.364 66.814-47.263 66.504Q-47.162 66.195-47.162 65.887L-46.895 65.887L-46.895 67.176L-45.819 67.176L-45.819 67.456L-46.895 67.456L-46.895 69.340Q-46.895 69.616-46.791 69.815Q-46.687 70.013-46.427 70.013Q-46.270 70.013-46.164 69.909Q-46.058 69.804-46.008 69.651Q-45.959 69.497-45.959 69.340L-45.959 68.926L-45.692 68.926L-45.692 69.353Q-45.692 69.579-45.791 69.789Q-45.890 69.999-46.075 70.131Q-46.260 70.262-46.489 70.262Q-46.926 70.262-47.201 70.025Q-47.476 69.787-47.476 69.353\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(53.341 -86.422)\">\u003Cpath d=\"M-37.154 71.503L-41.567 71.503Q-41.635 71.493-41.681 71.447Q-41.728 71.401-41.728 71.329Q-41.728 71.185-41.567 71.161L-37.154 71.161Q-36.994 71.185-36.994 71.329Q-36.994 71.401-37.040 71.447Q-37.086 71.493-37.154 71.503M-37.247 69.941L-41.635 67.829Q-41.728 67.795-41.728 67.682Q-41.728 67.572-41.635 67.528L-37.247 65.419Q-37.216 65.399-37.165 65.399Q-37.096 65.399-37.045 65.450Q-36.994 65.501-36.994 65.566Q-36.994 65.672-37.079 65.720L-41.160 67.682L-37.079 69.640Q-36.994 69.688-36.994 69.787Q-36.994 69.859-37.045 69.910Q-37.096 69.962-37.165 69.962Q-37.216 69.962-37.247 69.941\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(53.341 -86.422)\">\u003Cpath d=\"M-33.224 68.683Q-33.224 68.345-33.083 68.054Q-32.943 67.764-32.699 67.550Q-32.455 67.337-32.150 67.222Q-31.846 67.108-31.521 67.108Q-31.251 67.108-30.988 67.207Q-30.725 67.306-30.534 67.484L-30.534 66.086Q-30.534 65.816-30.641 65.754Q-30.749 65.693-31.060 65.693L-31.060 65.412L-29.983 65.337L-29.983 69.521Q-29.983 69.709-29.929 69.792Q-29.874 69.876-29.773 69.895Q-29.672 69.914-29.457 69.914L-29.457 70.194L-30.564 70.262L-30.564 69.845Q-30.981 70.262-31.607 70.262Q-32.038 70.262-32.410 70.050Q-32.783 69.839-33.003 69.478Q-33.224 69.117-33.224 68.683M-31.549 70.040Q-31.340 70.040-31.154 69.968Q-30.968 69.897-30.814 69.760Q-30.660 69.623-30.564 69.445L-30.564 67.836Q-30.650 67.689-30.795 67.569Q-30.940 67.449-31.110 67.390Q-31.279 67.330-31.460 67.330Q-32.020 67.330-32.289 67.719Q-32.557 68.109-32.557 68.690Q-32.557 69.261-32.323 69.651Q-32.089 70.040-31.549 70.040\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-warn)\" stroke=\"none\" d=\"M159.629-54.998a2.4 2.4 0 1 0-4.8 0 2.4 2.4 0 0 0 4.8 0m-2.4 0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(125.764 -123.442)\">\u003Cpath d=\"M-58.123 69.360L-58.123 67.856Q-58.123 67.586-58.231 67.525Q-58.339 67.463-58.650 67.463L-58.650 67.183L-57.542 67.108L-57.542 69.340L-57.542 69.360Q-57.542 69.640-57.491 69.784Q-57.440 69.927-57.298 69.984Q-57.156 70.040-56.869 70.040Q-56.616 70.040-56.411 69.900Q-56.206 69.760-56.090 69.534Q-55.973 69.309-55.973 69.059L-55.973 67.856Q-55.973 67.586-56.081 67.525Q-56.189 67.463-56.500 67.463L-56.500 67.183L-55.392 67.108L-55.392 69.521Q-55.392 69.712-55.339 69.794Q-55.286 69.876-55.186 69.895Q-55.085 69.914-54.869 69.914L-54.869 70.194L-55.946 70.262L-55.946 69.698Q-56.055 69.880-56.201 70.003Q-56.346 70.126-56.532 70.194Q-56.719 70.262-56.920 70.262Q-58.123 70.262-58.123 69.360M-52.600 70.194L-54.234 70.194L-54.234 69.914Q-54.005 69.914-53.856 69.880Q-53.707 69.845-53.707 69.705L-53.707 67.856Q-53.707 67.586-53.815 67.525Q-53.923 67.463-54.234 67.463L-54.234 67.183L-53.174 67.108L-53.174 67.757Q-53.003 67.449-52.699 67.278Q-52.395 67.108-52.050 67.108Q-51.544 67.108-51.260 67.331Q-50.976 67.555-50.976 68.051L-50.976 69.705Q-50.976 69.842-50.828 69.878Q-50.679 69.914-50.453 69.914L-50.453 70.194L-52.084 70.194L-52.084 69.914Q-51.855 69.914-51.706 69.880Q-51.557 69.845-51.557 69.705L-51.557 68.065Q-51.557 67.730-51.677 67.530Q-51.797 67.330-52.111 67.330Q-52.381 67.330-52.615 67.466Q-52.849 67.603-52.988 67.837Q-53.126 68.071-53.126 68.345L-53.126 69.705Q-53.126 69.842-52.976 69.878Q-52.825 69.914-52.600 69.914L-52.600 70.194M-49.866 68.683Q-49.866 68.355-49.731 68.054Q-49.595 67.754-49.360 67.533Q-49.124 67.313-48.820 67.193Q-48.515 67.073-48.191 67.073Q-47.685 67.073-47.336 67.176Q-46.988 67.278-46.988 67.654Q-46.988 67.801-47.085 67.902Q-47.182 68.003-47.329 68.003Q-47.483 68.003-47.582 67.904Q-47.681 67.805-47.681 67.654Q-47.681 67.466-47.541 67.374Q-47.743 67.323-48.184 67.323Q-48.539 67.323-48.768 67.519Q-48.997 67.716-49.098 68.025Q-49.199 68.335-49.199 68.683Q-49.199 69.032-49.073 69.338Q-48.946 69.644-48.691 69.828Q-48.437 70.013-48.081 70.013Q-47.859 70.013-47.675 69.929Q-47.490 69.845-47.355 69.690Q-47.220 69.534-47.162 69.326Q-47.148 69.271-47.094 69.271L-46.981 69.271Q-46.950 69.271-46.928 69.295Q-46.906 69.319-46.906 69.353L-46.906 69.374Q-46.991 69.661-47.179 69.859Q-47.367 70.057-47.632 70.160Q-47.897 70.262-48.191 70.262Q-48.621 70.262-49.009 70.056Q-49.397 69.849-49.631 69.486Q-49.866 69.124-49.866 68.683M-46.359 68.711Q-46.359 68.369-46.224 68.070Q-46.089 67.771-45.849 67.547Q-45.610 67.323-45.292 67.198Q-44.974 67.073-44.643 67.073Q-44.199 67.073-43.799 67.289Q-43.399 67.504-43.165 67.882Q-42.930 68.259-42.930 68.711Q-42.930 69.052-43.072 69.336Q-43.214 69.620-43.459 69.827Q-43.703 70.033-44.012 70.148Q-44.322 70.262-44.643 70.262Q-45.074 70.262-45.475 70.061Q-45.877 69.859-46.118 69.507Q-46.359 69.155-46.359 68.711M-44.643 70.013Q-44.041 70.013-43.817 69.635Q-43.594 69.257-43.594 68.625Q-43.594 68.013-43.828 67.654Q-44.062 67.296-44.643 67.296Q-45.696 67.296-45.696 68.625Q-45.696 69.257-45.470 69.635Q-45.244 70.013-44.643 70.013M-40.654 70.194L-42.288 70.194L-42.288 69.914Q-42.059 69.914-41.910 69.880Q-41.762 69.845-41.762 69.705L-41.762 67.856Q-41.762 67.586-41.869 67.525Q-41.977 67.463-42.288 67.463L-42.288 67.183L-41.228 67.108L-41.228 67.757Q-41.057 67.449-40.753 67.278Q-40.449 67.108-40.104 67.108Q-39.598 67.108-39.314 67.331Q-39.031 67.555-39.031 68.051L-39.031 69.705Q-39.031 69.842-38.882 69.878Q-38.733 69.914-38.508 69.914L-38.508 70.194L-40.138 70.194L-40.138 69.914Q-39.909 69.914-39.760 69.880Q-39.612 69.845-39.612 69.705L-39.612 68.065Q-39.612 67.730-39.731 67.530Q-39.851 67.330-40.165 67.330Q-40.435 67.330-40.669 67.466Q-40.904 67.603-41.042 67.837Q-41.180 68.071-41.180 68.345L-41.180 69.705Q-41.180 69.842-41.030 69.878Q-40.880 69.914-40.654 69.914L-40.654 70.194M-37.920 70.187L-37.920 69.124Q-37.920 69.100-37.892 69.073Q-37.865 69.046-37.841 69.046L-37.732 69.046Q-37.667 69.046-37.653 69.104Q-37.557 69.538-37.311 69.789Q-37.065 70.040-36.652 70.040Q-36.310 70.040-36.057 69.907Q-35.804 69.774-35.804 69.466Q-35.804 69.309-35.898 69.194Q-35.992 69.080-36.130 69.011Q-36.269 68.943-36.436 68.905L-37.017 68.806Q-37.373 68.738-37.646 68.517Q-37.920 68.297-37.920 67.955Q-37.920 67.706-37.809 67.531Q-37.698 67.357-37.511 67.258Q-37.325 67.159-37.110 67.116Q-36.894 67.073-36.652 67.073Q-36.238 67.073-35.958 67.255L-35.742 67.080Q-35.732 67.077-35.725 67.075Q-35.719 67.073-35.708 67.073L-35.657 67.073Q-35.630 67.073-35.606 67.097Q-35.582 67.121-35.582 67.149L-35.582 67.996Q-35.582 68.017-35.606 68.044Q-35.630 68.071-35.657 68.071L-35.770 68.071Q-35.797 68.071-35.823 68.046Q-35.848 68.020-35.848 67.996Q-35.848 67.760-35.954 67.596Q-36.060 67.432-36.243 67.350Q-36.426 67.268-36.658 67.268Q-36.987 67.268-37.243 67.371Q-37.499 67.473-37.499 67.750Q-37.499 67.945-37.316 68.054Q-37.134 68.164-36.905 68.205L-36.330 68.311Q-36.084 68.359-35.871 68.487Q-35.657 68.615-35.520 68.818Q-35.384 69.022-35.384 69.271Q-35.384 69.784-35.749 70.023Q-36.115 70.262-36.652 70.262Q-37.147 70.262-37.479 69.968L-37.745 70.242Q-37.766 70.262-37.793 70.262L-37.841 70.262Q-37.865 70.262-37.892 70.235Q-37.920 70.208-37.920 70.187M-34.228 69.353L-34.228 67.456L-34.867 67.456L-34.867 67.234Q-34.550 67.234-34.333 67.024Q-34.116 66.814-34.015 66.504Q-33.914 66.195-33.914 65.887L-33.647 65.887L-33.647 67.176L-32.571 67.176L-32.571 67.456L-33.647 67.456L-33.647 69.340Q-33.647 69.616-33.543 69.815Q-33.439 70.013-33.179 70.013Q-33.022 70.013-32.916 69.909Q-32.810 69.804-32.760 69.651Q-32.711 69.497-32.711 69.340L-32.711 68.926L-32.444 68.926L-32.444 69.353Q-32.444 69.579-32.543 69.789Q-32.642 69.999-32.827 70.131Q-33.012 70.262-33.241 70.262Q-33.678 70.262-33.953 70.025Q-34.228 69.787-34.228 69.353M-29.884 70.194L-31.620 70.194L-31.620 69.914Q-31.391 69.914-31.243 69.880Q-31.094 69.845-31.094 69.705L-31.094 67.856Q-31.094 67.586-31.202 67.525Q-31.309 67.463-31.620 67.463L-31.620 67.183L-30.592 67.108L-30.592 67.815Q-30.462 67.507-30.219 67.308Q-29.976 67.108-29.658 67.108Q-29.440 67.108-29.269 67.232Q-29.098 67.357-29.098 67.569Q-29.098 67.706-29.197 67.805Q-29.296 67.904-29.429 67.904Q-29.566 67.904-29.665 67.805Q-29.764 67.706-29.764 67.569Q-29.764 67.429-29.665 67.330Q-29.956 67.330-30.156 67.526Q-30.356 67.723-30.448 68.017Q-30.540 68.311-30.540 68.591L-30.540 69.705Q-30.540 69.914-29.884 69.914L-29.884 70.194M-28.455 69.466Q-28.455 69.134-28.231 68.907Q-28.008 68.680-27.664 68.552Q-27.321 68.423-26.948 68.371Q-26.575 68.318-26.271 68.318L-26.271 68.065Q-26.271 67.860-26.379 67.680Q-26.487 67.501-26.668 67.398Q-26.849 67.296-27.057 67.296Q-27.464 67.296-27.700 67.388Q-27.611 67.425-27.565 67.509Q-27.519 67.593-27.519 67.695Q-27.519 67.791-27.565 67.870Q-27.611 67.948-27.691 67.993Q-27.772 68.037-27.861 68.037Q-28.011 68.037-28.112 67.940Q-28.213 67.842-28.213 67.695Q-28.213 67.073-27.057 67.073Q-26.845 67.073-26.596 67.137Q-26.346 67.200-26.145 67.319Q-25.943 67.439-25.817 67.624Q-25.690 67.808-25.690 68.051L-25.690 69.627Q-25.690 69.743-25.629 69.839Q-25.567 69.934-25.454 69.934Q-25.345 69.934-25.280 69.840Q-25.215 69.746-25.215 69.627L-25.215 69.179L-24.949 69.179L-24.949 69.627Q-24.949 69.897-25.176 70.062Q-25.403 70.228-25.683 70.228Q-25.892 70.228-26.029 70.074Q-26.165 69.921-26.189 69.705Q-26.336 69.972-26.618 70.117Q-26.900 70.262-27.225 70.262Q-27.502 70.262-27.785 70.187Q-28.069 70.112-28.262 69.933Q-28.455 69.753-28.455 69.466M-27.840 69.466Q-27.840 69.640-27.739 69.770Q-27.638 69.900-27.483 69.970Q-27.327 70.040-27.163 70.040Q-26.945 70.040-26.736 69.943Q-26.528 69.845-26.399 69.664Q-26.271 69.483-26.271 69.257L-26.271 68.529Q-26.596 68.529-26.962 68.620Q-27.327 68.711-27.584 68.923Q-27.840 69.134-27.840 69.466M-22.915 70.194L-24.467 70.194L-24.467 69.914Q-24.241 69.914-24.092 69.880Q-23.944 69.845-23.944 69.705L-23.944 67.856Q-23.944 67.668-23.991 67.584Q-24.039 67.501-24.137 67.482Q-24.234 67.463-24.446 67.463L-24.446 67.183L-23.390 67.108L-23.390 69.705Q-23.390 69.845-23.258 69.880Q-23.127 69.914-22.915 69.914L-22.915 70.194M-24.186 65.887Q-24.186 65.716-24.063 65.597Q-23.940 65.477-23.769 65.477Q-23.602 65.477-23.479 65.597Q-23.356 65.716-23.356 65.887Q-23.356 66.062-23.479 66.185Q-23.602 66.308-23.769 66.308Q-23.940 66.308-24.063 66.185Q-24.186 66.062-24.186 65.887M-20.587 70.194L-22.221 70.194L-22.221 69.914Q-21.992 69.914-21.843 69.880Q-21.695 69.845-21.695 69.705L-21.695 67.856Q-21.695 67.586-21.802 67.525Q-21.910 67.463-22.221 67.463L-22.221 67.183L-21.161 67.108L-21.161 67.757Q-20.991 67.449-20.686 67.278Q-20.382 67.108-20.037 67.108Q-19.531 67.108-19.247 67.331Q-18.964 67.555-18.964 68.051L-18.964 69.705Q-18.964 69.842-18.815 69.878Q-18.666 69.914-18.441 69.914L-18.441 70.194L-20.071 70.194L-20.071 69.914Q-19.842 69.914-19.693 69.880Q-19.545 69.845-19.545 69.705L-19.545 68.065Q-19.545 67.730-19.664 67.530Q-19.784 67.330-20.098 67.330Q-20.368 67.330-20.603 67.466Q-20.837 67.603-20.975 67.837Q-21.114 68.071-21.114 68.345L-21.114 69.705Q-21.114 69.842-20.963 69.878Q-20.813 69.914-20.587 69.914L-20.587 70.194M-17.894 68.659Q-17.894 68.338-17.769 68.049Q-17.644 67.760-17.419 67.537Q-17.193 67.313-16.897 67.193Q-16.602 67.073-16.284 67.073Q-15.956 67.073-15.694 67.173Q-15.433 67.272-15.257 67.454Q-15.081 67.637-14.987 67.895Q-14.893 68.153-14.893 68.485Q-14.893 68.577-14.975 68.598L-17.231 68.598L-17.231 68.659Q-17.231 69.247-16.947 69.630Q-16.663 70.013-16.096 70.013Q-15.775 70.013-15.506 69.820Q-15.238 69.627-15.149 69.312Q-15.142 69.271-15.067 69.257L-14.975 69.257Q-14.893 69.281-14.893 69.353Q-14.893 69.360-14.900 69.387Q-15.012 69.784-15.383 70.023Q-15.754 70.262-16.178 70.262Q-16.616 70.262-17.015 70.054Q-17.415 69.845-17.655 69.478Q-17.894 69.111-17.894 68.659M-17.224 68.389L-15.409 68.389Q-15.409 68.112-15.506 67.860Q-15.604 67.607-15.802 67.451Q-16 67.296-16.284 67.296Q-16.561 67.296-16.774 67.454Q-16.988 67.613-17.106 67.868Q-17.224 68.123-17.224 68.389M-14.305 68.683Q-14.305 68.345-14.165 68.054Q-14.025 67.764-13.780 67.550Q-13.536 67.337-13.232 67.222Q-12.928 67.108-12.603 67.108Q-12.333 67.108-12.070 67.207Q-11.806 67.306-11.615 67.484L-11.615 66.086Q-11.615 65.816-11.723 65.754Q-11.830 65.693-12.141 65.693L-12.141 65.412L-11.065 65.337L-11.065 69.521Q-11.065 69.709-11.010 69.792Q-10.955 69.876-10.855 69.895Q-10.754 69.914-10.538 69.914L-10.538 70.194L-11.646 70.262L-11.646 69.845Q-12.063 70.262-12.688 70.262Q-13.119 70.262-13.491 70.050Q-13.864 69.839-14.085 69.478Q-14.305 69.117-14.305 68.683M-12.630 70.040Q-12.422 70.040-12.235 69.968Q-12.049 69.897-11.895 69.760Q-11.741 69.623-11.646 69.445L-11.646 67.836Q-11.731 67.689-11.877 67.569Q-12.022 67.449-12.191 67.390Q-12.360 67.330-12.541 67.330Q-13.102 67.330-13.370 67.719Q-13.638 68.109-13.638 68.690Q-13.638 69.261-13.404 69.651Q-13.170 70.040-12.630 70.040\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(125.764 -123.442)\">\u003Cpath d=\"M-7.196 68.711Q-7.196 68.369-7.061 68.070Q-6.926 67.771-6.686 67.547Q-6.447 67.323-6.129 67.198Q-5.811 67.073-5.480 67.073Q-5.035 67.073-4.636 67.289Q-4.236 67.504-4.001 67.882Q-3.767 68.259-3.767 68.711Q-3.767 69.052-3.909 69.336Q-4.051 69.620-4.295 69.827Q-4.540 70.033-4.849 70.148Q-5.158 70.262-5.480 70.262Q-5.910 70.262-6.312 70.061Q-6.714 69.859-6.955 69.507Q-7.196 69.155-7.196 68.711M-5.480 70.013Q-4.878 70.013-4.654 69.635Q-4.430 69.257-4.430 68.625Q-4.430 68.013-4.665 67.654Q-4.899 67.296-5.480 67.296Q-6.532 67.296-6.532 68.625Q-6.532 69.257-6.307 69.635Q-6.081 70.013-5.480 70.013M-1.529 71.551L-3.159 71.551L-3.159 71.271Q-2.930 71.271-2.781 71.236Q-2.633 71.202-2.633 71.062L-2.633 67.716Q-2.633 67.545-2.769 67.504Q-2.906 67.463-3.159 67.463L-3.159 67.183L-2.079 67.108L-2.079 67.514Q-1.857 67.313-1.570 67.210Q-1.282 67.108-0.975 67.108Q-0.548 67.108-0.184 67.321Q0.180 67.535 0.394 67.899Q0.608 68.263 0.608 68.683Q0.608 69.128 0.368 69.492Q0.129 69.856-0.264 70.059Q-0.657 70.262-1.101 70.262Q-1.368 70.262-1.616 70.162Q-1.864 70.061-2.052 69.880L-2.052 71.062Q-2.052 71.199-1.903 71.235Q-1.754 71.271-1.529 71.271L-1.529 71.551M-2.052 67.863L-2.052 69.473Q-1.918 69.726-1.676 69.883Q-1.433 70.040-1.156 70.040Q-0.828 70.040-0.575 69.839Q-0.322 69.637-0.189 69.319Q-0.055 69.001-0.055 68.683Q-0.055 68.454-0.120 68.225Q-0.185 67.996-0.313 67.798Q-0.442 67.600-0.636 67.480Q-0.831 67.361-1.064 67.361Q-1.358 67.361-1.626 67.490Q-1.894 67.620-2.052 67.863M1.770 69.353L1.770 67.456L1.131 67.456L1.131 67.234Q1.448 67.234 1.666 67.024Q1.883 66.814 1.983 66.504Q2.084 66.195 2.084 65.887L2.351 65.887L2.351 67.176L3.427 67.176L3.427 67.456L2.351 67.456L2.351 69.340Q2.351 69.616 2.455 69.815Q2.559 70.013 2.819 70.013Q2.976 70.013 3.082 69.909Q3.188 69.804 3.238 69.651Q3.287 69.497 3.287 69.340L3.287 68.926L3.554 68.926L3.554 69.353Q3.554 69.579 3.455 69.789Q3.356 69.999 3.171 70.131Q2.987 70.262 2.758 70.262Q2.320 70.262 2.045 70.025Q1.770 69.787 1.770 69.353M5.981 70.194L4.429 70.194L4.429 69.914Q4.655 69.914 4.803 69.880Q4.952 69.845 4.952 69.705L4.952 67.856Q4.952 67.668 4.904 67.584Q4.856 67.501 4.759 67.482Q4.661 67.463 4.449 67.463L4.449 67.183L5.506 67.108L5.506 69.705Q5.506 69.845 5.637 69.880Q5.769 69.914 5.981 69.914L5.981 70.194M4.709 65.887Q4.709 65.716 4.832 65.597Q4.955 65.477 5.126 65.477Q5.294 65.477 5.417 65.597Q5.540 65.716 5.540 65.887Q5.540 66.062 5.417 66.185Q5.294 66.308 5.126 66.308Q4.955 66.308 4.832 66.185Q4.709 66.062 4.709 65.887M8.308 70.194L6.675 70.194L6.675 69.914Q6.904 69.914 7.052 69.880Q7.201 69.845 7.201 69.705L7.201 67.856Q7.201 67.586 7.093 67.525Q6.986 67.463 6.675 67.463L6.675 67.183L7.734 67.108L7.734 67.757Q7.905 67.449 8.209 67.278Q8.513 67.108 8.859 67.108Q9.259 67.108 9.535 67.248Q9.812 67.388 9.898 67.736Q10.065 67.443 10.364 67.275Q10.663 67.108 11.009 67.108Q11.514 67.108 11.798 67.331Q12.082 67.555 12.082 68.051L12.082 69.705Q12.082 69.842 12.230 69.878Q12.379 69.914 12.605 69.914L12.605 70.194L10.974 70.194L10.974 69.914Q11.200 69.914 11.350 69.878Q11.501 69.842 11.501 69.705L11.501 68.065Q11.501 67.730 11.381 67.530Q11.261 67.330 10.947 67.330Q10.677 67.330 10.443 67.466Q10.209 67.603 10.070 67.837Q9.932 68.071 9.932 68.345L9.932 69.705Q9.932 69.842 10.081 69.878Q10.229 69.914 10.455 69.914L10.455 70.194L8.824 70.194L8.824 69.914Q9.053 69.914 9.202 69.880Q9.351 69.845 9.351 69.705L9.351 68.065Q9.351 67.730 9.231 67.530Q9.112 67.330 8.797 67.330Q8.527 67.330 8.293 67.466Q8.059 67.603 7.920 67.837Q7.782 68.071 7.782 68.345L7.782 69.705Q7.782 69.842 7.932 69.878Q8.083 69.914 8.308 69.914\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(125.764 -123.442)\">\u003Cpath d=\"M13.566 69.360L13.566 67.856Q13.566 67.586 13.458 67.525Q13.350 67.463 13.039 67.463L13.039 67.183L14.147 67.108L14.147 69.340L14.147 69.360Q14.147 69.640 14.198 69.784Q14.249 69.927 14.391 69.984Q14.533 70.040 14.820 70.040Q15.073 70.040 15.278 69.900Q15.483 69.760 15.599 69.534Q15.716 69.309 15.716 69.059L15.716 67.856Q15.716 67.586 15.608 67.525Q15.500 67.463 15.189 67.463L15.189 67.183L16.297 67.108L16.297 69.521Q16.297 69.712 16.350 69.794Q16.403 69.876 16.503 69.895Q16.604 69.914 16.820 69.914L16.820 70.194L15.743 70.262L15.743 69.698Q15.634 69.880 15.488 70.003Q15.343 70.126 15.157 70.194Q14.970 70.262 14.769 70.262Q13.566 70.262 13.566 69.360M19.089 70.194L17.455 70.194L17.455 69.914Q17.684 69.914 17.833 69.880Q17.982 69.845 17.982 69.705L17.982 67.856Q17.982 67.586 17.874 67.525Q17.766 67.463 17.455 67.463L17.455 67.183L18.515 67.108L18.515 67.757Q18.686 67.449 18.990 67.278Q19.294 67.108 19.639 67.108Q20.039 67.108 20.316 67.248Q20.593 67.388 20.678 67.736Q20.846 67.443 21.145 67.275Q21.444 67.108 21.789 67.108Q22.295 67.108 22.579 67.331Q22.863 67.555 22.863 68.051L22.863 69.705Q22.863 69.842 23.011 69.878Q23.160 69.914 23.385 69.914L23.385 70.194L21.755 70.194L21.755 69.914Q21.981 69.914 22.131 69.878Q22.281 69.842 22.281 69.705L22.281 68.065Q22.281 67.730 22.162 67.530Q22.042 67.330 21.728 67.330Q21.458 67.330 21.224 67.466Q20.989 67.603 20.851 67.837Q20.713 68.071 20.713 68.345L20.713 69.705Q20.713 69.842 20.861 69.878Q21.010 69.914 21.236 69.914L21.236 70.194L19.605 70.194L19.605 69.914Q19.834 69.914 19.983 69.880Q20.132 69.845 20.132 69.705L20.132 68.065Q20.132 67.730 20.012 67.530Q19.892 67.330 19.578 67.330Q19.308 67.330 19.074 67.466Q18.840 67.603 18.701 67.837Q18.563 68.071 18.563 68.345L18.563 69.705Q18.563 69.842 18.713 69.878Q18.864 69.914 19.089 69.914\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-accent)\" stroke=\"none\" d=\"M81.384-13.742a2.4 2.4 0 1 0-4.8 0 2.4 2.4 0 0 0 4.8 0m-2.4 0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(144.374 -76.495)\">\u003Cpath d=\"M-58.698 68.683Q-58.698 68.355-58.563 68.054Q-58.428 67.754-58.192 67.533Q-57.956 67.313-57.652 67.193Q-57.347 67.073-57.023 67.073Q-56.517 67.073-56.168 67.176Q-55.820 67.278-55.820 67.654Q-55.820 67.801-55.917 67.902Q-56.014 68.003-56.161 68.003Q-56.315 68.003-56.414 67.904Q-56.513 67.805-56.513 67.654Q-56.513 67.466-56.373 67.374Q-56.575 67.323-57.016 67.323Q-57.371 67.323-57.600 67.519Q-57.829 67.716-57.930 68.025Q-58.031 68.335-58.031 68.683Q-58.031 69.032-57.905 69.338Q-57.778 69.644-57.523 69.828Q-57.269 70.013-56.913 70.013Q-56.691 70.013-56.507 69.929Q-56.322 69.845-56.187 69.690Q-56.052 69.534-55.994 69.326Q-55.980 69.271-55.926 69.271L-55.813 69.271Q-55.782 69.271-55.760 69.295Q-55.738 69.319-55.738 69.353L-55.738 69.374Q-55.823 69.661-56.011 69.859Q-56.199 70.057-56.464 70.160Q-56.729 70.262-57.023 70.262Q-57.453 70.262-57.841 70.056Q-58.229 69.849-58.463 69.486Q-58.698 69.124-58.698 68.683M-55.191 68.711Q-55.191 68.369-55.056 68.070Q-54.921 67.771-54.681 67.547Q-54.442 67.323-54.124 67.198Q-53.806 67.073-53.475 67.073Q-53.031 67.073-52.631 67.289Q-52.231 67.504-51.997 67.882Q-51.762 68.259-51.762 68.711Q-51.762 69.052-51.904 69.336Q-52.046 69.620-52.291 69.827Q-52.535 70.033-52.844 70.148Q-53.154 70.262-53.475 70.262Q-53.906 70.262-54.307 70.061Q-54.709 69.859-54.950 69.507Q-55.191 69.155-55.191 68.711M-53.475 70.013Q-52.873 70.013-52.649 69.635Q-52.426 69.257-52.426 68.625Q-52.426 68.013-52.660 67.654Q-52.894 67.296-53.475 67.296Q-54.528 67.296-54.528 68.625Q-54.528 69.257-54.302 69.635Q-54.076 70.013-53.475 70.013M-49.486 70.194L-51.120 70.194L-51.120 69.914Q-50.891 69.914-50.742 69.880Q-50.594 69.845-50.594 69.705L-50.594 67.856Q-50.594 67.586-50.701 67.525Q-50.809 67.463-51.120 67.463L-51.120 67.183L-50.060 67.108L-50.060 67.757Q-49.889 67.449-49.585 67.278Q-49.281 67.108-48.936 67.108Q-48.430 67.108-48.146 67.331Q-47.863 67.555-47.863 68.051L-47.863 69.705Q-47.863 69.842-47.714 69.878Q-47.565 69.914-47.340 69.914L-47.340 70.194L-48.970 70.194L-48.970 69.914Q-48.741 69.914-48.592 69.880Q-48.444 69.845-48.444 69.705L-48.444 68.065Q-48.444 67.730-48.563 67.530Q-48.683 67.330-48.997 67.330Q-49.267 67.330-49.502 67.466Q-49.736 67.603-49.874 67.837Q-50.012 68.071-50.012 68.345L-50.012 69.705Q-50.012 69.842-49.862 69.878Q-49.712 69.914-49.486 69.914L-49.486 70.194M-46.752 70.187L-46.752 69.124Q-46.752 69.100-46.724 69.073Q-46.697 69.046-46.673 69.046L-46.564 69.046Q-46.499 69.046-46.485 69.104Q-46.389 69.538-46.143 69.789Q-45.897 70.040-45.484 70.040Q-45.142 70.040-44.889 69.907Q-44.636 69.774-44.636 69.466Q-44.636 69.309-44.730 69.194Q-44.824 69.080-44.962 69.011Q-45.101 68.943-45.268 68.905L-45.849 68.806Q-46.205 68.738-46.478 68.517Q-46.752 68.297-46.752 67.955Q-46.752 67.706-46.641 67.531Q-46.530 67.357-46.343 67.258Q-46.157 67.159-45.942 67.116Q-45.726 67.073-45.484 67.073Q-45.070 67.073-44.790 67.255L-44.575 67.080Q-44.564 67.077-44.557 67.075Q-44.551 67.073-44.540 67.073L-44.489 67.073Q-44.462 67.073-44.438 67.097Q-44.414 67.121-44.414 67.149L-44.414 67.996Q-44.414 68.017-44.438 68.044Q-44.462 68.071-44.489 68.071L-44.602 68.071Q-44.629 68.071-44.655 68.046Q-44.680 68.020-44.680 67.996Q-44.680 67.760-44.786 67.596Q-44.892 67.432-45.075 67.350Q-45.258 67.268-45.491 67.268Q-45.819 67.268-46.075 67.371Q-46.331 67.473-46.331 67.750Q-46.331 67.945-46.148 68.054Q-45.966 68.164-45.737 68.205L-45.162 68.311Q-44.916 68.359-44.703 68.487Q-44.489 68.615-44.352 68.818Q-44.216 69.022-44.216 69.271Q-44.216 69.784-44.581 70.023Q-44.947 70.262-45.484 70.262Q-45.979 70.262-46.311 69.968L-46.577 70.242Q-46.598 70.262-46.625 70.262L-46.673 70.262Q-46.697 70.262-46.724 70.235Q-46.752 70.208-46.752 70.187M-43.060 69.353L-43.060 67.456L-43.700 67.456L-43.700 67.234Q-43.382 67.234-43.165 67.024Q-42.948 66.814-42.847 66.504Q-42.746 66.195-42.746 65.887L-42.479 65.887L-42.479 67.176L-41.403 67.176L-41.403 67.456L-42.479 67.456L-42.479 69.340Q-42.479 69.616-42.375 69.815Q-42.271 70.013-42.011 70.013Q-41.854 70.013-41.748 69.909Q-41.642 69.804-41.592 69.651Q-41.543 69.497-41.543 69.340L-41.543 68.926L-41.276 68.926L-41.276 69.353Q-41.276 69.579-41.375 69.789Q-41.474 69.999-41.659 70.131Q-41.844 70.262-42.073 70.262Q-42.510 70.262-42.785 70.025Q-43.060 69.787-43.060 69.353M-38.716 70.194L-40.452 70.194L-40.452 69.914Q-40.223 69.914-40.075 69.880Q-39.926 69.845-39.926 69.705L-39.926 67.856Q-39.926 67.586-40.034 67.525Q-40.141 67.463-40.452 67.463L-40.452 67.183L-39.424 67.108L-39.424 67.815Q-39.294 67.507-39.051 67.308Q-38.808 67.108-38.491 67.108Q-38.272 67.108-38.101 67.232Q-37.930 67.357-37.930 67.569Q-37.930 67.706-38.029 67.805Q-38.128 67.904-38.262 67.904Q-38.398 67.904-38.497 67.805Q-38.596 67.706-38.596 67.569Q-38.596 67.429-38.497 67.330Q-38.788 67.330-38.988 67.526Q-39.188 67.723-39.280 68.017Q-39.372 68.311-39.372 68.591L-39.372 69.705Q-39.372 69.914-38.716 69.914L-38.716 70.194M-37.287 69.466Q-37.287 69.134-37.064 68.907Q-36.840 68.680-36.496 68.552Q-36.153 68.423-35.780 68.371Q-35.408 68.318-35.103 68.318L-35.103 68.065Q-35.103 67.860-35.211 67.680Q-35.319 67.501-35.500 67.398Q-35.681 67.296-35.889 67.296Q-36.296 67.296-36.532 67.388Q-36.443 67.425-36.397 67.509Q-36.351 67.593-36.351 67.695Q-36.351 67.791-36.397 67.870Q-36.443 67.948-36.523 67.993Q-36.604 68.037-36.693 68.037Q-36.843 68.037-36.944 67.940Q-37.045 67.842-37.045 67.695Q-37.045 67.073-35.889 67.073Q-35.678 67.073-35.428 67.137Q-35.179 67.200-34.977 67.319Q-34.775 67.439-34.649 67.624Q-34.522 67.808-34.522 68.051L-34.522 69.627Q-34.522 69.743-34.461 69.839Q-34.399 69.934-34.286 69.934Q-34.177 69.934-34.112 69.840Q-34.047 69.746-34.047 69.627L-34.047 69.179L-33.781 69.179L-33.781 69.627Q-33.781 69.897-34.008 70.062Q-34.235 70.228-34.515 70.228Q-34.724 70.228-34.861 70.074Q-34.997 69.921-35.021 69.705Q-35.168 69.972-35.450 70.117Q-35.732 70.262-36.057 70.262Q-36.334 70.262-36.617 70.187Q-36.901 70.112-37.094 69.933Q-37.287 69.753-37.287 69.466M-36.672 69.466Q-36.672 69.640-36.571 69.770Q-36.470 69.900-36.315 69.970Q-36.159 70.040-35.995 70.040Q-35.777 70.040-35.568 69.943Q-35.360 69.845-35.231 69.664Q-35.103 69.483-35.103 69.257L-35.103 68.529Q-35.428 68.529-35.794 68.620Q-36.159 68.711-36.416 68.923Q-36.672 69.134-36.672 69.466M-31.747 70.194L-33.299 70.194L-33.299 69.914Q-33.073 69.914-32.924 69.880Q-32.776 69.845-32.776 69.705L-32.776 67.856Q-32.776 67.668-32.824 67.584Q-32.871 67.501-32.969 67.482Q-33.066 67.463-33.278 67.463L-33.278 67.183L-32.222 67.108L-32.222 69.705Q-32.222 69.845-32.090 69.880Q-31.959 69.914-31.747 69.914L-31.747 70.194M-33.018 65.887Q-33.018 65.716-32.895 65.597Q-32.772 65.477-32.601 65.477Q-32.434 65.477-32.311 65.597Q-32.188 65.716-32.188 65.887Q-32.188 66.062-32.311 66.185Q-32.434 66.308-32.601 66.308Q-32.772 66.308-32.895 66.185Q-33.018 66.062-33.018 65.887M-29.419 70.194L-31.053 70.194L-31.053 69.914Q-30.824 69.914-30.675 69.880Q-30.527 69.845-30.527 69.705L-30.527 67.856Q-30.527 67.586-30.634 67.525Q-30.742 67.463-31.053 67.463L-31.053 67.183L-29.993 67.108L-29.993 67.757Q-29.823 67.449-29.518 67.278Q-29.214 67.108-28.869 67.108Q-28.363 67.108-28.079 67.331Q-27.796 67.555-27.796 68.051L-27.796 69.705Q-27.796 69.842-27.647 69.878Q-27.498 69.914-27.273 69.914L-27.273 70.194L-28.903 70.194L-28.903 69.914Q-28.674 69.914-28.525 69.880Q-28.377 69.845-28.377 69.705L-28.377 68.065Q-28.377 67.730-28.496 67.530Q-28.616 67.330-28.930 67.330Q-29.200 67.330-29.435 67.466Q-29.669 67.603-29.807 67.837Q-29.946 68.071-29.946 68.345L-29.946 69.705Q-29.946 69.842-29.795 69.878Q-29.645 69.914-29.419 69.914L-29.419 70.194M-26.726 68.659Q-26.726 68.338-26.601 68.049Q-26.476 67.760-26.251 67.537Q-26.025 67.313-25.730 67.193Q-25.434 67.073-25.116 67.073Q-24.788 67.073-24.526 67.173Q-24.265 67.272-24.089 67.454Q-23.913 67.637-23.819 67.895Q-23.725 68.153-23.725 68.485Q-23.725 68.577-23.807 68.598L-26.063 68.598L-26.063 68.659Q-26.063 69.247-25.779 69.630Q-25.495 70.013-24.928 70.013Q-24.607 70.013-24.338 69.820Q-24.070 69.627-23.981 69.312Q-23.974 69.271-23.899 69.257L-23.807 69.257Q-23.725 69.281-23.725 69.353Q-23.725 69.360-23.732 69.387Q-23.845 69.784-24.215 70.023Q-24.586 70.262-25.010 70.262Q-25.448 70.262-25.847 70.054Q-26.247 69.845-26.487 69.478Q-26.726 69.111-26.726 68.659M-26.056 68.389L-24.241 68.389Q-24.241 68.112-24.338 67.860Q-24.436 67.607-24.634 67.451Q-24.832 67.296-25.116 67.296Q-25.393 67.296-25.606 67.454Q-25.820 67.613-25.938 67.868Q-26.056 68.123-26.056 68.389M-23.137 68.683Q-23.137 68.345-22.997 68.054Q-22.857 67.764-22.612 67.550Q-22.368 67.337-22.064 67.222Q-21.760 67.108-21.435 67.108Q-21.165 67.108-20.902 67.207Q-20.638 67.306-20.447 67.484L-20.447 66.086Q-20.447 65.816-20.555 65.754Q-20.662 65.693-20.973 65.693L-20.973 65.412L-19.897 65.337L-19.897 69.521Q-19.897 69.709-19.842 69.792Q-19.787 69.876-19.687 69.895Q-19.586 69.914-19.370 69.914L-19.370 70.194L-20.478 70.262L-20.478 69.845Q-20.895 70.262-21.520 70.262Q-21.951 70.262-22.324 70.050Q-22.696 69.839-22.917 69.478Q-23.137 69.117-23.137 68.683M-21.462 70.040Q-21.254 70.040-21.067 69.968Q-20.881 69.897-20.727 69.760Q-20.574 69.623-20.478 69.445L-20.478 67.836Q-20.563 67.689-20.709 67.569Q-20.854 67.449-21.023 67.390Q-21.192 67.330-21.373 67.330Q-21.934 67.330-22.202 67.719Q-22.470 68.109-22.470 68.690Q-22.470 69.261-22.236 69.651Q-22.002 70.040-21.462 70.040\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(144.374 -76.495)\">\u003Cpath d=\"M-16.029 68.711Q-16.029 68.369-15.894 68.070Q-15.759 67.771-15.519 67.547Q-15.280 67.323-14.962 67.198Q-14.644 67.073-14.313 67.073Q-13.868 67.073-13.469 67.289Q-13.069 67.504-12.834 67.882Q-12.600 68.259-12.600 68.711Q-12.600 69.052-12.742 69.336Q-12.884 69.620-13.128 69.827Q-13.373 70.033-13.682 70.148Q-13.991 70.262-14.313 70.262Q-14.743 70.262-15.145 70.061Q-15.547 69.859-15.788 69.507Q-16.029 69.155-16.029 68.711M-14.313 70.013Q-13.711 70.013-13.487 69.635Q-13.263 69.257-13.263 68.625Q-13.263 68.013-13.498 67.654Q-13.732 67.296-14.313 67.296Q-15.365 67.296-15.365 68.625Q-15.365 69.257-15.140 69.635Q-14.914 70.013-14.313 70.013M-10.362 71.551L-11.992 71.551L-11.992 71.271Q-11.763 71.271-11.614 71.236Q-11.466 71.202-11.466 71.062L-11.466 67.716Q-11.466 67.545-11.602 67.504Q-11.739 67.463-11.992 67.463L-11.992 67.183L-10.912 67.108L-10.912 67.514Q-10.690 67.313-10.403 67.210Q-10.115 67.108-9.808 67.108Q-9.381 67.108-9.017 67.321Q-8.653 67.535-8.439 67.899Q-8.225 68.263-8.225 68.683Q-8.225 69.128-8.465 69.492Q-8.704 69.856-9.097 70.059Q-9.490 70.262-9.934 70.262Q-10.201 70.262-10.449 70.162Q-10.697 70.061-10.885 69.880L-10.885 71.062Q-10.885 71.199-10.736 71.235Q-10.587 71.271-10.362 71.271L-10.362 71.551M-10.885 67.863L-10.885 69.473Q-10.751 69.726-10.509 69.883Q-10.266 70.040-9.989 70.040Q-9.661 70.040-9.408 69.839Q-9.155 69.637-9.022 69.319Q-8.888 69.001-8.888 68.683Q-8.888 68.454-8.953 68.225Q-9.018 67.996-9.146 67.798Q-9.275 67.600-9.469 67.480Q-9.664 67.361-9.897 67.361Q-10.191 67.361-10.459 67.490Q-10.727 67.620-10.885 67.863M-7.063 69.353L-7.063 67.456L-7.702 67.456L-7.702 67.234Q-7.385 67.234-7.167 67.024Q-6.950 66.814-6.850 66.504Q-6.749 66.195-6.749 65.887L-6.482 65.887L-6.482 67.176L-5.406 67.176L-5.406 67.456L-6.482 67.456L-6.482 69.340Q-6.482 69.616-6.378 69.815Q-6.274 70.013-6.014 70.013Q-5.857 70.013-5.751 69.909Q-5.645 69.804-5.595 69.651Q-5.546 69.497-5.546 69.340L-5.546 68.926L-5.279 68.926L-5.279 69.353Q-5.279 69.579-5.378 69.789Q-5.477 69.999-5.662 70.131Q-5.846 70.262-6.075 70.262Q-6.513 70.262-6.788 70.025Q-7.063 69.787-7.063 69.353M-2.852 70.194L-4.404 70.194L-4.404 69.914Q-4.178 69.914-4.030 69.880Q-3.881 69.845-3.881 69.705L-3.881 67.856Q-3.881 67.668-3.929 67.584Q-3.977 67.501-4.074 67.482Q-4.172 67.463-4.384 67.463L-4.384 67.183L-3.327 67.108L-3.327 69.705Q-3.327 69.845-3.196 69.880Q-3.064 69.914-2.852 69.914L-2.852 70.194M-4.124 65.887Q-4.124 65.716-4.001 65.597Q-3.878 65.477-3.707 65.477Q-3.539 65.477-3.416 65.597Q-3.293 65.716-3.293 65.887Q-3.293 66.062-3.416 66.185Q-3.539 66.308-3.707 66.308Q-3.878 66.308-4.001 66.185Q-4.124 66.062-4.124 65.887M-0.525 70.194L-2.158 70.194L-2.158 69.914Q-1.929 69.914-1.781 69.880Q-1.632 69.845-1.632 69.705L-1.632 67.856Q-1.632 67.586-1.740 67.525Q-1.847 67.463-2.158 67.463L-2.158 67.183L-1.099 67.108L-1.099 67.757Q-0.928 67.449-0.624 67.278Q-0.320 67.108 0.026 67.108Q0.426 67.108 0.702 67.248Q0.979 67.388 1.065 67.736Q1.232 67.443 1.531 67.275Q1.830 67.108 2.176 67.108Q2.681 67.108 2.965 67.331Q3.249 67.555 3.249 68.051L3.249 69.705Q3.249 69.842 3.397 69.878Q3.546 69.914 3.772 69.914L3.772 70.194L2.141 70.194L2.141 69.914Q2.367 69.914 2.517 69.878Q2.668 69.842 2.668 69.705L2.668 68.065Q2.668 67.730 2.548 67.530Q2.428 67.330 2.114 67.330Q1.844 67.330 1.610 67.466Q1.376 67.603 1.237 67.837Q1.099 68.071 1.099 68.345L1.099 69.705Q1.099 69.842 1.248 69.878Q1.396 69.914 1.622 69.914L1.622 70.194L-0.009 70.194L-0.009 69.914Q0.220 69.914 0.369 69.880Q0.518 69.845 0.518 69.705L0.518 68.065Q0.518 67.730 0.398 67.530Q0.279 67.330-0.036 67.330Q-0.306 67.330-0.540 67.466Q-0.774 67.603-0.913 67.837Q-1.051 68.071-1.051 68.345L-1.051 69.705Q-1.051 69.842-0.901 69.878Q-0.750 69.914-0.525 69.914\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(144.374 -76.495)\">\u003Cpath d=\"M4.733 69.360L4.733 67.856Q4.733 67.586 4.625 67.525Q4.517 67.463 4.206 67.463L4.206 67.183L5.314 67.108L5.314 69.340L5.314 69.360Q5.314 69.640 5.365 69.784Q5.416 69.927 5.558 69.984Q5.700 70.040 5.987 70.040Q6.240 70.040 6.445 69.900Q6.650 69.760 6.766 69.534Q6.883 69.309 6.883 69.059L6.883 67.856Q6.883 67.586 6.775 67.525Q6.667 67.463 6.356 67.463L6.356 67.183L7.464 67.108L7.464 69.521Q7.464 69.712 7.517 69.794Q7.570 69.876 7.670 69.895Q7.771 69.914 7.987 69.914L7.987 70.194L6.910 70.262L6.910 69.698Q6.801 69.880 6.655 70.003Q6.510 70.126 6.324 70.194Q6.137 70.262 5.936 70.262Q4.733 70.262 4.733 69.360M10.256 70.194L8.622 70.194L8.622 69.914Q8.851 69.914 9 69.880Q9.149 69.845 9.149 69.705L9.149 67.856Q9.149 67.586 9.041 67.525Q8.933 67.463 8.622 67.463L8.622 67.183L9.682 67.108L9.682 67.757Q9.853 67.449 10.157 67.278Q10.461 67.108 10.806 67.108Q11.206 67.108 11.483 67.248Q11.760 67.388 11.845 67.736Q12.013 67.443 12.312 67.275Q12.611 67.108 12.956 67.108Q13.462 67.108 13.746 67.331Q14.030 67.555 14.030 68.051L14.030 69.705Q14.030 69.842 14.178 69.878Q14.327 69.914 14.552 69.914L14.552 70.194L12.922 70.194L12.922 69.914Q13.148 69.914 13.298 69.878Q13.448 69.842 13.448 69.705L13.448 68.065Q13.448 67.730 13.329 67.530Q13.209 67.330 12.895 67.330Q12.625 67.330 12.391 67.466Q12.156 67.603 12.018 67.837Q11.880 68.071 11.880 68.345L11.880 69.705Q11.880 69.842 12.028 69.878Q12.177 69.914 12.403 69.914L12.403 70.194L10.772 70.194L10.772 69.914Q11.001 69.914 11.150 69.880Q11.299 69.845 11.299 69.705L11.299 68.065Q11.299 67.730 11.179 67.530Q11.059 67.330 10.745 67.330Q10.475 67.330 10.241 67.466Q10.007 67.603 9.868 67.837Q9.730 68.071 9.730 68.345L9.730 69.705Q9.730 69.842 9.880 69.878Q10.031 69.914 10.256 69.914\" 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\">The feasible set in policy space. The cost constraint \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\">\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0962em;\">J\u003C\u002Fspan>\u003Cspan class=\"msupsub\">\u003Cspan class=\"vlist-t vlist-t2\">\u003Cspan class=\"vlist-r\">\u003Cspan class=\"vlist\" style=\"height:0.1514em;\">\u003Cspan style=\"top:-2.55em;margin-left:-0.0962em;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\">c\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>\u003Cspan class=\"mopen\">(\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0359em;\">π\u003C\u002Fspan>\u003Cspan class=\"mclose\">)\u003C\u002Fspan>\u003Cspan class=\"mspace\" style=\"margin-right:0.2778em;\">\u003C\u002Fspan>\u003Cspan class=\"mrel\">≤\u003C\u002Fspan>\u003Cspan class=\"mspace\" style=\"margin-right:0.2778em;\">\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6944em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\">d\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> admits the shaded region; the unconstrained reward optimum lies outside it, so the constrained optimum is the highest-reward point on or inside the boundary. Reward increases toward the upper right.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:446.379px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 334.784 117.435\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-65.203 1.261h96.739v-36.988h-96.74Z\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M0.028-34.682L-1.827-34.682L-1.827-34.975Q-1.558-34.975-1.390-35.020Q-1.222-35.065-1.222-35.241L-1.222-39.065Q-1.222-39.272-1.378-39.325Q-1.534-39.378-1.827-39.378L-1.827-39.674L-0.605-39.760L-0.605-39.295Q-0.374-39.518-0.060-39.639Q0.255-39.760 0.595-39.760Q1.067-39.760 1.471-39.514Q1.876-39.268 2.108-38.852Q2.341-38.436 2.341-37.960Q2.341-37.585 2.192-37.256Q2.044-36.928 1.774-36.676Q1.505-36.424 1.161-36.290Q0.817-36.155 0.458-36.155Q0.169-36.155-0.103-36.276Q-0.374-36.397-0.581-36.608L-0.581-35.241Q-0.581-35.065-0.413-35.020Q-0.245-34.975 0.028-34.975L0.028-34.682M-0.581-38.897L-0.581-37.057Q-0.429-36.768-0.167-36.588Q0.095-36.409 0.403-36.409Q0.688-36.409 0.911-36.547Q1.134-36.686 1.286-36.917Q1.438-37.147 1.516-37.419Q1.595-37.690 1.595-37.960Q1.595-38.292 1.470-38.649Q1.345-39.006 1.096-39.243Q0.848-39.479 0.501-39.479Q0.177-39.479-0.118-39.323Q-0.413-39.167-0.581-38.897M4.872-36.233L2.891-36.233L2.891-36.530Q3.161-36.530 3.329-36.575Q3.497-36.620 3.497-36.792L3.497-38.928Q3.497-39.143 3.434-39.239Q3.372-39.335 3.255-39.356Q3.137-39.378 2.891-39.378L2.891-39.674L4.059-39.760L4.059-38.975Q4.137-39.186 4.290-39.372Q4.442-39.557 4.641-39.659Q4.841-39.760 5.067-39.760Q5.313-39.760 5.505-39.616Q5.696-39.471 5.696-39.241Q5.696-39.085 5.591-38.975Q5.485-38.866 5.329-38.866Q5.173-38.866 5.063-38.975Q4.954-39.085 4.954-39.241Q4.954-39.401 5.059-39.506Q4.735-39.506 4.520-39.278Q4.305-39.049 4.210-38.710Q4.114-38.370 4.114-38.065L4.114-36.792Q4.114-36.624 4.341-36.577Q4.567-36.530 4.872-36.530L4.872-36.233M8.036-36.233L6.259-36.233L6.259-36.530Q6.532-36.530 6.700-36.577Q6.868-36.624 6.868-36.792L6.868-38.928Q6.868-39.143 6.811-39.239Q6.755-39.335 6.641-39.356Q6.528-39.378 6.282-39.378L6.282-39.674L7.481-39.760L7.481-36.792Q7.481-36.624 7.628-36.577Q7.774-36.530 8.036-36.530L8.036-36.233M6.595-41.155Q6.595-41.346 6.729-41.477Q6.864-41.608 7.059-41.608Q7.180-41.608 7.284-41.545Q7.387-41.483 7.450-41.379Q7.512-41.276 7.512-41.155Q7.512-40.960 7.382-40.825Q7.251-40.690 7.059-40.690Q6.860-40.690 6.727-40.823Q6.595-40.956 6.595-41.155M10.466-36.233L8.610-36.233L8.610-36.530Q8.884-36.530 9.052-36.577Q9.220-36.624 9.220-36.792L9.220-38.928Q9.220-39.143 9.157-39.239Q9.095-39.335 8.975-39.356Q8.856-39.378 8.610-39.378L8.610-39.674L9.802-39.760L9.802-39.026Q9.915-39.241 10.108-39.409Q10.302-39.577 10.540-39.669Q10.778-39.760 11.032-39.760Q11.993-39.760 12.169-39.049Q12.352-39.378 12.680-39.569Q13.009-39.760 13.387-39.760Q14.563-39.760 14.563-38.682L14.563-36.792Q14.563-36.624 14.731-36.577Q14.899-36.530 15.169-36.530L15.169-36.233L13.313-36.233L13.313-36.530Q13.587-36.530 13.755-36.575Q13.923-36.620 13.923-36.792L13.923-38.667Q13.923-39.053 13.798-39.280Q13.673-39.506 13.321-39.506Q13.016-39.506 12.761-39.344Q12.505-39.182 12.356-38.913Q12.208-38.643 12.208-38.346L12.208-36.792Q12.208-36.624 12.378-36.577Q12.548-36.530 12.817-36.530L12.817-36.233L10.962-36.233L10.962-36.530Q11.235-36.530 11.403-36.577Q11.571-36.624 11.571-36.792L11.571-38.667Q11.571-39.053 11.446-39.280Q11.321-39.506 10.970-39.506Q10.665-39.506 10.409-39.344Q10.153-39.182 10.005-38.913Q9.856-38.643 9.856-38.346L9.856-36.792Q9.856-36.624 10.026-36.577Q10.196-36.530 10.466-36.530L10.466-36.233M15.712-37.065Q15.712-37.549 16.114-37.844Q16.516-38.139 17.067-38.258Q17.618-38.378 18.110-38.378L18.110-38.667Q18.110-38.893 17.995-39.100Q17.880-39.307 17.682-39.426Q17.485-39.545 17.255-39.545Q16.829-39.545 16.544-39.440Q16.614-39.413 16.661-39.358Q16.708-39.303 16.733-39.233Q16.759-39.163 16.759-39.088Q16.759-38.983 16.708-38.891Q16.657-38.799 16.565-38.749Q16.473-38.698 16.368-38.698Q16.262-38.698 16.171-38.749Q16.079-38.799 16.028-38.891Q15.977-38.983 15.977-39.088Q15.977-39.506 16.366-39.653Q16.755-39.799 17.255-39.799Q17.587-39.799 17.940-39.669Q18.294-39.538 18.522-39.284Q18.751-39.030 18.751-38.682L18.751-36.881Q18.751-36.749 18.823-36.639Q18.895-36.530 19.024-36.530Q19.149-36.530 19.218-36.635Q19.286-36.741 19.286-36.881L19.286-37.393L19.567-37.393L19.567-36.881Q19.567-36.678 19.450-36.520Q19.333-36.362 19.151-36.278Q18.970-36.194 18.766-36.194Q18.536-36.194 18.384-36.366Q18.231-36.538 18.200-36.768Q18.040-36.487 17.731-36.321Q17.423-36.155 17.071-36.155Q16.559-36.155 16.136-36.378Q15.712-36.600 15.712-37.065M16.399-37.065Q16.399-36.780 16.626-36.594Q16.852-36.409 17.145-36.409Q17.391-36.409 17.616-36.526Q17.841-36.643 17.975-36.846Q18.110-37.049 18.110-37.303L18.110-38.135Q17.845-38.135 17.559-38.081Q17.274-38.026 17.003-37.897Q16.731-37.768 16.565-37.561Q16.399-37.354 16.399-37.065M21.774-36.233L19.942-36.233L19.942-36.530Q20.216-36.530 20.384-36.577Q20.552-36.624 20.552-36.792L20.552-40.952Q20.552-41.167 20.489-41.262Q20.427-41.358 20.307-41.379Q20.188-41.401 19.942-41.401L19.942-41.698L21.165-41.784L21.165-36.792Q21.165-36.624 21.333-36.577Q21.501-36.530 21.774-36.530\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M25.112-36.241L25.112-37.463Q25.112-37.491 25.143-37.522Q25.175-37.553 25.198-37.553L25.304-37.553Q25.374-37.553 25.390-37.491Q25.452-37.170 25.591-36.930Q25.729-36.690 25.962-36.549Q26.194-36.409 26.503-36.409Q26.741-36.409 26.950-36.469Q27.159-36.530 27.296-36.678Q27.433-36.827 27.433-37.073Q27.433-37.327 27.222-37.493Q27.011-37.659 26.741-37.713L26.120-37.827Q25.714-37.905 25.413-38.161Q25.112-38.417 25.112-38.792Q25.112-39.159 25.313-39.381Q25.515-39.604 25.839-39.702Q26.163-39.799 26.503-39.799Q26.968-39.799 27.265-39.592L27.487-39.776Q27.511-39.799 27.542-39.799L27.593-39.799Q27.624-39.799 27.651-39.772Q27.679-39.745 27.679-39.713L27.679-38.729Q27.679-38.698 27.653-38.669Q27.628-38.639 27.593-38.639L27.487-38.639Q27.452-38.639 27.425-38.667Q27.397-38.694 27.397-38.729Q27.397-39.128 27.145-39.348Q26.893-39.569 26.495-39.569Q26.140-39.569 25.856-39.446Q25.573-39.323 25.573-39.018Q25.573-38.799 25.774-38.667Q25.976-38.534 26.222-38.491L26.847-38.378Q27.276-38.288 27.585-37.991Q27.893-37.694 27.893-37.280Q27.893-36.710 27.495-36.432Q27.097-36.155 26.503-36.155Q25.952-36.155 25.601-36.491L25.304-36.178Q25.280-36.155 25.245-36.155L25.198-36.155Q25.175-36.155 25.143-36.186Q25.112-36.217 25.112-36.241M29.046-37.194L29.046-39.385L28.343-39.385L28.343-39.639Q28.698-39.639 28.940-39.872Q29.183-40.104 29.294-40.452Q29.405-40.799 29.405-41.155L29.686-41.155L29.686-39.682L30.862-39.682L30.862-39.385L29.686-39.385L29.686-37.210Q29.686-36.889 29.806-36.661Q29.925-36.432 30.206-36.432Q30.386-36.432 30.503-36.555Q30.620-36.678 30.673-36.858Q30.726-37.038 30.726-37.210L30.726-37.682L31.007-37.682L31.007-37.194Q31.007-36.940 30.901-36.700Q30.796-36.460 30.599-36.307Q30.401-36.155 30.143-36.155Q29.827-36.155 29.575-36.278Q29.323-36.401 29.185-36.635Q29.046-36.870 29.046-37.194M31.726-37.987Q31.726-38.467 31.958-38.883Q32.190-39.299 32.601-39.549Q33.011-39.799 33.487-39.799Q34.218-39.799 34.616-39.358Q35.015-38.917 35.015-38.186Q35.015-38.081 34.921-38.057L32.472-38.057L32.472-37.987Q32.472-37.577 32.593-37.221Q32.714-36.866 32.985-36.649Q33.257-36.432 33.686-36.432Q34.050-36.432 34.347-36.661Q34.644-36.889 34.745-37.241Q34.753-37.288 34.839-37.303L34.921-37.303Q35.015-37.276 35.015-37.194Q35.015-37.186 35.007-37.155Q34.944-36.928 34.806-36.745Q34.667-36.561 34.476-36.428Q34.284-36.295 34.065-36.225Q33.847-36.155 33.608-36.155Q33.237-36.155 32.899-36.292Q32.561-36.428 32.294-36.680Q32.026-36.932 31.876-37.272Q31.726-37.612 31.726-37.987M32.479-38.295L34.440-38.295Q34.440-38.600 34.339-38.891Q34.237-39.182 34.020-39.364Q33.804-39.545 33.487-39.545Q33.186-39.545 32.956-39.358Q32.726-39.170 32.602-38.879Q32.479-38.588 32.479-38.295M37.386-34.682L35.530-34.682L35.530-34.975Q35.800-34.975 35.968-35.020Q36.136-35.065 36.136-35.241L36.136-39.065Q36.136-39.272 35.979-39.325Q35.823-39.378 35.530-39.378L35.530-39.674L36.753-39.760L36.753-39.295Q36.983-39.518 37.298-39.639Q37.612-39.760 37.952-39.760Q38.425-39.760 38.829-39.514Q39.233-39.268 39.466-38.852Q39.698-38.436 39.698-37.960Q39.698-37.585 39.550-37.256Q39.401-36.928 39.132-36.676Q38.862-36.424 38.519-36.290Q38.175-36.155 37.815-36.155Q37.526-36.155 37.255-36.276Q36.983-36.397 36.776-36.608L36.776-35.241Q36.776-35.065 36.944-35.020Q37.112-34.975 37.386-34.975L37.386-34.682M36.776-38.897L36.776-37.057Q36.929-36.768 37.190-36.588Q37.452-36.409 37.761-36.409Q38.046-36.409 38.269-36.547Q38.491-36.686 38.644-36.917Q38.796-37.147 38.874-37.419Q38.952-37.690 38.952-37.960Q38.952-38.292 38.827-38.649Q38.702-39.006 38.454-39.243Q38.206-39.479 37.858-39.479Q37.534-39.479 37.239-39.323Q36.944-39.167 36.776-38.897M40.702-36.698Q40.702-36.881 40.839-37.018Q40.976-37.155 41.167-37.155Q41.358-37.155 41.491-37.022Q41.624-36.889 41.624-36.698Q41.624-36.499 41.491-36.366Q41.358-36.233 41.167-36.233Q40.976-36.233 40.839-36.370Q40.702-36.506 40.702-36.698M40.702-39.225Q40.702-39.409 40.839-39.545Q40.976-39.682 41.167-39.682Q41.358-39.682 41.491-39.549Q41.624-39.417 41.624-39.225Q41.624-39.026 41.491-38.893Q41.358-38.760 41.167-38.760Q40.976-38.760 40.839-38.897Q40.702-39.034 40.702-39.225\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M-10.951-26.733L-12.729-26.733L-12.729-27.030Q-12.455-27.030-12.287-27.077Q-12.119-27.124-12.119-27.292L-12.119-29.428Q-12.119-29.643-12.176-29.739Q-12.233-29.835-12.346-29.856Q-12.459-29.878-12.705-29.878L-12.705-30.174L-11.506-30.260L-11.506-27.292Q-11.506-27.124-11.360-27.077Q-11.213-27.030-10.951-27.030L-10.951-26.733M-12.393-31.655Q-12.393-31.846-12.258-31.977Q-12.123-32.108-11.928-32.108Q-11.807-32.108-11.703-32.046Q-11.600-31.983-11.537-31.879Q-11.475-31.776-11.475-31.655Q-11.475-31.460-11.606-31.325Q-11.736-31.190-11.928-31.190Q-12.127-31.190-12.260-31.323Q-12.393-31.456-12.393-31.655M-8.522-26.733L-10.377-26.733L-10.377-27.030Q-10.104-27.030-9.936-27.077Q-9.768-27.124-9.768-27.292L-9.768-29.428Q-9.768-29.643-9.830-29.739Q-9.893-29.835-10.012-29.856Q-10.131-29.878-10.377-29.878L-10.377-30.174L-9.186-30.260L-9.186-29.526Q-9.072-29.741-8.879-29.909Q-8.686-30.077-8.447-30.169Q-8.209-30.260-7.955-30.260Q-6.994-30.260-6.819-29.549Q-6.635-29.878-6.307-30.069Q-5.979-30.260-5.600-30.260Q-4.424-30.260-4.424-29.182L-4.424-27.292Q-4.424-27.124-4.256-27.077Q-4.088-27.030-3.819-27.030L-3.819-26.733L-5.674-26.733L-5.674-27.030Q-5.401-27.030-5.233-27.075Q-5.065-27.120-5.065-27.292L-5.065-29.167Q-5.065-29.553-5.190-29.780Q-5.315-30.006-5.666-30.006Q-5.971-30.006-6.227-29.844Q-6.483-29.682-6.631-29.413Q-6.779-29.143-6.779-28.846L-6.779-27.292Q-6.779-27.124-6.610-27.077Q-6.440-27.030-6.170-27.030L-6.170-26.733L-8.026-26.733L-8.026-27.030Q-7.752-27.030-7.584-27.077Q-7.416-27.124-7.416-27.292L-7.416-29.167Q-7.416-29.553-7.541-29.780Q-7.666-30.006-8.018-30.006Q-8.322-30.006-8.578-29.844Q-8.834-29.682-8.983-29.413Q-9.131-29.143-9.131-28.846L-9.131-27.292Q-9.131-27.124-8.961-27.077Q-8.791-27.030-8.522-27.030L-8.522-26.733M-1.490-25.182L-3.346-25.182L-3.346-25.475Q-3.076-25.475-2.908-25.520Q-2.740-25.565-2.740-25.741L-2.740-29.565Q-2.740-29.772-2.897-29.825Q-3.053-29.878-3.346-29.878L-3.346-30.174L-2.123-30.260L-2.123-29.796Q-1.893-30.018-1.578-30.139Q-1.264-30.260-0.924-30.260Q-0.451-30.260-0.047-30.014Q0.357-29.768 0.590-29.352Q0.822-28.936 0.822-28.460Q0.822-28.085 0.674-27.756Q0.525-27.428 0.256-27.176Q-0.014-26.924-0.358-26.790Q-0.701-26.655-1.061-26.655Q-1.350-26.655-1.621-26.776Q-1.893-26.897-2.100-27.108L-2.100-25.741Q-2.100-25.565-1.932-25.520Q-1.764-25.475-1.490-25.475L-1.490-25.182M-2.100-29.397L-2.100-27.557Q-1.947-27.268-1.686-27.088Q-1.424-26.909-1.115-26.909Q-0.830-26.909-0.608-27.047Q-0.385-27.186-0.233-27.417Q-0.080-27.647-0.002-27.919Q0.076-28.190 0.076-28.460Q0.076-28.792-0.049-29.149Q-0.174-29.506-0.422-29.743Q-0.670-29.979-1.018-29.979Q-1.342-29.979-1.637-29.823Q-1.932-29.667-2.100-29.397M3.353-26.733L1.373-26.733L1.373-27.030Q1.642-27.030 1.810-27.075Q1.978-27.120 1.978-27.292L1.978-29.428Q1.978-29.643 1.916-29.739Q1.853-29.835 1.736-29.856Q1.619-29.878 1.373-29.878L1.373-30.174L2.541-30.260L2.541-29.475Q2.619-29.686 2.771-29.872Q2.924-30.057 3.123-30.159Q3.322-30.260 3.549-30.260Q3.795-30.260 3.986-30.116Q4.178-29.971 4.178-29.741Q4.178-29.585 4.072-29.475Q3.967-29.366 3.810-29.366Q3.654-29.366 3.545-29.475Q3.435-29.585 3.435-29.741Q3.435-29.901 3.541-30.006Q3.217-30.006 3.002-29.778Q2.787-29.549 2.691-29.210Q2.596-28.870 2.596-28.565L2.596-27.292Q2.596-27.124 2.822-27.077Q3.049-27.030 3.353-27.030L3.353-26.733M4.658-28.428Q4.658-28.932 4.914-29.364Q5.170-29.796 5.605-30.047Q6.041-30.299 6.541-30.299Q6.928-30.299 7.269-30.155Q7.611-30.010 7.873-29.749Q8.135-29.487 8.277-29.151Q8.420-28.815 8.420-28.428Q8.420-27.936 8.156-27.526Q7.892-27.116 7.463-26.885Q7.033-26.655 6.541-26.655Q6.049-26.655 5.615-26.887Q5.181-27.120 4.920-27.528Q4.658-27.936 4.658-28.428M6.541-26.932Q6.998-26.932 7.250-27.155Q7.502-27.378 7.590-27.729Q7.678-28.081 7.678-28.526Q7.678-28.956 7.584-29.294Q7.490-29.631 7.236-29.838Q6.982-30.046 6.541-30.046Q5.892-30.046 5.648-29.629Q5.404-29.213 5.404-28.526Q5.404-28.081 5.492-27.729Q5.580-27.378 5.832-27.155Q6.084-26.932 6.541-26.932\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M10.483-26.764L9.260-29.620Q9.178-29.796 9.034-29.840Q8.889-29.885 8.620-29.885L8.620-30.182L10.331-30.182L10.331-29.885Q9.909-29.885 9.909-29.702Q9.909-29.667 9.924-29.620L10.870-27.428L11.710-29.405Q11.749-29.483 11.749-29.573Q11.749-29.713 11.643-29.799Q11.538-29.885 11.397-29.885L11.397-30.182L12.749-30.182L12.749-29.885Q12.225-29.885 12.010-29.405L10.885-26.764Q10.823-26.655 10.717-26.655L10.651-26.655Q10.538-26.655 10.483-26.764\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M12.933-28.487Q12.933-28.967 13.166-29.383Q13.398-29.799 13.808-30.049Q14.218-30.299 14.695-30.299Q15.425-30.299 15.824-29.858Q16.222-29.417 16.222-28.686Q16.222-28.581 16.129-28.557L13.679-28.557L13.679-28.487Q13.679-28.077 13.800-27.721Q13.922-27.366 14.193-27.149Q14.465-26.932 14.894-26.932Q15.258-26.932 15.554-27.161Q15.851-27.389 15.953-27.741Q15.961-27.788 16.047-27.803L16.129-27.803Q16.222-27.776 16.222-27.694Q16.222-27.686 16.215-27.655Q16.152-27.428 16.013-27.245Q15.875-27.061 15.683-26.928Q15.492-26.796 15.273-26.725Q15.054-26.655 14.816-26.655Q14.445-26.655 14.107-26.792Q13.769-26.928 13.502-27.180Q13.234-27.432 13.084-27.772Q12.933-28.112 12.933-28.487M13.687-28.796L15.648-28.796Q15.648-29.100 15.547-29.391Q15.445-29.682 15.228-29.864Q15.011-30.046 14.695-30.046Q14.394-30.046 14.164-29.858Q13.933-29.671 13.810-29.379Q13.687-29.088 13.687-28.796\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M21.427-25.182L19.572-25.182L19.572-25.475Q19.841-25.475 20.009-25.520Q20.177-25.565 20.177-25.741L20.177-29.565Q20.177-29.772 20.021-29.825Q19.865-29.878 19.572-29.878L19.572-30.174L20.794-30.260L20.794-29.796Q21.025-30.018 21.339-30.139Q21.654-30.260 21.994-30.260Q22.466-30.260 22.870-30.014Q23.275-29.768 23.507-29.352Q23.740-28.936 23.740-28.460Q23.740-28.085 23.591-27.756Q23.443-27.428 23.173-27.176Q22.904-26.924 22.560-26.790Q22.216-26.655 21.857-26.655Q21.568-26.655 21.296-26.776Q21.025-26.897 20.818-27.108L20.818-25.741Q20.818-25.565 20.986-25.520Q21.154-25.475 21.427-25.475L21.427-25.182M20.818-29.397L20.818-27.557Q20.970-27.268 21.232-27.088Q21.494-26.909 21.802-26.909Q22.087-26.909 22.310-27.047Q22.533-27.186 22.685-27.417Q22.837-27.647 22.915-27.919Q22.994-28.190 22.994-28.460Q22.994-28.792 22.869-29.149Q22.744-29.506 22.495-29.743Q22.247-29.979 21.900-29.979Q21.576-29.979 21.281-29.823Q20.986-29.667 20.818-29.397\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M24.502-28.428Q24.502-28.932 24.758-29.364Q25.014-29.796 25.450-30.047Q25.885-30.299 26.385-30.299Q26.772-30.299 27.114-30.155Q27.455-30.010 27.717-29.749Q27.979-29.487 28.121-29.151Q28.264-28.815 28.264-28.428Q28.264-27.936 28-27.526Q27.737-27.116 27.307-26.885Q26.877-26.655 26.385-26.655Q25.893-26.655 25.459-26.887Q25.026-27.120 24.764-27.528Q24.502-27.936 24.502-28.428M26.385-26.932Q26.842-26.932 27.094-27.155Q27.346-27.378 27.434-27.729Q27.522-28.081 27.522-28.526Q27.522-28.956 27.428-29.294Q27.334-29.631 27.080-29.838Q26.826-30.046 26.385-30.046Q25.737-30.046 25.493-29.629Q25.248-29.213 25.248-28.526Q25.248-28.081 25.336-27.729Q25.424-27.378 25.676-27.155Q25.928-26.932 26.385-26.932M30.662-26.733L28.830-26.733L28.830-27.030Q29.104-27.030 29.272-27.077Q29.440-27.124 29.440-27.292L29.440-31.452Q29.440-31.667 29.377-31.762Q29.315-31.858 29.196-31.879Q29.076-31.901 28.830-31.901L28.830-32.198L30.053-32.284L30.053-27.292Q30.053-27.124 30.221-27.077Q30.389-27.030 30.662-27.030L30.662-26.733M32.967-26.733L31.190-26.733L31.190-27.030Q31.463-27.030 31.631-27.077Q31.799-27.124 31.799-27.292L31.799-29.428Q31.799-29.643 31.743-29.739Q31.686-29.835 31.573-29.856Q31.459-29.878 31.213-29.878L31.213-30.174L32.412-30.260L32.412-27.292Q32.412-27.124 32.559-27.077Q32.705-27.030 32.967-27.030L32.967-26.733M31.526-31.655Q31.526-31.846 31.660-31.977Q31.795-32.108 31.991-32.108Q32.112-32.108 32.215-32.046Q32.319-31.983 32.381-31.879Q32.444-31.776 32.444-31.655Q32.444-31.460 32.313-31.325Q32.182-31.190 31.991-31.190Q31.791-31.190 31.659-31.323Q31.526-31.456 31.526-31.655M33.510-28.460Q33.510-28.956 33.760-29.381Q34.010-29.807 34.430-30.053Q34.850-30.299 35.350-30.299Q35.889-30.299 36.280-30.174Q36.670-30.049 36.670-29.635Q36.670-29.530 36.619-29.438Q36.569-29.346 36.477-29.296Q36.385-29.245 36.276-29.245Q36.170-29.245 36.078-29.296Q35.987-29.346 35.936-29.438Q35.885-29.530 35.885-29.635Q35.885-29.858 36.053-29.963Q35.830-30.022 35.358-30.022Q35.061-30.022 34.846-29.883Q34.631-29.745 34.500-29.514Q34.369-29.284 34.311-29.014Q34.252-28.745 34.252-28.460Q34.252-28.065 34.385-27.715Q34.518-27.366 34.789-27.149Q35.061-26.932 35.459-26.932Q35.834-26.932 36.110-27.149Q36.385-27.366 36.487-27.725Q36.502-27.788 36.565-27.788L36.670-27.788Q36.705-27.788 36.731-27.760Q36.756-27.733 36.756-27.694L36.756-27.671Q36.623-27.190 36.239-26.922Q35.854-26.655 35.350-26.655Q34.987-26.655 34.653-26.792Q34.319-26.928 34.059-27.178Q33.799-27.428 33.655-27.764Q33.510-28.100 33.510-28.460M37.662-25.436Q37.776-25.358 37.951-25.358Q38.241-25.358 38.461-25.571Q38.682-25.784 38.807-26.085L39.096-26.733L37.823-29.620Q37.741-29.796 37.596-29.840Q37.451-29.885 37.182-29.885L37.182-30.182L38.901-30.182L38.901-29.885Q38.479-29.885 38.479-29.702Q38.479-29.690 38.494-29.620L39.432-27.495L40.264-29.405Q40.303-29.495 40.303-29.573Q40.303-29.713 40.201-29.799Q40.100-29.885 39.959-29.885L39.959-30.182L41.311-30.182L41.311-29.885Q41.057-29.885 40.864-29.760Q40.670-29.635 40.565-29.405L39.119-26.085Q39.006-25.831 38.840-25.608Q38.674-25.385 38.446-25.243Q38.217-25.100 37.951-25.100Q37.655-25.100 37.414-25.292Q37.174-25.483 37.174-25.772Q37.174-25.928 37.280-26.030Q37.385-26.131 37.534-26.131Q37.639-26.131 37.719-26.085Q37.799-26.038 37.846-25.960Q37.893-25.881 37.893-25.772Q37.893-25.651 37.832-25.563Q37.772-25.475 37.662-25.436\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M44.572-28.428Q44.572-28.932 44.828-29.364Q45.084-29.796 45.520-30.047Q45.955-30.299 46.455-30.299Q46.842-30.299 47.184-30.155Q47.525-30.010 47.787-29.749Q48.049-29.487 48.191-29.151Q48.334-28.815 48.334-28.428Q48.334-27.936 48.070-27.526Q47.807-27.116 47.377-26.885Q46.947-26.655 46.455-26.655Q45.963-26.655 45.529-26.887Q45.096-27.120 44.834-27.528Q44.572-27.936 44.572-28.428M46.455-26.932Q46.912-26.932 47.164-27.155Q47.416-27.378 47.504-27.729Q47.592-28.081 47.592-28.526Q47.592-28.956 47.498-29.294Q47.404-29.631 47.150-29.838Q46.897-30.046 46.455-30.046Q45.807-30.046 45.563-29.629Q45.318-29.213 45.318-28.526Q45.318-28.081 45.406-27.729Q45.494-27.378 45.746-27.155Q45.998-26.932 46.455-26.932M50.748-26.733L48.893-26.733L48.893-27.030Q49.166-27.030 49.334-27.077Q49.502-27.124 49.502-27.292L49.502-29.428Q49.502-29.643 49.439-29.739Q49.377-29.835 49.258-29.856Q49.139-29.878 48.893-29.878L48.893-30.174L50.084-30.260L50.084-29.526Q50.197-29.741 50.391-29.909Q50.584-30.077 50.822-30.169Q51.061-30.260 51.314-30.260Q52.482-30.260 52.482-29.182L52.482-27.292Q52.482-27.124 52.652-27.077Q52.822-27.030 53.092-27.030L53.092-26.733L51.236-26.733L51.236-27.030Q51.510-27.030 51.678-27.077Q51.846-27.124 51.846-27.292L51.846-29.167Q51.846-29.549 51.725-29.778Q51.604-30.006 51.252-30.006Q50.939-30.006 50.686-29.844Q50.432-29.682 50.285-29.413Q50.139-29.143 50.139-28.846L50.139-27.292Q50.139-27.124 50.309-27.077Q50.479-27.030 50.748-27.030\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M-14.588-17.233L-16.568-17.233L-16.568-17.530Q-16.299-17.530-16.131-17.575Q-15.963-17.620-15.963-17.792L-15.963-19.928Q-15.963-20.143-16.025-20.239Q-16.088-20.335-16.205-20.356Q-16.322-20.378-16.568-20.378L-16.568-20.674L-15.400-20.760L-15.400-19.975Q-15.322-20.186-15.170-20.372Q-15.018-20.557-14.818-20.659Q-14.619-20.760-14.393-20.760Q-14.146-20.760-13.955-20.616Q-13.764-20.471-13.764-20.241Q-13.764-20.085-13.869-19.975Q-13.975-19.866-14.131-19.866Q-14.287-19.866-14.396-19.975Q-14.506-20.085-14.506-20.241Q-14.506-20.401-14.400-20.506Q-14.725-20.506-14.939-20.278Q-15.154-20.049-15.250-19.710Q-15.346-19.370-15.346-19.065L-15.346-17.792Q-15.346-17.624-15.119-17.577Q-14.893-17.530-14.588-17.530L-14.588-17.233M-13.283-18.987Q-13.283-19.467-13.051-19.883Q-12.818-20.299-12.408-20.549Q-11.998-20.799-11.521-20.799Q-10.791-20.799-10.393-20.358Q-9.994-19.917-9.994-19.186Q-9.994-19.081-10.088-19.057L-12.537-19.057L-12.537-18.987Q-12.537-18.577-12.416-18.221Q-12.295-17.866-12.023-17.649Q-11.752-17.432-11.322-17.432Q-10.959-17.432-10.662-17.661Q-10.365-17.889-10.264-18.241Q-10.256-18.288-10.170-18.303L-10.088-18.303Q-9.994-18.276-9.994-18.194Q-9.994-18.186-10.002-18.155Q-10.064-17.928-10.203-17.745Q-10.342-17.561-10.533-17.428Q-10.725-17.296-10.943-17.225Q-11.162-17.155-11.400-17.155Q-11.771-17.155-12.109-17.292Q-12.447-17.428-12.715-17.680Q-12.982-17.932-13.133-18.272Q-13.283-18.612-13.283-18.987M-12.529-19.296L-10.568-19.296Q-10.568-19.600-10.670-19.891Q-10.771-20.182-10.988-20.364Q-11.205-20.546-11.521-20.546Q-11.822-20.546-12.053-20.358Q-12.283-20.171-12.406-19.879Q-12.529-19.588-12.529-19.296M-7.920-17.264L-8.990-20.120Q-9.057-20.299-9.188-20.342Q-9.318-20.385-9.576-20.385L-9.576-20.682L-7.896-20.682L-7.896-20.385Q-8.346-20.385-8.346-20.186Q-8.342-20.171-8.340-20.153Q-8.338-20.135-8.338-20.120L-7.545-18.026L-6.834-19.936Q-6.869-20.030-6.869-20.075Q-6.869-20.120-6.904-20.120Q-6.971-20.299-7.102-20.342Q-7.232-20.385-7.486-20.385L-7.486-20.682L-5.896-20.682L-5.896-20.385Q-6.346-20.385-6.346-20.186Q-6.342-20.167-6.340-20.149Q-6.338-20.131-6.338-20.120L-5.506-17.905L-4.752-19.905Q-4.729-19.963-4.729-20.034Q-4.729-20.194-4.865-20.290Q-5.002-20.385-5.170-20.385L-5.170-20.682L-3.783-20.682L-3.783-20.385Q-4.018-20.385-4.195-20.258Q-4.373-20.131-4.455-19.905L-5.439-17.264Q-5.494-17.155-5.607-17.155L-5.666-17.155Q-5.779-17.155-5.822-17.264L-6.682-19.538L-7.537-17.264Q-7.576-17.155-7.697-17.155L-7.752-17.155Q-7.865-17.155-7.920-17.264\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M-3.504-18.065Q-3.504-18.549-3.102-18.844Q-2.699-19.139-2.149-19.258Q-1.598-19.378-1.106-19.378L-1.106-19.667Q-1.106-19.893-1.221-20.100Q-1.336-20.307-1.533-20.426Q-1.731-20.546-1.961-20.546Q-2.387-20.546-2.672-20.440Q-2.602-20.413-2.555-20.358Q-2.508-20.303-2.483-20.233Q-2.457-20.163-2.457-20.088Q-2.457-19.983-2.508-19.891Q-2.559-19.799-2.651-19.749Q-2.742-19.698-2.848-19.698Q-2.953-19.698-3.045-19.749Q-3.137-19.799-3.188-19.891Q-3.238-19.983-3.238-20.088Q-3.238-20.506-2.850-20.653Q-2.461-20.799-1.961-20.799Q-1.629-20.799-1.276-20.669Q-0.922-20.538-0.694-20.284Q-0.465-20.030-0.465-19.682L-0.465-17.881Q-0.465-17.749-0.393-17.639Q-0.320-17.530-0.192-17.530Q-0.067-17.530 0.002-17.635Q0.070-17.741 0.070-17.881L0.070-18.393L0.351-18.393L0.351-17.881Q0.351-17.678 0.234-17.520Q0.117-17.362-0.065-17.278Q-0.246-17.194-0.449-17.194Q-0.680-17.194-0.832-17.366Q-0.985-17.538-1.016-17.768Q-1.176-17.487-1.485-17.321Q-1.793-17.155-2.145-17.155Q-2.656-17.155-3.080-17.378Q-3.504-17.600-3.504-18.065M-2.817-18.065Q-2.817-17.780-2.590-17.594Q-2.363-17.409-2.070-17.409Q-1.824-17.409-1.600-17.526Q-1.375-17.643-1.240-17.846Q-1.106-18.049-1.106-18.303L-1.106-19.135Q-1.371-19.135-1.656-19.081Q-1.942-19.026-2.213-18.897Q-2.485-18.768-2.651-18.561Q-2.817-18.354-2.817-18.065M2.652-17.233L0.672-17.233L0.672-17.530Q0.941-17.530 1.109-17.575Q1.277-17.620 1.277-17.792L1.277-19.928Q1.277-20.143 1.215-20.239Q1.152-20.335 1.035-20.356Q0.918-20.378 0.672-20.378L0.672-20.674L1.840-20.760L1.840-19.975Q1.918-20.186 2.070-20.372Q2.223-20.557 2.422-20.659Q2.621-20.760 2.848-20.760Q3.094-20.760 3.285-20.616Q3.476-20.471 3.476-20.241Q3.476-20.085 3.371-19.975Q3.265-19.866 3.109-19.866Q2.953-19.866 2.844-19.975Q2.734-20.085 2.734-20.241Q2.734-20.401 2.840-20.506Q2.515-20.506 2.301-20.278Q2.086-20.049 1.990-19.710Q1.894-19.370 1.894-19.065L1.894-17.792Q1.894-17.624 2.121-17.577Q2.348-17.530 2.652-17.530L2.652-17.233M5.773-17.155Q5.293-17.155 4.885-17.399Q4.476-17.643 4.238-18.057Q4-18.471 4-18.960Q4-19.452 4.258-19.868Q4.515-20.284 4.947-20.522Q5.379-20.760 5.871-20.760Q6.492-20.760 6.941-20.323L6.941-21.952Q6.941-22.167 6.879-22.262Q6.816-22.358 6.699-22.379Q6.582-22.401 6.336-22.401L6.336-22.698L7.558-22.784L7.558-17.975Q7.558-17.764 7.621-17.669Q7.683-17.573 7.801-17.551Q7.918-17.530 8.168-17.530L8.168-17.233L6.918-17.155L6.918-17.639Q6.453-17.155 5.773-17.155M5.840-17.409Q6.180-17.409 6.473-17.600Q6.765-17.792 6.918-18.088L6.918-19.921Q6.769-20.194 6.508-20.350Q6.246-20.506 5.933-20.506Q5.308-20.506 5.025-20.059Q4.742-19.612 4.742-18.952Q4.742-18.307 4.994-17.858Q5.246-17.409 5.840-17.409\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M13.524-17.233L11.544-17.233L11.544-17.530Q11.813-17.530 11.981-17.575Q12.149-17.620 12.149-17.792L12.149-19.928Q12.149-20.143 12.087-20.239Q12.024-20.335 11.907-20.356Q11.790-20.378 11.544-20.378L11.544-20.674L12.712-20.760L12.712-19.975Q12.790-20.186 12.942-20.372Q13.094-20.557 13.294-20.659Q13.493-20.760 13.719-20.760Q13.966-20.760 14.157-20.616Q14.348-20.471 14.348-20.241Q14.348-20.085 14.243-19.975Q14.137-19.866 13.981-19.866Q13.825-19.866 13.716-19.975Q13.606-20.085 13.606-20.241Q13.606-20.401 13.712-20.506Q13.387-20.506 13.173-20.278Q12.958-20.049 12.862-19.710Q12.766-19.370 12.766-19.065L12.766-17.792Q12.766-17.624 12.993-17.577Q13.219-17.530 13.524-17.530\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M19.776-18.682L17.522-18.682L17.522-19.233L19.776-19.233\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M25.242-17.233L23.410-17.233L23.410-17.530Q23.684-17.530 23.852-17.577Q24.020-17.624 24.020-17.792L24.020-21.952Q24.020-22.167 23.957-22.262Q23.895-22.358 23.776-22.379Q23.656-22.401 23.410-22.401L23.410-22.698L24.633-22.784L24.633-17.792Q24.633-17.624 24.801-17.577Q24.969-17.530 25.242-17.530L25.242-17.233M25.785-18.065Q25.785-18.549 26.188-18.844Q26.590-19.139 27.141-19.258Q27.692-19.378 28.184-19.378L28.184-19.667Q28.184-19.893 28.069-20.100Q27.953-20.307 27.756-20.426Q27.559-20.546 27.328-20.546Q26.902-20.546 26.617-20.440Q26.688-20.413 26.735-20.358Q26.781-20.303 26.807-20.233Q26.832-20.163 26.832-20.088Q26.832-19.983 26.781-19.891Q26.731-19.799 26.639-19.749Q26.547-19.698 26.442-19.698Q26.336-19.698 26.244-19.749Q26.152-19.799 26.102-19.891Q26.051-19.983 26.051-20.088Q26.051-20.506 26.440-20.653Q26.828-20.799 27.328-20.799Q27.660-20.799 28.014-20.669Q28.367-20.538 28.596-20.284Q28.824-20.030 28.824-19.682L28.824-17.881Q28.824-17.749 28.897-17.639Q28.969-17.530 29.098-17.530Q29.223-17.530 29.291-17.635Q29.360-17.741 29.360-17.881L29.360-18.393L29.641-18.393L29.641-17.881Q29.641-17.678 29.524-17.520Q29.406-17.362 29.225-17.278Q29.043-17.194 28.840-17.194Q28.610-17.194 28.457-17.366Q28.305-17.538 28.274-17.768Q28.113-17.487 27.805-17.321Q27.496-17.155 27.145-17.155Q26.633-17.155 26.209-17.378Q25.785-17.600 25.785-18.065M26.473-18.065Q26.473-17.780 26.699-17.594Q26.926-17.409 27.219-17.409Q27.465-17.409 27.690-17.526Q27.914-17.643 28.049-17.846Q28.184-18.049 28.184-18.303L28.184-19.135Q27.918-19.135 27.633-19.081Q27.348-19.026 27.076-18.897Q26.805-18.768 26.639-18.561Q26.473-18.354 26.473-18.065M31.863-17.233L30.008-17.233L30.008-17.530Q30.281-17.530 30.449-17.577Q30.617-17.624 30.617-17.792L30.617-19.928Q30.617-20.143 30.555-20.239Q30.492-20.335 30.373-20.356Q30.254-20.378 30.008-20.378L30.008-20.674L31.199-20.760L31.199-20.026Q31.313-20.241 31.506-20.409Q31.699-20.577 31.938-20.669Q32.176-20.760 32.430-20.760Q33.391-20.760 33.567-20.049Q33.750-20.378 34.078-20.569Q34.406-20.760 34.785-20.760Q35.961-20.760 35.961-19.682L35.961-17.792Q35.961-17.624 36.129-17.577Q36.297-17.530 36.567-17.530L36.567-17.233L34.711-17.233L34.711-17.530Q34.985-17.530 35.153-17.575Q35.320-17.620 35.320-17.792L35.320-19.667Q35.320-20.053 35.195-20.280Q35.070-20.506 34.719-20.506Q34.414-20.506 34.158-20.344Q33.903-20.182 33.754-19.913Q33.606-19.643 33.606-19.346L33.606-17.792Q33.606-17.624 33.776-17.577Q33.945-17.530 34.215-17.530L34.215-17.233L32.360-17.233L32.360-17.530Q32.633-17.530 32.801-17.577Q32.969-17.624 32.969-17.792L32.969-19.667Q32.969-20.053 32.844-20.280Q32.719-20.506 32.367-20.506Q32.063-20.506 31.807-20.344Q31.551-20.182 31.402-19.913Q31.254-19.643 31.254-19.346L31.254-17.792Q31.254-17.624 31.424-17.577Q31.594-17.530 31.863-17.530\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M37.701-17.233L37.420-17.233L37.420-21.952Q37.420-22.167 37.358-22.262Q37.295-22.358 37.178-22.379Q37.061-22.401 36.815-22.401L36.815-22.698L38.037-22.784L38.037-20.296Q38.514-20.760 39.213-20.760Q39.694-20.760 40.102-20.516Q40.510-20.272 40.746-19.858Q40.983-19.444 40.983-18.960Q40.983-18.585 40.834-18.256Q40.686-17.928 40.416-17.676Q40.147-17.424 39.803-17.290Q39.459-17.155 39.100-17.155Q38.779-17.155 38.481-17.303Q38.182-17.452 37.975-17.713L37.701-17.233M38.061-19.905L38.061-18.065Q38.213-17.768 38.473-17.588Q38.733-17.409 39.045-17.409Q39.471-17.409 39.738-17.628Q40.006-17.846 40.121-18.192Q40.236-18.538 40.236-18.960Q40.236-19.608 39.988-20.057Q39.740-20.506 39.143-20.506Q38.807-20.506 38.518-20.348Q38.229-20.190 38.061-19.905\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M43.562-17.155Q43.081-17.155 42.673-17.399Q42.265-17.643 42.027-18.057Q41.788-18.471 41.788-18.960Q41.788-19.452 42.046-19.868Q42.304-20.284 42.736-20.522Q43.167-20.760 43.659-20.760Q44.280-20.760 44.730-20.323L44.730-21.952Q44.730-22.167 44.667-22.262Q44.605-22.358 44.487-22.379Q44.370-22.401 44.124-22.401L44.124-22.698L45.347-22.784L45.347-17.975Q45.347-17.764 45.409-17.669Q45.472-17.573 45.589-17.551Q45.706-17.530 45.956-17.530L45.956-17.233L44.706-17.155L44.706-17.639Q44.241-17.155 43.562-17.155M43.628-17.409Q43.968-17.409 44.261-17.600Q44.554-17.792 44.706-18.088L44.706-19.921Q44.558-20.194 44.296-20.350Q44.034-20.506 43.722-20.506Q43.097-20.506 42.814-20.059Q42.530-19.612 42.530-18.952Q42.530-18.307 42.782-17.858Q43.034-17.409 43.628-17.409M46.562-18.065Q46.562-18.549 46.964-18.844Q47.366-19.139 47.917-19.258Q48.468-19.378 48.960-19.378L48.960-19.667Q48.960-19.893 48.845-20.100Q48.730-20.307 48.532-20.426Q48.335-20.546 48.105-20.546Q47.679-20.546 47.394-20.440Q47.464-20.413 47.511-20.358Q47.558-20.303 47.583-20.233Q47.609-20.163 47.609-20.088Q47.609-19.983 47.558-19.891Q47.507-19.799 47.415-19.749Q47.323-19.698 47.218-19.698Q47.112-19.698 47.021-19.749Q46.929-19.799 46.878-19.891Q46.827-19.983 46.827-20.088Q46.827-20.506 47.216-20.653Q47.605-20.799 48.105-20.799Q48.437-20.799 48.790-20.669Q49.144-20.538 49.372-20.284Q49.601-20.030 49.601-19.682L49.601-17.881Q49.601-17.749 49.673-17.639Q49.745-17.530 49.874-17.530Q49.999-17.530 50.068-17.635Q50.136-17.741 50.136-17.881L50.136-18.393L50.417-18.393L50.417-17.881Q50.417-17.678 50.300-17.520Q50.183-17.362 50.001-17.278Q49.819-17.194 49.616-17.194Q49.386-17.194 49.234-17.366Q49.081-17.538 49.050-17.768Q48.890-17.487 48.581-17.321Q48.273-17.155 47.921-17.155Q47.409-17.155 46.986-17.378Q46.562-17.600 46.562-18.065M47.249-18.065Q47.249-17.780 47.476-17.594Q47.702-17.409 47.995-17.409Q48.241-17.409 48.466-17.526Q48.691-17.643 48.825-17.846Q48.960-18.049 48.960-18.303L48.960-19.135Q48.694-19.135 48.409-19.081Q48.124-19.026 47.853-18.897Q47.581-18.768 47.415-18.561Q47.249-18.354 47.249-18.065\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.962 12.278)\">\u003Cpath d=\"M53.594-18.960Q53.594-19.456 53.844-19.881Q54.094-20.307 54.514-20.553Q54.934-20.799 55.434-20.799Q55.973-20.799 56.364-20.674Q56.754-20.549 56.754-20.135Q56.754-20.030 56.704-19.938Q56.653-19.846 56.561-19.796Q56.469-19.745 56.360-19.745Q56.254-19.745 56.163-19.796Q56.071-19.846 56.020-19.938Q55.969-20.030 55.969-20.135Q55.969-20.358 56.137-20.463Q55.915-20.522 55.442-20.522Q55.145-20.522 54.930-20.383Q54.715-20.245 54.584-20.014Q54.454-19.784 54.395-19.514Q54.336-19.245 54.336-18.960Q54.336-18.565 54.469-18.215Q54.602-17.866 54.874-17.649Q55.145-17.432 55.543-17.432Q55.918-17.432 56.194-17.649Q56.469-17.866 56.571-18.225Q56.586-18.288 56.649-18.288L56.754-18.288Q56.790-18.288 56.815-18.260Q56.840-18.233 56.840-18.194L56.840-18.171Q56.708-17.690 56.323-17.422Q55.938-17.155 55.434-17.155Q55.071-17.155 54.737-17.292Q54.403-17.428 54.143-17.678Q53.883-17.928 53.739-18.264Q53.594-18.600 53.594-18.960\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M119.738 1.261h136.576v-36.988H119.738Z\"\u002F>\u003Cg stroke=\"none\" font-size=\"8\">\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M31.972-26.655Q31.491-26.655 31.083-26.899Q30.675-27.143 30.437-27.557Q30.198-27.971 30.198-28.460Q30.198-28.952 30.456-29.368Q30.714-29.784 31.146-30.022Q31.577-30.260 32.069-30.260Q32.690-30.260 33.140-29.823L33.140-31.452Q33.140-31.667 33.077-31.762Q33.015-31.858 32.897-31.879Q32.780-31.901 32.534-31.901L32.534-32.198L33.757-32.284L33.757-27.475Q33.757-27.264 33.819-27.169Q33.882-27.073 33.999-27.051Q34.116-27.030 34.366-27.030L34.366-26.733L33.116-26.655L33.116-27.139Q32.651-26.655 31.972-26.655M32.038-26.909Q32.378-26.909 32.671-27.100Q32.964-27.292 33.116-27.588L33.116-29.421Q32.968-29.694 32.706-29.850Q32.444-30.006 32.132-30.006Q31.507-30.006 31.224-29.559Q30.940-29.112 30.940-28.452Q30.940-27.807 31.192-27.358Q31.444-26.909 32.038-26.909M35.558-27.686L35.558-29.428Q35.558-29.643 35.495-29.739Q35.433-29.835 35.313-29.856Q35.194-29.878 34.948-29.878L34.948-30.174L36.194-30.260L36.194-27.710L36.194-27.686Q36.194-27.374 36.249-27.212Q36.304-27.049 36.454-26.979Q36.605-26.909 36.925-26.909Q37.355-26.909 37.628-27.247Q37.901-27.585 37.901-28.030L37.901-29.428Q37.901-29.643 37.839-29.739Q37.776-29.835 37.657-29.856Q37.538-29.878 37.292-29.878L37.292-30.174L38.538-30.260L38.538-27.475Q38.538-27.264 38.601-27.169Q38.663-27.073 38.782-27.051Q38.901-27.030 39.147-27.030L39.147-26.733L37.925-26.655L37.925-27.276Q37.757-26.987 37.476-26.821Q37.194-26.655 36.874-26.655Q35.558-26.655 35.558-27.686M39.690-27.565Q39.690-28.049 40.093-28.344Q40.495-28.639 41.046-28.758Q41.597-28.878 42.089-28.878L42.089-29.167Q42.089-29.393 41.974-29.600Q41.858-29.807 41.661-29.926Q41.464-30.046 41.233-30.046Q40.808-30.046 40.522-29.940Q40.593-29.913 40.640-29.858Q40.687-29.803 40.712-29.733Q40.737-29.663 40.737-29.588Q40.737-29.483 40.687-29.391Q40.636-29.299 40.544-29.249Q40.452-29.198 40.347-29.198Q40.241-29.198 40.149-29.249Q40.058-29.299 40.007-29.391Q39.956-29.483 39.956-29.588Q39.956-30.006 40.345-30.153Q40.733-30.299 41.233-30.299Q41.565-30.299 41.919-30.169Q42.272-30.038 42.501-29.784Q42.730-29.530 42.730-29.182L42.730-27.381Q42.730-27.249 42.802-27.139Q42.874-27.030 43.003-27.030Q43.128-27.030 43.196-27.135Q43.265-27.241 43.265-27.381L43.265-27.893L43.546-27.893L43.546-27.381Q43.546-27.178 43.429-27.020Q43.312-26.862 43.130-26.778Q42.948-26.694 42.745-26.694Q42.515-26.694 42.362-26.866Q42.210-27.038 42.179-27.268Q42.019-26.987 41.710-26.821Q41.401-26.655 41.050-26.655Q40.538-26.655 40.114-26.878Q39.690-27.100 39.690-27.565M40.378-27.565Q40.378-27.280 40.605-27.094Q40.831-26.909 41.124-26.909Q41.370-26.909 41.595-27.026Q41.819-27.143 41.954-27.346Q42.089-27.549 42.089-27.803L42.089-28.635Q41.823-28.635 41.538-28.581Q41.253-28.526 40.981-28.397Q40.710-28.268 40.544-28.061Q40.378-27.854 40.378-27.565M45.753-26.733L43.921-26.733L43.921-27.030Q44.194-27.030 44.362-27.077Q44.530-27.124 44.530-27.292L44.530-31.452Q44.530-31.667 44.468-31.762Q44.405-31.858 44.286-31.879Q44.167-31.901 43.921-31.901L43.921-32.198L45.144-32.284L45.144-27.292Q45.144-27.124 45.312-27.077Q45.480-27.030 45.753-27.030\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M49.087-26.741L49.087-27.963Q49.087-27.991 49.118-28.022Q49.150-28.053 49.173-28.053L49.279-28.053Q49.349-28.053 49.365-27.991Q49.427-27.671 49.566-27.430Q49.704-27.190 49.937-27.049Q50.169-26.909 50.478-26.909Q50.716-26.909 50.925-26.969Q51.134-27.030 51.271-27.178Q51.408-27.327 51.408-27.573Q51.408-27.827 51.197-27.993Q50.986-28.159 50.716-28.213L50.095-28.327Q49.689-28.405 49.388-28.661Q49.087-28.917 49.087-29.292Q49.087-29.659 49.288-29.881Q49.490-30.104 49.814-30.202Q50.138-30.299 50.478-30.299Q50.943-30.299 51.240-30.092L51.462-30.276Q51.486-30.299 51.517-30.299L51.568-30.299Q51.599-30.299 51.626-30.272Q51.654-30.245 51.654-30.213L51.654-29.229Q51.654-29.198 51.628-29.169Q51.603-29.139 51.568-29.139L51.462-29.139Q51.427-29.139 51.400-29.167Q51.372-29.194 51.372-29.229Q51.372-29.628 51.120-29.848Q50.868-30.069 50.470-30.069Q50.115-30.069 49.831-29.946Q49.548-29.823 49.548-29.518Q49.548-29.299 49.749-29.167Q49.951-29.034 50.197-28.991L50.822-28.878Q51.251-28.788 51.560-28.491Q51.868-28.194 51.868-27.780Q51.868-27.210 51.470-26.932Q51.072-26.655 50.478-26.655Q49.927-26.655 49.576-26.991L49.279-26.678Q49.255-26.655 49.220-26.655L49.173-26.655Q49.150-26.655 49.118-26.686Q49.087-26.717 49.087-26.741M53.021-27.694L53.021-29.885L52.318-29.885L52.318-30.139Q52.673-30.139 52.915-30.372Q53.158-30.604 53.269-30.952Q53.380-31.299 53.380-31.655L53.661-31.655L53.661-30.182L54.837-30.182L54.837-29.885L53.661-29.885L53.661-27.710Q53.661-27.389 53.781-27.161Q53.900-26.932 54.181-26.932Q54.361-26.932 54.478-27.055Q54.595-27.178 54.648-27.358Q54.701-27.538 54.701-27.710L54.701-28.182L54.982-28.182L54.982-27.694Q54.982-27.440 54.876-27.200Q54.771-26.960 54.574-26.807Q54.376-26.655 54.118-26.655Q53.802-26.655 53.550-26.778Q53.298-26.901 53.160-27.135Q53.021-27.370 53.021-27.694M55.701-28.487Q55.701-28.967 55.933-29.383Q56.165-29.799 56.576-30.049Q56.986-30.299 57.462-30.299Q58.193-30.299 58.591-29.858Q58.990-29.417 58.990-28.686Q58.990-28.581 58.896-28.557L56.447-28.557L56.447-28.487Q56.447-28.077 56.568-27.721Q56.689-27.366 56.960-27.149Q57.232-26.932 57.661-26.932Q58.025-26.932 58.322-27.161Q58.618-27.389 58.720-27.741Q58.728-27.788 58.814-27.803L58.896-27.803Q58.990-27.776 58.990-27.694Q58.990-27.686 58.982-27.655Q58.919-27.428 58.781-27.245Q58.642-27.061 58.451-26.928Q58.259-26.796 58.040-26.725Q57.822-26.655 57.583-26.655Q57.212-26.655 56.874-26.792Q56.536-26.928 56.269-27.180Q56.001-27.432 55.851-27.772Q55.701-28.112 55.701-28.487M56.454-28.796L58.415-28.796Q58.415-29.100 58.314-29.391Q58.212-29.682 57.995-29.864Q57.779-30.046 57.462-30.046Q57.161-30.046 56.931-29.858Q56.701-29.671 56.577-29.379Q56.454-29.088 56.454-28.796M61.361-25.182L59.505-25.182L59.505-25.475Q59.775-25.475 59.943-25.520Q60.111-25.565 60.111-25.741L60.111-29.565Q60.111-29.772 59.954-29.825Q59.798-29.878 59.505-29.878L59.505-30.174L60.728-30.260L60.728-29.796Q60.958-30.018 61.273-30.139Q61.587-30.260 61.927-30.260Q62.400-30.260 62.804-30.014Q63.208-29.768 63.441-29.352Q63.673-28.936 63.673-28.460Q63.673-28.085 63.525-27.756Q63.376-27.428 63.107-27.176Q62.837-26.924 62.493-26.790Q62.150-26.655 61.790-26.655Q61.501-26.655 61.230-26.776Q60.958-26.897 60.751-27.108L60.751-25.741Q60.751-25.565 60.919-25.520Q61.087-25.475 61.361-25.475L61.361-25.182M60.751-29.397L60.751-27.557Q60.904-27.268 61.165-27.088Q61.427-26.909 61.736-26.909Q62.021-26.909 62.243-27.047Q62.466-27.186 62.618-27.417Q62.771-27.647 62.849-27.919Q62.927-28.190 62.927-28.460Q62.927-28.792 62.802-29.149Q62.677-29.506 62.429-29.743Q62.181-29.979 61.833-29.979Q61.509-29.979 61.214-29.823Q60.919-29.667 60.751-29.397M64.677-27.198Q64.677-27.381 64.814-27.518Q64.951-27.655 65.142-27.655Q65.333-27.655 65.466-27.522Q65.599-27.389 65.599-27.198Q65.599-26.999 65.466-26.866Q65.333-26.733 65.142-26.733Q64.951-26.733 64.814-26.870Q64.677-27.006 64.677-27.198M64.677-29.725Q64.677-29.909 64.814-30.046Q64.951-30.182 65.142-30.182Q65.333-30.182 65.466-30.049Q65.599-29.917 65.599-29.725Q65.599-29.526 65.466-29.393Q65.333-29.260 65.142-29.260Q64.951-29.260 64.814-29.397Q64.677-29.534 64.677-29.725\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M-14.682-17.233L-16.514-17.233L-16.514-17.530Q-16.240-17.530-16.072-17.577Q-15.904-17.624-15.904-17.792L-15.904-21.952Q-15.904-22.167-15.967-22.262Q-16.029-22.358-16.148-22.379Q-16.268-22.401-16.514-22.401L-16.514-22.698L-15.291-22.784L-15.291-17.792Q-15.291-17.624-15.123-17.577Q-14.955-17.530-14.682-17.530L-14.682-17.233M-14.139-18.065Q-14.139-18.549-13.736-18.844Q-13.334-19.139-12.783-19.258Q-12.232-19.378-11.740-19.378L-11.740-19.667Q-11.740-19.893-11.855-20.100Q-11.971-20.307-12.168-20.426Q-12.365-20.546-12.596-20.546Q-13.021-20.546-13.307-20.440Q-13.236-20.413-13.189-20.358Q-13.143-20.303-13.117-20.233Q-13.092-20.163-13.092-20.088Q-13.092-19.983-13.143-19.891Q-13.193-19.799-13.285-19.749Q-13.377-19.698-13.482-19.698Q-13.588-19.698-13.680-19.749Q-13.771-19.799-13.822-19.891Q-13.873-19.983-13.873-20.088Q-13.873-20.506-13.484-20.653Q-13.096-20.799-12.596-20.799Q-12.264-20.799-11.910-20.669Q-11.557-20.538-11.328-20.284Q-11.100-20.030-11.100-19.682L-11.100-17.881Q-11.100-17.749-11.027-17.639Q-10.955-17.530-10.826-17.530Q-10.701-17.530-10.633-17.635Q-10.564-17.741-10.564-17.881L-10.564-18.393L-10.283-18.393L-10.283-17.881Q-10.283-17.678-10.400-17.520Q-10.518-17.362-10.699-17.278Q-10.881-17.194-11.084-17.194Q-11.314-17.194-11.467-17.366Q-11.619-17.538-11.650-17.768Q-11.811-17.487-12.119-17.321Q-12.428-17.155-12.779-17.155Q-13.291-17.155-13.715-17.378Q-14.139-17.600-14.139-18.065M-13.451-18.065Q-13.451-17.780-13.225-17.594Q-12.998-17.409-12.705-17.409Q-12.459-17.409-12.234-17.526Q-12.010-17.643-11.875-17.846Q-11.740-18.049-11.740-18.303L-11.740-19.135Q-12.006-19.135-12.291-19.081Q-12.576-19.026-12.848-18.897Q-13.119-18.768-13.285-18.561Q-13.451-18.354-13.451-18.065M-8.061-17.233L-9.916-17.233L-9.916-17.530Q-9.643-17.530-9.475-17.577Q-9.307-17.624-9.307-17.792L-9.307-19.928Q-9.307-20.143-9.369-20.239Q-9.432-20.335-9.551-20.356Q-9.670-20.378-9.916-20.378L-9.916-20.674L-8.725-20.760L-8.725-20.026Q-8.611-20.241-8.418-20.409Q-8.225-20.577-7.986-20.669Q-7.748-20.760-7.494-20.760Q-6.533-20.760-6.357-20.049Q-6.174-20.378-5.846-20.569Q-5.518-20.760-5.139-20.760Q-3.963-20.760-3.963-19.682L-3.963-17.792Q-3.963-17.624-3.795-17.577Q-3.627-17.530-3.357-17.530L-3.357-17.233L-5.213-17.233L-5.213-17.530Q-4.939-17.530-4.771-17.575Q-4.604-17.620-4.604-17.792L-4.604-19.667Q-4.604-20.053-4.729-20.280Q-4.854-20.506-5.205-20.506Q-5.510-20.506-5.766-20.344Q-6.021-20.182-6.170-19.913Q-6.318-19.643-6.318-19.346L-6.318-17.792Q-6.318-17.624-6.148-17.577Q-5.979-17.530-5.709-17.530L-5.709-17.233L-7.564-17.233L-7.564-17.530Q-7.291-17.530-7.123-17.577Q-6.955-17.624-6.955-17.792L-6.955-19.667Q-6.955-20.053-7.080-20.280Q-7.205-20.506-7.557-20.506Q-7.861-20.506-8.117-20.344Q-8.373-20.182-8.521-19.913Q-8.670-19.643-8.670-19.346L-8.670-17.792Q-8.670-17.624-8.500-17.577Q-8.330-17.530-8.061-17.530\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M-2.223-17.233L-2.504-17.233L-2.504-21.952Q-2.504-22.167-2.566-22.262Q-2.629-22.358-2.746-22.379Q-2.863-22.401-3.109-22.401L-3.109-22.698L-1.887-22.784L-1.887-20.296Q-1.410-20.760-0.711-20.760Q-0.230-20.760 0.178-20.516Q0.586-20.272 0.822-19.858Q1.059-19.444 1.059-18.960Q1.059-18.585 0.910-18.256Q0.762-17.928 0.492-17.676Q0.223-17.424-0.121-17.290Q-0.465-17.155-0.824-17.155Q-1.145-17.155-1.443-17.303Q-1.742-17.452-1.949-17.713L-2.223-17.233M-1.863-19.905L-1.863-18.065Q-1.711-17.768-1.451-17.588Q-1.191-17.409-0.879-17.409Q-0.453-17.409-0.186-17.628Q0.082-17.846 0.197-18.192Q0.313-18.538 0.313-18.960Q0.313-19.608 0.064-20.057Q-0.184-20.506-0.781-20.506Q-1.117-20.506-1.406-20.348Q-1.695-20.190-1.863-19.905\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M3.638-17.155Q3.157-17.155 2.749-17.399Q2.341-17.643 2.103-18.057Q1.864-18.471 1.864-18.960Q1.864-19.452 2.122-19.868Q2.380-20.284 2.812-20.522Q3.243-20.760 3.735-20.760Q4.356-20.760 4.806-20.323L4.806-21.952Q4.806-22.167 4.743-22.262Q4.681-22.358 4.563-22.379Q4.446-22.401 4.200-22.401L4.200-22.698L5.423-22.784L5.423-17.975Q5.423-17.764 5.485-17.669Q5.548-17.573 5.665-17.551Q5.782-17.530 6.032-17.530L6.032-17.233L4.782-17.155L4.782-17.639Q4.317-17.155 3.638-17.155M3.704-17.409Q4.044-17.409 4.337-17.600Q4.630-17.792 4.782-18.088L4.782-19.921Q4.634-20.194 4.372-20.350Q4.110-20.506 3.798-20.506Q3.173-20.506 2.890-20.059Q2.606-19.612 2.606-18.952Q2.606-18.307 2.858-17.858Q3.110-17.409 3.704-17.409M6.638-18.065Q6.638-18.549 7.040-18.844Q7.442-19.139 7.993-19.258Q8.544-19.378 9.036-19.378L9.036-19.667Q9.036-19.893 8.921-20.100Q8.806-20.307 8.608-20.426Q8.411-20.546 8.181-20.546Q7.755-20.546 7.470-20.440Q7.540-20.413 7.587-20.358Q7.634-20.303 7.659-20.233Q7.685-20.163 7.685-20.088Q7.685-19.983 7.634-19.891Q7.583-19.799 7.491-19.749Q7.399-19.698 7.294-19.698Q7.188-19.698 7.097-19.749Q7.005-19.799 6.954-19.891Q6.903-19.983 6.903-20.088Q6.903-20.506 7.292-20.653Q7.681-20.799 8.181-20.799Q8.513-20.799 8.866-20.669Q9.220-20.538 9.448-20.284Q9.677-20.030 9.677-19.682L9.677-17.881Q9.677-17.749 9.749-17.639Q9.821-17.530 9.950-17.530Q10.075-17.530 10.144-17.635Q10.212-17.741 10.212-17.881L10.212-18.393L10.493-18.393L10.493-17.881Q10.493-17.678 10.376-17.520Q10.259-17.362 10.077-17.278Q9.896-17.194 9.692-17.194Q9.462-17.194 9.310-17.366Q9.157-17.538 9.126-17.768Q8.966-17.487 8.657-17.321Q8.349-17.155 7.997-17.155Q7.485-17.155 7.062-17.378Q6.638-17.600 6.638-18.065M7.325-18.065Q7.325-17.780 7.552-17.594Q7.778-17.409 8.071-17.409Q8.317-17.409 8.542-17.526Q8.767-17.643 8.901-17.846Q9.036-18.049 9.036-18.303L9.036-19.135Q8.771-19.135 8.485-19.081Q8.200-19.026 7.929-18.897Q7.657-18.768 7.491-18.561Q7.325-18.354 7.325-18.065\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M15.678-17.225Q15.623-17.542 15.465-17.854Q15.307-18.167 15.076-18.419Q14.846-18.671 14.553-18.852Q14.260-19.034 13.932-19.128Q13.862-19.151 13.862-19.233Q13.862-19.315 13.932-19.338Q14.260-19.436 14.553-19.618Q14.846-19.799 15.080-20.057Q15.315-20.315 15.469-20.616Q15.623-20.917 15.678-21.241Q15.698-21.327 15.780-21.346L15.948-21.346Q16.045-21.319 16.045-21.217Q15.948-20.690 15.647-20.217Q15.346-19.745 14.893-19.417L21.244-19.417Q21.319-19.417 21.366-19.364Q21.412-19.311 21.412-19.233Q21.412-19.159 21.362-19.104Q21.311-19.049 21.244-19.049L14.893-19.049Q15.190-18.835 15.422-18.557Q15.655-18.280 15.813-17.948Q15.971-17.616 16.045-17.249Q16.045-17.147 15.948-17.120L15.780-17.120Q15.698-17.139 15.678-17.225\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M26.874-17.233L25.042-17.233L25.042-17.530Q25.316-17.530 25.484-17.577Q25.652-17.624 25.652-17.792L25.652-21.952Q25.652-22.167 25.589-22.262Q25.527-22.358 25.408-22.379Q25.288-22.401 25.042-22.401L25.042-22.698L26.265-22.784L26.265-17.792Q26.265-17.624 26.433-17.577Q26.601-17.530 26.874-17.530L26.874-17.233M27.417-18.065Q27.417-18.549 27.820-18.844Q28.222-19.139 28.773-19.258Q29.324-19.378 29.816-19.378L29.816-19.667Q29.816-19.893 29.701-20.100Q29.585-20.307 29.388-20.426Q29.191-20.546 28.960-20.546Q28.535-20.546 28.249-20.440Q28.320-20.413 28.367-20.358Q28.413-20.303 28.439-20.233Q28.464-20.163 28.464-20.088Q28.464-19.983 28.413-19.891Q28.363-19.799 28.271-19.749Q28.179-19.698 28.074-19.698Q27.968-19.698 27.876-19.749Q27.785-19.799 27.734-19.891Q27.683-19.983 27.683-20.088Q27.683-20.506 28.072-20.653Q28.460-20.799 28.960-20.799Q29.292-20.799 29.646-20.669Q29.999-20.538 30.228-20.284Q30.456-20.030 30.456-19.682L30.456-17.881Q30.456-17.749 30.529-17.639Q30.601-17.530 30.730-17.530Q30.855-17.530 30.923-17.635Q30.992-17.741 30.992-17.881L30.992-18.393L31.273-18.393L31.273-17.881Q31.273-17.678 31.156-17.520Q31.038-17.362 30.857-17.278Q30.675-17.194 30.472-17.194Q30.242-17.194 30.089-17.366Q29.937-17.538 29.906-17.768Q29.745-17.487 29.437-17.321Q29.128-17.155 28.777-17.155Q28.265-17.155 27.841-17.378Q27.417-17.600 27.417-18.065M28.105-18.065Q28.105-17.780 28.331-17.594Q28.558-17.409 28.851-17.409Q29.097-17.409 29.322-17.526Q29.546-17.643 29.681-17.846Q29.816-18.049 29.816-18.303L29.816-19.135Q29.550-19.135 29.265-19.081Q28.980-19.026 28.708-18.897Q28.437-18.768 28.271-18.561Q28.105-18.354 28.105-18.065M33.495-17.233L31.640-17.233L31.640-17.530Q31.913-17.530 32.081-17.577Q32.249-17.624 32.249-17.792L32.249-19.928Q32.249-20.143 32.187-20.239Q32.124-20.335 32.005-20.356Q31.886-20.378 31.640-20.378L31.640-20.674L32.831-20.760L32.831-20.026Q32.945-20.241 33.138-20.409Q33.331-20.577 33.570-20.669Q33.808-20.760 34.062-20.760Q35.023-20.760 35.199-20.049Q35.382-20.378 35.710-20.569Q36.038-20.760 36.417-20.760Q37.593-20.760 37.593-19.682L37.593-17.792Q37.593-17.624 37.761-17.577Q37.929-17.530 38.199-17.530L38.199-17.233L36.343-17.233L36.343-17.530Q36.617-17.530 36.785-17.575Q36.952-17.620 36.952-17.792L36.952-19.667Q36.952-20.053 36.827-20.280Q36.702-20.506 36.351-20.506Q36.046-20.506 35.790-20.344Q35.535-20.182 35.386-19.913Q35.238-19.643 35.238-19.346L35.238-17.792Q35.238-17.624 35.408-17.577Q35.577-17.530 35.847-17.530L35.847-17.233L33.992-17.233L33.992-17.530Q34.265-17.530 34.433-17.577Q34.601-17.624 34.601-17.792L34.601-19.667Q34.601-20.053 34.476-20.280Q34.351-20.506 33.999-20.506Q33.695-20.506 33.439-20.344Q33.183-20.182 33.035-19.913Q32.886-19.643 32.886-19.346L32.886-17.792Q32.886-17.624 33.056-17.577Q33.226-17.530 33.495-17.530\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M39.333-17.233L39.052-17.233L39.052-21.952Q39.052-22.167 38.990-22.262Q38.927-22.358 38.810-22.379Q38.693-22.401 38.447-22.401L38.447-22.698L39.669-22.784L39.669-20.296Q40.146-20.760 40.845-20.760Q41.326-20.760 41.734-20.516Q42.142-20.272 42.378-19.858Q42.615-19.444 42.615-18.960Q42.615-18.585 42.466-18.256Q42.318-17.928 42.048-17.676Q41.779-17.424 41.435-17.290Q41.091-17.155 40.732-17.155Q40.411-17.155 40.113-17.303Q39.814-17.452 39.607-17.713L39.333-17.233M39.693-19.905L39.693-18.065Q39.845-17.768 40.105-17.588Q40.365-17.409 40.677-17.409Q41.103-17.409 41.370-17.628Q41.638-17.846 41.753-18.192Q41.868-18.538 41.868-18.960Q41.868-19.608 41.620-20.057Q41.372-20.506 40.775-20.506Q40.439-20.506 40.150-20.348Q39.861-20.190 39.693-19.905\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M45.194-17.155Q44.713-17.155 44.305-17.399Q43.897-17.643 43.659-18.057Q43.420-18.471 43.420-18.960Q43.420-19.452 43.678-19.868Q43.936-20.284 44.368-20.522Q44.799-20.760 45.291-20.760Q45.912-20.760 46.362-20.323L46.362-21.952Q46.362-22.167 46.299-22.262Q46.237-22.358 46.119-22.379Q46.002-22.401 45.756-22.401L45.756-22.698L46.979-22.784L46.979-17.975Q46.979-17.764 47.041-17.669Q47.104-17.573 47.221-17.551Q47.338-17.530 47.588-17.530L47.588-17.233L46.338-17.155L46.338-17.639Q45.873-17.155 45.194-17.155M45.260-17.409Q45.600-17.409 45.893-17.600Q46.186-17.792 46.338-18.088L46.338-19.921Q46.190-20.194 45.928-20.350Q45.666-20.506 45.354-20.506Q44.729-20.506 44.446-20.059Q44.162-19.612 44.162-18.952Q44.162-18.307 44.414-17.858Q44.666-17.409 45.260-17.409M48.194-18.065Q48.194-18.549 48.596-18.844Q48.998-19.139 49.549-19.258Q50.100-19.378 50.592-19.378L50.592-19.667Q50.592-19.893 50.477-20.100Q50.362-20.307 50.164-20.426Q49.967-20.546 49.737-20.546Q49.311-20.546 49.026-20.440Q49.096-20.413 49.143-20.358Q49.190-20.303 49.215-20.233Q49.241-20.163 49.241-20.088Q49.241-19.983 49.190-19.891Q49.139-19.799 49.047-19.749Q48.955-19.698 48.850-19.698Q48.744-19.698 48.653-19.749Q48.561-19.799 48.510-19.891Q48.459-19.983 48.459-20.088Q48.459-20.506 48.848-20.653Q49.237-20.799 49.737-20.799Q50.069-20.799 50.422-20.669Q50.776-20.538 51.004-20.284Q51.233-20.030 51.233-19.682L51.233-17.881Q51.233-17.749 51.305-17.639Q51.377-17.530 51.506-17.530Q51.631-17.530 51.700-17.635Q51.768-17.741 51.768-17.881L51.768-18.393L52.049-18.393L52.049-17.881Q52.049-17.678 51.932-17.520Q51.815-17.362 51.633-17.278Q51.452-17.194 51.248-17.194Q51.018-17.194 50.866-17.366Q50.713-17.538 50.682-17.768Q50.522-17.487 50.213-17.321Q49.905-17.155 49.553-17.155Q49.041-17.155 48.618-17.378Q48.194-17.600 48.194-18.065M48.881-18.065Q48.881-17.780 49.108-17.594Q49.334-17.409 49.627-17.409Q49.873-17.409 50.098-17.526Q50.323-17.643 50.457-17.846Q50.592-18.049 50.592-18.303L50.592-19.135Q50.327-19.135 50.041-19.081Q49.756-19.026 49.485-18.897Q49.213-18.768 49.047-18.561Q48.881-18.354 48.881-18.065\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M58.066-19.049L55.593-19.049Q55.515-19.061 55.466-19.110Q55.418-19.159 55.418-19.233Q55.418-19.307 55.466-19.356Q55.515-19.405 55.593-19.417L58.066-19.417L58.066-21.897Q58.093-22.065 58.250-22.065Q58.324-22.065 58.373-22.016Q58.422-21.967 58.433-21.897L58.433-19.417L60.906-19.417Q61.074-19.385 61.074-19.233Q61.074-19.081 60.906-19.049L58.433-19.049L58.433-16.569Q58.422-16.499 58.373-16.450Q58.324-16.401 58.250-16.401Q58.093-16.401 58.066-16.569\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M64.628-18.987Q64.628-19.467 64.861-19.883Q65.093-20.299 65.503-20.549Q65.913-20.799 66.390-20.799Q67.120-20.799 67.519-20.358Q67.917-19.917 67.917-19.186Q67.917-19.081 67.824-19.057L65.374-19.057L65.374-18.987Q65.374-18.577 65.495-18.221Q65.617-17.866 65.888-17.649Q66.160-17.432 66.589-17.432Q66.953-17.432 67.249-17.661Q67.546-17.889 67.648-18.241Q67.656-18.288 67.742-18.303L67.824-18.303Q67.917-18.276 67.917-18.194Q67.917-18.186 67.910-18.155Q67.847-17.928 67.708-17.745Q67.570-17.561 67.378-17.428Q67.187-17.296 66.968-17.225Q66.749-17.155 66.511-17.155Q66.140-17.155 65.802-17.292Q65.464-17.428 65.197-17.680Q64.929-17.932 64.779-18.272Q64.628-18.612 64.628-18.987M65.382-19.296L67.343-19.296Q67.343-19.600 67.242-19.891Q67.140-20.182 66.923-20.364Q66.706-20.546 66.390-20.546Q66.089-20.546 65.859-20.358Q65.628-20.171 65.505-19.879Q65.382-19.588 65.382-19.296M69.031-18.194L69.031-20.385L68.328-20.385L68.328-20.639Q68.683-20.639 68.925-20.872Q69.167-21.104 69.279-21.452Q69.390-21.799 69.390-22.155L69.671-22.155L69.671-20.682L70.847-20.682L70.847-20.385L69.671-20.385L69.671-18.210Q69.671-17.889 69.790-17.661Q69.910-17.432 70.191-17.432Q70.370-17.432 70.488-17.555Q70.605-17.678 70.658-17.858Q70.710-18.038 70.710-18.210L70.710-18.682L70.992-18.682L70.992-18.194Q70.992-17.940 70.886-17.700Q70.781-17.460 70.583-17.307Q70.386-17.155 70.128-17.155Q69.812-17.155 69.560-17.278Q69.308-17.401 69.169-17.635Q69.031-17.870 69.031-18.194M71.808-18.065Q71.808-18.549 72.210-18.844Q72.613-19.139 73.163-19.258Q73.714-19.378 74.206-19.378L74.206-19.667Q74.206-19.893 74.091-20.100Q73.976-20.307 73.779-20.426Q73.581-20.546 73.351-20.546Q72.925-20.546 72.640-20.440Q72.710-20.413 72.757-20.358Q72.804-20.303 72.829-20.233Q72.855-20.163 72.855-20.088Q72.855-19.983 72.804-19.891Q72.753-19.799 72.661-19.749Q72.570-19.698 72.464-19.698Q72.359-19.698 72.267-19.749Q72.175-19.799 72.124-19.891Q72.074-19.983 72.074-20.088Q72.074-20.506 72.462-20.653Q72.851-20.799 73.351-20.799Q73.683-20.799 74.036-20.669Q74.390-20.538 74.619-20.284Q74.847-20.030 74.847-19.682L74.847-17.881Q74.847-17.749 74.919-17.639Q74.992-17.530 75.120-17.530Q75.245-17.530 75.314-17.635Q75.382-17.741 75.382-17.881L75.382-18.393L75.663-18.393L75.663-17.881Q75.663-17.678 75.546-17.520Q75.429-17.362 75.247-17.278Q75.066-17.194 74.863-17.194Q74.632-17.194 74.480-17.366Q74.328-17.538 74.296-17.768Q74.136-17.487 73.828-17.321Q73.519-17.155 73.167-17.155Q72.656-17.155 72.232-17.378Q71.808-17.600 71.808-18.065M72.495-18.065Q72.495-17.780 72.722-17.594Q72.949-17.409 73.242-17.409Q73.488-17.409 73.712-17.526Q73.937-17.643 74.072-17.846Q74.206-18.049 74.206-18.303L74.206-19.135Q73.941-19.135 73.656-19.081Q73.370-19.026 73.099-18.897Q72.828-18.768 72.661-18.561Q72.495-18.354 72.495-18.065\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M81.174-15.241Q80.561-15.698 80.159-16.333Q79.756-16.967 79.561-17.713Q79.366-18.460 79.366-19.233Q79.366-20.006 79.561-20.753Q79.756-21.499 80.159-22.133Q80.561-22.768 81.174-23.225Q81.186-23.229 81.194-23.231Q81.202-23.233 81.213-23.233L81.291-23.233Q81.330-23.233 81.356-23.206Q81.381-23.178 81.381-23.135Q81.381-23.085 81.350-23.065Q80.842-22.612 80.520-21.989Q80.198-21.366 80.057-20.671Q79.916-19.975 79.916-19.233Q79.916-18.499 80.055-17.799Q80.194-17.100 80.518-16.475Q80.842-15.850 81.350-15.401Q81.381-15.381 81.381-15.331Q81.381-15.288 81.356-15.260Q81.330-15.233 81.291-15.233L81.213-15.233Q81.205-15.237 81.196-15.239Q81.186-15.241 81.174-15.241M82.143-18.960Q82.143-19.456 82.393-19.881Q82.643-20.307 83.063-20.553Q83.483-20.799 83.983-20.799Q84.522-20.799 84.912-20.674Q85.303-20.549 85.303-20.135Q85.303-20.030 85.252-19.938Q85.202-19.846 85.110-19.796Q85.018-19.745 84.909-19.745Q84.803-19.745 84.711-19.796Q84.620-19.846 84.569-19.938Q84.518-20.030 84.518-20.135Q84.518-20.358 84.686-20.463Q84.463-20.522 83.991-20.522Q83.694-20.522 83.479-20.383Q83.264-20.245 83.133-20.014Q83.002-19.784 82.944-19.514Q82.885-19.245 82.885-18.960Q82.885-18.565 83.018-18.215Q83.151-17.866 83.422-17.649Q83.694-17.432 84.092-17.432Q84.467-17.432 84.743-17.649Q85.018-17.866 85.120-18.225Q85.135-18.288 85.198-18.288L85.303-18.288Q85.338-18.288 85.364-18.260Q85.389-18.233 85.389-18.194L85.389-18.171Q85.256-17.690 84.871-17.422Q84.487-17.155 83.983-17.155Q83.620-17.155 83.286-17.292Q82.952-17.428 82.692-17.678Q82.432-17.928 82.287-18.264Q82.143-18.600 82.143-18.960M85.877-18.928Q85.877-19.432 86.133-19.864Q86.389-20.296 86.825-20.547Q87.260-20.799 87.760-20.799Q88.147-20.799 88.489-20.655Q88.830-20.510 89.092-20.249Q89.354-19.987 89.496-19.651Q89.639-19.315 89.639-18.928Q89.639-18.436 89.375-18.026Q89.112-17.616 88.682-17.385Q88.252-17.155 87.760-17.155Q87.268-17.155 86.834-17.387Q86.401-17.620 86.139-18.028Q85.877-18.436 85.877-18.928M87.760-17.432Q88.217-17.432 88.469-17.655Q88.721-17.878 88.809-18.229Q88.897-18.581 88.897-19.026Q88.897-19.456 88.803-19.794Q88.709-20.131 88.455-20.338Q88.202-20.546 87.760-20.546Q87.112-20.546 86.868-20.129Q86.623-19.713 86.623-19.026Q86.623-18.581 86.711-18.229Q86.799-17.878 87.051-17.655Q87.303-17.432 87.760-17.432M90.166-17.241L90.166-18.463Q90.166-18.491 90.198-18.522Q90.229-18.553 90.252-18.553L90.358-18.553Q90.428-18.553 90.444-18.491Q90.506-18.171 90.645-17.930Q90.784-17.690 91.016-17.549Q91.248-17.409 91.557-17.409Q91.795-17.409 92.004-17.469Q92.213-17.530 92.350-17.678Q92.487-17.827 92.487-18.073Q92.487-18.327 92.276-18.493Q92.065-18.659 91.795-18.713L91.174-18.827Q90.768-18.905 90.467-19.161Q90.166-19.417 90.166-19.792Q90.166-20.159 90.368-20.381Q90.569-20.604 90.893-20.702Q91.217-20.799 91.557-20.799Q92.022-20.799 92.319-20.592L92.541-20.776Q92.565-20.799 92.596-20.799L92.647-20.799Q92.678-20.799 92.705-20.772Q92.733-20.745 92.733-20.713L92.733-19.729Q92.733-19.698 92.707-19.669Q92.682-19.639 92.647-19.639L92.541-19.639Q92.506-19.639 92.479-19.667Q92.452-19.694 92.452-19.729Q92.452-20.128 92.200-20.348Q91.948-20.569 91.549-20.569Q91.194-20.569 90.911-20.446Q90.627-20.323 90.627-20.018Q90.627-19.799 90.828-19.667Q91.030-19.534 91.276-19.491L91.901-19.378Q92.330-19.288 92.639-18.991Q92.948-18.694 92.948-18.280Q92.948-17.710 92.549-17.432Q92.151-17.155 91.557-17.155Q91.006-17.155 90.655-17.491L90.358-17.178Q90.334-17.155 90.299-17.155L90.252-17.155Q90.229-17.155 90.198-17.186Q90.166-17.217 90.166-17.241M94.100-18.194L94.100-20.385L93.397-20.385L93.397-20.639Q93.752-20.639 93.995-20.872Q94.237-21.104 94.348-21.452Q94.459-21.799 94.459-22.155L94.741-22.155L94.741-20.682L95.916-20.682L95.916-20.385L94.741-20.385L94.741-18.210Q94.741-17.889 94.860-17.661Q94.979-17.432 95.260-17.432Q95.440-17.432 95.557-17.555Q95.674-17.678 95.727-17.858Q95.780-18.038 95.780-18.210L95.780-18.682L96.061-18.682L96.061-18.194Q96.061-17.940 95.955-17.700Q95.850-17.460 95.653-17.307Q95.455-17.155 95.198-17.155Q94.881-17.155 94.629-17.278Q94.377-17.401 94.239-17.635Q94.100-17.870 94.100-18.194\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M101.734-18.682L99.480-18.682L99.480-19.233L101.734-19.233\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(139.905 6.528)\">\u003Cpath d=\"M107.104-17.155Q106.623-17.155 106.215-17.399Q105.807-17.643 105.569-18.057Q105.330-18.471 105.330-18.960Q105.330-19.452 105.588-19.868Q105.846-20.284 106.278-20.522Q106.709-20.760 107.201-20.760Q107.822-20.760 108.272-20.323L108.272-21.952Q108.272-22.167 108.209-22.262Q108.147-22.358 108.029-22.379Q107.912-22.401 107.666-22.401L107.666-22.698L108.889-22.784L108.889-17.975Q108.889-17.764 108.951-17.669Q109.014-17.573 109.131-17.551Q109.248-17.530 109.498-17.530L109.498-17.233L108.248-17.155L108.248-17.639Q107.783-17.155 107.104-17.155M107.170-17.409Q107.510-17.409 107.803-17.600Q108.096-17.792 108.248-18.088L108.248-19.921Q108.100-20.194 107.838-20.350Q107.576-20.506 107.264-20.506Q106.639-20.506 106.356-20.059Q106.072-19.612 106.072-18.952Q106.072-18.307 106.324-17.858Q106.576-17.409 107.170-17.409M110.408-15.233L110.326-15.233Q110.291-15.233 110.266-15.262Q110.240-15.292 110.240-15.331Q110.240-15.381 110.272-15.401Q110.658-15.737 110.942-16.186Q111.225-16.635 111.391-17.135Q111.557-17.635 111.631-18.153Q111.705-18.671 111.705-19.233Q111.705-19.803 111.631-20.319Q111.557-20.835 111.391-21.331Q111.225-21.827 110.945-22.274Q110.666-22.721 110.272-23.065Q110.240-23.085 110.240-23.135Q110.240-23.174 110.266-23.204Q110.291-23.233 110.326-23.233L110.408-23.233Q110.420-23.233 110.430-23.231Q110.440-23.229 110.447-23.225Q111.061-22.768 111.463-22.133Q111.865-21.499 112.061-20.753Q112.256-20.006 112.256-19.233Q112.256-18.460 112.061-17.713Q111.865-16.967 111.463-16.333Q111.061-15.698 110.447-15.241Q110.436-15.241 110.428-15.239Q110.420-15.237 110.408-15.233\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-16.834-36.127c68.287-32.321 136.574-32.321 202.513-.918\"\u002F>\u003Cpath stroke=\"none\" d=\"m188.026-35.927-2.861-3.667.514 2.549-2.303 1.207\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(77.769 -46.843)\">\u003Cpath d=\"M-14.838-17.233L-16.472-17.233L-16.472-17.513Q-16.243-17.513-16.094-17.547Q-15.945-17.582-15.945-17.722L-15.945-19.571Q-15.945-19.841-16.053-19.902Q-16.161-19.964-16.472-19.964L-16.472-20.244L-15.412-20.319L-15.412-19.670Q-15.241-19.978-14.937-20.149Q-14.633-20.319-14.288-20.319Q-13.888-20.319-13.611-20.179Q-13.334-20.039-13.249-19.691Q-13.081-19.984-12.782-20.152Q-12.483-20.319-12.138-20.319Q-11.632-20.319-11.348-20.096Q-11.064-19.872-11.064-19.376L-11.064-17.722Q-11.064-17.585-10.916-17.549Q-10.767-17.513-10.542-17.513L-10.542-17.233L-12.172-17.233L-12.172-17.513Q-11.946-17.513-11.796-17.549Q-11.646-17.585-11.646-17.722L-11.646-19.362Q-11.646-19.697-11.765-19.897Q-11.885-20.097-12.199-20.097Q-12.469-20.097-12.703-19.961Q-12.938-19.824-13.076-19.590Q-13.214-19.356-13.214-19.082L-13.214-17.722Q-13.214-17.585-13.066-17.549Q-12.917-17.513-12.691-17.513L-12.691-17.233L-14.322-17.233L-14.322-17.513Q-14.093-17.513-13.944-17.547Q-13.795-17.582-13.795-17.722L-13.795-19.362Q-13.795-19.697-13.915-19.897Q-14.035-20.097-14.349-20.097Q-14.619-20.097-14.853-19.961Q-15.087-19.824-15.226-19.590Q-15.364-19.356-15.364-19.082L-15.364-17.722Q-15.364-17.585-15.214-17.549Q-15.063-17.513-14.838-17.513L-14.838-17.233M-9.995-18.768Q-9.995-19.089-9.870-19.378Q-9.745-19.667-9.520-19.890Q-9.294-20.114-8.998-20.234Q-8.703-20.354-8.385-20.354Q-8.057-20.354-7.795-20.254Q-7.534-20.155-7.358-19.973Q-7.182-19.790-7.088-19.532Q-6.994-19.274-6.994-18.942Q-6.994-18.850-7.076-18.829L-9.332-18.829L-9.332-18.768Q-9.332-18.180-9.048-17.797Q-8.764-17.414-8.197-17.414Q-7.876-17.414-7.607-17.607Q-7.339-17.800-7.250-18.115Q-7.243-18.156-7.168-18.170L-7.076-18.170Q-6.994-18.146-6.994-18.074Q-6.994-18.067-7.001-18.040Q-7.113-17.643-7.484-17.404Q-7.855-17.165-8.279-17.165Q-8.716-17.165-9.116-17.373Q-9.516-17.582-9.755-17.949Q-9.995-18.316-9.995-18.768M-9.325-19.038L-7.510-19.038Q-7.510-19.315-7.607-19.567Q-7.705-19.820-7.903-19.976Q-8.101-20.131-8.385-20.131Q-8.662-20.131-8.875-19.973Q-9.089-19.814-9.207-19.559Q-9.325-19.304-9.325-19.038M-6.348-17.961Q-6.348-18.293-6.124-18.520Q-5.900-18.747-5.556-18.875Q-5.213-19.004-4.840-19.056Q-4.468-19.109-4.164-19.109L-4.164-19.362Q-4.164-19.567-4.271-19.747Q-4.379-19.926-4.560-20.029Q-4.741-20.131-4.950-20.131Q-5.356-20.131-5.592-20.039Q-5.503-20.002-5.457-19.918Q-5.411-19.834-5.411-19.732Q-5.411-19.636-5.457-19.557Q-5.503-19.479-5.584-19.434Q-5.664-19.390-5.753-19.390Q-5.903-19.390-6.004-19.487Q-6.105-19.585-6.105-19.732Q-6.105-20.354-4.950-20.354Q-4.738-20.354-4.488-20.290Q-4.239-20.227-4.037-20.108Q-3.835-19.988-3.709-19.803Q-3.583-19.619-3.583-19.376L-3.583-17.800Q-3.583-17.684-3.521-17.588Q-3.459-17.493-3.347-17.493Q-3.237-17.493-3.172-17.587Q-3.107-17.681-3.107-17.800L-3.107-18.248L-2.841-18.248L-2.841-17.800Q-2.841-17.530-3.068-17.365Q-3.295-17.199-3.576-17.199Q-3.784-17.199-3.921-17.353Q-4.058-17.506-4.082-17.722Q-4.229-17.455-4.511-17.310Q-4.792-17.165-5.117-17.165Q-5.394-17.165-5.678-17.240Q-5.961-17.315-6.155-17.494Q-6.348-17.674-6.348-17.961M-5.732-17.961Q-5.732-17.787-5.632-17.657Q-5.531-17.527-5.375-17.457Q-5.220-17.387-5.056-17.387Q-4.837-17.387-4.628-17.484Q-4.420-17.582-4.292-17.763Q-4.164-17.944-4.164-18.170L-4.164-18.898Q-4.488-18.898-4.854-18.807Q-5.220-18.716-5.476-18.504Q-5.732-18.293-5.732-17.961M-2.424-17.240L-2.424-18.303Q-2.424-18.327-2.396-18.354Q-2.369-18.381-2.345-18.381L-2.236-18.381Q-2.171-18.381-2.157-18.323Q-2.062-17.889-1.815-17.638Q-1.569-17.387-1.156-17.387Q-0.814-17.387-0.561-17.520Q-0.308-17.653-0.308-17.961Q-0.308-18.118-0.402-18.233Q-0.496-18.347-0.635-18.416Q-0.773-18.484-0.940-18.522L-1.521-18.621Q-1.877-18.689-2.150-18.910Q-2.424-19.130-2.424-19.472Q-2.424-19.721-2.313-19.896Q-2.202-20.070-2.015-20.169Q-1.829-20.268-1.614-20.311Q-1.398-20.354-1.156-20.354Q-0.742-20.354-0.462-20.172L-0.247-20.347Q-0.236-20.350-0.230-20.352Q-0.223-20.354-0.212-20.354L-0.161-20.354Q-0.134-20.354-0.110-20.330Q-0.086-20.306-0.086-20.278L-0.086-19.431Q-0.086-19.410-0.110-19.383Q-0.134-19.356-0.161-19.356L-0.274-19.356Q-0.301-19.356-0.327-19.381Q-0.353-19.407-0.353-19.431Q-0.353-19.667-0.459-19.831Q-0.564-19.995-0.747-20.077Q-0.930-20.159-1.163-20.159Q-1.491-20.159-1.747-20.056Q-2.003-19.954-2.003-19.677Q-2.003-19.482-1.821-19.373Q-1.638-19.263-1.409-19.222L-0.834-19.116Q-0.588-19.068-0.375-18.940Q-0.161-18.812-0.024-18.609Q0.112-18.405 0.112-18.156Q0.112-17.643-0.253-17.404Q-0.619-17.165-1.156-17.165Q-1.651-17.165-1.983-17.459L-2.250-17.185Q-2.270-17.165-2.297-17.165L-2.345-17.165Q-2.369-17.165-2.396-17.192Q-2.424-17.219-2.424-17.240M1.315-18.067L1.315-19.571Q1.315-19.841 1.208-19.902Q1.100-19.964 0.789-19.964L0.789-20.244L1.896-20.319L1.896-18.087L1.896-18.067Q1.896-17.787 1.948-17.643Q1.999-17.500 2.141-17.443Q2.283-17.387 2.570-17.387Q2.823-17.387 3.028-17.527Q3.233-17.667 3.349-17.893Q3.465-18.118 3.465-18.368L3.465-19.571Q3.465-19.841 3.358-19.902Q3.250-19.964 2.939-19.964L2.939-20.244L4.046-20.319L4.046-17.906Q4.046-17.715 4.099-17.633Q4.152-17.551 4.253-17.532Q4.354-17.513 4.569-17.513L4.569-17.233L3.493-17.165L3.493-17.729Q3.383-17.547 3.238-17.424Q3.093-17.301 2.906-17.233Q2.720-17.165 2.519-17.165Q1.315-17.165 1.315-18.067M6.907-17.233L5.171-17.233L5.171-17.513Q5.400-17.513 5.549-17.547Q5.697-17.582 5.697-17.722L5.697-19.571Q5.697-19.841 5.590-19.902Q5.482-19.964 5.171-19.964L5.171-20.244L6.200-20.319L6.200-19.612Q6.330-19.920 6.572-20.119Q6.815-20.319 7.133-20.319Q7.352-20.319 7.522-20.195Q7.693-20.070 7.693-19.858Q7.693-19.721 7.594-19.622Q7.495-19.523 7.362-19.523Q7.225-19.523 7.126-19.622Q7.027-19.721 7.027-19.858Q7.027-19.998 7.126-20.097Q6.835-20.097 6.635-19.901Q6.436-19.704 6.343-19.410Q6.251-19.116 6.251-18.836L6.251-17.722Q6.251-17.513 6.907-17.513L6.907-17.233M8.237-18.768Q8.237-19.089 8.362-19.378Q8.486-19.667 8.712-19.890Q8.937-20.114 9.233-20.234Q9.529-20.354 9.847-20.354Q10.175-20.354 10.436-20.254Q10.698-20.155 10.874-19.973Q11.050-19.790 11.144-19.532Q11.238-19.274 11.238-18.942Q11.238-18.850 11.156-18.829L8.900-18.829L8.900-18.768Q8.900-18.180 9.184-17.797Q9.467-17.414 10.035-17.414Q10.356-17.414 10.624-17.607Q10.893-17.800 10.981-18.115Q10.988-18.156 11.063-18.170L11.156-18.170Q11.238-18.146 11.238-18.074Q11.238-18.067 11.231-18.040Q11.118-17.643 10.747-17.404Q10.376-17.165 9.953-17.165Q9.515-17.165 9.115-17.373Q8.715-17.582 8.476-17.949Q8.237-18.316 8.237-18.768M8.907-19.038L10.722-19.038Q10.722-19.315 10.624-19.567Q10.527-19.820 10.329-19.976Q10.130-20.131 9.847-20.131Q9.570-20.131 9.356-19.973Q9.143-19.814 9.025-19.559Q8.907-19.304 8.907-19.038M11.826-18.744Q11.826-19.082 11.966-19.373Q12.106-19.663 12.350-19.877Q12.595-20.090 12.899-20.205Q13.203-20.319 13.528-20.319Q13.798-20.319 14.061-20.220Q14.324-20.121 14.516-19.943L14.516-21.341Q14.516-21.611 14.408-21.673Q14.300-21.734 13.989-21.734L13.989-22.015L15.066-22.090L15.066-17.906Q15.066-17.718 15.121-17.635Q15.175-17.551 15.276-17.532Q15.377-17.513 15.592-17.513L15.592-17.233L14.485-17.165L14.485-17.582Q14.068-17.165 13.442-17.165Q13.012-17.165 12.639-17.377Q12.267-17.588 12.046-17.949Q11.826-18.310 11.826-18.744M13.500-17.387Q13.709-17.387 13.895-17.459Q14.082-17.530 14.235-17.667Q14.389-17.804 14.485-17.982L14.485-19.591Q14.399-19.738 14.254-19.858Q14.109-19.978 13.940-20.037Q13.770-20.097 13.589-20.097Q13.029-20.097 12.760-19.708Q12.492-19.318 12.492-18.737Q12.492-18.166 12.726-17.776Q12.960-17.387 13.500-17.387\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(77.769 -46.843)\">\u003Cpath d=\"M18.968-18.744Q18.968-19.072 19.103-19.373Q19.238-19.673 19.474-19.894Q19.710-20.114 20.014-20.234Q20.319-20.354 20.643-20.354Q21.149-20.354 21.498-20.251Q21.846-20.149 21.846-19.773Q21.846-19.626 21.749-19.525Q21.652-19.424 21.505-19.424Q21.351-19.424 21.252-19.523Q21.153-19.622 21.153-19.773Q21.153-19.961 21.293-20.053Q21.091-20.104 20.650-20.104Q20.295-20.104 20.066-19.908Q19.837-19.711 19.736-19.402Q19.635-19.092 19.635-18.744Q19.635-18.395 19.761-18.089Q19.888-17.783 20.143-17.599Q20.397-17.414 20.753-17.414Q20.975-17.414 21.159-17.498Q21.344-17.582 21.479-17.737Q21.614-17.893 21.672-18.101Q21.686-18.156 21.740-18.156L21.853-18.156Q21.884-18.156 21.906-18.132Q21.928-18.108 21.928-18.074L21.928-18.053Q21.843-17.766 21.655-17.568Q21.467-17.370 21.202-17.267Q20.937-17.165 20.643-17.165Q20.213-17.165 19.825-17.371Q19.437-17.578 19.203-17.941Q18.968-18.303 18.968-18.744M22.475-18.716Q22.475-19.058 22.610-19.357Q22.745-19.656 22.985-19.880Q23.224-20.104 23.542-20.229Q23.860-20.354 24.191-20.354Q24.635-20.354 25.035-20.138Q25.435-19.923 25.669-19.545Q25.904-19.168 25.904-18.716Q25.904-18.375 25.762-18.091Q25.620-17.807 25.375-17.600Q25.131-17.394 24.822-17.279Q24.512-17.165 24.191-17.165Q23.760-17.165 23.359-17.366Q22.957-17.568 22.716-17.920Q22.475-18.272 22.475-18.716M24.191-17.414Q24.793-17.414 25.017-17.792Q25.240-18.170 25.240-18.802Q25.240-19.414 25.006-19.773Q24.772-20.131 24.191-20.131Q23.138-20.131 23.138-18.802Q23.138-18.170 23.364-17.792Q23.590-17.414 24.191-17.414M26.498-17.240L26.498-18.303Q26.498-18.327 26.526-18.354Q26.553-18.381 26.577-18.381L26.686-18.381Q26.751-18.381 26.765-18.323Q26.861-17.889 27.107-17.638Q27.353-17.387 27.766-17.387Q28.108-17.387 28.361-17.520Q28.614-17.653 28.614-17.961Q28.614-18.118 28.520-18.233Q28.426-18.347 28.288-18.416Q28.149-18.484 27.982-18.522L27.401-18.621Q27.045-18.689 26.772-18.910Q26.498-19.130 26.498-19.472Q26.498-19.721 26.609-19.896Q26.720-20.070 26.907-20.169Q27.093-20.268 27.308-20.311Q27.524-20.354 27.766-20.354Q28.180-20.354 28.460-20.172L28.675-20.347Q28.686-20.350 28.693-20.352Q28.699-20.354 28.710-20.354L28.761-20.354Q28.788-20.354 28.812-20.330Q28.836-20.306 28.836-20.278L28.836-19.431Q28.836-19.410 28.812-19.383Q28.788-19.356 28.761-19.356L28.648-19.356Q28.621-19.356 28.595-19.381Q28.570-19.407 28.570-19.431Q28.570-19.667 28.464-19.831Q28.358-19.995 28.175-20.077Q27.992-20.159 27.759-20.159Q27.431-20.159 27.175-20.056Q26.919-19.954 26.919-19.677Q26.919-19.482 27.102-19.373Q27.284-19.263 27.513-19.222L28.088-19.116Q28.334-19.068 28.547-18.940Q28.761-18.812 28.898-18.609Q29.034-18.405 29.034-18.156Q29.034-17.643 28.669-17.404Q28.303-17.165 27.766-17.165Q27.271-17.165 26.939-17.459L26.673-17.185Q26.652-17.165 26.625-17.165L26.577-17.165Q26.553-17.165 26.526-17.192Q26.498-17.219 26.498-17.240M30.190-18.074L30.190-19.971L29.550-19.971L29.550-20.193Q29.868-20.193 30.085-20.403Q30.302-20.613 30.403-20.923Q30.504-21.232 30.504-21.540L30.771-21.540L30.771-20.251L31.847-20.251L31.847-19.971L30.771-19.971L30.771-18.087Q30.771-17.811 30.875-17.612Q30.979-17.414 31.239-17.414Q31.396-17.414 31.502-17.518Q31.608-17.623 31.658-17.776Q31.707-17.930 31.707-18.087L31.707-18.501L31.974-18.501L31.974-18.074Q31.974-17.848 31.875-17.638Q31.776-17.428 31.591-17.296Q31.406-17.165 31.177-17.165Q30.740-17.165 30.465-17.402Q30.190-17.640 30.190-18.074\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M188.026 1.461c-68.286 32.52-136.573 32.52-202.51 1.312\"\u002F>\u003Cpath stroke=\"none\" d=\"m-16.834 1.661 2.87 3.66-.52-2.548 2.3-1.212\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(64.183 51.704)\">\u003Cpath d=\"M-15.945-18.067L-15.945-19.571Q-15.945-19.841-16.053-19.902Q-16.161-19.964-16.472-19.964L-16.472-20.244L-15.364-20.319L-15.364-18.087L-15.364-18.067Q-15.364-17.787-15.313-17.643Q-15.262-17.500-15.120-17.443Q-14.978-17.387-14.691-17.387Q-14.438-17.387-14.233-17.527Q-14.028-17.667-13.912-17.893Q-13.795-18.118-13.795-18.368L-13.795-19.571Q-13.795-19.841-13.903-19.902Q-14.011-19.964-14.322-19.964L-14.322-20.244L-13.214-20.319L-13.214-17.906Q-13.214-17.715-13.161-17.633Q-13.108-17.551-13.008-17.532Q-12.907-17.513-12.691-17.513L-12.691-17.233L-13.768-17.165L-13.768-17.729Q-13.877-17.547-14.023-17.424Q-14.168-17.301-14.354-17.233Q-14.541-17.165-14.742-17.165Q-15.945-17.165-15.945-18.067M-10.459-15.876L-12.090-15.876L-12.090-16.156Q-11.861-16.156-11.712-16.191Q-11.563-16.225-11.563-16.365L-11.563-19.711Q-11.563-19.882-11.700-19.923Q-11.837-19.964-12.090-19.964L-12.090-20.244L-11.010-20.319L-11.010-19.913Q-10.788-20.114-10.501-20.217Q-10.213-20.319-9.906-20.319Q-9.479-20.319-9.115-20.106Q-8.751-19.892-8.537-19.528Q-8.323-19.164-8.323-18.744Q-8.323-18.299-8.563-17.935Q-8.802-17.571-9.195-17.368Q-9.588-17.165-10.032-17.165Q-10.299-17.165-10.547-17.265Q-10.794-17.366-10.982-17.547L-10.982-16.365Q-10.982-16.228-10.834-16.192Q-10.685-16.156-10.459-16.156L-10.459-15.876M-10.982-19.564L-10.982-17.954Q-10.849-17.701-10.606-17.544Q-10.364-17.387-10.087-17.387Q-9.759-17.387-9.506-17.588Q-9.253-17.790-9.120-18.108Q-8.986-18.426-8.986-18.744Q-8.986-18.973-9.051-19.202Q-9.116-19.431-9.244-19.629Q-9.373-19.827-9.567-19.947Q-9.762-20.066-9.995-20.066Q-10.289-20.066-10.557-19.937Q-10.825-19.807-10.982-19.564\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.183 51.704)\">\u003Cpath d=\"M-7.471-18.744Q-7.471-19.082-7.330-19.373Q-7.190-19.663-6.946-19.877Q-6.702-20.090-6.397-20.205Q-6.093-20.319-5.768-20.319Q-5.498-20.319-5.235-20.220Q-4.972-20.121-4.781-19.943L-4.781-21.341Q-4.781-21.611-4.888-21.673Q-4.996-21.734-5.307-21.734L-5.307-22.015L-4.230-22.090L-4.230-17.906Q-4.230-17.718-4.176-17.635Q-4.121-17.551-4.020-17.532Q-3.919-17.513-3.704-17.513L-3.704-17.233L-4.811-17.165L-4.811-17.582Q-5.228-17.165-5.854-17.165Q-6.285-17.165-6.657-17.377Q-7.030-17.588-7.250-17.949Q-7.471-18.310-7.471-18.744M-5.796-17.387Q-5.587-17.387-5.401-17.459Q-5.215-17.530-5.061-17.667Q-4.907-17.804-4.811-17.982L-4.811-19.591Q-4.897-19.738-5.042-19.858Q-5.187-19.978-5.357-20.037Q-5.526-20.097-5.707-20.097Q-6.267-20.097-6.536-19.708Q-6.804-19.318-6.804-18.737Q-6.804-18.166-6.570-17.776Q-6.336-17.387-5.796-17.387M-2.996-17.961Q-2.996-18.293-2.773-18.520Q-2.549-18.747-2.205-18.875Q-1.862-19.004-1.489-19.056Q-1.117-19.109-0.812-19.109L-0.812-19.362Q-0.812-19.567-0.920-19.747Q-1.028-19.926-1.209-20.029Q-1.390-20.131-1.598-20.131Q-2.005-20.131-2.241-20.039Q-2.152-20.002-2.106-19.918Q-2.060-19.834-2.060-19.732Q-2.060-19.636-2.106-19.557Q-2.152-19.479-2.233-19.434Q-2.313-19.390-2.402-19.390Q-2.552-19.390-2.653-19.487Q-2.754-19.585-2.754-19.732Q-2.754-20.354-1.598-20.354Q-1.387-20.354-1.137-20.290Q-0.888-20.227-0.686-20.108Q-0.484-19.988-0.358-19.803Q-0.231-19.619-0.231-19.376L-0.231-17.800Q-0.231-17.684-0.170-17.588Q-0.108-17.493 0.005-17.493Q0.114-17.493 0.179-17.587Q0.244-17.681 0.244-17.800L0.244-18.248L0.510-18.248L0.510-17.800Q0.510-17.530 0.283-17.365Q0.056-17.199-0.224-17.199Q-0.433-17.199-0.570-17.353Q-0.706-17.506-0.730-17.722Q-0.877-17.455-1.159-17.310Q-1.441-17.165-1.766-17.165Q-2.043-17.165-2.327-17.240Q-2.610-17.315-2.803-17.494Q-2.996-17.674-2.996-17.961M-2.381-17.961Q-2.381-17.787-2.280-17.657Q-2.180-17.527-2.024-17.457Q-1.868-17.387-1.704-17.387Q-1.486-17.387-1.277-17.484Q-1.069-17.582-0.941-17.763Q-0.812-17.944-0.812-18.170L-0.812-18.898Q-1.137-18.898-1.503-18.807Q-1.868-18.716-2.125-18.504Q-2.381-18.293-2.381-17.961M1.454-18.074L1.454-19.971L0.815-19.971L0.815-20.193Q1.132-20.193 1.350-20.403Q1.567-20.613 1.667-20.923Q1.768-21.232 1.768-21.540L2.035-21.540L2.035-20.251L3.111-20.251L3.111-19.971L2.035-19.971L2.035-18.087Q2.035-17.811 2.139-17.612Q2.243-17.414 2.503-17.414Q2.660-17.414 2.766-17.518Q2.872-17.623 2.922-17.776Q2.971-17.930 2.971-18.087L2.971-18.501L3.238-18.501L3.238-18.074Q3.238-17.848 3.139-17.638Q3.040-17.428 2.855-17.296Q2.671-17.165 2.442-17.165Q2.004-17.165 1.729-17.402Q1.454-17.640 1.454-18.074M4.007-18.768Q4.007-19.089 4.132-19.378Q4.257-19.667 4.482-19.890Q4.708-20.114 5.003-20.234Q5.299-20.354 5.617-20.354Q5.945-20.354 6.206-20.254Q6.468-20.155 6.644-19.973Q6.820-19.790 6.914-19.532Q7.008-19.274 7.008-18.942Q7.008-18.850 6.926-18.829L4.670-18.829L4.670-18.768Q4.670-18.180 4.954-17.797Q5.237-17.414 5.805-17.414Q6.126-17.414 6.394-17.607Q6.663-17.800 6.752-18.115Q6.758-18.156 6.834-18.170L6.926-18.170Q7.008-18.146 7.008-18.074Q7.008-18.067 7.001-18.040Q6.888-17.643 6.517-17.404Q6.147-17.165 5.723-17.165Q5.285-17.165 4.885-17.373Q4.486-17.582 4.246-17.949Q4.007-18.316 4.007-18.768M4.677-19.038L6.492-19.038Q6.492-19.315 6.394-19.567Q6.297-19.820 6.099-19.976Q5.901-20.131 5.617-20.131Q5.340-20.131 5.126-19.973Q4.913-19.814 4.795-19.559Q4.677-19.304 4.677-19.038M7.596-18.744Q7.596-19.082 7.736-19.373Q7.876-19.663 8.121-19.877Q8.365-20.090 8.669-20.205Q8.973-20.319 9.298-20.319Q9.568-20.319 9.831-20.220Q10.094-20.121 10.286-19.943L10.286-21.341Q10.286-21.611 10.178-21.673Q10.070-21.734 9.759-21.734L9.759-22.015L10.836-22.090L10.836-17.906Q10.836-17.718 10.891-17.635Q10.945-17.551 11.046-17.532Q11.147-17.513 11.362-17.513L11.362-17.233L10.255-17.165L10.255-17.582Q9.838-17.165 9.213-17.165Q8.782-17.165 8.409-17.377Q8.037-17.588 7.816-17.949Q7.596-18.310 7.596-18.744M9.271-17.387Q9.479-17.387 9.665-17.459Q9.852-17.530 10.006-17.667Q10.159-17.804 10.255-17.982L10.255-19.591Q10.170-19.738 10.024-19.858Q9.879-19.978 9.710-20.037Q9.541-20.097 9.360-20.097Q8.799-20.097 8.531-19.708Q8.262-19.318 8.262-18.737Q8.262-18.166 8.496-17.776Q8.731-17.387 9.271-17.387\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.183 51.704)\">\u003Cpath d=\"M16.368-15.876L14.738-15.876L14.738-16.156Q14.967-16.156 15.116-16.191Q15.264-16.225 15.264-16.365L15.264-19.711Q15.264-19.882 15.128-19.923Q14.991-19.964 14.738-19.964L14.738-20.244L15.818-20.319L15.818-19.913Q16.040-20.114 16.327-20.217Q16.615-20.319 16.922-20.319Q17.349-20.319 17.713-20.106Q18.077-19.892 18.291-19.528Q18.505-19.164 18.505-18.744Q18.505-18.299 18.265-17.935Q18.026-17.571 17.633-17.368Q17.240-17.165 16.796-17.165Q16.529-17.165 16.281-17.265Q16.034-17.366 15.846-17.547L15.846-16.365Q15.846-16.228 15.994-16.192Q16.143-16.156 16.368-16.156L16.368-15.876M15.846-19.564L15.846-17.954Q15.979-17.701 16.222-17.544Q16.464-17.387 16.741-17.387Q17.069-17.387 17.322-17.588Q17.575-17.790 17.708-18.108Q17.842-18.426 17.842-18.744Q17.842-18.973 17.777-19.202Q17.712-19.431 17.584-19.629Q17.455-19.827 17.261-19.947Q17.066-20.066 16.833-20.066Q16.539-20.066 16.271-19.937Q16.003-19.807 15.846-19.564M20.890-17.233L19.154-17.233L19.154-17.513Q19.383-17.513 19.532-17.547Q19.681-17.582 19.681-17.722L19.681-19.571Q19.681-19.841 19.573-19.902Q19.465-19.964 19.154-19.964L19.154-20.244L20.183-20.319L20.183-19.612Q20.313-19.920 20.556-20.119Q20.798-20.319 21.116-20.319Q21.335-20.319 21.506-20.195Q21.677-20.070 21.677-19.858Q21.677-19.721 21.577-19.622Q21.478-19.523 21.345-19.523Q21.208-19.523 21.109-19.622Q21.010-19.721 21.010-19.858Q21.010-19.998 21.109-20.097Q20.819-20.097 20.619-19.901Q20.419-19.704 20.327-19.410Q20.234-19.116 20.234-18.836L20.234-17.722Q20.234-17.513 20.890-17.513L20.890-17.233M23.878-17.233L22.326-17.233L22.326-17.513Q22.552-17.513 22.700-17.547Q22.849-17.582 22.849-17.722L22.849-19.571Q22.849-19.759 22.801-19.843Q22.753-19.926 22.656-19.945Q22.558-19.964 22.347-19.964L22.347-20.244L23.403-20.319L23.403-17.722Q23.403-17.582 23.534-17.547Q23.666-17.513 23.878-17.513L23.878-17.233M22.606-21.540Q22.606-21.711 22.729-21.830Q22.852-21.950 23.023-21.950Q23.191-21.950 23.314-21.830Q23.437-21.711 23.437-21.540Q23.437-21.365 23.314-21.242Q23.191-21.119 23.023-21.119Q22.852-21.119 22.729-21.242Q22.606-21.365 22.606-21.540M24.524-18.744Q24.524-19.072 24.659-19.373Q24.794-19.673 25.030-19.894Q25.265-20.114 25.570-20.234Q25.874-20.354 26.199-20.354Q26.704-20.354 27.053-20.251Q27.402-20.149 27.402-19.773Q27.402-19.626 27.304-19.525Q27.207-19.424 27.060-19.424Q26.906-19.424 26.807-19.523Q26.708-19.622 26.708-19.773Q26.708-19.961 26.848-20.053Q26.646-20.104 26.205-20.104Q25.850-20.104 25.621-19.908Q25.392-19.711 25.291-19.402Q25.190-19.092 25.190-18.744Q25.190-18.395 25.317-18.089Q25.443-17.783 25.698-17.599Q25.952-17.414 26.308-17.414Q26.530-17.414 26.715-17.498Q26.899-17.582 27.034-17.737Q27.169-17.893 27.227-18.101Q27.241-18.156 27.296-18.156L27.409-18.156Q27.439-18.156 27.462-18.132Q27.484-18.108 27.484-18.074L27.484-18.053Q27.398-17.766 27.210-17.568Q27.022-17.370 26.757-17.267Q26.493-17.165 26.199-17.165Q25.768-17.165 25.380-17.371Q24.992-17.578 24.758-17.941Q24.524-18.303 24.524-18.744M28.031-18.768Q28.031-19.089 28.155-19.378Q28.280-19.667 28.506-19.890Q28.731-20.114 29.027-20.234Q29.323-20.354 29.640-20.354Q29.969-20.354 30.230-20.254Q30.492-20.155 30.668-19.973Q30.844-19.790 30.938-19.532Q31.032-19.274 31.032-18.942Q31.032-18.850 30.950-18.829L28.694-18.829L28.694-18.768Q28.694-18.180 28.977-17.797Q29.261-17.414 29.828-17.414Q30.150-17.414 30.418-17.607Q30.686-17.800 30.775-18.115Q30.782-18.156 30.857-18.170L30.950-18.170Q31.032-18.146 31.032-18.074Q31.032-18.067 31.025-18.040Q30.912-17.643 30.541-17.404Q30.170-17.165 29.746-17.165Q29.309-17.165 28.909-17.373Q28.509-17.582 28.270-17.949Q28.031-18.316 28.031-18.768M28.701-19.038L30.515-19.038Q30.515-19.315 30.418-19.567Q30.321-19.820 30.122-19.976Q29.924-20.131 29.640-20.131Q29.364-20.131 29.150-19.973Q28.936-19.814 28.818-19.559Q28.701-19.304 28.701-19.038\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.183 51.704)\">\u003Cpath d=\"M36.003-17.233L34.400-17.233L34.400-17.513Q34.626-17.513 34.775-17.547Q34.923-17.582 34.923-17.722L34.923-21.341Q34.923-21.611 34.816-21.673Q34.708-21.734 34.400-21.734L34.400-22.015L35.477-22.090L35.477-17.722Q35.477-17.585 35.627-17.549Q35.778-17.513 36.003-17.513L36.003-17.233M36.656-17.961Q36.656-18.293 36.880-18.520Q37.104-18.747 37.448-18.875Q37.791-19.004 38.164-19.056Q38.536-19.109 38.840-19.109L38.840-19.362Q38.840-19.567 38.733-19.747Q38.625-19.926 38.444-20.029Q38.263-20.131 38.054-20.131Q37.647-20.131 37.412-20.039Q37.500-20.002 37.547-19.918Q37.593-19.834 37.593-19.732Q37.593-19.636 37.547-19.557Q37.500-19.479 37.420-19.434Q37.340-19.390 37.251-19.390Q37.101-19.390 37-19.487Q36.899-19.585 36.899-19.732Q36.899-20.354 38.054-20.354Q38.266-20.354 38.516-20.290Q38.765-20.227 38.967-20.108Q39.168-19.988 39.295-19.803Q39.421-19.619 39.421-19.376L39.421-17.800Q39.421-17.684 39.483-17.588Q39.544-17.493 39.657-17.493Q39.767-17.493 39.832-17.587Q39.896-17.681 39.896-17.800L39.896-18.248L40.163-18.248L40.163-17.800Q40.163-17.530 39.936-17.365Q39.709-17.199 39.428-17.199Q39.220-17.199 39.083-17.353Q38.946-17.506 38.922-17.722Q38.775-17.455 38.493-17.310Q38.211-17.165 37.887-17.165Q37.610-17.165 37.326-17.240Q37.042-17.315 36.849-17.494Q36.656-17.674 36.656-17.961M37.271-17.961Q37.271-17.787 37.372-17.657Q37.473-17.527 37.629-17.457Q37.784-17.387 37.948-17.387Q38.167-17.387 38.375-17.484Q38.584-17.582 38.712-17.763Q38.840-17.944 38.840-18.170L38.840-18.898Q38.516-18.898 38.150-18.807Q37.784-18.716 37.528-18.504Q37.271-18.293 37.271-17.961M42.262-17.233L40.628-17.233L40.628-17.513Q40.857-17.513 41.006-17.547Q41.154-17.582 41.154-17.722L41.154-19.571Q41.154-19.841 41.047-19.902Q40.939-19.964 40.628-19.964L40.628-20.244L41.688-20.319L41.688-19.670Q41.858-19.978 42.163-20.149Q42.467-20.319 42.812-20.319Q43.212-20.319 43.489-20.179Q43.766-20.039 43.851-19.691Q44.019-19.984 44.318-20.152Q44.617-20.319 44.962-20.319Q45.468-20.319 45.751-20.096Q46.035-19.872 46.035-19.376L46.035-17.722Q46.035-17.585 46.184-17.549Q46.333-17.513 46.558-17.513L46.558-17.233L44.928-17.233L44.928-17.513Q45.153-17.513 45.304-17.549Q45.454-17.585 45.454-17.722L45.454-19.362Q45.454-19.697 45.334-19.897Q45.215-20.097 44.900-20.097Q44.630-20.097 44.396-19.961Q44.162-19.824 44.024-19.590Q43.885-19.356 43.885-19.082L43.885-17.722Q43.885-17.585 44.034-17.549Q44.183-17.513 44.408-17.513L44.408-17.233L42.778-17.233L42.778-17.513Q43.007-17.513 43.156-17.547Q43.304-17.582 43.304-17.722L43.304-19.362Q43.304-19.697 43.185-19.897Q43.065-20.097 42.750-20.097Q42.480-20.097 42.246-19.961Q42.012-19.824 41.874-19.590Q41.735-19.356 41.735-19.082L41.735-17.722Q41.735-17.585 41.886-17.549Q42.036-17.513 42.262-17.513\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.183 51.704)\">\u003Cpath d=\"M47.746-17.233L47.479-17.233L47.479-21.341Q47.479-21.611 47.372-21.673Q47.264-21.734 46.953-21.734L46.953-22.015L48.033-22.090L48.033-19.920Q48.242-20.111 48.527-20.215Q48.813-20.319 49.110-20.319Q49.428-20.319 49.725-20.198Q50.022-20.077 50.245-19.861Q50.467-19.646 50.593-19.361Q50.720-19.075 50.720-18.744Q50.720-18.299 50.480-17.935Q50.241-17.571 49.848-17.368Q49.455-17.165 49.011-17.165Q48.816-17.165 48.626-17.221Q48.437-17.277 48.276-17.382Q48.115-17.486 47.975-17.647L47.746-17.233M48.061-19.578L48.061-17.961Q48.197-17.701 48.438-17.544Q48.679-17.387 48.956-17.387Q49.250-17.387 49.462-17.494Q49.674-17.602 49.807-17.794Q49.940-17.985 49.999-18.224Q50.057-18.463 50.057-18.744Q50.057-19.103 49.963-19.407Q49.869-19.711 49.641-19.904Q49.414-20.097 49.048-20.097Q48.748-20.097 48.481-19.961Q48.214-19.824 48.061-19.578\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(64.183 51.704)\">\u003Cpath d=\"M51.571-18.744Q51.571-19.082 51.712-19.373Q51.852-19.663 52.096-19.877Q52.340-20.090 52.645-20.205Q52.949-20.319 53.274-20.319Q53.544-20.319 53.807-20.220Q54.070-20.121 54.261-19.943L54.261-21.341Q54.261-21.611 54.154-21.673Q54.046-21.734 53.735-21.734L53.735-22.015L54.812-22.090L54.812-17.906Q54.812-17.718 54.866-17.635Q54.921-17.551 55.022-17.532Q55.123-17.513 55.338-17.513L55.338-17.233L54.231-17.165L54.231-17.582Q53.814-17.165 53.188-17.165Q52.757-17.165 52.385-17.377Q52.012-17.588 51.792-17.949Q51.571-18.310 51.571-18.744M53.246-17.387Q53.455-17.387 53.641-17.459Q53.827-17.530 53.981-17.667Q54.135-17.804 54.231-17.982L54.231-19.591Q54.145-19.738 54-19.858Q53.855-19.978 53.685-20.037Q53.516-20.097 53.335-20.097Q52.775-20.097 52.506-19.708Q52.238-19.318 52.238-18.737Q52.238-18.166 52.472-17.776Q52.706-17.387 53.246-17.387M56.046-17.961Q56.046-18.293 56.269-18.520Q56.493-18.747 56.837-18.875Q57.180-19.004 57.553-19.056Q57.925-19.109 58.230-19.109L58.230-19.362Q58.230-19.567 58.122-19.747Q58.014-19.926 57.833-20.029Q57.652-20.131 57.444-20.131Q57.037-20.131 56.801-20.039Q56.890-20.002 56.936-19.918Q56.982-19.834 56.982-19.732Q56.982-19.636 56.936-19.557Q56.890-19.479 56.809-19.434Q56.729-19.390 56.640-19.390Q56.490-19.390 56.389-19.487Q56.288-19.585 56.288-19.732Q56.288-20.354 57.444-20.354Q57.655-20.354 57.905-20.290Q58.154-20.227 58.356-20.108Q58.558-19.988 58.684-19.803Q58.811-19.619 58.811-19.376L58.811-17.800Q58.811-17.684 58.872-17.588Q58.934-17.493 59.047-17.493Q59.156-17.493 59.221-17.587Q59.286-17.681 59.286-17.800L59.286-18.248L59.552-18.248L59.552-17.800Q59.552-17.530 59.325-17.365Q59.098-17.199 58.818-17.199Q58.609-17.199 58.472-17.353Q58.336-17.506 58.312-17.722Q58.165-17.455 57.883-17.310Q57.601-17.165 57.276-17.165Q56.999-17.165 56.715-17.240Q56.432-17.315 56.239-17.494Q56.046-17.674 56.046-17.961M56.661-17.961Q56.661-17.787 56.762-17.657Q56.862-17.527 57.018-17.457Q57.174-17.387 57.338-17.387Q57.556-17.387 57.765-17.484Q57.973-17.582 58.101-17.763Q58.230-17.944 58.230-18.170L58.230-18.898Q57.905-18.898 57.539-18.807Q57.174-18.716 56.917-18.504Q56.661-18.293 56.661-17.961\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The primal-dual loop. The multiplier lambda prices the cost; the policy is improved against the shaped reward r minus lambda times c, then lambda is nudged up when cost exceeds the budget d and down when it falls below, driving the pair to the saddle point where cost equals d.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:372.674px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 279.505 140.144\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-31.348 47.652h208.55\"\u002F>\u003Cpath stroke=\"none\" d=\"m179.202 47.652-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(191.85 9.089)\">\u003Cpath d=\"M-29.293 47.730Q-29.774 47.730-30.182 47.486Q-30.590 47.242-30.828 46.828Q-31.067 46.414-31.067 45.925Q-31.067 45.433-30.809 45.017Q-30.551 44.601-30.119 44.363Q-29.688 44.125-29.196 44.125Q-28.575 44.125-28.125 44.562L-28.125 42.933Q-28.125 42.718-28.188 42.623Q-28.250 42.527-28.368 42.506Q-28.485 42.484-28.731 42.484L-28.731 42.187L-27.508 42.101L-27.508 46.910Q-27.508 47.121-27.446 47.216Q-27.383 47.312-27.266 47.334Q-27.149 47.355-26.899 47.355L-26.899 47.652L-28.149 47.730L-28.149 47.246Q-28.614 47.730-29.293 47.730M-29.227 47.476Q-28.887 47.476-28.594 47.285Q-28.301 47.093-28.149 46.797L-28.149 44.965Q-28.297 44.691-28.559 44.535Q-28.821 44.379-29.133 44.379Q-29.758 44.379-30.041 44.826Q-30.325 45.273-30.325 45.933Q-30.325 46.578-30.073 47.027Q-29.821 47.476-29.227 47.476M-25.707 46.699L-25.707 44.957Q-25.707 44.742-25.770 44.646Q-25.832 44.550-25.952 44.529Q-26.071 44.507-26.317 44.507L-26.317 44.211L-25.071 44.125L-25.071 46.675L-25.071 46.699Q-25.071 47.011-25.016 47.173Q-24.961 47.336-24.811 47.406Q-24.660 47.476-24.340 47.476Q-23.910 47.476-23.637 47.138Q-23.364 46.800-23.364 46.355L-23.364 44.957Q-23.364 44.742-23.426 44.646Q-23.489 44.550-23.608 44.529Q-23.727 44.507-23.973 44.507L-23.973 44.211L-22.727 44.125L-22.727 46.910Q-22.727 47.121-22.664 47.216Q-22.602 47.312-22.483 47.334Q-22.364 47.355-22.118 47.355L-22.118 47.652L-23.340 47.730L-23.340 47.109Q-23.508 47.398-23.789 47.564Q-24.071 47.730-24.391 47.730Q-25.707 47.730-25.707 46.699M-21.575 46.820Q-21.575 46.336-21.172 46.041Q-20.770 45.746-20.219 45.627Q-19.668 45.507-19.176 45.507L-19.176 45.218Q-19.176 44.992-19.291 44.785Q-19.407 44.578-19.604 44.459Q-19.801 44.340-20.032 44.340Q-20.457 44.340-20.743 44.445Q-20.672 44.472-20.625 44.527Q-20.578 44.582-20.553 44.652Q-20.528 44.722-20.528 44.797Q-20.528 44.902-20.578 44.994Q-20.629 45.086-20.721 45.136Q-20.813 45.187-20.918 45.187Q-21.024 45.187-21.116 45.136Q-21.207 45.086-21.258 44.994Q-21.309 44.902-21.309 44.797Q-21.309 44.379-20.920 44.232Q-20.532 44.086-20.032 44.086Q-19.700 44.086-19.346 44.216Q-18.993 44.347-18.764 44.601Q-18.535 44.855-18.535 45.203L-18.535 47.004Q-18.535 47.136-18.463 47.246Q-18.391 47.355-18.262 47.355Q-18.137 47.355-18.069 47.250Q-18 47.144-18 47.004L-18 46.492L-17.719 46.492L-17.719 47.004Q-17.719 47.207-17.836 47.365Q-17.953 47.523-18.135 47.607Q-18.317 47.691-18.520 47.691Q-18.750 47.691-18.903 47.519Q-19.055 47.347-19.086 47.117Q-19.246 47.398-19.555 47.564Q-19.864 47.730-20.215 47.730Q-20.727 47.730-21.151 47.507Q-21.575 47.285-21.575 46.820M-20.887 46.820Q-20.887 47.105-20.660 47.291Q-20.434 47.476-20.141 47.476Q-19.895 47.476-19.670 47.359Q-19.446 47.242-19.311 47.039Q-19.176 46.836-19.176 46.582L-19.176 45.750Q-19.442 45.750-19.727 45.804Q-20.012 45.859-20.284 45.988Q-20.555 46.117-20.721 46.324Q-20.887 46.531-20.887 46.820M-15.512 47.652L-17.344 47.652L-17.344 47.355Q-17.071 47.355-16.903 47.308Q-16.735 47.261-16.735 47.093L-16.735 42.933Q-16.735 42.718-16.797 42.623Q-16.860 42.527-16.979 42.506Q-17.098 42.484-17.344 42.484L-17.344 42.187L-16.121 42.101L-16.121 47.093Q-16.121 47.261-15.953 47.308Q-15.785 47.355-15.512 47.355\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.85 9.089)\">\u003Cpath d=\"M-12.178 47.644L-12.178 46.422Q-12.178 46.394-12.146 46.363Q-12.115 46.332-12.092 46.332L-11.986 46.332Q-11.916 46.332-11.900 46.394Q-11.838 46.715-11.699 46.955Q-11.561 47.195-11.328 47.336Q-11.096 47.476-10.787 47.476Q-10.549 47.476-10.340 47.416Q-10.131 47.355-9.994 47.207Q-9.857 47.058-9.857 46.812Q-9.857 46.558-10.068 46.392Q-10.279 46.226-10.549 46.172L-11.170 46.058Q-11.576 45.980-11.877 45.724Q-12.178 45.468-12.178 45.093Q-12.178 44.726-11.977 44.504Q-11.775 44.281-11.451 44.183Q-11.127 44.086-10.787 44.086Q-10.322 44.086-10.025 44.293L-9.803 44.109Q-9.779 44.086-9.748 44.086L-9.697 44.086Q-9.666 44.086-9.639 44.113Q-9.611 44.140-9.611 44.172L-9.611 45.156Q-9.611 45.187-9.637 45.216Q-9.662 45.246-9.697 45.246L-9.803 45.246Q-9.838 45.246-9.865 45.218Q-9.893 45.191-9.893 45.156Q-9.893 44.757-10.145 44.537Q-10.396 44.316-10.795 44.316Q-11.150 44.316-11.434 44.439Q-11.717 44.562-11.717 44.867Q-11.717 45.086-11.516 45.218Q-11.314 45.351-11.068 45.394L-10.443 45.507Q-10.014 45.597-9.705 45.894Q-9.396 46.191-9.396 46.605Q-9.396 47.175-9.795 47.453Q-10.193 47.730-10.787 47.730Q-11.338 47.730-11.689 47.394L-11.986 47.707Q-12.010 47.730-12.045 47.730L-12.092 47.730Q-12.115 47.730-12.146 47.699Q-12.178 47.668-12.178 47.644M-8.244 46.691L-8.244 44.500L-8.947 44.500L-8.947 44.246Q-8.592 44.246-8.350 44.013Q-8.107 43.781-7.996 43.433Q-7.885 43.086-7.885 42.730L-7.604 42.730L-7.604 44.203L-6.428 44.203L-6.428 44.500L-7.604 44.500L-7.604 46.675Q-7.604 46.996-7.484 47.224Q-7.365 47.453-7.084 47.453Q-6.904 47.453-6.787 47.330Q-6.670 47.207-6.617 47.027Q-6.564 46.847-6.564 46.675L-6.564 46.203L-6.283 46.203L-6.283 46.691Q-6.283 46.945-6.389 47.185Q-6.494 47.425-6.691 47.578Q-6.889 47.730-7.146 47.730Q-7.463 47.730-7.715 47.607Q-7.967 47.484-8.105 47.250Q-8.244 47.015-8.244 46.691M-5.564 45.898Q-5.564 45.418-5.332 45.002Q-5.100 44.586-4.689 44.336Q-4.279 44.086-3.803 44.086Q-3.072 44.086-2.674 44.527Q-2.275 44.968-2.275 45.699Q-2.275 45.804-2.369 45.828L-4.818 45.828L-4.818 45.898Q-4.818 46.308-4.697 46.664Q-4.576 47.019-4.305 47.236Q-4.033 47.453-3.604 47.453Q-3.240 47.453-2.943 47.224Q-2.646 46.996-2.545 46.644Q-2.537 46.597-2.451 46.582L-2.369 46.582Q-2.275 46.609-2.275 46.691Q-2.275 46.699-2.283 46.730Q-2.346 46.957-2.484 47.140Q-2.623 47.324-2.814 47.457Q-3.006 47.590-3.225 47.660Q-3.443 47.730-3.682 47.730Q-4.053 47.730-4.391 47.593Q-4.729 47.457-4.996 47.205Q-5.264 46.953-5.414 46.613Q-5.564 46.273-5.564 45.898M-4.811 45.590L-2.850 45.590Q-2.850 45.285-2.951 44.994Q-3.053 44.703-3.270 44.521Q-3.486 44.340-3.803 44.340Q-4.104 44.340-4.334 44.527Q-4.564 44.715-4.688 45.006Q-4.811 45.297-4.811 45.590M0.096 49.203L-1.760 49.203L-1.760 48.910Q-1.490 48.910-1.322 48.865Q-1.154 48.820-1.154 48.644L-1.154 44.820Q-1.154 44.613-1.311 44.560Q-1.467 44.507-1.760 44.507L-1.760 44.211L-0.537 44.125L-0.537 44.590Q-0.307 44.367 0.008 44.246Q0.322 44.125 0.662 44.125Q1.135 44.125 1.539 44.371Q1.943 44.617 2.176 45.033Q2.408 45.449 2.408 45.925Q2.408 46.300 2.260 46.629Q2.111 46.957 1.842 47.209Q1.572 47.461 1.229 47.595Q0.885 47.730 0.525 47.730Q0.236 47.730-0.035 47.609Q-0.307 47.488-0.514 47.277L-0.514 48.644Q-0.514 48.820-0.346 48.865Q-0.178 48.910 0.096 48.910L0.096 49.203M-0.514 44.988L-0.514 46.828Q-0.361 47.117-0.100 47.297Q0.162 47.476 0.471 47.476Q0.756 47.476 0.979 47.338Q1.201 47.199 1.354 46.968Q1.506 46.738 1.584 46.466Q1.662 46.195 1.662 45.925Q1.662 45.593 1.537 45.236Q1.412 44.879 1.164 44.642Q0.916 44.406 0.568 44.406Q0.244 44.406-0.051 44.562Q-0.346 44.718-0.514 44.988M2.975 47.644L2.975 46.422Q2.975 46.394 3.006 46.363Q3.037 46.332 3.061 46.332L3.166 46.332Q3.236 46.332 3.252 46.394Q3.314 46.715 3.453 46.955Q3.592 47.195 3.824 47.336Q4.057 47.476 4.365 47.476Q4.604 47.476 4.812 47.416Q5.021 47.355 5.158 47.207Q5.295 47.058 5.295 46.812Q5.295 46.558 5.084 46.392Q4.873 46.226 4.604 46.172L3.982 46.058Q3.576 45.980 3.275 45.724Q2.975 45.468 2.975 45.093Q2.975 44.726 3.176 44.504Q3.377 44.281 3.701 44.183Q4.025 44.086 4.365 44.086Q4.830 44.086 5.127 44.293L5.350 44.109Q5.373 44.086 5.404 44.086L5.455 44.086Q5.486 44.086 5.514 44.113Q5.541 44.140 5.541 44.172L5.541 45.156Q5.541 45.187 5.516 45.216Q5.490 45.246 5.455 45.246L5.350 45.246Q5.314 45.246 5.287 45.218Q5.260 45.191 5.260 45.156Q5.260 44.757 5.008 44.537Q4.756 44.316 4.357 44.316Q4.002 44.316 3.719 44.439Q3.436 44.562 3.436 44.867Q3.436 45.086 3.637 45.218Q3.838 45.351 4.084 45.394L4.709 45.507Q5.139 45.597 5.447 45.894Q5.756 46.191 5.756 46.605Q5.756 47.175 5.357 47.453Q4.959 47.730 4.365 47.730Q3.814 47.730 3.463 47.394L3.166 47.707Q3.143 47.730 3.107 47.730L3.061 47.730Q3.037 47.730 3.006 47.699Q2.975 47.668 2.975 47.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-31.348 47.652V-64.16\"\u002F>\u003Cpath stroke=\"none\" d=\"m-31.348-66.16-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-30.922 -111.033)\">\u003Cpath d=\"M-29.196 47.652L-31.028 47.652L-31.028 47.355Q-30.754 47.355-30.586 47.308Q-30.418 47.261-30.418 47.093L-30.418 42.933Q-30.418 42.718-30.481 42.623Q-30.543 42.527-30.662 42.506Q-30.782 42.484-31.028 42.484L-31.028 42.187L-29.805 42.101L-29.805 47.093Q-29.805 47.261-29.637 47.308Q-29.469 47.355-29.196 47.355L-29.196 47.652M-28.653 46.820Q-28.653 46.336-28.250 46.041Q-27.848 45.746-27.297 45.627Q-26.746 45.507-26.254 45.507L-26.254 45.218Q-26.254 44.992-26.369 44.785Q-26.485 44.578-26.682 44.459Q-26.879 44.340-27.110 44.340Q-27.535 44.340-27.821 44.445Q-27.750 44.472-27.703 44.527Q-27.657 44.582-27.631 44.652Q-27.606 44.722-27.606 44.797Q-27.606 44.902-27.657 44.994Q-27.707 45.086-27.799 45.136Q-27.891 45.187-27.996 45.187Q-28.102 45.187-28.194 45.136Q-28.285 45.086-28.336 44.994Q-28.387 44.902-28.387 44.797Q-28.387 44.379-27.998 44.232Q-27.610 44.086-27.110 44.086Q-26.778 44.086-26.424 44.216Q-26.071 44.347-25.842 44.601Q-25.614 44.855-25.614 45.203L-25.614 47.004Q-25.614 47.136-25.541 47.246Q-25.469 47.355-25.340 47.355Q-25.215 47.355-25.147 47.250Q-25.078 47.144-25.078 47.004L-25.078 46.492L-24.797 46.492L-24.797 47.004Q-24.797 47.207-24.914 47.365Q-25.032 47.523-25.213 47.607Q-25.395 47.691-25.598 47.691Q-25.828 47.691-25.981 47.519Q-26.133 47.347-26.164 47.117Q-26.325 47.398-26.633 47.564Q-26.942 47.730-27.293 47.730Q-27.805 47.730-28.229 47.507Q-28.653 47.285-28.653 46.820M-27.965 46.820Q-27.965 47.105-27.739 47.291Q-27.512 47.476-27.219 47.476Q-26.973 47.476-26.748 47.359Q-26.524 47.242-26.389 47.039Q-26.254 46.836-26.254 46.582L-26.254 45.750Q-26.520 45.750-26.805 45.804Q-27.090 45.859-27.362 45.988Q-27.633 46.117-27.799 46.324Q-27.965 46.531-27.965 46.820M-22.575 47.652L-24.430 47.652L-24.430 47.355Q-24.157 47.355-23.989 47.308Q-23.821 47.261-23.821 47.093L-23.821 44.957Q-23.821 44.742-23.883 44.646Q-23.946 44.550-24.065 44.529Q-24.184 44.507-24.430 44.507L-24.430 44.211L-23.239 44.125L-23.239 44.859Q-23.125 44.644-22.932 44.476Q-22.739 44.308-22.500 44.216Q-22.262 44.125-22.008 44.125Q-21.047 44.125-20.871 44.836Q-20.688 44.507-20.360 44.316Q-20.032 44.125-19.653 44.125Q-18.477 44.125-18.477 45.203L-18.477 47.093Q-18.477 47.261-18.309 47.308Q-18.141 47.355-17.871 47.355L-17.871 47.652L-19.727 47.652L-19.727 47.355Q-19.453 47.355-19.285 47.310Q-19.118 47.265-19.118 47.093L-19.118 45.218Q-19.118 44.832-19.243 44.605Q-19.368 44.379-19.719 44.379Q-20.024 44.379-20.280 44.541Q-20.535 44.703-20.684 44.972Q-20.832 45.242-20.832 45.539L-20.832 47.093Q-20.832 47.261-20.662 47.308Q-20.493 47.355-20.223 47.355L-20.223 47.652L-22.078 47.652L-22.078 47.355Q-21.805 47.355-21.637 47.308Q-21.469 47.261-21.469 47.093L-21.469 45.218Q-21.469 44.832-21.594 44.605Q-21.719 44.379-22.071 44.379Q-22.375 44.379-22.631 44.541Q-22.887 44.703-23.035 44.972Q-23.184 45.242-23.184 45.539L-23.184 47.093Q-23.184 47.261-23.014 47.308Q-22.844 47.355-22.575 47.355\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-30.922 -111.033)\">\u003Cpath d=\"M-16.738 47.652L-17.019 47.652L-17.019 42.933Q-17.019 42.718-17.081 42.623Q-17.144 42.527-17.261 42.506Q-17.378 42.484-17.624 42.484L-17.624 42.187L-16.402 42.101L-16.402 44.590Q-15.925 44.125-15.226 44.125Q-14.745 44.125-14.337 44.369Q-13.929 44.613-13.693 45.027Q-13.456 45.441-13.456 45.925Q-13.456 46.300-13.605 46.629Q-13.753 46.957-14.023 47.209Q-14.292 47.461-14.636 47.595Q-14.980 47.730-15.339 47.730Q-15.660 47.730-15.958 47.582Q-16.257 47.433-16.464 47.172L-16.738 47.652M-16.378 44.980L-16.378 46.820Q-16.226 47.117-15.966 47.297Q-15.706 47.476-15.394 47.476Q-14.968 47.476-14.701 47.257Q-14.433 47.039-14.318 46.693Q-14.203 46.347-14.203 45.925Q-14.203 45.277-14.451 44.828Q-14.699 44.379-15.296 44.379Q-15.632 44.379-15.921 44.537Q-16.210 44.695-16.378 44.980\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-30.922 -111.033)\">\u003Cpath d=\"M-10.876 47.730Q-11.357 47.730-11.765 47.486Q-12.173 47.242-12.411 46.828Q-12.650 46.414-12.650 45.925Q-12.650 45.433-12.392 45.017Q-12.134 44.601-11.702 44.363Q-11.271 44.125-10.779 44.125Q-10.158 44.125-9.708 44.562L-9.708 42.933Q-9.708 42.718-9.771 42.623Q-9.833 42.527-9.951 42.506Q-10.068 42.484-10.314 42.484L-10.314 42.187L-9.091 42.101L-9.091 46.910Q-9.091 47.121-9.029 47.216Q-8.966 47.312-8.849 47.334Q-8.732 47.355-8.482 47.355L-8.482 47.652L-9.732 47.730L-9.732 47.246Q-10.197 47.730-10.876 47.730M-10.810 47.476Q-10.470 47.476-10.177 47.285Q-9.884 47.093-9.732 46.797L-9.732 44.965Q-9.880 44.691-10.142 44.535Q-10.404 44.379-10.716 44.379Q-11.341 44.379-11.624 44.826Q-11.908 45.273-11.908 45.933Q-11.908 46.578-11.656 47.027Q-11.404 47.476-10.810 47.476M-7.876 46.820Q-7.876 46.336-7.474 46.041Q-7.072 45.746-6.521 45.627Q-5.970 45.507-5.478 45.507L-5.478 45.218Q-5.478 44.992-5.593 44.785Q-5.708 44.578-5.906 44.459Q-6.103 44.340-6.333 44.340Q-6.759 44.340-7.044 44.445Q-6.974 44.472-6.927 44.527Q-6.880 44.582-6.855 44.652Q-6.829 44.722-6.829 44.797Q-6.829 44.902-6.880 44.994Q-6.931 45.086-7.023 45.136Q-7.115 45.187-7.220 45.187Q-7.326 45.187-7.417 45.136Q-7.509 45.086-7.560 44.994Q-7.611 44.902-7.611 44.797Q-7.611 44.379-7.222 44.232Q-6.833 44.086-6.333 44.086Q-6.001 44.086-5.648 44.216Q-5.294 44.347-5.066 44.601Q-4.837 44.855-4.837 45.203L-4.837 47.004Q-4.837 47.136-4.765 47.246Q-4.693 47.355-4.564 47.355Q-4.439 47.355-4.370 47.250Q-4.302 47.144-4.302 47.004L-4.302 46.492L-4.021 46.492L-4.021 47.004Q-4.021 47.207-4.138 47.365Q-4.255 47.523-4.437 47.607Q-4.618 47.691-4.822 47.691Q-5.052 47.691-5.204 47.519Q-5.357 47.347-5.388 47.117Q-5.548 47.398-5.857 47.564Q-6.165 47.730-6.517 47.730Q-7.029 47.730-7.452 47.507Q-7.876 47.285-7.876 46.820M-7.189 46.820Q-7.189 47.105-6.962 47.291Q-6.736 47.476-6.443 47.476Q-6.197 47.476-5.972 47.359Q-5.747 47.242-5.613 47.039Q-5.478 46.836-5.478 46.582L-5.478 45.750Q-5.743 45.750-6.029 45.804Q-6.314 45.859-6.585 45.988Q-6.857 46.117-7.023 46.324Q-7.189 46.531-7.189 46.820\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"m-19.967 47.652 39.834-79.668L59.7-47.95l39.834 6.83 39.833-2.277\" style=\"stroke-width:1.2\"\u002F>\u003Cpath fill=\"var(--tk-accent)\" stroke=\"none\" d=\"M-17.767 47.652a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0M22.067-32.016a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0M61.900000000000006-47.95a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0M101.735-41.12a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0M141.56799999999998-43.397a2.2 2.2 0 1 0-4.4 0 2.2 2.2 0 0 0 4.4 0m-2.2 0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(9.388 10.89)\">\u003Cpath d=\"M-29.359 47.792Q-29.994 47.792-30.358 47.447Q-30.723 47.102-30.858 46.577Q-30.993 46.052-30.993 45.427Q-30.993 44.402-30.637 43.703Q-30.282 43.004-29.359 43.004Q-28.432 43.004-28.080 43.703Q-27.728 44.402-27.728 45.427Q-27.728 46.052-27.863 46.577Q-27.998 47.102-28.361 47.447Q-28.723 47.792-29.359 47.792M-29.359 47.567Q-28.921 47.567-28.708 47.192Q-28.494 46.818-28.444 46.351Q-28.395 45.885-28.395 45.307Q-28.395 44.754-28.444 44.326Q-28.494 43.899-28.706 43.564Q-28.918 43.229-29.359 43.229Q-29.701 43.229-29.904 43.436Q-30.107 43.643-30.194 43.955Q-30.282 44.268-30.304 44.584Q-30.326 44.901-30.326 45.307Q-30.326 45.724-30.304 46.066Q-30.282 46.408-30.193 46.756Q-30.104 47.105-29.899 47.336Q-29.694 47.567-29.359 47.567\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(33.46 -83.2)\">\u003Cpath d=\"M-29.359 47.792Q-29.994 47.792-30.358 47.447Q-30.723 47.102-30.858 46.577Q-30.993 46.052-30.993 45.427Q-30.993 44.402-30.637 43.703Q-30.282 43.004-29.359 43.004Q-28.432 43.004-28.080 43.703Q-27.728 44.402-27.728 45.427Q-27.728 46.052-27.863 46.577Q-27.998 47.102-28.361 47.447Q-28.723 47.792-29.359 47.792M-29.359 47.567Q-28.921 47.567-28.708 47.192Q-28.494 46.818-28.444 46.351Q-28.395 45.885-28.395 45.307Q-28.395 44.754-28.444 44.326Q-28.494 43.899-28.706 43.564Q-28.918 43.229-29.359 43.229Q-29.701 43.229-29.904 43.436Q-30.107 43.643-30.194 43.955Q-30.282 44.268-30.304 44.584Q-30.326 44.901-30.326 45.307Q-30.326 45.724-30.304 46.066Q-30.282 46.408-30.193 46.756Q-30.104 47.105-29.899 47.336Q-29.694 47.567-29.359 47.567M-26.652 47.232Q-26.652 47.064-26.529 46.941Q-26.406 46.818-26.231 46.818Q-26.064 46.818-25.941 46.941Q-25.818 47.064-25.818 47.232Q-25.818 47.406-25.941 47.529Q-26.064 47.652-26.231 47.652Q-26.406 47.652-26.529 47.529Q-26.652 47.406-26.652 47.232M-24.307 47.105Q-24.187 47.262-23.996 47.361Q-23.805 47.461-23.589 47.500Q-23.374 47.539-23.152 47.539Q-22.854 47.539-22.660 47.384Q-22.465 47.228-22.374 46.974Q-22.284 46.719-22.284 46.435Q-22.284 46.141-22.376 45.890Q-22.468 45.639-22.666 45.483Q-22.865 45.328-23.159 45.328L-23.675 45.328Q-23.702 45.328-23.728 45.302Q-23.753 45.277-23.753 45.253L-23.753 45.181Q-23.753 45.150-23.728 45.128Q-23.702 45.106-23.675 45.106L-23.234 45.075Q-22.871 45.075-22.651 44.718Q-22.431 44.360-22.431 43.971Q-22.431 43.643-22.625 43.439Q-22.820 43.236-23.152 43.236Q-23.439 43.236-23.692 43.320Q-23.945 43.403-24.109 43.591Q-23.962 43.591-23.861 43.706Q-23.760 43.820-23.760 43.971Q-23.760 44.121-23.866 44.231Q-23.972 44.340-24.129 44.340Q-24.290 44.340-24.399 44.231Q-24.509 44.121-24.509 43.971Q-24.509 43.646-24.300 43.427Q-24.092 43.209-23.775 43.106Q-23.459 43.004-23.152 43.004Q-22.834 43.004-22.506 43.108Q-22.178 43.212-21.950 43.434Q-21.723 43.656-21.723 43.971Q-21.723 44.405-22.010 44.730Q-22.297 45.054-22.731 45.201Q-22.420 45.266-22.140 45.432Q-21.860 45.598-21.682 45.856Q-21.504 46.114-21.504 46.435Q-21.504 46.845-21.749 47.155Q-21.993 47.464-22.374 47.628Q-22.755 47.792-23.152 47.792Q-23.521 47.792-23.878 47.679Q-24.235 47.567-24.480 47.317Q-24.724 47.068-24.724 46.698Q-24.724 46.527-24.608 46.415Q-24.492 46.302-24.321 46.302Q-24.211 46.302-24.121 46.353Q-24.030 46.404-23.975 46.497Q-23.921 46.589-23.921 46.698Q-23.921 46.866-24.034 46.985Q-24.146 47.105-24.307 47.105M-20.315 46.890L-20.346 46.890Q-20.209 47.187-19.911 47.363Q-19.614 47.539-19.286 47.539Q-18.924 47.539-18.696 47.361Q-18.469 47.184-18.375 46.895Q-18.281 46.606-18.281 46.244Q-18.281 45.929-18.336 45.644Q-18.390 45.359-18.563 45.153Q-18.736 44.948-19.050 44.948Q-19.324 44.948-19.506 45.015Q-19.689 45.082-19.794 45.171Q-19.898 45.259-19.994 45.369Q-20.089 45.478-20.134 45.488L-20.212 45.488Q-20.284 45.471-20.301 45.400L-20.301 43.082Q-20.301 43.048-20.277 43.026Q-20.253 43.004-20.219 43.004L-20.192 43.004Q-19.905 43.120-19.636 43.174Q-19.368 43.229-19.091 43.229Q-18.814 43.229-18.544 43.174Q-18.274 43.120-17.994 43.004L-17.970 43.004Q-17.936 43.004-17.912 43.027Q-17.888 43.051-17.888 43.082L-17.888 43.151Q-17.888 43.178-17.909 43.198Q-18.182 43.513-18.567 43.689Q-18.951 43.865-19.365 43.865Q-19.703 43.865-20.021 43.779L-20.021 45.061Q-19.624 44.726-19.050 44.726Q-18.647 44.726-18.310 44.936Q-17.973 45.147-17.780 45.499Q-17.587 45.851-17.587 46.251Q-17.587 46.582-17.727 46.868Q-17.868 47.153-18.112 47.363Q-18.356 47.573-18.659 47.683Q-18.961 47.792-19.279 47.792Q-19.638 47.792-19.964 47.628Q-20.291 47.464-20.486 47.172Q-20.681 46.880-20.681 46.517Q-20.681 46.367-20.575 46.261Q-20.469 46.155-20.315 46.155Q-20.161 46.155-20.057 46.259Q-19.952 46.363-19.952 46.517Q-19.952 46.674-20.057 46.782Q-20.161 46.890-20.315 46.890\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(83.938 -100.272)\">\u003Cpath d=\"M-29.359 47.792Q-29.994 47.792-30.358 47.447Q-30.723 47.102-30.858 46.577Q-30.993 46.052-30.993 45.427Q-30.993 44.402-30.637 43.703Q-30.282 43.004-29.359 43.004Q-28.432 43.004-28.080 43.703Q-27.728 44.402-27.728 45.427Q-27.728 46.052-27.863 46.577Q-27.998 47.102-28.361 47.447Q-28.723 47.792-29.359 47.792M-29.359 47.567Q-28.921 47.567-28.708 47.192Q-28.494 46.818-28.444 46.351Q-28.395 45.885-28.395 45.307Q-28.395 44.754-28.444 44.326Q-28.494 43.899-28.706 43.564Q-28.918 43.229-29.359 43.229Q-29.701 43.229-29.904 43.436Q-30.107 43.643-30.194 43.955Q-30.282 44.268-30.304 44.584Q-30.326 44.901-30.326 45.307Q-30.326 45.724-30.304 46.066Q-30.282 46.408-30.193 46.756Q-30.104 47.105-29.899 47.336Q-29.694 47.567-29.359 47.567M-26.652 47.232Q-26.652 47.064-26.529 46.941Q-26.406 46.818-26.231 46.818Q-26.064 46.818-25.941 46.941Q-25.818 47.064-25.818 47.232Q-25.818 47.406-25.941 47.529Q-26.064 47.652-26.231 47.652Q-26.406 47.652-26.529 47.529Q-26.652 47.406-26.652 47.232M-22.786 46.504L-24.830 46.504L-24.830 46.223L-22.499 43.051Q-22.465 43.004-22.400 43.004L-22.263 43.004Q-22.219 43.004-22.191 43.031Q-22.164 43.058-22.164 43.103L-22.164 46.223L-21.402 46.223L-21.402 46.504L-22.164 46.504L-22.164 47.163Q-22.164 47.372-21.409 47.372L-21.409 47.652L-23.541 47.652L-23.541 47.372Q-22.786 47.372-22.786 47.163L-22.786 46.504M-22.738 43.779L-24.529 46.223L-22.738 46.223L-22.738 43.779M-17.796 47.652L-20.681 47.652L-20.681 47.450Q-20.681 47.420-20.653 47.392L-19.406 46.175Q-19.334 46.100-19.291 46.058Q-19.248 46.015-19.170 45.936Q-18.756 45.523-18.525 45.165Q-18.295 44.808-18.295 44.384Q-18.295 44.152-18.373 43.949Q-18.452 43.745-18.594 43.595Q-18.736 43.444-18.931 43.364Q-19.125 43.284-19.358 43.284Q-19.669 43.284-19.927 43.443Q-20.185 43.602-20.315 43.879L-20.294 43.879Q-20.127 43.879-20.019 43.990Q-19.911 44.101-19.911 44.265Q-19.911 44.422-20.021 44.535Q-20.130 44.648-20.294 44.648Q-20.455 44.648-20.568 44.535Q-20.681 44.422-20.681 44.265Q-20.681 43.889-20.472 43.602Q-20.264 43.315-19.929 43.159Q-19.594 43.004-19.238 43.004Q-18.814 43.004-18.435 43.162Q-18.056 43.321-17.821 43.638Q-17.587 43.954-17.587 44.384Q-17.587 44.695-17.727 44.964Q-17.868 45.232-18.073 45.437Q-18.278 45.642-18.640 45.924Q-19.002 46.206-19.112 46.302L-19.966 47.030L-19.324 47.030Q-19.060 47.030-18.772 47.028Q-18.483 47.027-18.264 47.018Q-18.045 47.009-18.028 46.992Q-17.967 46.927-17.929 46.760Q-17.891 46.592-17.854 46.350L-17.587 46.350\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(123.772 -77.314)\">\u003Cpath d=\"M-29.359 47.792Q-29.994 47.792-30.358 47.447Q-30.723 47.102-30.858 46.577Q-30.993 46.052-30.993 45.427Q-30.993 44.402-30.637 43.703Q-30.282 43.004-29.359 43.004Q-28.432 43.004-28.080 43.703Q-27.728 44.402-27.728 45.427Q-27.728 46.052-27.863 46.577Q-27.998 47.102-28.361 47.447Q-28.723 47.792-29.359 47.792M-29.359 47.567Q-28.921 47.567-28.708 47.192Q-28.494 46.818-28.444 46.351Q-28.395 45.885-28.395 45.307Q-28.395 44.754-28.444 44.326Q-28.494 43.899-28.706 43.564Q-28.918 43.229-29.359 43.229Q-29.701 43.229-29.904 43.436Q-30.107 43.643-30.194 43.955Q-30.282 44.268-30.304 44.584Q-30.326 44.901-30.326 45.307Q-30.326 45.724-30.304 46.066Q-30.282 46.408-30.193 46.756Q-30.104 47.105-29.899 47.336Q-29.694 47.567-29.359 47.567M-26.652 47.232Q-26.652 47.064-26.529 46.941Q-26.406 46.818-26.231 46.818Q-26.064 46.818-25.941 46.941Q-25.818 47.064-25.818 47.232Q-25.818 47.406-25.941 47.529Q-26.064 47.652-26.231 47.652Q-26.406 47.652-26.529 47.529Q-26.652 47.406-26.652 47.232M-24.307 47.105Q-24.187 47.262-23.996 47.361Q-23.805 47.461-23.589 47.500Q-23.374 47.539-23.152 47.539Q-22.854 47.539-22.660 47.384Q-22.465 47.228-22.374 46.974Q-22.284 46.719-22.284 46.435Q-22.284 46.141-22.376 45.890Q-22.468 45.639-22.666 45.483Q-22.865 45.328-23.159 45.328L-23.675 45.328Q-23.702 45.328-23.728 45.302Q-23.753 45.277-23.753 45.253L-23.753 45.181Q-23.753 45.150-23.728 45.128Q-23.702 45.106-23.675 45.106L-23.234 45.075Q-22.871 45.075-22.651 44.718Q-22.431 44.360-22.431 43.971Q-22.431 43.643-22.625 43.439Q-22.820 43.236-23.152 43.236Q-23.439 43.236-23.692 43.320Q-23.945 43.403-24.109 43.591Q-23.962 43.591-23.861 43.706Q-23.760 43.820-23.760 43.971Q-23.760 44.121-23.866 44.231Q-23.972 44.340-24.129 44.340Q-24.290 44.340-24.399 44.231Q-24.509 44.121-24.509 43.971Q-24.509 43.646-24.300 43.427Q-24.092 43.209-23.775 43.106Q-23.459 43.004-23.152 43.004Q-22.834 43.004-22.506 43.108Q-22.178 43.212-21.950 43.434Q-21.723 43.656-21.723 43.971Q-21.723 44.405-22.010 44.730Q-22.297 45.054-22.731 45.201Q-22.420 45.266-22.140 45.432Q-21.860 45.598-21.682 45.856Q-21.504 46.114-21.504 46.435Q-21.504 46.845-21.749 47.155Q-21.993 47.464-22.374 47.628Q-22.755 47.792-23.152 47.792Q-23.521 47.792-23.878 47.679Q-24.235 47.567-24.480 47.317Q-24.724 47.068-24.724 46.698Q-24.724 46.527-24.608 46.415Q-24.492 46.302-24.321 46.302Q-24.211 46.302-24.121 46.353Q-24.030 46.404-23.975 46.497Q-23.921 46.589-23.921 46.698Q-23.921 46.866-24.034 46.985Q-24.146 47.105-24.307 47.105M-20.147 47.338Q-20.028 47.454-19.850 47.496Q-19.672 47.539-19.457 47.539Q-19.218 47.539-19.007 47.430Q-18.797 47.320-18.643 47.138Q-18.490 46.955-18.390 46.722Q-18.223 46.295-18.223 45.475Q-18.373 45.769-18.637 45.948Q-18.900 46.128-19.218 46.128Q-19.652 46.128-19.999 45.919Q-20.346 45.711-20.544 45.350Q-20.742 44.989-20.742 44.566Q-20.742 44.231-20.612 43.942Q-20.482 43.653-20.252 43.439Q-20.021 43.226-19.722 43.115Q-19.423 43.004-19.091 43.004Q-18.233 43.004-17.878 43.718Q-17.522 44.432-17.522 45.389Q-17.522 45.806-17.650 46.234Q-17.779 46.661-18.035 47.016Q-18.291 47.372-18.654 47.582Q-19.016 47.792-19.457 47.792Q-19.911 47.792-20.229 47.604Q-20.547 47.416-20.547 46.992Q-20.547 46.842-20.448 46.743Q-20.349 46.644-20.199 46.644Q-20.130 46.644-20.064 46.671Q-19.997 46.698-19.952 46.743Q-19.908 46.787-19.881 46.854Q-19.853 46.921-19.853 46.992Q-19.853 47.122-19.934 47.220Q-20.014 47.317-20.147 47.338M-19.177 45.902Q-18.883 45.902-18.667 45.724Q-18.452 45.547-18.344 45.271Q-18.237 44.996-18.237 44.706Q-18.237 44.661-18.238 44.634Q-18.240 44.607-18.244 44.572Q-18.240 44.562-18.238 44.555Q-18.237 44.548-18.237 44.538Q-18.237 44.036-18.435 43.636Q-18.633 43.236-19.091 43.236Q-19.659 43.236-19.852 43.595Q-20.045 43.954-20.045 44.566Q-20.045 44.952-19.990 45.235Q-19.935 45.519-19.741 45.711Q-19.546 45.902-19.177 45.902\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-warn)\" d=\"M-31.348-43.397h182.097\" style=\"stroke-dasharray:3.0,3.0\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(178.517 -98.219)\">\u003Cpath d=\"M-31.034 47.645L-31.034 46.582Q-31.034 46.558-31.006 46.531Q-30.979 46.504-30.955 46.504L-30.846 46.504Q-30.781 46.504-30.767 46.562Q-30.671 46.996-30.425 47.247Q-30.179 47.498-29.765 47.498Q-29.424 47.498-29.171 47.365Q-28.918 47.232-28.918 46.924Q-28.918 46.767-29.012 46.652Q-29.106 46.538-29.244 46.469Q-29.383 46.401-29.550 46.363L-30.131 46.264Q-30.487 46.196-30.760 45.975Q-31.034 45.755-31.034 45.413Q-31.034 45.164-30.922 44.989Q-30.811 44.815-30.625 44.716Q-30.439 44.617-30.223 44.574Q-30.008 44.531-29.765 44.531Q-29.352 44.531-29.072 44.713L-28.856 44.538Q-28.846 44.535-28.839 44.533Q-28.832 44.531-28.822 44.531L-28.771 44.531Q-28.744 44.531-28.720 44.555Q-28.696 44.579-28.696 44.607L-28.696 45.454Q-28.696 45.475-28.720 45.502Q-28.744 45.529-28.771 45.529L-28.884 45.529Q-28.911 45.529-28.937 45.504Q-28.962 45.478-28.962 45.454Q-28.962 45.218-29.068 45.054Q-29.174 44.890-29.357 44.808Q-29.540 44.726-29.772 44.726Q-30.100 44.726-30.357 44.829Q-30.613 44.931-30.613 45.208Q-30.613 45.403-30.430 45.512Q-30.247 45.622-30.018 45.663L-29.444 45.769Q-29.198 45.817-28.984 45.945Q-28.771 46.073-28.634 46.276Q-28.497 46.480-28.497 46.729Q-28.497 47.242-28.863 47.481Q-29.229 47.720-29.765 47.720Q-30.261 47.720-30.593 47.426L-30.859 47.700Q-30.880 47.720-30.907 47.720L-30.955 47.720Q-30.979 47.720-31.006 47.693Q-31.034 47.666-31.034 47.645M-26.187 47.652L-27.821 47.652L-27.821 47.372Q-27.592 47.372-27.443 47.338Q-27.294 47.303-27.294 47.163L-27.294 43.544Q-27.294 43.274-27.402 43.212Q-27.510 43.151-27.821 43.151L-27.821 42.870L-26.741 42.795L-26.741 45.181Q-26.635 44.996-26.457 44.854Q-26.279 44.713-26.071 44.639Q-25.862 44.566-25.637 44.566Q-25.131 44.566-24.847 44.789Q-24.563 45.013-24.563 45.509L-24.563 47.163Q-24.563 47.300-24.415 47.336Q-24.266 47.372-24.040 47.372L-24.040 47.652L-25.671 47.652L-25.671 47.372Q-25.442 47.372-25.293 47.338Q-25.144 47.303-25.144 47.163L-25.144 45.523Q-25.144 45.188-25.264 44.988Q-25.384 44.788-25.698 44.788Q-25.968 44.788-26.202 44.924Q-26.436 45.061-26.575 45.295Q-26.713 45.529-26.713 45.803L-26.713 47.163Q-26.713 47.300-26.563 47.336Q-26.412 47.372-26.187 47.372L-26.187 47.652M-23.394 46.924Q-23.394 46.592-23.171 46.365Q-22.947 46.138-22.603 46.010Q-22.260 45.881-21.887 45.829Q-21.515 45.776-21.210 45.776L-21.210 45.523Q-21.210 45.318-21.318 45.138Q-21.426 44.959-21.607 44.856Q-21.788 44.754-21.996 44.754Q-22.403 44.754-22.639 44.846Q-22.550 44.883-22.504 44.967Q-22.458 45.051-22.458 45.153Q-22.458 45.249-22.504 45.328Q-22.550 45.406-22.630 45.451Q-22.711 45.495-22.800 45.495Q-22.950 45.495-23.051 45.398Q-23.152 45.300-23.152 45.153Q-23.152 44.531-21.996 44.531Q-21.785 44.531-21.535 44.595Q-21.285 44.658-21.084 44.777Q-20.882 44.897-20.756 45.082Q-20.629 45.266-20.629 45.509L-20.629 47.085Q-20.629 47.201-20.568 47.297Q-20.506 47.392-20.393 47.392Q-20.284 47.392-20.219 47.298Q-20.154 47.204-20.154 47.085L-20.154 46.637L-19.888 46.637L-19.888 47.085Q-19.888 47.355-20.115 47.520Q-20.342 47.686-20.622 47.686Q-20.831 47.686-20.968 47.532Q-21.104 47.379-21.128 47.163Q-21.275 47.430-21.557 47.575Q-21.839 47.720-22.164 47.720Q-22.441 47.720-22.724 47.645Q-23.008 47.570-23.201 47.391Q-23.394 47.211-23.394 46.924M-22.779 46.924Q-22.779 47.098-22.678 47.228Q-22.577 47.358-22.422 47.428Q-22.266 47.498-22.102 47.498Q-21.884 47.498-21.675 47.401Q-21.467 47.303-21.338 47.122Q-21.210 46.941-21.210 46.715L-21.210 45.987Q-21.535 45.987-21.901 46.078Q-22.266 46.169-22.523 46.381Q-22.779 46.592-22.779 46.924M-19.471 46.141Q-19.471 45.803-19.330 45.512Q-19.190 45.222-18.946 45.008Q-18.702 44.795-18.397 44.680Q-18.093 44.566-17.768 44.566Q-17.498 44.566-17.235 44.665Q-16.972 44.764-16.781 44.942L-16.781 43.544Q-16.781 43.274-16.888 43.212Q-16.996 43.151-17.307 43.151L-17.307 42.870L-16.230 42.795L-16.230 46.979Q-16.230 47.167-16.176 47.250Q-16.121 47.334-16.020 47.353Q-15.919 47.372-15.704 47.372L-15.704 47.652L-16.811 47.720L-16.811 47.303Q-17.228 47.720-17.854 47.720Q-18.285 47.720-18.657 47.508Q-19.030 47.297-19.250 46.936Q-19.471 46.575-19.471 46.141M-17.796 47.498Q-17.587 47.498-17.401 47.426Q-17.215 47.355-17.061 47.218Q-16.907 47.081-16.811 46.903L-16.811 45.294Q-16.897 45.147-17.042 45.027Q-17.187 44.907-17.357 44.848Q-17.526 44.788-17.707 44.788Q-18.267 44.788-18.536 45.177Q-18.804 45.567-18.804 46.148Q-18.804 46.719-18.570 47.109Q-18.336 47.498-17.796 47.498M-15.096 46.169Q-15.096 45.827-14.961 45.528Q-14.826 45.229-14.586 45.005Q-14.347 44.781-14.029 44.656Q-13.711 44.531-13.380 44.531Q-12.935 44.531-12.535 44.747Q-12.136 44.962-11.901 45.340Q-11.667 45.717-11.667 46.169Q-11.667 46.510-11.809 46.794Q-11.951 47.078-12.195 47.285Q-12.440 47.491-12.749 47.606Q-13.058 47.720-13.380 47.720Q-13.810 47.720-14.212 47.519Q-14.614 47.317-14.855 46.965Q-15.096 46.613-15.096 46.169M-13.380 47.471Q-12.778 47.471-12.554 47.093Q-12.330 46.715-12.330 46.083Q-12.330 45.471-12.565 45.112Q-12.799 44.754-13.380 44.754Q-14.432 44.754-14.432 46.083Q-14.432 46.715-14.207 47.093Q-13.981 47.471-13.380 47.471\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(178.517 -98.219)\">\u003Cpath d=\"M-9.888 47.625L-10.869 45.126Q-10.930 44.983-11.048 44.948Q-11.166 44.914-11.382 44.914L-11.382 44.634L-9.902 44.634L-9.902 44.914Q-10.281 44.914-10.281 45.075Q-10.281 45.085-10.267 45.126L-9.553 46.958L-8.880 45.253Q-8.910 45.181-8.910 45.153Q-8.910 45.126-8.938 45.126Q-8.999 44.979-9.117 44.947Q-9.235 44.914-9.447 44.914L-9.447 44.634L-8.049 44.634L-8.049 44.914Q-8.425 44.914-8.425 45.075Q-8.425 45.106-8.418 45.126L-7.663 47.064L-6.976 45.314Q-6.955 45.263-6.955 45.208Q-6.955 45.068-7.068 44.991Q-7.181 44.914-7.321 44.914L-7.321 44.634L-6.101 44.634L-6.101 44.914Q-6.306 44.914-6.461 45.020Q-6.617 45.126-6.689 45.314L-7.594 47.625Q-7.629 47.720-7.741 47.720L-7.810 47.720Q-7.919 47.720-7.957 47.625L-8.739 45.622L-9.526 47.625Q-9.560 47.720-9.673 47.720L-9.741 47.720Q-9.850 47.720-9.888 47.625\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(178.517 -98.219)\">\u003Cpath d=\"M-1.229 49.009L-2.859 49.009L-2.859 48.729Q-2.630 48.729-2.481 48.694Q-2.333 48.660-2.333 48.520L-2.333 45.174Q-2.333 45.003-2.469 44.962Q-2.606 44.921-2.859 44.921L-2.859 44.641L-1.779 44.566L-1.779 44.972Q-1.557 44.771-1.270 44.668Q-0.982 44.566-0.675 44.566Q-0.248 44.566 0.116 44.779Q0.480 44.993 0.694 45.357Q0.908 45.721 0.908 46.141Q0.908 46.586 0.668 46.950Q0.429 47.314 0.036 47.517Q-0.357 47.720-0.801 47.720Q-1.068 47.720-1.316 47.620Q-1.563 47.519-1.751 47.338L-1.751 48.520Q-1.751 48.657-1.603 48.693Q-1.454 48.729-1.229 48.729L-1.229 49.009M-1.751 45.321L-1.751 46.931Q-1.618 47.184-1.375 47.341Q-1.133 47.498-0.856 47.498Q-0.528 47.498-0.275 47.297Q-0.022 47.095 0.111 46.777Q0.245 46.459 0.245 46.141Q0.245 45.912 0.180 45.683Q0.115 45.454-0.013 45.256Q-0.142 45.058-0.336 44.938Q-0.531 44.819-0.764 44.819Q-1.058 44.819-1.326 44.948Q-1.594 45.078-1.751 45.321M3.293 47.652L1.557 47.652L1.557 47.372Q1.786 47.372 1.935 47.338Q2.084 47.303 2.084 47.163L2.084 45.314Q2.084 45.044 1.976 44.983Q1.868 44.921 1.557 44.921L1.557 44.641L2.586 44.566L2.586 45.273Q2.716 44.965 2.959 44.766Q3.201 44.566 3.519 44.566Q3.738 44.566 3.909 44.690Q4.080 44.815 4.080 45.027Q4.080 45.164 3.980 45.263Q3.881 45.362 3.748 45.362Q3.611 45.362 3.512 45.263Q3.413 45.164 3.413 45.027Q3.413 44.887 3.512 44.788Q3.222 44.788 3.022 44.984Q2.822 45.181 2.730 45.475Q2.637 45.769 2.637 46.049L2.637 47.163Q2.637 47.372 3.293 47.372L3.293 47.652M6.281 47.652L4.729 47.652L4.729 47.372Q4.955 47.372 5.103 47.338Q5.252 47.303 5.252 47.163L5.252 45.314Q5.252 45.126 5.204 45.042Q5.156 44.959 5.059 44.940Q4.961 44.921 4.750 44.921L4.750 44.641L5.806 44.566L5.806 47.163Q5.806 47.303 5.937 47.338Q6.069 47.372 6.281 47.372L6.281 47.652M5.009 43.345Q5.009 43.174 5.132 43.055Q5.255 42.935 5.426 42.935Q5.594 42.935 5.717 43.055Q5.840 43.174 5.840 43.345Q5.840 43.520 5.717 43.643Q5.594 43.766 5.426 43.766Q5.255 43.766 5.132 43.643Q5.009 43.520 5.009 43.345M6.927 46.141Q6.927 45.813 7.062 45.512Q7.197 45.212 7.433 44.991Q7.668 44.771 7.973 44.651Q8.277 44.531 8.602 44.531Q9.107 44.531 9.456 44.634Q9.805 44.736 9.805 45.112Q9.805 45.259 9.707 45.360Q9.610 45.461 9.463 45.461Q9.309 45.461 9.210 45.362Q9.111 45.263 9.111 45.112Q9.111 44.924 9.251 44.832Q9.049 44.781 8.608 44.781Q8.253 44.781 8.024 44.977Q7.795 45.174 7.694 45.483Q7.593 45.793 7.593 46.141Q7.593 46.490 7.720 46.796Q7.846 47.102 8.101 47.286Q8.355 47.471 8.711 47.471Q8.933 47.471 9.118 47.387Q9.302 47.303 9.437 47.148Q9.572 46.992 9.630 46.784Q9.644 46.729 9.699 46.729L9.812 46.729Q9.842 46.729 9.865 46.753Q9.887 46.777 9.887 46.811L9.887 46.832Q9.801 47.119 9.613 47.317Q9.425 47.515 9.160 47.618Q8.896 47.720 8.602 47.720Q8.171 47.720 7.783 47.514Q7.395 47.307 7.161 46.944Q6.927 46.582 6.927 46.141M10.434 46.117Q10.434 45.796 10.558 45.507Q10.683 45.218 10.909 44.995Q11.134 44.771 11.430 44.651Q11.726 44.531 12.043 44.531Q12.372 44.531 12.633 44.631Q12.895 44.730 13.071 44.912Q13.247 45.095 13.341 45.353Q13.435 45.611 13.435 45.943Q13.435 46.035 13.353 46.056L11.097 46.056L11.097 46.117Q11.097 46.705 11.380 47.088Q11.664 47.471 12.231 47.471Q12.553 47.471 12.821 47.278Q13.089 47.085 13.178 46.770Q13.185 46.729 13.260 46.715L13.353 46.715Q13.435 46.739 13.435 46.811Q13.435 46.818 13.428 46.845Q13.315 47.242 12.944 47.481Q12.573 47.720 12.149 47.720Q11.712 47.720 11.312 47.512Q10.912 47.303 10.673 46.936Q10.434 46.569 10.434 46.117M11.104 45.847L12.918 45.847Q12.918 45.570 12.821 45.318Q12.724 45.065 12.525 44.909Q12.327 44.754 12.043 44.754Q11.767 44.754 11.553 44.912Q11.339 45.071 11.221 45.326Q11.104 45.581 11.104 45.847\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The multiplier lambda converging to the budget. Starting from zero (cost ignored, badly over budget), each dual step nudges lambda up while measured cost exceeds d and down once it dips below, so lambda overshoots then damps toward the shadow price where measured cost equals the budget d. The cost trace (right axis, dashed) settles onto d from above.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:221.824px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 166.368 158.829\">\u003Cg stroke=\"currentColor\" transform=\"matrix(1 0 0 -1 3.083 11.872)\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003CclipPath id=\"pgf1662fc79f87b4e895690547bd9ae9259cp1\">\u003Cpath d=\"M68.286 0c0 37.714-30.572 68.286-68.286 68.286S-68.286 37.714-68.286 0-37.714-68.286 0-68.286 68.286-37.714 68.286 0ZM0 0\"\u002F>\u003C\u002FclipPath>\u003Cg clip-path=\"url(#pgf1662fc79f87b4e895690547bd9ae9259cp1)\">\u003Cpath fill=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M-79.668-79.668H79.668v39.834L-79.668 54.06Z\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M68.286 0c0 37.714-30.572 68.286-68.286 68.286S-68.286 37.714-68.286 0-37.714-68.286 0-68.286 68.286-37.714 68.286 0ZM0 0\" style=\"stroke-width:.8\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"matrix(1 0 0 -1 -30.455 87.898)\">\u003Cpath d=\"M5.595 11.872L3.462 11.872L3.462 11.592Q4.184 11.592 4.184 11.383L4.184 7.582Q4.184 7.371 3.462 7.371L3.462 7.090L5.595 7.090L5.595 7.371Q4.874 7.371 4.874 7.582L4.874 9.808L7.243 7.770Q7.359 7.661 7.359 7.559Q7.359 7.466 7.282 7.418Q7.205 7.371 7.109 7.371L7.109 7.090L8.712 7.090L8.712 7.371Q8.425 7.371 8.148 7.476Q7.872 7.582 7.653 7.770L6.269 8.960L7.960 11.192Q8.097 11.370 8.207 11.455Q8.316 11.540 8.441 11.566Q8.565 11.592 8.815 11.592L8.815 11.872L6.932 11.872L6.932 11.592Q7.085 11.592 7.191 11.561Q7.297 11.530 7.297 11.417Q7.297 11.332 7.185 11.192L5.800 9.367L4.874 10.156L4.874 11.383Q4.874 11.592 5.595 11.592L5.595 11.872M13.549 11.872L9.581 11.872L9.581 11.592Q10.302 11.592 10.302 11.383L10.302 7.582Q10.302 7.371 9.581 7.371L9.581 7.090L11.895 7.090L11.895 7.371Q11.577 7.371 11.284 7.406Q10.992 7.442 10.992 7.582L10.992 11.383Q10.992 11.523 11.081 11.558Q11.170 11.592 11.358 11.592L11.980 11.592Q12.394 11.592 12.672 11.489Q12.951 11.387 13.116 11.185Q13.282 10.983 13.364 10.696Q13.446 10.409 13.491 10.002L13.757 10.002\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -30.455 87.898)\">\u003Cpath d=\"M17.681 11.031L17.681 9.134L17.042 9.134L17.042 8.912Q17.360 8.912 17.577 8.702Q17.794 8.492 17.894 8.182Q17.995 7.873 17.995 7.565L18.262 7.565L18.262 8.854L19.339 8.854L19.339 9.134L18.262 9.134L18.262 11.018Q18.262 11.294 18.366 11.493Q18.470 11.691 18.730 11.691Q18.887 11.691 18.993 11.587Q19.099 11.482 19.149 11.329Q19.198 11.175 19.198 11.018L19.198 10.604L19.465 10.604L19.465 11.031Q19.465 11.257 19.366 11.467Q19.267 11.677 19.082 11.809Q18.898 11.940 18.669 11.940Q18.231 11.940 17.956 11.703Q17.681 11.465 17.681 11.031M22.025 11.872L20.289 11.872L20.289 11.592Q20.518 11.592 20.666 11.558Q20.815 11.523 20.815 11.383L20.815 9.534Q20.815 9.264 20.707 9.203Q20.600 9.141 20.289 9.141L20.289 8.861L21.318 8.786L21.318 9.493Q21.447 9.185 21.690 8.986Q21.933 8.786 22.251 8.786Q22.469 8.786 22.640 8.910Q22.811 9.035 22.811 9.247Q22.811 9.384 22.712 9.483Q22.613 9.582 22.480 9.582Q22.343 9.582 22.244 9.483Q22.145 9.384 22.145 9.247Q22.145 9.107 22.244 9.008Q21.953 9.008 21.753 9.204Q21.553 9.401 21.461 9.695Q21.369 9.989 21.369 10.269L21.369 11.383Q21.369 11.592 22.025 11.592L22.025 11.872M23.970 11.038L23.970 9.534Q23.970 9.264 23.862 9.203Q23.755 9.141 23.444 9.141L23.444 8.861L24.551 8.786L24.551 11.018L24.551 11.038Q24.551 11.318 24.602 11.462Q24.653 11.605 24.795 11.662Q24.937 11.718 25.224 11.718Q25.477 11.718 25.682 11.578Q25.887 11.438 26.004 11.212Q26.120 10.987 26.120 10.737L26.120 9.534Q26.120 9.264 26.012 9.203Q25.904 9.141 25.593 9.141L25.593 8.861L26.701 8.786L26.701 11.199Q26.701 11.390 26.754 11.472Q26.807 11.554 26.908 11.573Q27.008 11.592 27.224 11.592L27.224 11.872L26.147 11.940L26.147 11.376Q26.038 11.558 25.892 11.681Q25.747 11.804 25.561 11.872Q25.375 11.940 25.173 11.940Q23.970 11.940 23.970 11.038M27.812 11.865L27.812 10.802Q27.812 10.778 27.839 10.751Q27.866 10.724 27.890 10.724L28 10.724Q28.065 10.724 28.078 10.782Q28.174 11.216 28.420 11.467Q28.666 11.718 29.080 11.718Q29.422 11.718 29.674 11.585Q29.927 11.452 29.927 11.144Q29.927 10.987 29.833 10.872Q29.739 10.758 29.601 10.689Q29.463 10.621 29.295 10.583L28.714 10.484Q28.359 10.416 28.085 10.195Q27.812 9.975 27.812 9.633Q27.812 9.384 27.923 9.209Q28.034 9.035 28.220 8.936Q28.406 8.837 28.622 8.794Q28.837 8.751 29.080 8.751Q29.493 8.751 29.774 8.933L29.989 8.758Q29.999 8.755 30.006 8.753Q30.013 8.751 30.023 8.751L30.074 8.751Q30.102 8.751 30.126 8.775Q30.150 8.799 30.150 8.827L30.150 9.674Q30.150 9.695 30.126 9.722Q30.102 9.749 30.074 9.749L29.962 9.749Q29.934 9.749 29.909 9.724Q29.883 9.698 29.883 9.674Q29.883 9.438 29.777 9.274Q29.671 9.110 29.488 9.028Q29.305 8.946 29.073 8.946Q28.745 8.946 28.488 9.049Q28.232 9.151 28.232 9.428Q28.232 9.623 28.415 9.732Q28.598 9.842 28.827 9.883L29.401 9.989Q29.647 10.037 29.861 10.165Q30.074 10.293 30.211 10.496Q30.348 10.700 30.348 10.949Q30.348 11.462 29.982 11.701Q29.616 11.940 29.080 11.940Q28.584 11.940 28.253 11.646L27.986 11.920Q27.965 11.940 27.938 11.940L27.890 11.940Q27.866 11.940 27.839 11.913Q27.812 11.886 27.812 11.865M31.503 11.031L31.503 9.134L30.864 9.134L30.864 8.912Q31.182 8.912 31.399 8.702Q31.616 8.492 31.717 8.182Q31.818 7.873 31.818 7.565L32.084 7.565L32.084 8.854L33.161 8.854L33.161 9.134L32.084 9.134L32.084 11.018Q32.084 11.294 32.188 11.493Q32.293 11.691 32.552 11.691Q32.710 11.691 32.816 11.587Q32.922 11.482 32.971 11.329Q33.021 11.175 33.021 11.018L33.021 10.604L33.287 10.604L33.287 11.031Q33.287 11.257 33.188 11.467Q33.089 11.677 32.904 11.809Q32.720 11.940 32.491 11.940Q32.053 11.940 31.778 11.703Q31.503 11.465 31.503 11.031\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -30.455 87.898)\">\u003Cpath d=\"M38.558 11.872L36.822 11.872L36.822 11.592Q37.051 11.592 37.200 11.558Q37.348 11.523 37.348 11.383L37.348 9.534Q37.348 9.264 37.241 9.203Q37.133 9.141 36.822 9.141L36.822 8.861L37.851 8.786L37.851 9.493Q37.981 9.185 38.223 8.986Q38.466 8.786 38.784 8.786Q39.003 8.786 39.174 8.910Q39.345 9.035 39.345 9.247Q39.345 9.384 39.245 9.483Q39.146 9.582 39.013 9.582Q38.876 9.582 38.777 9.483Q38.678 9.384 38.678 9.247Q38.678 9.107 38.777 9.008Q38.487 9.008 38.287 9.204Q38.087 9.401 37.994 9.695Q37.902 9.989 37.902 10.269L37.902 11.383Q37.902 11.592 38.558 11.592L38.558 11.872M39.888 10.337Q39.888 10.016 40.013 9.727Q40.138 9.438 40.363 9.215Q40.589 8.991 40.884 8.871Q41.180 8.751 41.498 8.751Q41.826 8.751 42.088 8.851Q42.349 8.950 42.525 9.132Q42.701 9.315 42.795 9.573Q42.889 9.831 42.889 10.163Q42.889 10.255 42.807 10.276L40.551 10.276L40.551 10.337Q40.551 10.925 40.835 11.308Q41.119 11.691 41.686 11.691Q42.007 11.691 42.275 11.498Q42.544 11.305 42.633 10.990Q42.640 10.949 42.715 10.935L42.807 10.935Q42.889 10.959 42.889 11.031Q42.889 11.038 42.882 11.065Q42.769 11.462 42.399 11.701Q42.028 11.940 41.604 11.940Q41.166 11.940 40.766 11.732Q40.367 11.523 40.127 11.156Q39.888 10.789 39.888 10.337M40.558 10.067L42.373 10.067Q42.373 9.790 42.275 9.538Q42.178 9.285 41.980 9.129Q41.782 8.974 41.498 8.974Q41.221 8.974 41.007 9.132Q40.794 9.291 40.676 9.546Q40.558 9.801 40.558 10.067M43.436 12.405Q43.436 12.159 43.632 11.975Q43.829 11.790 44.085 11.711Q43.949 11.599 43.877 11.438Q43.805 11.277 43.805 11.096Q43.805 10.775 44.017 10.529Q43.682 10.231 43.682 9.821Q43.682 9.360 44.072 9.073Q44.461 8.786 44.940 8.786Q45.411 8.786 45.746 9.032Q45.921 8.878 46.131 8.796Q46.341 8.714 46.570 8.714Q46.734 8.714 46.856 8.821Q46.977 8.929 46.977 9.093Q46.977 9.189 46.905 9.261Q46.833 9.332 46.741 9.332Q46.642 9.332 46.572 9.259Q46.502 9.185 46.502 9.086Q46.502 9.032 46.515 9.001L46.522 8.987Q46.529 8.967 46.538 8.956Q46.546 8.946 46.550 8.939Q46.194 8.939 45.907 9.162Q46.194 9.455 46.194 9.821Q46.194 10.136 46.010 10.368Q45.825 10.601 45.536 10.729Q45.247 10.857 44.940 10.857Q44.738 10.857 44.547 10.807Q44.355 10.758 44.178 10.648Q44.085 10.775 44.085 10.918Q44.085 11.100 44.213 11.235Q44.342 11.370 44.526 11.370L45.159 11.370Q45.606 11.370 45.975 11.441Q46.345 11.513 46.604 11.742Q46.864 11.971 46.864 12.405Q46.864 12.726 46.568 12.928Q46.273 13.130 45.869 13.219Q45.466 13.308 45.152 13.308Q44.834 13.308 44.431 13.219Q44.027 13.130 43.732 12.928Q43.436 12.726 43.436 12.405M43.890 12.405Q43.890 12.634 44.109 12.783Q44.328 12.932 44.620 13Q44.912 13.068 45.152 13.068Q45.316 13.068 45.524 13.032Q45.733 12.997 45.940 12.916Q46.146 12.836 46.278 12.708Q46.410 12.580 46.410 12.405Q46.410 12.053 46.028 11.959Q45.647 11.865 45.145 11.865L44.526 11.865Q44.287 11.865 44.089 12.016Q43.890 12.166 43.890 12.405M44.940 10.618Q45.606 10.618 45.606 9.821Q45.606 9.021 44.940 9.021Q44.270 9.021 44.270 9.821Q44.270 10.618 44.940 10.618M49.076 11.872L47.524 11.872L47.524 11.592Q47.749 11.592 47.898 11.558Q48.047 11.523 48.047 11.383L48.047 9.534Q48.047 9.346 47.999 9.262Q47.951 9.179 47.854 9.160Q47.756 9.141 47.544 9.141L47.544 8.861L48.600 8.786L48.600 11.383Q48.600 11.523 48.732 11.558Q48.864 11.592 49.076 11.592L49.076 11.872M47.804 7.565Q47.804 7.394 47.927 7.275Q48.050 7.155 48.221 7.155Q48.389 7.155 48.512 7.275Q48.635 7.394 48.635 7.565Q48.635 7.740 48.512 7.863Q48.389 7.986 48.221 7.986Q48.050 7.986 47.927 7.863Q47.804 7.740 47.804 7.565M49.681 10.389Q49.681 10.047 49.816 9.748Q49.951 9.449 50.190 9.225Q50.429 9.001 50.747 8.876Q51.065 8.751 51.396 8.751Q51.841 8.751 52.241 8.967Q52.640 9.182 52.875 9.560Q53.109 9.937 53.109 10.389Q53.109 10.730 52.967 11.014Q52.825 11.298 52.581 11.505Q52.336 11.711 52.027 11.826Q51.718 11.940 51.396 11.940Q50.966 11.940 50.564 11.739Q50.162 11.537 49.921 11.185Q49.681 10.833 49.681 10.389M51.396 11.691Q51.998 11.691 52.222 11.313Q52.446 10.935 52.446 10.303Q52.446 9.691 52.212 9.332Q51.977 8.974 51.396 8.974Q50.344 8.974 50.344 10.303Q50.344 10.935 50.569 11.313Q50.795 11.691 51.396 11.691M55.385 11.872L53.751 11.872L53.751 11.592Q53.980 11.592 54.129 11.558Q54.278 11.523 54.278 11.383L54.278 9.534Q54.278 9.264 54.170 9.203Q54.062 9.141 53.751 9.141L53.751 8.861L54.811 8.786L54.811 9.435Q54.982 9.127 55.286 8.956Q55.590 8.786 55.935 8.786Q56.441 8.786 56.725 9.009Q57.009 9.233 57.009 9.729L57.009 11.383Q57.009 11.520 57.157 11.556Q57.306 11.592 57.532 11.592L57.532 11.872L55.901 11.872L55.901 11.592Q56.130 11.592 56.279 11.558Q56.428 11.523 56.428 11.383L56.428 9.743Q56.428 9.408 56.308 9.208Q56.188 9.008 55.874 9.008Q55.604 9.008 55.370 9.144Q55.136 9.281 54.997 9.515Q54.859 9.749 54.859 10.023L54.859 11.383Q54.859 11.520 55.009 11.556Q55.160 11.592 55.385 11.592\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"matrix(1 0 0 -1 -64.767 -28.29)\">\u003Cpath d=\"M5.195 11.872L3.462 11.872L3.462 11.592Q3.688 11.592 3.837 11.558Q3.985 11.523 3.985 11.383L3.985 9.134L3.397 9.134L3.397 8.854L3.985 8.854L3.985 8.037Q3.985 7.719 4.163 7.471Q4.341 7.224 4.631 7.083Q4.922 6.943 5.233 6.943Q5.489 6.943 5.693 7.085Q5.896 7.227 5.896 7.470Q5.896 7.606 5.797 7.705Q5.698 7.805 5.561 7.805Q5.424 7.805 5.325 7.705Q5.226 7.606 5.226 7.470Q5.226 7.289 5.366 7.196Q5.288 7.169 5.188 7.169Q4.980 7.169 4.826 7.302Q4.672 7.435 4.592 7.639Q4.512 7.842 4.512 8.051L4.512 8.854L5.400 8.854L5.400 9.134L4.539 9.134L4.539 11.383Q4.539 11.592 5.195 11.592L5.195 11.872M5.834 10.337Q5.834 10.016 5.959 9.727Q6.084 9.438 6.310 9.215Q6.535 8.991 6.831 8.871Q7.126 8.751 7.444 8.751Q7.772 8.751 8.034 8.851Q8.295 8.950 8.471 9.132Q8.647 9.315 8.741 9.573Q8.835 9.831 8.835 10.163Q8.835 10.255 8.753 10.276L6.498 10.276L6.498 10.337Q6.498 10.925 6.781 11.308Q7.065 11.691 7.632 11.691Q7.954 11.691 8.222 11.498Q8.490 11.305 8.579 10.990Q8.586 10.949 8.661 10.935L8.753 10.935Q8.835 10.959 8.835 11.031Q8.835 11.038 8.829 11.065Q8.716 11.462 8.345 11.701Q7.974 11.940 7.550 11.940Q7.113 11.940 6.713 11.732Q6.313 11.523 6.074 11.156Q5.834 10.789 5.834 10.337M6.504 10.067L8.319 10.067Q8.319 9.790 8.222 9.538Q8.125 9.285 7.926 9.129Q7.728 8.974 7.444 8.974Q7.167 8.974 6.954 9.132Q6.740 9.291 6.622 9.546Q6.504 9.801 6.504 10.067M9.481 11.144Q9.481 10.812 9.705 10.585Q9.929 10.358 10.273 10.230Q10.616 10.101 10.989 10.049Q11.361 9.996 11.666 9.996L11.666 9.743Q11.666 9.538 11.558 9.358Q11.450 9.179 11.269 9.076Q11.088 8.974 10.879 8.974Q10.473 8.974 10.237 9.066Q10.326 9.103 10.372 9.187Q10.418 9.271 10.418 9.373Q10.418 9.469 10.372 9.548Q10.326 9.626 10.245 9.671Q10.165 9.715 10.076 9.715Q9.926 9.715 9.825 9.618Q9.724 9.520 9.724 9.373Q9.724 8.751 10.879 8.751Q11.091 8.751 11.341 8.815Q11.590 8.878 11.792 8.997Q11.994 9.117 12.120 9.302Q12.247 9.486 12.247 9.729L12.247 11.305Q12.247 11.421 12.308 11.517Q12.370 11.612 12.482 11.612Q12.592 11.612 12.657 11.518Q12.722 11.424 12.722 11.305L12.722 10.857L12.988 10.857L12.988 11.305Q12.988 11.575 12.761 11.740Q12.534 11.906 12.253 11.906Q12.045 11.906 11.908 11.752Q11.771 11.599 11.748 11.383Q11.601 11.650 11.319 11.795Q11.037 11.940 10.712 11.940Q10.435 11.940 10.151 11.865Q9.868 11.790 9.675 11.611Q9.481 11.431 9.481 11.144M10.097 11.144Q10.097 11.318 10.198 11.448Q10.298 11.578 10.454 11.648Q10.609 11.718 10.773 11.718Q10.992 11.718 11.201 11.621Q11.409 11.523 11.537 11.342Q11.666 11.161 11.666 10.935L11.666 10.207Q11.341 10.207 10.975 10.298Q10.609 10.389 10.353 10.601Q10.097 10.812 10.097 11.144M13.405 11.865L13.405 10.802Q13.405 10.778 13.433 10.751Q13.460 10.724 13.484 10.724L13.593 10.724Q13.658 10.724 13.672 10.782Q13.768 11.216 14.014 11.467Q14.260 11.718 14.673 11.718Q15.015 11.718 15.268 11.585Q15.521 11.452 15.521 11.144Q15.521 10.987 15.427 10.872Q15.333 10.758 15.195 10.689Q15.056 10.621 14.889 10.583L14.308 10.484Q13.952 10.416 13.679 10.195Q13.405 9.975 13.405 9.633Q13.405 9.384 13.516 9.209Q13.627 9.035 13.814 8.936Q14 8.837 14.215 8.794Q14.431 8.751 14.673 8.751Q15.087 8.751 15.367 8.933L15.583 8.758Q15.593 8.755 15.600 8.753Q15.606 8.751 15.617 8.751L15.668 8.751Q15.695 8.751 15.719 8.775Q15.743 8.799 15.743 8.827L15.743 9.674Q15.743 9.695 15.719 9.722Q15.695 9.749 15.668 9.749L15.555 9.749Q15.528 9.749 15.502 9.724Q15.477 9.698 15.477 9.674Q15.477 9.438 15.371 9.274Q15.265 9.110 15.082 9.028Q14.899 8.946 14.666 8.946Q14.338 8.946 14.082 9.049Q13.826 9.151 13.826 9.428Q13.826 9.623 14.009 9.732Q14.191 9.842 14.420 9.883L14.995 9.989Q15.241 10.037 15.454 10.165Q15.668 10.293 15.805 10.496Q15.941 10.700 15.941 10.949Q15.941 11.462 15.576 11.701Q15.210 11.940 14.673 11.940Q14.178 11.940 13.846 11.646L13.580 11.920Q13.559 11.940 13.532 11.940L13.484 11.940Q13.460 11.940 13.433 11.913Q13.405 11.886 13.405 11.865M18.187 11.872L16.635 11.872L16.635 11.592Q16.861 11.592 17.010 11.558Q17.158 11.523 17.158 11.383L17.158 9.534Q17.158 9.346 17.110 9.262Q17.062 9.179 16.965 9.160Q16.868 9.141 16.656 9.141L16.656 8.861L17.712 8.786L17.712 11.383Q17.712 11.523 17.843 11.558Q17.975 11.592 18.187 11.592L18.187 11.872M16.916 7.565Q16.916 7.394 17.039 7.275Q17.162 7.155 17.333 7.155Q17.500 7.155 17.623 7.275Q17.746 7.394 17.746 7.565Q17.746 7.740 17.623 7.863Q17.500 7.986 17.333 7.986Q17.162 7.986 17.039 7.863Q16.916 7.740 16.916 7.565M19.640 11.872L19.373 11.872L19.373 7.764Q19.373 7.494 19.265 7.432Q19.158 7.371 18.847 7.371L18.847 7.090L19.927 7.015L19.927 9.185Q20.135 8.994 20.421 8.890Q20.706 8.786 21.003 8.786Q21.321 8.786 21.619 8.907Q21.916 9.028 22.138 9.244Q22.360 9.459 22.487 9.744Q22.613 10.030 22.613 10.361Q22.613 10.806 22.374 11.170Q22.135 11.534 21.742 11.737Q21.349 11.940 20.904 11.940Q20.709 11.940 20.520 11.884Q20.330 11.828 20.169 11.723Q20.009 11.619 19.869 11.458L19.640 11.872M19.954 9.527L19.954 11.144Q20.091 11.404 20.332 11.561Q20.573 11.718 20.850 11.718Q21.144 11.718 21.355 11.611Q21.567 11.503 21.701 11.311Q21.834 11.120 21.892 10.881Q21.950 10.642 21.950 10.361Q21.950 10.002 21.856 9.698Q21.762 9.394 21.535 9.201Q21.308 9.008 20.942 9.008Q20.641 9.008 20.375 9.144Q20.108 9.281 19.954 9.527M24.917 11.872L23.314 11.872L23.314 11.592Q23.540 11.592 23.688 11.558Q23.837 11.523 23.837 11.383L23.837 7.764Q23.837 7.494 23.729 7.432Q23.622 7.371 23.314 7.371L23.314 7.090L24.391 7.015L24.391 11.383Q24.391 11.520 24.541 11.556Q24.691 11.592 24.917 11.592L24.917 11.872M25.471 10.337Q25.471 10.016 25.595 9.727Q25.720 9.438 25.946 9.215Q26.171 8.991 26.467 8.871Q26.763 8.751 27.081 8.751Q27.409 8.751 27.670 8.851Q27.932 8.950 28.108 9.132Q28.284 9.315 28.378 9.573Q28.472 9.831 28.472 10.163Q28.472 10.255 28.390 10.276L26.134 10.276L26.134 10.337Q26.134 10.925 26.417 11.308Q26.701 11.691 27.269 11.691Q27.590 11.691 27.858 11.498Q28.126 11.305 28.215 10.990Q28.222 10.949 28.297 10.935L28.390 10.935Q28.472 10.959 28.472 11.031Q28.472 11.038 28.465 11.065Q28.352 11.462 27.981 11.701Q27.610 11.940 27.187 11.940Q26.749 11.940 26.349 11.732Q25.949 11.523 25.710 11.156Q25.471 10.789 25.471 10.337M26.141 10.067L27.956 10.067Q27.956 9.790 27.858 9.538Q27.761 9.285 27.562 9.129Q27.364 8.974 27.081 8.974Q26.804 8.974 26.590 9.132Q26.376 9.291 26.259 9.546Q26.141 9.801 26.141 10.067\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -64.767 -28.29)\">\u003Cpath d=\"M33.169 11.845L32.188 9.346Q32.127 9.203 32.009 9.168Q31.891 9.134 31.675 9.134L31.675 8.854L33.155 8.854L33.155 9.134Q32.776 9.134 32.776 9.295Q32.776 9.305 32.790 9.346L33.504 11.178L34.177 9.473Q34.147 9.401 34.147 9.373Q34.147 9.346 34.119 9.346Q34.058 9.199 33.940 9.167Q33.822 9.134 33.610 9.134L33.610 8.854L35.008 8.854L35.008 9.134Q34.632 9.134 34.632 9.295Q34.632 9.326 34.639 9.346L35.394 11.284L36.081 9.534Q36.102 9.483 36.102 9.428Q36.102 9.288 35.989 9.211Q35.876 9.134 35.736 9.134L35.736 8.854L36.956 8.854L36.956 9.134Q36.751 9.134 36.596 9.240Q36.440 9.346 36.368 9.534L35.463 11.845Q35.428 11.940 35.316 11.940L35.247 11.940Q35.138 11.940 35.100 11.845L34.318 9.842L33.531 11.845Q33.497 11.940 33.384 11.940L33.316 11.940Q33.207 11.940 33.169 11.845\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -64.767 -28.29)\">\u003Cpath d=\"M37.233 10.337Q37.233 10.016 37.358 9.727Q37.483 9.438 37.709 9.215Q37.934 8.991 38.230 8.871Q38.525 8.751 38.843 8.751Q39.171 8.751 39.433 8.851Q39.694 8.950 39.870 9.132Q40.046 9.315 40.140 9.573Q40.234 9.831 40.234 10.163Q40.234 10.255 40.152 10.276L37.897 10.276L37.897 10.337Q37.897 10.925 38.180 11.308Q38.464 11.691 39.031 11.691Q39.353 11.691 39.621 11.498Q39.889 11.305 39.978 10.990Q39.985 10.949 40.060 10.935L40.152 10.935Q40.234 10.959 40.234 11.031Q40.234 11.038 40.228 11.065Q40.115 11.462 39.744 11.701Q39.373 11.940 38.949 11.940Q38.512 11.940 38.112 11.732Q37.712 11.523 37.473 11.156Q37.233 10.789 37.233 10.337M37.903 10.067L39.718 10.067Q39.718 9.790 39.621 9.538Q39.523 9.285 39.325 9.129Q39.127 8.974 38.843 8.974Q38.566 8.974 38.353 9.132Q38.139 9.291 38.021 9.546Q37.903 9.801 37.903 10.067M40.822 10.361Q40.822 10.023 40.962 9.732Q41.103 9.442 41.347 9.228Q41.591 9.015 41.896 8.900Q42.200 8.786 42.524 8.786Q42.794 8.786 43.058 8.885Q43.321 8.984 43.512 9.162L43.512 7.764Q43.512 7.494 43.405 7.432Q43.297 7.371 42.986 7.371L42.986 7.090L44.063 7.015L44.063 11.199Q44.063 11.387 44.117 11.470Q44.172 11.554 44.273 11.573Q44.374 11.592 44.589 11.592L44.589 11.872L43.481 11.940L43.481 11.523Q43.064 11.940 42.439 11.940Q42.008 11.940 41.636 11.728Q41.263 11.517 41.043 11.156Q40.822 10.795 40.822 10.361M42.497 11.718Q42.706 11.718 42.892 11.646Q43.078 11.575 43.232 11.438Q43.386 11.301 43.481 11.123L43.481 9.514Q43.396 9.367 43.251 9.247Q43.106 9.127 42.936 9.068Q42.767 9.008 42.586 9.008Q42.025 9.008 41.757 9.397Q41.489 9.787 41.489 10.368Q41.489 10.939 41.723 11.329Q41.957 11.718 42.497 11.718M45.197 12.405Q45.197 12.159 45.394 11.975Q45.590 11.790 45.847 11.711Q45.710 11.599 45.638 11.438Q45.566 11.277 45.566 11.096Q45.566 10.775 45.778 10.529Q45.443 10.231 45.443 9.821Q45.443 9.360 45.833 9.073Q46.223 8.786 46.701 8.786Q47.173 8.786 47.508 9.032Q47.682 8.878 47.892 8.796Q48.103 8.714 48.332 8.714Q48.496 8.714 48.617 8.821Q48.738 8.929 48.738 9.093Q48.738 9.189 48.667 9.261Q48.595 9.332 48.502 9.332Q48.403 9.332 48.333 9.259Q48.263 9.185 48.263 9.086Q48.263 9.032 48.277 9.001L48.284 8.987Q48.291 8.967 48.299 8.956Q48.308 8.946 48.311 8.939Q47.956 8.939 47.668 9.162Q47.956 9.455 47.956 9.821Q47.956 10.136 47.771 10.368Q47.586 10.601 47.298 10.729Q47.009 10.857 46.701 10.857Q46.500 10.857 46.308 10.807Q46.117 10.758 45.939 10.648Q45.847 10.775 45.847 10.918Q45.847 11.100 45.975 11.235Q46.103 11.370 46.288 11.370L46.920 11.370Q47.368 11.370 47.737 11.441Q48.106 11.513 48.366 11.742Q48.626 11.971 48.626 12.405Q48.626 12.726 48.330 12.928Q48.034 13.130 47.631 13.219Q47.228 13.308 46.913 13.308Q46.595 13.308 46.192 13.219Q45.789 13.130 45.493 12.928Q45.197 12.726 45.197 12.405M45.652 12.405Q45.652 12.634 45.871 12.783Q46.089 12.932 46.382 13Q46.674 13.068 46.913 13.068Q47.077 13.068 47.286 13.032Q47.494 12.997 47.701 12.916Q47.908 12.836 48.039 12.708Q48.171 12.580 48.171 12.405Q48.171 12.053 47.790 11.959Q47.409 11.865 46.906 11.865L46.288 11.865Q46.048 11.865 45.850 12.016Q45.652 12.166 45.652 12.405M46.701 10.618Q47.368 10.618 47.368 9.821Q47.368 9.021 46.701 9.021Q46.031 9.021 46.031 9.821Q46.031 10.618 46.701 10.618M49.179 10.337Q49.179 10.016 49.304 9.727Q49.429 9.438 49.654 9.215Q49.880 8.991 50.176 8.871Q50.471 8.751 50.789 8.751Q51.117 8.751 51.379 8.851Q51.640 8.950 51.816 9.132Q51.992 9.315 52.086 9.573Q52.180 9.831 52.180 10.163Q52.180 10.255 52.098 10.276L49.842 10.276L49.842 10.337Q49.842 10.925 50.126 11.308Q50.410 11.691 50.977 11.691Q51.298 11.691 51.567 11.498Q51.835 11.305 51.924 10.990Q51.931 10.949 52.006 10.935L52.098 10.935Q52.180 10.959 52.180 11.031Q52.180 11.038 52.173 11.065Q52.061 11.462 51.690 11.701Q51.319 11.940 50.895 11.940Q50.458 11.940 50.058 11.732Q49.658 11.523 49.418 11.156Q49.179 10.789 49.179 10.337M49.849 10.067L51.664 10.067Q51.664 9.790 51.567 9.538Q51.469 9.285 51.271 9.129Q51.073 8.974 50.789 8.974Q50.512 8.974 50.299 9.132Q50.085 9.291 49.967 9.546Q49.849 9.801 49.849 10.067\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M2.2 0a2.2 2.2 0 1 1-4.4 0 2.2 2.2 0 0 1 4.4 0M0 0\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"matrix(1 0 0 -1 -58.163 .633)\">\u003Cpath d=\"M3.397 10.361Q3.397 10.033 3.532 9.732Q3.667 9.432 3.903 9.211Q4.139 8.991 4.443 8.871Q4.748 8.751 5.072 8.751Q5.578 8.751 5.927 8.854Q6.275 8.956 6.275 9.332Q6.275 9.479 6.178 9.580Q6.081 9.681 5.934 9.681Q5.780 9.681 5.681 9.582Q5.582 9.483 5.582 9.332Q5.582 9.144 5.722 9.052Q5.520 9.001 5.079 9.001Q4.724 9.001 4.495 9.197Q4.266 9.394 4.165 9.703Q4.064 10.013 4.064 10.361Q4.064 10.710 4.190 11.016Q4.317 11.322 4.572 11.506Q4.826 11.691 5.182 11.691Q5.404 11.691 5.588 11.607Q5.773 11.523 5.908 11.368Q6.043 11.212 6.101 11.004Q6.115 10.949 6.169 10.949L6.282 10.949Q6.313 10.949 6.335 10.973Q6.357 10.997 6.357 11.031L6.357 11.052Q6.272 11.339 6.084 11.537Q5.896 11.735 5.631 11.838Q5.366 11.940 5.072 11.940Q4.642 11.940 4.254 11.734Q3.866 11.527 3.632 11.164Q3.397 10.802 3.397 10.361M7.520 11.038L7.520 9.534Q7.520 9.264 7.412 9.203Q7.304 9.141 6.993 9.141L6.993 8.861L8.101 8.786L8.101 11.018L8.101 11.038Q8.101 11.318 8.152 11.462Q8.203 11.605 8.345 11.662Q8.487 11.718 8.774 11.718Q9.027 11.718 9.232 11.578Q9.437 11.438 9.553 11.212Q9.669 10.987 9.669 10.737L9.669 9.534Q9.669 9.264 9.562 9.203Q9.454 9.141 9.143 9.141L9.143 8.861L10.250 8.786L10.250 11.199Q10.250 11.390 10.303 11.472Q10.356 11.554 10.457 11.573Q10.558 11.592 10.773 11.592L10.773 11.872L9.697 11.940L9.697 11.376Q9.587 11.558 9.442 11.681Q9.297 11.804 9.111 11.872Q8.924 11.940 8.723 11.940Q7.520 11.940 7.520 11.038M13.111 11.872L11.375 11.872L11.375 11.592Q11.604 11.592 11.753 11.558Q11.901 11.523 11.901 11.383L11.901 9.534Q11.901 9.264 11.794 9.203Q11.686 9.141 11.375 9.141L11.375 8.861L12.404 8.786L12.404 9.493Q12.534 9.185 12.776 8.986Q13.019 8.786 13.337 8.786Q13.556 8.786 13.727 8.910Q13.897 9.035 13.897 9.247Q13.897 9.384 13.798 9.483Q13.699 9.582 13.566 9.582Q13.429 9.582 13.330 9.483Q13.231 9.384 13.231 9.247Q13.231 9.107 13.330 9.008Q13.040 9.008 12.840 9.204Q12.640 9.401 12.547 9.695Q12.455 9.989 12.455 10.269L12.455 11.383Q12.455 11.592 13.111 11.592L13.111 11.872M16.232 11.872L14.496 11.872L14.496 11.592Q14.725 11.592 14.873 11.558Q15.022 11.523 15.022 11.383L15.022 9.534Q15.022 9.264 14.914 9.203Q14.807 9.141 14.496 9.141L14.496 8.861L15.524 8.786L15.524 9.493Q15.654 9.185 15.897 8.986Q16.140 8.786 16.458 8.786Q16.676 8.786 16.847 8.910Q17.018 9.035 17.018 9.247Q17.018 9.384 16.919 9.483Q16.820 9.582 16.687 9.582Q16.550 9.582 16.451 9.483Q16.352 9.384 16.352 9.247Q16.352 9.107 16.451 9.008Q16.160 9.008 15.960 9.204Q15.760 9.401 15.668 9.695Q15.576 9.989 15.576 10.269L15.576 11.383Q15.576 11.592 16.232 11.592L16.232 11.872M17.562 10.337Q17.562 10.016 17.686 9.727Q17.811 9.438 18.037 9.215Q18.262 8.991 18.558 8.871Q18.854 8.751 19.171 8.751Q19.500 8.751 19.761 8.851Q20.022 8.950 20.198 9.132Q20.375 9.315 20.468 9.573Q20.562 9.831 20.562 10.163Q20.562 10.255 20.480 10.276L18.225 10.276L18.225 10.337Q18.225 10.925 18.508 11.308Q18.792 11.691 19.359 11.691Q19.681 11.691 19.949 11.498Q20.217 11.305 20.306 10.990Q20.313 10.949 20.388 10.935L20.480 10.935Q20.562 10.959 20.562 11.031Q20.562 11.038 20.556 11.065Q20.443 11.462 20.072 11.701Q19.701 11.940 19.277 11.940Q18.840 11.940 18.440 11.732Q18.040 11.523 17.801 11.156Q17.562 10.789 17.562 10.337M18.231 10.067L20.046 10.067Q20.046 9.790 19.949 9.538Q19.852 9.285 19.653 9.129Q19.455 8.974 19.171 8.974Q18.895 8.974 18.681 9.132Q18.467 9.291 18.349 9.546Q18.231 9.801 18.231 10.067M22.832 11.872L21.198 11.872L21.198 11.592Q21.427 11.592 21.576 11.558Q21.725 11.523 21.725 11.383L21.725 9.534Q21.725 9.264 21.617 9.203Q21.509 9.141 21.198 9.141L21.198 8.861L22.258 8.786L22.258 9.435Q22.429 9.127 22.733 8.956Q23.037 8.786 23.382 8.786Q23.888 8.786 24.172 9.009Q24.456 9.233 24.456 9.729L24.456 11.383Q24.456 11.520 24.604 11.556Q24.753 11.592 24.979 11.592L24.979 11.872L23.348 11.872L23.348 11.592Q23.577 11.592 23.726 11.558Q23.875 11.523 23.875 11.383L23.875 9.743Q23.875 9.408 23.755 9.208Q23.635 9.008 23.321 9.008Q23.051 9.008 22.817 9.144Q22.583 9.281 22.444 9.515Q22.306 9.749 22.306 10.023L22.306 11.383Q22.306 11.520 22.456 11.556Q22.606 11.592 22.832 11.592\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -58.163 .633)\">\u003Cpath d=\"M25.903 11.031L25.903 9.134L25.264 9.134L25.264 8.912Q25.582 8.912 25.799 8.702Q26.016 8.492 26.116 8.182Q26.217 7.873 26.217 7.565L26.484 7.565L26.484 8.854L27.561 8.854L27.561 9.134L26.484 9.134L26.484 11.018Q26.484 11.294 26.588 11.493Q26.692 11.691 26.952 11.691Q27.109 11.691 27.215 11.587Q27.321 11.482 27.371 11.329Q27.420 11.175 27.420 11.018L27.420 10.604L27.687 10.604L27.687 11.031Q27.687 11.257 27.588 11.467Q27.489 11.677 27.304 11.809Q27.120 11.940 26.891 11.940Q26.453 11.940 26.178 11.703Q25.903 11.465 25.903 11.031\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -58.163 .633)\">\u003Cpath d=\"M32.840 13.229L31.210 13.229L31.210 12.949Q31.439 12.949 31.588 12.914Q31.736 12.880 31.736 12.740L31.736 9.394Q31.736 9.223 31.600 9.182Q31.463 9.141 31.210 9.141L31.210 8.861L32.290 8.786L32.290 9.192Q32.512 8.991 32.799 8.888Q33.087 8.786 33.394 8.786Q33.821 8.786 34.185 8.999Q34.549 9.213 34.763 9.577Q34.977 9.941 34.977 10.361Q34.977 10.806 34.737 11.170Q34.498 11.534 34.105 11.737Q33.712 11.940 33.268 11.940Q33.001 11.940 32.753 11.840Q32.506 11.739 32.318 11.558L32.318 12.740Q32.318 12.877 32.466 12.913Q32.615 12.949 32.840 12.949L32.840 13.229M32.318 9.541L32.318 11.151Q32.451 11.404 32.694 11.561Q32.936 11.718 33.213 11.718Q33.541 11.718 33.794 11.517Q34.047 11.315 34.180 10.997Q34.314 10.679 34.314 10.361Q34.314 10.132 34.249 9.903Q34.184 9.674 34.056 9.476Q33.927 9.278 33.733 9.158Q33.538 9.039 33.305 9.039Q33.011 9.039 32.743 9.168Q32.475 9.298 32.318 9.541\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 -58.163 .633)\">\u003Cpath d=\"M35.787 10.389Q35.787 10.047 35.922 9.748Q36.057 9.449 36.297 9.225Q36.536 9.001 36.854 8.876Q37.172 8.751 37.503 8.751Q37.948 8.751 38.347 8.967Q38.747 9.182 38.982 9.560Q39.216 9.937 39.216 10.389Q39.216 10.730 39.074 11.014Q38.932 11.298 38.688 11.505Q38.443 11.711 38.134 11.826Q37.825 11.940 37.503 11.940Q37.073 11.940 36.671 11.739Q36.269 11.537 36.028 11.185Q35.787 10.833 35.787 10.389M37.503 11.691Q38.105 11.691 38.329 11.313Q38.553 10.935 38.553 10.303Q38.553 9.691 38.318 9.332Q38.084 8.974 37.503 8.974Q36.451 8.974 36.451 10.303Q36.451 10.935 36.676 11.313Q36.902 11.691 37.503 11.691M41.478 11.872L39.875 11.872L39.875 11.592Q40.101 11.592 40.250 11.558Q40.398 11.523 40.398 11.383L40.398 7.764Q40.398 7.494 40.291 7.432Q40.183 7.371 39.875 7.371L39.875 7.090L40.952 7.015L40.952 11.383Q40.952 11.520 41.102 11.556Q41.253 11.592 41.478 11.592L41.478 11.872M43.690 11.872L42.138 11.872L42.138 11.592Q42.364 11.592 42.512 11.558Q42.661 11.523 42.661 11.383L42.661 9.534Q42.661 9.346 42.613 9.262Q42.565 9.179 42.468 9.160Q42.370 9.141 42.159 9.141L42.159 8.861L43.215 8.786L43.215 11.383Q43.215 11.523 43.346 11.558Q43.478 11.592 43.690 11.592L43.690 11.872M42.418 7.565Q42.418 7.394 42.541 7.275Q42.664 7.155 42.835 7.155Q43.003 7.155 43.126 7.275Q43.249 7.394 43.249 7.565Q43.249 7.740 43.126 7.863Q43.003 7.986 42.835 7.986Q42.664 7.986 42.541 7.863Q42.418 7.740 42.418 7.565M44.336 10.361Q44.336 10.033 44.471 9.732Q44.606 9.432 44.842 9.211Q45.077 8.991 45.382 8.871Q45.686 8.751 46.011 8.751Q46.516 8.751 46.865 8.854Q47.214 8.956 47.214 9.332Q47.214 9.479 47.116 9.580Q47.019 9.681 46.872 9.681Q46.718 9.681 46.619 9.582Q46.520 9.483 46.520 9.332Q46.520 9.144 46.660 9.052Q46.458 9.001 46.017 9.001Q45.662 9.001 45.433 9.197Q45.204 9.394 45.103 9.703Q45.002 10.013 45.002 10.361Q45.002 10.710 45.129 11.016Q45.255 11.322 45.510 11.506Q45.764 11.691 46.120 11.691Q46.342 11.691 46.527 11.607Q46.711 11.523 46.846 11.368Q46.981 11.212 47.039 11.004Q47.053 10.949 47.108 10.949L47.221 10.949Q47.251 10.949 47.274 10.973Q47.296 10.997 47.296 11.031L47.296 11.052Q47.210 11.339 47.022 11.537Q46.834 11.735 46.569 11.838Q46.305 11.940 46.011 11.940Q45.580 11.940 45.192 11.734Q44.804 11.527 44.570 11.164Q44.336 10.802 44.336 10.361M48.219 13.007Q48.348 13.075 48.485 13.075Q48.656 13.075 48.806 12.986Q48.957 12.897 49.068 12.752Q49.179 12.607 49.258 12.439L49.521 11.872L48.352 9.346Q48.277 9.199 48.147 9.167Q48.017 9.134 47.785 9.134L47.785 8.854L49.306 8.854L49.306 9.134Q48.957 9.134 48.957 9.281Q48.960 9.302 48.962 9.319Q48.964 9.336 48.964 9.346L49.822 11.205L50.594 9.534Q50.628 9.466 50.628 9.387Q50.628 9.274 50.545 9.204Q50.461 9.134 50.348 9.134L50.348 8.854L51.544 8.854L51.544 9.134Q51.326 9.134 51.153 9.238Q50.980 9.343 50.888 9.534L49.552 12.439Q49.381 12.809 49.111 13.055Q48.841 13.301 48.485 13.301Q48.215 13.301 47.996 13.135Q47.778 12.969 47.778 12.706Q47.778 12.569 47.870 12.480Q47.962 12.392 48.102 12.392Q48.239 12.392 48.328 12.480Q48.417 12.569 48.417 12.706Q48.417 12.809 48.364 12.887Q48.311 12.966 48.219 13.007\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m0 0 43.686 43.686\"\u002F>\u003Cpath stroke=\"none\" d=\"m45.525 45.525-4.413-1.471 2.574-.368.368-2.574\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"matrix(1 0 0 -1 7.8 65.136)\">\u003Cpath d=\"M5.147 11.872L3.411 11.872L3.411 11.592Q3.640 11.592 3.789 11.558Q3.937 11.523 3.937 11.383L3.937 9.534Q3.937 9.264 3.830 9.203Q3.722 9.141 3.411 9.141L3.411 8.861L4.440 8.786L4.440 9.493Q4.570 9.185 4.812 8.986Q5.055 8.786 5.373 8.786Q5.592 8.786 5.763 8.910Q5.934 9.035 5.934 9.247Q5.934 9.384 5.834 9.483Q5.735 9.582 5.602 9.582Q5.465 9.582 5.366 9.483Q5.267 9.384 5.267 9.247Q5.267 9.107 5.366 9.008Q5.076 9.008 4.876 9.204Q4.676 9.401 4.583 9.695Q4.491 9.989 4.491 10.269L4.491 11.383Q4.491 11.592 5.147 11.592L5.147 11.872M6.477 10.337Q6.477 10.016 6.602 9.727Q6.727 9.438 6.952 9.215Q7.178 8.991 7.473 8.871Q7.769 8.751 8.087 8.751Q8.415 8.751 8.677 8.851Q8.938 8.950 9.114 9.132Q9.290 9.315 9.384 9.573Q9.478 9.831 9.478 10.163Q9.478 10.255 9.396 10.276L7.140 10.276L7.140 10.337Q7.140 10.925 7.424 11.308Q7.708 11.691 8.275 11.691Q8.596 11.691 8.864 11.498Q9.133 11.305 9.222 10.990Q9.229 10.949 9.304 10.935L9.396 10.935Q9.478 10.959 9.478 11.031Q9.478 11.038 9.471 11.065Q9.358 11.462 8.988 11.701Q8.617 11.940 8.193 11.940Q7.755 11.940 7.355 11.732Q6.956 11.523 6.716 11.156Q6.477 10.789 6.477 10.337M7.147 10.067L8.962 10.067Q8.962 9.790 8.864 9.538Q8.767 9.285 8.569 9.129Q8.371 8.974 8.087 8.974Q7.810 8.974 7.596 9.132Q7.383 9.291 7.265 9.546Q7.147 9.801 7.147 10.067M11.454 11.845L10.473 9.346Q10.411 9.203 10.293 9.168Q10.175 9.134 9.960 9.134L9.960 8.854L11.440 8.854L11.440 9.134Q11.061 9.134 11.061 9.295Q11.061 9.305 11.074 9.346L11.789 11.178L12.462 9.473Q12.431 9.401 12.431 9.373Q12.431 9.346 12.404 9.346Q12.342 9.199 12.224 9.167Q12.106 9.134 11.895 9.134L11.895 8.854L13.292 8.854L13.292 9.134Q12.916 9.134 12.916 9.295Q12.916 9.326 12.923 9.346L13.679 11.284L14.366 9.534Q14.386 9.483 14.386 9.428Q14.386 9.288 14.273 9.211Q14.161 9.134 14.021 9.134L14.021 8.854L15.241 8.854L15.241 9.134Q15.036 9.134 14.880 9.240Q14.725 9.346 14.653 9.534L13.747 11.845Q13.713 11.940 13.600 11.940L13.532 11.940Q13.422 11.940 13.385 11.845L12.602 9.842L11.816 11.845Q11.782 11.940 11.669 11.940L11.601 11.940Q11.491 11.940 11.454 11.845\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 7.8 65.136)\">\u003Cpath d=\"M15.630 11.144Q15.630 10.812 15.853 10.585Q16.077 10.358 16.421 10.230Q16.764 10.101 17.137 10.049Q17.509 9.996 17.814 9.996L17.814 9.743Q17.814 9.538 17.706 9.358Q17.598 9.179 17.417 9.076Q17.236 8.974 17.028 8.974Q16.621 8.974 16.385 9.066Q16.474 9.103 16.520 9.187Q16.566 9.271 16.566 9.373Q16.566 9.469 16.520 9.548Q16.474 9.626 16.393 9.671Q16.313 9.715 16.224 9.715Q16.074 9.715 15.973 9.618Q15.872 9.520 15.872 9.373Q15.872 8.751 17.028 8.751Q17.239 8.751 17.489 8.815Q17.738 8.878 17.940 8.997Q18.142 9.117 18.268 9.302Q18.395 9.486 18.395 9.729L18.395 11.305Q18.395 11.421 18.456 11.517Q18.518 11.612 18.631 11.612Q18.740 11.612 18.805 11.518Q18.870 11.424 18.870 11.305L18.870 10.857L19.136 10.857L19.136 11.305Q19.136 11.575 18.909 11.740Q18.682 11.906 18.402 11.906Q18.193 11.906 18.056 11.752Q17.920 11.599 17.896 11.383Q17.749 11.650 17.467 11.795Q17.185 11.940 16.860 11.940Q16.583 11.940 16.299 11.865Q16.016 11.790 15.823 11.611Q15.630 11.431 15.630 11.144M16.245 11.144Q16.245 11.318 16.346 11.448Q16.446 11.578 16.602 11.648Q16.757 11.718 16.922 11.718Q17.140 11.718 17.349 11.621Q17.557 11.523 17.685 11.342Q17.814 11.161 17.814 10.935L17.814 10.207Q17.489 10.207 17.123 10.298Q16.757 10.389 16.501 10.601Q16.245 10.812 16.245 11.144M21.303 11.872L19.567 11.872L19.567 11.592Q19.796 11.592 19.945 11.558Q20.093 11.523 20.093 11.383L20.093 9.534Q20.093 9.264 19.986 9.203Q19.878 9.141 19.567 9.141L19.567 8.861L20.596 8.786L20.596 9.493Q20.726 9.185 20.968 8.986Q21.211 8.786 21.529 8.786Q21.748 8.786 21.919 8.910Q22.090 9.035 22.090 9.247Q22.090 9.384 21.990 9.483Q21.891 9.582 21.758 9.582Q21.621 9.582 21.522 9.483Q21.423 9.384 21.423 9.247Q21.423 9.107 21.522 9.008Q21.232 9.008 21.032 9.204Q20.832 9.401 20.739 9.695Q20.647 9.989 20.647 10.269L20.647 11.383Q20.647 11.592 21.303 11.592L21.303 11.872M22.674 10.361Q22.674 10.023 22.814 9.732Q22.954 9.442 23.199 9.228Q23.443 9.015 23.747 8.900Q24.051 8.786 24.376 8.786Q24.646 8.786 24.909 8.885Q25.173 8.984 25.364 9.162L25.364 7.764Q25.364 7.494 25.256 7.432Q25.149 7.371 24.838 7.371L24.838 7.090L25.914 7.015L25.914 11.199Q25.914 11.387 25.969 11.470Q26.024 11.554 26.124 11.573Q26.225 11.592 26.441 11.592L26.441 11.872L25.333 11.940L25.333 11.523Q24.916 11.940 24.291 11.940Q23.860 11.940 23.487 11.728Q23.115 11.517 22.894 11.156Q22.674 10.795 22.674 10.361M24.349 11.718Q24.557 11.718 24.744 11.646Q24.930 11.575 25.084 11.438Q25.237 11.301 25.333 11.123L25.333 9.514Q25.248 9.367 25.102 9.247Q24.957 9.127 24.788 9.068Q24.619 9.008 24.438 9.008Q23.877 9.008 23.609 9.397Q23.340 9.787 23.340 10.368Q23.340 10.939 23.575 11.329Q23.809 11.718 24.349 11.718\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 7.8 65.136)\">\u003Cpath d=\"M29.752 12.405Q29.752 12.159 29.949 11.975Q30.146 11.790 30.402 11.711Q30.265 11.599 30.193 11.438Q30.122 11.277 30.122 11.096Q30.122 10.775 30.333 10.529Q29.999 10.231 29.999 9.821Q29.999 9.360 30.388 9.073Q30.778 8.786 31.256 8.786Q31.728 8.786 32.063 9.032Q32.237 8.878 32.448 8.796Q32.658 8.714 32.887 8.714Q33.051 8.714 33.172 8.821Q33.293 8.929 33.293 9.093Q33.293 9.189 33.222 9.261Q33.150 9.332 33.058 9.332Q32.958 9.332 32.888 9.259Q32.818 9.185 32.818 9.086Q32.818 9.032 32.832 9.001L32.839 8.987Q32.846 8.967 32.854 8.956Q32.863 8.946 32.866 8.939Q32.511 8.939 32.224 9.162Q32.511 9.455 32.511 9.821Q32.511 10.136 32.326 10.368Q32.142 10.601 31.853 10.729Q31.564 10.857 31.256 10.857Q31.055 10.857 30.863 10.807Q30.672 10.758 30.494 10.648Q30.402 10.775 30.402 10.918Q30.402 11.100 30.530 11.235Q30.658 11.370 30.843 11.370L31.475 11.370Q31.923 11.370 32.292 11.441Q32.661 11.513 32.921 11.742Q33.181 11.971 33.181 12.405Q33.181 12.726 32.885 12.928Q32.589 13.130 32.186 13.219Q31.783 13.308 31.468 13.308Q31.150 13.308 30.747 13.219Q30.344 13.130 30.048 12.928Q29.752 12.726 29.752 12.405M30.207 12.405Q30.207 12.634 30.426 12.783Q30.645 12.932 30.937 13Q31.229 13.068 31.468 13.068Q31.632 13.068 31.841 13.032Q32.049 12.997 32.256 12.916Q32.463 12.836 32.594 12.708Q32.726 12.580 32.726 12.405Q32.726 12.053 32.345 11.959Q31.964 11.865 31.461 11.865L30.843 11.865Q30.604 11.865 30.405 12.016Q30.207 12.166 30.207 12.405M31.256 10.618Q31.923 10.618 31.923 9.821Q31.923 9.021 31.256 9.021Q30.586 9.021 30.586 9.821Q30.586 10.618 31.256 10.618M35.525 11.872L33.789 11.872L33.789 11.592Q34.018 11.592 34.167 11.558Q34.315 11.523 34.315 11.383L34.315 9.534Q34.315 9.264 34.208 9.203Q34.100 9.141 33.789 9.141L33.789 8.861L34.818 8.786L34.818 9.493Q34.948 9.185 35.190 8.986Q35.433 8.786 35.751 8.786Q35.970 8.786 36.141 8.910Q36.312 9.035 36.312 9.247Q36.312 9.384 36.212 9.483Q36.113 9.582 35.980 9.582Q35.843 9.582 35.744 9.483Q35.645 9.384 35.645 9.247Q35.645 9.107 35.744 9.008Q35.454 9.008 35.254 9.204Q35.054 9.401 34.961 9.695Q34.869 9.989 34.869 10.269L34.869 11.383Q34.869 11.592 35.525 11.592L35.525 11.872M36.954 11.144Q36.954 10.812 37.178 10.585Q37.402 10.358 37.745 10.230Q38.089 10.101 38.461 10.049Q38.834 9.996 39.138 9.996L39.138 9.743Q39.138 9.538 39.031 9.358Q38.923 9.179 38.742 9.076Q38.561 8.974 38.352 8.974Q37.945 8.974 37.709 9.066Q37.798 9.103 37.844 9.187Q37.891 9.271 37.891 9.373Q37.891 9.469 37.844 9.548Q37.798 9.626 37.718 9.671Q37.638 9.715 37.549 9.715Q37.398 9.715 37.298 9.618Q37.197 9.520 37.197 9.373Q37.197 8.751 38.352 8.751Q38.564 8.751 38.813 8.815Q39.063 8.878 39.265 8.997Q39.466 9.117 39.593 9.302Q39.719 9.486 39.719 9.729L39.719 11.305Q39.719 11.421 39.781 11.517Q39.842 11.612 39.955 11.612Q40.064 11.612 40.129 11.518Q40.194 11.424 40.194 11.305L40.194 10.857L40.461 10.857L40.461 11.305Q40.461 11.575 40.234 11.740Q40.006 11.906 39.726 11.906Q39.518 11.906 39.381 11.752Q39.244 11.599 39.220 11.383Q39.073 11.650 38.791 11.795Q38.509 11.940 38.185 11.940Q37.908 11.940 37.624 11.865Q37.340 11.790 37.147 11.611Q36.954 11.431 36.954 11.144M37.569 11.144Q37.569 11.318 37.670 11.448Q37.771 11.578 37.927 11.648Q38.082 11.718 38.246 11.718Q38.465 11.718 38.673 11.621Q38.882 11.523 39.010 11.342Q39.138 11.161 39.138 10.935L39.138 10.207Q38.813 10.207 38.448 10.298Q38.082 10.389 37.826 10.601Q37.569 10.812 37.569 11.144M40.878 10.361Q40.878 10.023 41.018 9.732Q41.158 9.442 41.403 9.228Q41.647 9.015 41.951 8.900Q42.255 8.786 42.580 8.786Q42.850 8.786 43.113 8.885Q43.376 8.984 43.568 9.162L43.568 7.764Q43.568 7.494 43.460 7.432Q43.353 7.371 43.041 7.371L43.041 7.090L44.118 7.015L44.118 11.199Q44.118 11.387 44.173 11.470Q44.228 11.554 44.328 11.573Q44.429 11.592 44.645 11.592L44.645 11.872L43.537 11.940L43.537 11.523Q43.120 11.940 42.495 11.940Q42.064 11.940 41.691 11.728Q41.319 11.517 41.098 11.156Q40.878 10.795 40.878 10.361M42.553 11.718Q42.761 11.718 42.948 11.646Q43.134 11.575 43.288 11.438Q43.441 11.301 43.537 11.123L43.537 9.514Q43.452 9.367 43.306 9.247Q43.161 9.127 42.992 9.068Q42.823 9.008 42.642 9.008Q42.081 9.008 41.813 9.397Q41.544 9.787 41.544 10.368Q41.544 10.939 41.779 11.329Q42.013 11.718 42.553 11.718M46.911 11.872L45.359 11.872L45.359 11.592Q45.584 11.592 45.733 11.558Q45.882 11.523 45.882 11.383L45.882 9.534Q45.882 9.346 45.834 9.262Q45.786 9.179 45.689 9.160Q45.591 9.141 45.379 9.141L45.379 8.861L46.436 8.786L46.436 11.383Q46.436 11.523 46.567 11.558Q46.699 11.592 46.911 11.592L46.911 11.872M45.639 7.565Q45.639 7.394 45.762 7.275Q45.885 7.155 46.056 7.155Q46.224 7.155 46.347 7.275Q46.470 7.394 46.470 7.565Q46.470 7.740 46.347 7.863Q46.224 7.986 46.056 7.986Q45.885 7.986 45.762 7.863Q45.639 7.740 45.639 7.565M47.516 10.337Q47.516 10.016 47.640 9.727Q47.765 9.438 47.991 9.215Q48.216 8.991 48.512 8.871Q48.808 8.751 49.125 8.751Q49.454 8.751 49.715 8.851Q49.977 8.950 50.153 9.132Q50.329 9.315 50.423 9.573Q50.517 9.831 50.517 10.163Q50.517 10.255 50.435 10.276L48.179 10.276L48.179 10.337Q48.179 10.925 48.462 11.308Q48.746 11.691 49.313 11.691Q49.635 11.691 49.903 11.498Q50.171 11.305 50.260 10.990Q50.267 10.949 50.342 10.935L50.435 10.935Q50.517 10.959 50.517 11.031Q50.517 11.038 50.510 11.065Q50.397 11.462 50.026 11.701Q49.655 11.940 49.231 11.940Q48.794 11.940 48.394 11.732Q47.994 11.523 47.755 11.156Q47.516 10.789 47.516 10.337M48.186 10.067L50 10.067Q50 9.790 49.903 9.538Q49.806 9.285 49.607 9.129Q49.409 8.974 49.125 8.974Q48.849 8.974 48.635 9.132Q48.421 9.291 48.303 9.546Q48.186 9.801 48.186 10.067M52.786 11.872L51.152 11.872L51.152 11.592Q51.381 11.592 51.530 11.558Q51.679 11.523 51.679 11.383L51.679 9.534Q51.679 9.264 51.571 9.203Q51.463 9.141 51.152 9.141L51.152 8.861L52.212 8.786L52.212 9.435Q52.383 9.127 52.687 8.956Q52.991 8.786 53.336 8.786Q53.842 8.786 54.126 9.009Q54.410 9.233 54.410 9.729L54.410 11.383Q54.410 11.520 54.558 11.556Q54.707 11.592 54.933 11.592L54.933 11.872L53.302 11.872L53.302 11.592Q53.531 11.592 53.680 11.558Q53.829 11.523 53.829 11.383L53.829 9.743Q53.829 9.408 53.709 9.208Q53.589 9.008 53.275 9.008Q53.005 9.008 52.771 9.144Q52.537 9.281 52.398 9.515Q52.260 9.749 52.260 10.023L52.260 11.383Q52.260 11.520 52.410 11.556Q52.561 11.592 52.786 11.592\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 7.8 65.136)\">\u003Cpath d=\"M55.855 11.031L55.855 9.134L55.216 9.134L55.216 8.912Q55.534 8.912 55.751 8.702Q55.968 8.492 56.068 8.182Q56.169 7.873 56.169 7.565L56.436 7.565L56.436 8.854L57.513 8.854L57.513 9.134L56.436 9.134L56.436 11.018Q56.436 11.294 56.540 11.493Q56.644 11.691 56.904 11.691Q57.061 11.691 57.167 11.587Q57.273 11.482 57.323 11.329Q57.372 11.175 57.372 11.018L57.372 10.604L57.639 10.604L57.639 11.031Q57.639 11.257 57.540 11.467Q57.441 11.677 57.256 11.809Q57.072 11.940 56.843 11.940Q56.405 11.940 56.130 11.703Q55.855 11.465 55.855 11.031\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-warn)\" d=\"M-66.864 48.37 66.864-31.298\" style=\"stroke-width:.8\"\u002F>\u003Cg fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\">\u003Cg fill=\"var(--tk-warn)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"matrix(1 0 0 -1 48.82 -16.439)\">\u003Cpath d=\"M3.397 10.361Q3.397 10.033 3.532 9.732Q3.667 9.432 3.903 9.211Q4.139 8.991 4.443 8.871Q4.748 8.751 5.072 8.751Q5.578 8.751 5.927 8.854Q6.275 8.956 6.275 9.332Q6.275 9.479 6.178 9.580Q6.081 9.681 5.934 9.681Q5.780 9.681 5.681 9.582Q5.582 9.483 5.582 9.332Q5.582 9.144 5.722 9.052Q5.520 9.001 5.079 9.001Q4.724 9.001 4.495 9.197Q4.266 9.394 4.165 9.703Q4.064 10.013 4.064 10.361Q4.064 10.710 4.190 11.016Q4.317 11.322 4.572 11.506Q4.826 11.691 5.182 11.691Q5.404 11.691 5.588 11.607Q5.773 11.523 5.908 11.368Q6.043 11.212 6.101 11.004Q6.115 10.949 6.169 10.949L6.282 10.949Q6.313 10.949 6.335 10.973Q6.357 10.997 6.357 11.031L6.357 11.052Q6.272 11.339 6.084 11.537Q5.896 11.735 5.631 11.838Q5.366 11.940 5.072 11.940Q4.642 11.940 4.254 11.734Q3.866 11.527 3.632 11.164Q3.397 10.802 3.397 10.361M6.904 10.389Q6.904 10.047 7.039 9.748Q7.174 9.449 7.414 9.225Q7.653 9.001 7.971 8.876Q8.289 8.751 8.620 8.751Q9.064 8.751 9.464 8.967Q9.864 9.182 10.098 9.560Q10.333 9.937 10.333 10.389Q10.333 10.730 10.191 11.014Q10.049 11.298 9.804 11.505Q9.560 11.711 9.251 11.826Q8.941 11.940 8.620 11.940Q8.189 11.940 7.788 11.739Q7.386 11.537 7.145 11.185Q6.904 10.833 6.904 10.389M8.620 11.691Q9.222 11.691 9.446 11.313Q9.669 10.935 9.669 10.303Q9.669 9.691 9.435 9.332Q9.201 8.974 8.620 8.974Q7.567 8.974 7.567 10.303Q7.567 10.935 7.793 11.313Q8.019 11.691 8.620 11.691M10.927 11.865L10.927 10.802Q10.927 10.778 10.955 10.751Q10.982 10.724 11.006 10.724L11.115 10.724Q11.180 10.724 11.194 10.782Q11.290 11.216 11.536 11.467Q11.782 11.718 12.195 11.718Q12.537 11.718 12.790 11.585Q13.043 11.452 13.043 11.144Q13.043 10.987 12.949 10.872Q12.855 10.758 12.717 10.689Q12.578 10.621 12.411 10.583L11.830 10.484Q11.474 10.416 11.201 10.195Q10.927 9.975 10.927 9.633Q10.927 9.384 11.038 9.209Q11.149 9.035 11.336 8.936Q11.522 8.837 11.737 8.794Q11.953 8.751 12.195 8.751Q12.609 8.751 12.889 8.933L13.104 8.758Q13.115 8.755 13.122 8.753Q13.128 8.751 13.139 8.751L13.190 8.751Q13.217 8.751 13.241 8.775Q13.265 8.799 13.265 8.827L13.265 9.674Q13.265 9.695 13.241 9.722Q13.217 9.749 13.190 9.749L13.077 9.749Q13.050 9.749 13.024 9.724Q12.999 9.698 12.999 9.674Q12.999 9.438 12.893 9.274Q12.787 9.110 12.604 9.028Q12.421 8.946 12.188 8.946Q11.860 8.946 11.604 9.049Q11.348 9.151 11.348 9.428Q11.348 9.623 11.531 9.732Q11.713 9.842 11.942 9.883L12.517 9.989Q12.763 10.037 12.976 10.165Q13.190 10.293 13.327 10.496Q13.463 10.700 13.463 10.949Q13.463 11.462 13.098 11.701Q12.732 11.940 12.195 11.940Q11.700 11.940 11.368 11.646L11.102 11.920Q11.081 11.940 11.054 11.940L11.006 11.940Q10.982 11.940 10.955 11.913Q10.927 11.886 10.927 11.865M14.619 11.031L14.619 9.134L13.979 9.134L13.979 8.912Q14.297 8.912 14.514 8.702Q14.731 8.492 14.832 8.182Q14.933 7.873 14.933 7.565L15.200 7.565L15.200 8.854L16.276 8.854L16.276 9.134L15.200 9.134L15.200 11.018Q15.200 11.294 15.304 11.493Q15.408 11.691 15.668 11.691Q15.825 11.691 15.931 11.587Q16.037 11.482 16.087 11.329Q16.136 11.175 16.136 11.018L16.136 10.604L16.403 10.604L16.403 11.031Q16.403 11.257 16.304 11.467Q16.205 11.677 16.020 11.809Q15.835 11.940 15.606 11.940Q15.169 11.940 14.894 11.703Q14.619 11.465 14.619 11.031\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 48.82 -16.439)\">\u003Cpath d=\"M25.094 11.065L20.261 11.065Q20.193 11.055 20.147 11.009Q20.101 10.963 20.101 10.891Q20.101 10.826 20.147 10.780Q20.193 10.734 20.261 10.724L25.094 10.724Q25.163 10.734 25.209 10.780Q25.255 10.826 25.255 10.891Q25.255 10.963 25.209 11.009Q25.163 11.055 25.094 11.065M25.094 9.527L20.261 9.527Q20.193 9.517 20.147 9.471Q20.101 9.425 20.101 9.353Q20.101 9.209 20.261 9.185L25.094 9.185Q25.255 9.209 25.255 9.353Q25.255 9.425 25.209 9.471Q25.163 9.517 25.094 9.527\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 48.82 -16.439)\">\u003Cpath d=\"M28.760 10.361Q28.760 10.023 28.901 9.732Q29.041 9.442 29.285 9.228Q29.529 9.015 29.834 8.900Q30.138 8.786 30.463 8.786Q30.733 8.786 30.996 8.885Q31.259 8.984 31.450 9.162L31.450 7.764Q31.450 7.494 31.343 7.432Q31.235 7.371 30.924 7.371L30.924 7.090L32.001 7.015L32.001 11.199Q32.001 11.387 32.055 11.470Q32.110 11.554 32.211 11.573Q32.312 11.592 32.527 11.592L32.527 11.872L31.420 11.940L31.420 11.523Q31.003 11.940 30.377 11.940Q29.946 11.940 29.574 11.728Q29.201 11.517 28.981 11.156Q28.760 10.795 28.760 10.361M30.435 11.718Q30.644 11.718 30.830 11.646Q31.016 11.575 31.170 11.438Q31.324 11.301 31.420 11.123L31.420 9.514Q31.334 9.367 31.189 9.247Q31.044 9.127 30.874 9.068Q30.705 9.008 30.524 9.008Q29.964 9.008 29.695 9.397Q29.427 9.787 29.427 10.368Q29.427 10.939 29.661 11.329Q29.895 11.718 30.435 11.718\" fill=\"var(--tk-warn)\" stroke=\"var(--tk-warn)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-accent)\" stroke=\"none\" d=\"M29.43 9.959a2.4 2.4 0 1 1-4.8 0 2.4 2.4 0 0 1 4.8 0m-2.4 0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"m0 0 24.027 8.852\"\u002F>\u003Cpath stroke=\"none\" d=\"m27.03 9.959-5.69.632 2.687-1.739-.916-3.065\"\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=\"matrix(1 0 0 -1 30.325 21.542)\">\u003Cpath d=\"M3.572 9.479Q3.572 8.953 3.789 8.485Q4.006 8.017 4.389 7.671Q4.771 7.326 5.255 7.138Q5.739 6.950 6.269 6.950Q6.672 6.950 7.036 7.107Q7.400 7.265 7.684 7.559L8.107 6.977Q8.142 6.950 8.166 6.950L8.213 6.950Q8.244 6.950 8.268 6.974Q8.292 6.998 8.292 7.029L8.292 8.892Q8.292 8.915 8.266 8.941Q8.241 8.967 8.213 8.967L8.087 8.967Q8.025 8.967 8.012 8.892Q7.981 8.577 7.846 8.273Q7.711 7.969 7.496 7.735Q7.280 7.500 6.991 7.365Q6.703 7.230 6.375 7.230Q5.732 7.230 5.274 7.524Q4.816 7.818 4.583 8.331Q4.351 8.844 4.351 9.479Q4.351 9.951 4.481 10.360Q4.611 10.768 4.871 11.081Q5.130 11.393 5.510 11.563Q5.889 11.732 6.381 11.732Q6.709 11.732 7.003 11.616Q7.297 11.499 7.531 11.284Q7.766 11.069 7.896 10.780Q8.025 10.491 8.025 10.163Q8.025 10.136 8.053 10.112Q8.080 10.088 8.101 10.088L8.213 10.088Q8.251 10.088 8.271 10.113Q8.292 10.139 8.292 10.177Q8.292 10.573 8.126 10.910Q7.960 11.247 7.673 11.494Q7.386 11.742 7.017 11.877Q6.648 12.012 6.269 12.012Q5.749 12.012 5.257 11.822Q4.765 11.633 4.385 11.289Q4.006 10.946 3.789 10.477Q3.572 10.009 3.572 9.479M11.313 11.872L9.181 11.872L9.181 11.592Q9.902 11.592 9.902 11.383L9.902 7.582Q9.902 7.371 9.181 7.371L9.181 7.090L11.847 7.090Q12.257 7.090 12.677 7.244Q13.098 7.398 13.381 7.702Q13.665 8.006 13.665 8.420Q13.665 8.738 13.498 8.984Q13.330 9.230 13.053 9.396Q12.776 9.561 12.455 9.645Q12.134 9.729 11.847 9.729L10.592 9.729L10.592 11.383Q10.592 11.592 11.313 11.592L11.313 11.872M10.565 7.582L10.565 9.479L11.652 9.479Q12.260 9.479 12.575 9.242Q12.889 9.004 12.889 8.420Q12.889 8.027 12.744 7.793Q12.599 7.559 12.327 7.465Q12.055 7.371 11.652 7.371L10.931 7.371Q10.743 7.371 10.654 7.405Q10.565 7.439 10.565 7.582M14.646 9.507Q14.646 8.820 14.995 8.230Q15.343 7.641 15.938 7.295Q16.533 6.950 17.223 6.950Q17.914 6.950 18.508 7.295Q19.103 7.641 19.452 8.230Q19.800 8.820 19.800 9.507Q19.800 10.194 19.448 10.768Q19.096 11.342 18.503 11.677Q17.910 12.012 17.223 12.012Q16.710 12.012 16.242 11.819Q15.774 11.626 15.415 11.284Q15.056 10.942 14.851 10.481Q14.646 10.019 14.646 9.507M17.223 11.752Q17.828 11.752 18.235 11.407Q18.642 11.062 18.831 10.524Q19.021 9.985 19.021 9.387Q19.021 8.953 18.910 8.565Q18.799 8.177 18.573 7.870Q18.348 7.562 18.006 7.382Q17.664 7.203 17.223 7.203Q16.786 7.203 16.447 7.379Q16.109 7.555 15.880 7.870Q15.651 8.184 15.538 8.577Q15.425 8.970 15.425 9.387Q15.425 9.975 15.617 10.518Q15.808 11.062 16.215 11.407Q16.622 11.752 17.223 11.752\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"matrix(1 0 0 -1 30.325 21.542)\">\u003Cpath d=\"M23.314 11.865L23.314 10.802Q23.314 10.778 23.342 10.751Q23.369 10.724 23.393 10.724L23.502 10.724Q23.567 10.724 23.581 10.782Q23.677 11.216 23.923 11.467Q24.169 11.718 24.583 11.718Q24.924 11.718 25.177 11.585Q25.430 11.452 25.430 11.144Q25.430 10.987 25.336 10.872Q25.242 10.758 25.104 10.689Q24.965 10.621 24.798 10.583L24.217 10.484Q23.861 10.416 23.588 10.195Q23.314 9.975 23.314 9.633Q23.314 9.384 23.426 9.209Q23.537 9.035 23.723 8.936Q23.909 8.837 24.125 8.794Q24.340 8.751 24.583 8.751Q24.996 8.751 25.276 8.933L25.492 8.758Q25.502 8.755 25.509 8.753Q25.516 8.751 25.526 8.751L25.577 8.751Q25.604 8.751 25.628 8.775Q25.652 8.799 25.652 8.827L25.652 9.674Q25.652 9.695 25.628 9.722Q25.604 9.749 25.577 9.749L25.464 9.749Q25.437 9.749 25.411 9.724Q25.386 9.698 25.386 9.674Q25.386 9.438 25.280 9.274Q25.174 9.110 24.991 9.028Q24.808 8.946 24.576 8.946Q24.248 8.946 23.991 9.049Q23.735 9.151 23.735 9.428Q23.735 9.623 23.918 9.732Q24.101 9.842 24.330 9.883L24.904 9.989Q25.150 10.037 25.364 10.165Q25.577 10.293 25.714 10.496Q25.851 10.700 25.851 10.949Q25.851 11.462 25.485 11.701Q25.119 11.940 24.583 11.940Q24.087 11.940 23.755 11.646L23.489 11.920Q23.468 11.940 23.441 11.940L23.393 11.940Q23.369 11.940 23.342 11.913Q23.314 11.886 23.314 11.865M27.006 11.031L27.006 9.134L26.367 9.134L26.367 8.912Q26.685 8.912 26.902 8.702Q27.119 8.492 27.219 8.182Q27.320 7.873 27.320 7.565L27.587 7.565L27.587 8.854L28.664 8.854L28.664 9.134L27.587 9.134L27.587 11.018Q27.587 11.294 27.691 11.493Q27.795 11.691 28.055 11.691Q28.212 11.691 28.318 11.587Q28.424 11.482 28.474 11.329Q28.523 11.175 28.523 11.018L28.523 10.604L28.790 10.604L28.790 11.031Q28.790 11.257 28.691 11.467Q28.592 11.677 28.407 11.809Q28.223 11.940 27.994 11.940Q27.556 11.940 27.281 11.703Q27.006 11.465 27.006 11.031M29.559 10.337Q29.559 10.016 29.684 9.727Q29.809 9.438 30.034 9.215Q30.260 8.991 30.555 8.871Q30.851 8.751 31.169 8.751Q31.497 8.751 31.759 8.851Q32.020 8.950 32.196 9.132Q32.372 9.315 32.466 9.573Q32.560 9.831 32.560 10.163Q32.560 10.255 32.478 10.276L30.222 10.276L30.222 10.337Q30.222 10.925 30.506 11.308Q30.790 11.691 31.357 11.691Q31.678 11.691 31.947 11.498Q32.215 11.305 32.304 10.990Q32.311 10.949 32.386 10.935L32.478 10.935Q32.560 10.959 32.560 11.031Q32.560 11.038 32.553 11.065Q32.440 11.462 32.070 11.701Q31.699 11.940 31.275 11.940Q30.837 11.940 30.438 11.732Q30.038 11.523 29.798 11.156Q29.559 10.789 29.559 10.337M30.229 10.067L32.044 10.067Q32.044 9.790 31.947 9.538Q31.849 9.285 31.651 9.129Q31.453 8.974 31.169 8.974Q30.892 8.974 30.678 9.132Q30.465 9.291 30.347 9.546Q30.229 9.801 30.229 10.067M34.792 13.229L33.162 13.229L33.162 12.949Q33.391 12.949 33.539 12.914Q33.688 12.880 33.688 12.740L33.688 9.394Q33.688 9.223 33.551 9.182Q33.415 9.141 33.162 9.141L33.162 8.861L34.242 8.786L34.242 9.192Q34.464 8.991 34.751 8.888Q35.038 8.786 35.346 8.786Q35.773 8.786 36.137 8.999Q36.501 9.213 36.715 9.577Q36.928 9.941 36.928 10.361Q36.928 10.806 36.689 11.170Q36.450 11.534 36.057 11.737Q35.664 11.940 35.219 11.940Q34.953 11.940 34.705 11.840Q34.457 11.739 34.269 11.558L34.269 12.740Q34.269 12.877 34.418 12.913Q34.566 12.949 34.792 12.949L34.792 13.229M34.269 9.541L34.269 11.151Q34.402 11.404 34.645 11.561Q34.888 11.718 35.165 11.718Q35.493 11.718 35.746 11.517Q35.999 11.315 36.132 10.997Q36.265 10.679 36.265 10.361Q36.265 10.132 36.200 9.903Q36.135 9.674 36.007 9.476Q35.879 9.278 35.684 9.158Q35.489 9.039 35.257 9.039Q34.963 9.039 34.695 9.168Q34.426 9.298 34.269 9.541\" 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\">One CPO update. Inside the KL trust region (circle) around the current policy, the cost constraint cuts off the half that would overspend the budget d; CPO takes the highest-reward point in the surviving feasible wedge, so the step improves reward while keeping the policy approximately within cost.\u003C\u002Ffigcaption>",1785117800200]