[{"data":1,"prerenderedAt":13747},["ShallowReactive",2],{"nav:calculus":3,"lesson:\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":311,"course-wordcounts":8298,"ref-card-index":9210,"tikz:a55093c3664b51f2d19bf634855d1362ee021889bcf3cede1ee785cb6b3fb7a0":13744,"tikz:77254a95a90295fcc012405d0b026da73ef16f2947069911122cdb2bc12bab93":13745,"tikz:00e45214c86af3dd0f02cfd5e2793c2f9d2f059633d82d351233b42f65958990":13746},[4,32,56,80,99,119,142,167,187,217,247,276],{"module":5,"moduleNumber":6,"slug":7,"lessons":8},"Limits and Continuity",1,"limits-and-continuity",[9,14,20,26],{"title":10,"path":11,"lessonNumber":6,"topics":12,"summary":13},"Functions and Mathematical Models","\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models",[5],"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",{"title":15,"path":16,"lessonNumber":17,"topics":18,"summary":19},"The Limit of a Function","\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function",2,[5],"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",{"title":21,"path":22,"lessonNumber":23,"topics":24,"summary":25},"Limit Laws and the ε–δ Definition","\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition",3,[5],"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",{"title":27,"path":28,"lessonNumber":29,"topics":30,"summary":31},"Continuity","\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity",4,[5],"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",{"module":33,"moduleNumber":17,"slug":34,"lessons":35},"Derivatives","derivatives",[36,41,46,51],{"title":37,"path":38,"lessonNumber":6,"topics":39,"summary":40},"The Derivative and Rates of Change","\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change",[33],"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",{"title":42,"path":43,"lessonNumber":17,"topics":44,"summary":45},"Differentiation Rules and the Chain Rule","\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule",[33],"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",{"title":47,"path":48,"lessonNumber":23,"topics":49,"summary":50},"Implicit Differentiation and Related Rates","\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates",[33],"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",{"title":52,"path":53,"lessonNumber":29,"topics":54,"summary":55},"Linear Approximations and Differentials","\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials",[33],"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",{"module":57,"moduleNumber":23,"slug":58,"lessons":59},"Applications of Derivatives","applications-of-derivatives",[60,65,70,75],{"title":61,"path":62,"lessonNumber":6,"topics":63,"summary":64},"Extrema and the Mean Value Theorem","\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem",[57],"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",{"title":66,"path":67,"lessonNumber":17,"topics":68,"summary":69},"How Derivatives Shape a Graph","\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph",[57],"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",{"title":71,"path":72,"lessonNumber":23,"topics":73,"summary":74},"Curve Sketching and Optimization","\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization",[57],"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",{"title":76,"path":77,"lessonNumber":29,"topics":78,"summary":79},"Newton's Method and Antiderivatives","\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives",[57],"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",{"module":81,"moduleNumber":29,"slug":82,"lessons":83},"Integrals","integrals",[84,89,94],{"title":85,"path":86,"lessonNumber":6,"topics":87,"summary":88},"Area and the Definite Integral","\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral",[81],"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",{"title":90,"path":91,"lessonNumber":17,"topics":92,"summary":93},"The Fundamental Theorem of Calculus","\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus",[81],"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",{"title":95,"path":96,"lessonNumber":23,"topics":97,"summary":98},"The Substitution Rule","\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule",[81],"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",{"module":100,"moduleNumber":101,"slug":102,"lessons":103},"Applications of Integration",5,"applications-of-integration",[104,109,114],{"title":105,"path":106,"lessonNumber":6,"topics":107,"summary":108},"Areas Between Curves and Volumes","\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes",[100],"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",{"title":110,"path":111,"lessonNumber":17,"topics":112,"summary":113},"Work, Average Value, Arc Length, and Surface Area","\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length",[100],"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",{"title":115,"path":116,"lessonNumber":23,"topics":117,"summary":118},"Applications to Physics, Economics, and Probability","\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability",[100],"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",{"module":120,"moduleNumber":121,"slug":122,"lessons":123},"Exponential, Logarithmic, and Inverse Functions",6,"exponential-logarithmic-and-inverse-functions",[124,132,137],{"title":125,"path":126,"lessonNumber":6,"topics":127,"summary":131},"Inverse Functions, Logarithms, and Exponentials","\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials",[128,129,130],"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",{"title":133,"path":134,"lessonNumber":17,"topics":135,"summary":136},"Growth, Decay, Inverse Trigonometric, and Hyperbolic Functions","\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions",[128,129,130],"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",{"title":138,"path":139,"lessonNumber":23,"topics":140,"summary":141},"Indeterminate Forms and l'Hospital's Rule","\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule",[128,129,130],"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",{"module":143,"moduleNumber":144,"slug":145,"lessons":146},"Techniques of Integration",7,"techniques-of-integration",[147,152,157,162],{"title":148,"path":149,"lessonNumber":6,"topics":150,"summary":151},"Integration by Parts","\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts",[143],"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",{"title":153,"path":154,"lessonNumber":17,"topics":155,"summary":156},"Trigonometric Integrals and Substitution","\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution",[143],"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",{"title":158,"path":159,"lessonNumber":23,"topics":160,"summary":161},"Partial Fractions and Integration Strategy","\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy",[143],"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",{"title":163,"path":164,"lessonNumber":29,"topics":165,"summary":166},"Approximate and Improper Integrals","\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals",[143],"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",{"module":168,"moduleNumber":169,"slug":170,"lessons":171},"Parametric Equations and Polar Coordinates",8,"parametric-and-polar",[172,177,182],{"title":173,"path":174,"lessonNumber":6,"topics":175,"summary":176},"Parametric Curves and Their Calculus","\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus",[168],"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",{"title":178,"path":179,"lessonNumber":17,"topics":180,"summary":181},"Polar Coordinates","\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates",[168],"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",{"title":183,"path":184,"lessonNumber":23,"topics":185,"summary":186},"Conic Sections","\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections",[168],"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",{"module":188,"moduleNumber":189,"slug":190,"lessons":191},"Infinite Sequences and Series",9,"sequences-and-series",[192,197,202,207,212],{"title":193,"path":194,"lessonNumber":6,"topics":195,"summary":196},"Sequences","\u002Fcalculus\u002Fsequences-and-series\u002Fsequences",[188],"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",{"title":198,"path":199,"lessonNumber":17,"topics":200,"summary":201},"Series and the Integral Test","\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test",[188],"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",{"title":203,"path":204,"lessonNumber":23,"topics":205,"summary":206},"The Convergence Tests","\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests",[188],"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",{"title":208,"path":209,"lessonNumber":29,"topics":210,"summary":211},"Power Series","\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series",[188],"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",{"title":213,"path":214,"lessonNumber":101,"topics":215,"summary":216},"Taylor and Maclaurin Series","\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series",[188],"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",{"module":218,"moduleNumber":219,"slug":220,"lessons":221},"Vectors and the Geometry of Space",10,"vectors-and-space-curves",[222,227,232,237,242],{"title":223,"path":224,"lessonNumber":6,"topics":225,"summary":226},"Three-Dimensional Coordinates, Vectors, and the Dot Product","\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product",[218],"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",{"title":228,"path":229,"lessonNumber":17,"topics":230,"summary":231},"The Cross Product, Lines, and Planes","\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes",[218],"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",{"title":233,"path":234,"lessonNumber":23,"topics":235,"summary":236},"Cylinders and Quadric Surfaces","\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces",[218],"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",{"title":238,"path":239,"lessonNumber":29,"topics":240,"summary":241},"Vector Functions and Space Curves","\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves",[218],"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",{"title":243,"path":244,"lessonNumber":101,"topics":245,"summary":246},"Arc Length, Curvature, and Motion in Space","\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion",[218],"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",{"module":248,"moduleNumber":249,"slug":250,"lessons":251},"Partial Derivatives",11,"partial-derivatives",[252,257,261,266,271],{"title":253,"path":254,"lessonNumber":6,"topics":255,"summary":256},"Functions of Several Variables, Limits, and Continuity","\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables",[248],"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",{"title":248,"path":258,"lessonNumber":17,"topics":259,"summary":260},"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives",[248],"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",{"title":262,"path":263,"lessonNumber":23,"topics":264,"summary":265},"Tangent Planes, Linear Approximation, and the Chain Rule","\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule",[248],"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",{"title":267,"path":268,"lessonNumber":29,"topics":269,"summary":270},"Directional Derivatives and the Gradient","\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient",[248],"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",{"title":272,"path":273,"lessonNumber":101,"topics":274,"summary":275},"Optimization and Lagrange Multipliers","\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers",[248],"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",{"module":277,"moduleNumber":278,"slug":279,"lessons":280},"Multiple Integrals and Vector Calculus",12,"multiple-integrals-and-vector-calculus",[281,286,291,296,301,306],{"title":282,"path":283,"lessonNumber":6,"topics":284,"summary":285},"Double Integrals","\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals",[277],"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",{"title":287,"path":288,"lessonNumber":17,"topics":289,"summary":290},"Triple Integrals and Coordinate Systems","\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems",[277],"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",{"title":292,"path":293,"lessonNumber":23,"topics":294,"summary":295},"Vector Fields and Line Integrals","\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals",[277],"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",{"title":297,"path":298,"lessonNumber":29,"topics":299,"summary":300},"Green's Theorem, Curl, and Divergence","\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence",[277],"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",{"title":302,"path":303,"lessonNumber":101,"topics":304,"summary":305},"Parametric Surfaces and Surface Integrals","\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals",[277],"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",{"title":307,"path":308,"lessonNumber":121,"topics":309,"summary":310},"Stokes' Theorem and the Divergence Theorem","\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem",[277],"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",{"id":312,"title":307,"blurb":313,"body":314,"brief":8272,"category":8273,"description":8274,"draft":8275,"extension":8276,"meta":8277,"module":277,"navigation":8279,"path":308,"practice":8280,"rawbody":8281,"readingTime":8282,"seo":8287,"sources":8288,"status":8294,"stem":8295,"summary":310,"topics":8296,"__hash__":8297},"course\u002F01.calculus\u002F12.multiple-integrals-and-vector-calculus\u002F06.stokes-and-the-divergence-theorem.md","",{"type":315,"value":316,"toc":8265},"minimark",[317,334,338,534,1017,1405,1409,1641,3735,3739,3779,4159,4267,4270,4959,5614,5618,5717,5959,5962,5965,5968,7840,8019,8023,8240],[318,319,320,324,325,329,330,333],"p",{},[321,322,323],"a",{"href":298},"Green's Theorem","\nhad two vector forms in the plane: circulation around a boundary curve equals\nintegrated curl over the region, and flux across the boundary equals integrated\ndivergence. Each lifts into three dimensions. The circulation form becomes\n",[326,327,328],"strong",{},"Stokes' Theorem",", with the flat region replaced by a surface in space and its\nboundary a space curve. The flux form becomes the ",[326,331,332],{},"Divergence Theorem",", with\nthe plane region replaced by a solid and its boundary a closed surface. All\nfour fundamental theorems are the same statement at different dimensions.",[335,336,328],"h2",{"id":337},"stokes-theorem",[318,339,340,341,367,368,385,386,401,402,457,458,473,474,517,518,533],{},"A surface ",[342,343,346],"span",{"className":344},[345],"katex",[342,347,351],{"className":348,"ariaHidden":350},[349],"katex-html","true",[342,352,355,360],{"className":353},[354],"base",[342,356],{"className":357,"style":359},[358],"strut","height:0.6833em;",[342,361,366],{"className":362,"style":365},[363,364],"mord","mathnormal","margin-right:0.0576em;","S"," in space has a boundary curve ",[342,369,371],{"className":370},[345],[342,372,374],{"className":373,"ariaHidden":350},[349],[342,375,377,380],{"className":376},[354],[342,378],{"className":379,"style":359},[358],[342,381,384],{"className":382,"style":383},[363,364],"margin-right:0.0715em;","C",", the edge where the surface stops.\nAn orientation of ",[342,387,389],{"className":388},[345],[342,390,392],{"className":391,"ariaHidden":350},[349],[342,393,395,398],{"className":394},[354],[342,396],{"className":397,"style":359},[358],[342,399,366],{"className":400,"style":365},[363,364]," (a choice of unit normal ",[342,403,405],{"className":404},[345],[342,406,408],{"className":407,"ariaHidden":350},[349],[342,409,411,415],{"className":410},[354],[342,412],{"className":413,"style":414},[358],"height:0.6944em;",[342,416,419],{"className":417},[363,418],"accent",[342,420,423],{"className":421},[422],"vlist-t",[342,424,427],{"className":425},[426],"vlist-r",[342,428,431,443],{"className":429,"style":414},[430],"vlist",[342,432,434,439],{"style":433},"top:-3em;",[342,435],{"className":436,"style":438},[437],"pstrut","height:3em;",[342,440,442],{"className":441},[363,364],"n",[342,444,445,448],{"style":433},[342,446],{"className":447,"style":438},[437],[342,449,453],{"className":450,"style":452},[451],"accent-body","left:-0.25em;",[342,454,456],{"className":455},[363],"^",") induces a positive\norientation of ",[342,459,461],{"className":460},[345],[342,462,464],{"className":463,"ariaHidden":350},[349],[342,465,467,470],{"className":466},[354],[342,468],{"className":469,"style":359},[358],[342,471,384],{"className":472,"style":383},[363,364]," by the right-hand rule: point the thumb along ",[342,475,477],{"className":476},[345],[342,478,480],{"className":479,"ariaHidden":350},[349],[342,481,483,486],{"className":482},[354],[342,484],{"className":485,"style":414},[358],[342,487,489],{"className":488},[363,418],[342,490,492],{"className":491},[422],[342,493,495],{"className":494},[426],[342,496,498,506],{"className":497,"style":414},[430],[342,499,500,503],{"style":433},[342,501],{"className":502,"style":438},[437],[342,504,442],{"className":505},[363,364],[342,507,508,511],{"style":433},[342,509],{"className":510,"style":438},[437],[342,512,514],{"className":513,"style":452},[451],[342,515,456],{"className":516},[363]," and\nthe fingers curl in the direction ",[342,519,521],{"className":520},[345],[342,522,524],{"className":523,"ariaHidden":350},[349],[342,525,527,530],{"className":526},[354],[342,528],{"className":529,"style":359},[358],[342,531,384],{"className":532,"style":383},[363,364]," is traced.",[535,536,538,656],"callout",{"type":537},"theorem",[318,539,540,543,544,559,560,575,576,639,640,655],{},[326,541,542],{},"Theorem (Stokes)."," Let ",[342,545,547],{"className":546},[345],[342,548,550],{"className":549,"ariaHidden":350},[349],[342,551,553,556],{"className":552},[354],[342,554],{"className":555,"style":359},[358],[342,557,366],{"className":558,"style":365},[363,364]," be an oriented, piecewise-smooth surface bounded\nby a simple, closed, piecewise-smooth boundary curve ",[342,561,563],{"className":562},[345],[342,564,566],{"className":565,"ariaHidden":350},[349],[342,567,569,572],{"className":568},[354],[342,570],{"className":571,"style":359},[358],[342,573,384],{"className":574,"style":383},[363,364]," with positive\norientation. If ",[342,577,579],{"className":578},[345],[342,580,582],{"className":581,"ariaHidden":350},[349],[342,583,585,589],{"className":584},[354],[342,586],{"className":587,"style":588},[358],"height:0.9663em;",[342,590,592],{"className":591},[363,418],[342,593,595],{"className":594},[422],[342,596,598],{"className":597},[426],[342,599,601,611],{"className":600,"style":588},[430],[342,602,603,606],{"style":433},[342,604],{"className":605,"style":438},[437],[342,607,610],{"className":608,"style":609},[363,364],"margin-right:0.1389em;","F",[342,612,614,617],{"style":613},"top:-3.2523em;",[342,615],{"className":616,"style":438},[437],[342,618,621],{"className":619,"style":620},[451],"left:-0.1522em;",[342,622,626],{"className":623,"style":625},[624],"overlay","height:0.714em;width:0.471em;",[627,628,635],"svg",{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg","0.471em","0.714em","width:0.471em","0 0 471 714","xMinYMin",[636,637],"path",{"d":638},"M377 20c0-5.333 1.833-10 5.5-14S391 0 397 0c4.667 0 8.667 1.667 12 5\n3.333 2.667 6.667 9 10 19 6.667 24.667 20.333 43.667 41 57 7.333 4.667 11\n10.667 11 18 0 6-1 10-3 12s-6.667 5-14 9c-28.667 14.667-53.667 35.667-75 63\n-1.333 1.333-3.167 3.5-5.5 6.5s-4 4.833-5 5.5c-1 .667-2.5 1.333-4.5 2s-4.333 1\n-7 1c-4.667 0-9.167-1.833-13.5-5.5S337 184 337 178c0-12.667 15.667-32.333 47-59\nH213l-171-1c-8.667-6-13-12.333-13-19 0-4.667 4.333-11.333 13-20h359\nc-16-25.333-24-45-24-59z"," has continuous partial derivatives on an open region\ncontaining ",[342,641,643],{"className":642},[345],[342,644,646],{"className":645,"ariaHidden":350},[349],[342,647,649,652],{"className":648},[354],[342,650],{"className":651,"style":359},[358],[342,653,366],{"className":654,"style":365},[363,364],", then",[342,657,660],{"className":658},[659],"katex-display",[342,661,663],{"className":662},[345],[342,664,666,790,852,969],{"className":665,"ariaHidden":350},[349],[342,667,669,673,735,740,775,779,784,787],{"className":668},[354],[342,670],{"className":671,"style":672},[358],"height:2.9666em;vertical-align:-1.6055em;",[342,674,678],{"className":675},[676,677],"mop","op-limits",[342,679,682,726],{"className":680},[422,681],"vlist-t2",[342,683,685,721],{"className":684},[426],[342,686,689,706],{"className":687,"style":688},[430],"height:1.3611em;",[342,690,692,696],{"style":691},"top:-1.8545em;margin-left:-0.4445em;",[342,693],{"className":694,"style":695},[437],"height:3.36em;",[342,697,703],{"className":698},[699,700,701,702],"sizing","reset-size6","size3","mtight",[342,704,384],{"className":705,"style":383},[363,364,702],[342,707,709,712],{"style":708},"top:-3.3611em;",[342,710],{"className":711,"style":695},[437],[342,713,714],{},[342,715,720],{"className":716,"style":719},[676,717,718],"op-symbol","large-op","margin-right:0.4445em;","∮",[342,722,725],{"className":723},[724],"vlist-s","​",[342,727,729],{"className":728},[426],[342,730,733],{"className":731,"style":732},[430],"height:1.6055em;",[342,734],{},[342,736],{"className":737,"style":739},[738],"mspace","margin-right:0.1667em;",[342,741,743],{"className":742},[363,418],[342,744,746],{"className":745},[422],[342,747,749],{"className":748},[426],[342,750,752,760],{"className":751,"style":588},[430],[342,753,754,757],{"style":433},[342,755],{"className":756,"style":438},[437],[342,758,610],{"className":759,"style":609},[363,364],[342,761,762,765],{"style":613},[342,763],{"className":764,"style":438},[437],[342,766,768],{"className":767,"style":620},[451],[342,769,771],{"className":770,"style":625},[624],[627,772,773],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,774],{"d":638},[342,776],{"className":777,"style":778},[738],"margin-right:0.2222em;",[342,780,783],{"className":781},[782],"mbin","⋅",[342,785],{"className":786,"style":739},[738],[342,788],{"className":789,"style":778},[738],[342,791,793,797,802,840,844,849],{"className":792},[354],[342,794],{"className":795,"style":796},[358],"height:0.714em;",[342,798,801],{"className":799},[363,800],"mathbf","d",[342,803,805],{"className":804},[363,418],[342,806,808],{"className":807},[422],[342,809,811],{"className":810},[426],[342,812,814,824],{"className":813,"style":796},[430],[342,815,816,819],{"style":433},[342,817],{"className":818,"style":438},[437],[342,820,823],{"className":821,"style":822},[363,364],"margin-right:0.0278em;","r",[342,825,826,829],{"style":433},[342,827],{"className":828,"style":438},[437],[342,830,833],{"className":831,"style":832},[451],"left:-0.1799em;",[342,834,836],{"className":835,"style":625},[624],[627,837,838],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,839],{"d":638},[342,841],{"className":842,"style":843},[738],"margin-right:0.2778em;",[342,845,848],{"className":846},[847],"mrel","=",[342,850],{"className":851,"style":843},[738],[342,853,855,859,908,911,919,922,957,960,963,966],{"className":854},[354],[342,856],{"className":857,"style":858},[358],"height:2.9663em;vertical-align:-1.6053em;",[342,860,862],{"className":861},[676,677],[342,863,865,899],{"className":864},[422,681],[342,866,868,896],{"className":867},[426],[342,869,872,884],{"className":870,"style":871},[430],"height:1.361em;",[342,873,875,878],{"style":874},"top:-1.8547em;margin-left:-0.4445em;",[342,876],{"className":877,"style":695},[437],[342,879,881],{"className":880},[699,700,701,702],[342,882,366],{"className":883,"style":365},[363,364,702],[342,885,887,890],{"style":886},"top:-3.361em;",[342,888],{"className":889,"style":695},[437],[342,891,892],{},[342,893,895],{"className":894,"style":719},[676,717,718],"∬",[342,897,725],{"className":898},[724],[342,900,902],{"className":901},[426],[342,903,906],{"className":904,"style":905},[430],"height:1.6053em;",[342,907],{},[342,909],{"className":910,"style":739},[738],[342,912,914],{"className":913},[676],[342,915,918],{"className":916},[363,917],"mathrm","curl",[342,920],{"className":921,"style":739},[738],[342,923,925],{"className":924},[363,418],[342,926,928],{"className":927},[422],[342,929,931],{"className":930},[426],[342,932,934,942],{"className":933,"style":588},[430],[342,935,936,939],{"style":433},[342,937],{"className":938,"style":438},[437],[342,940,610],{"className":941,"style":609},[363,364],[342,943,944,947],{"style":613},[342,945],{"className":946,"style":438},[437],[342,948,950],{"className":949,"style":620},[451],[342,951,953],{"className":952,"style":625},[624],[627,954,955],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,956],{"d":638},[342,958],{"className":959,"style":778},[738],[342,961,783],{"className":962},[782],[342,964],{"className":965,"style":739},[738],[342,967],{"className":968,"style":778},[738],[342,970,972,975,978,1013],{"className":971},[354],[342,973],{"className":974,"style":588},[358],[342,976,801],{"className":977},[363,800],[342,979,981],{"className":980},[363,418],[342,982,984],{"className":983},[422],[342,985,987],{"className":986},[426],[342,988,990,998],{"className":989,"style":588},[430],[342,991,992,995],{"style":433},[342,993],{"className":994,"style":438},[437],[342,996,366],{"className":997,"style":365},[363,364],[342,999,1000,1003],{"style":613},[342,1001],{"className":1002,"style":438},[437],[342,1004,1006],{"className":1005,"style":620},[451],[342,1007,1009],{"className":1008,"style":625},[624],[627,1010,1011],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1012],{"d":638},[342,1014,1016],{"className":1015},[363],".",[318,1018,1019,1020,1067,1068,1083,1084,1140,1141,1156,1157,1179,1180,1227,1228,1404],{},"The line integral around the boundary of the tangential component of ",[342,1021,1023],{"className":1022},[345],[342,1024,1026],{"className":1025,"ariaHidden":350},[349],[342,1027,1029,1032],{"className":1028},[354],[342,1030],{"className":1031,"style":588},[358],[342,1033,1035],{"className":1034},[363,418],[342,1036,1038],{"className":1037},[422],[342,1039,1041],{"className":1040},[426],[342,1042,1044,1052],{"className":1043,"style":588},[430],[342,1045,1046,1049],{"style":433},[342,1047],{"className":1048,"style":438},[437],[342,1050,610],{"className":1051,"style":609},[363,364],[342,1053,1054,1057],{"style":613},[342,1055],{"className":1056,"style":438},[437],[342,1058,1060],{"className":1059,"style":620},[451],[342,1061,1063],{"className":1062,"style":625},[624],[627,1064,1065],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1066],{"d":638},"\nequals the surface integral over ",[342,1069,1071],{"className":1070},[345],[342,1072,1074],{"className":1073,"ariaHidden":350},[349],[342,1075,1077,1080],{"className":1076},[354],[342,1078],{"className":1079,"style":359},[358],[342,1081,366],{"className":1082,"style":365},[363,364]," of the normal component of\n",[342,1085,1087],{"className":1086},[345],[342,1088,1090],{"className":1089,"ariaHidden":350},[349],[342,1091,1093,1096,1102,1105],{"className":1092},[354],[342,1094],{"className":1095,"style":588},[358],[342,1097,1099],{"className":1098},[676],[342,1100,918],{"className":1101},[363,917],[342,1103],{"className":1104,"style":739},[738],[342,1106,1108],{"className":1107},[363,418],[342,1109,1111],{"className":1110},[422],[342,1112,1114],{"className":1113},[426],[342,1115,1117,1125],{"className":1116,"style":588},[430],[342,1118,1119,1122],{"style":433},[342,1120],{"className":1121,"style":438},[437],[342,1123,610],{"className":1124,"style":609},[363,364],[342,1126,1127,1130],{"style":613},[342,1128],{"className":1129,"style":438},[437],[342,1131,1133],{"className":1132,"style":620},[451],[342,1134,1136],{"className":1135,"style":625},[624],[627,1137,1138],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1139],{"d":638},". When ",[342,1142,1144],{"className":1143},[345],[342,1145,1147],{"className":1146,"ariaHidden":350},[349],[342,1148,1150,1153],{"className":1149},[354],[342,1151],{"className":1152,"style":359},[358],[342,1154,366],{"className":1155,"style":365},[363,364]," is a flat region in the ",[342,1158,1160],{"className":1159},[345],[342,1161,1163],{"className":1162,"ariaHidden":350},[349],[342,1164,1166,1170,1174],{"className":1165},[354],[342,1167],{"className":1168,"style":1169},[358],"height:0.625em;vertical-align:-0.1944em;",[342,1171,1173],{"className":1172},[363,364],"x",[342,1175,1178],{"className":1176,"style":1177},[363,364],"margin-right:0.0359em;","y","-plane with\nupward normal ",[342,1181,1183],{"className":1182},[345],[342,1184,1186],{"className":1185,"ariaHidden":350},[349],[342,1187,1189,1193],{"className":1188},[354],[342,1190],{"className":1191,"style":1192},[358],"height:0.9579em;",[342,1194,1196],{"className":1195},[363,418],[342,1197,1199],{"className":1198},[422],[342,1200,1202],{"className":1201},[426],[342,1203,1205,1215],{"className":1204,"style":1192},[430],[342,1206,1207,1210],{"style":433},[342,1208],{"className":1209,"style":438},[437],[342,1211,1214],{"className":1212,"style":1213},[363,364],"margin-right:0.0315em;","k",[342,1216,1218,1221],{"style":1217},"top:-3.2634em;",[342,1219],{"className":1220,"style":438},[437],[342,1222,1224],{"className":1223,"style":452},[451],[342,1225,456],{"className":1226},[363],", the right side is\n",[342,1229,1231],{"className":1230},[345],[342,1232,1234,1354],{"className":1233,"ariaHidden":350},[349],[342,1235,1237,1241,1291,1296,1302,1305,1340,1345,1348,1351],{"className":1236},[354],[342,1238],{"className":1239,"style":1240},[358],"height:2.0162em;vertical-align:-1.0498em;",[342,1242,1244],{"className":1243},[676,677],[342,1245,1247,1282],{"className":1246},[422,681],[342,1248,1250,1279],{"className":1249},[426],[342,1251,1254,1266],{"className":1252,"style":1253},[430],"height:0.8055em;",[342,1255,1257,1260],{"style":1256},"top:-2.0502em;margin-left:-0.1945em;",[342,1258],{"className":1259,"style":438},[437],[342,1261,1263],{"className":1262},[699,700,701,702],[342,1264,366],{"className":1265,"style":365},[363,364,702],[342,1267,1269,1272],{"style":1268},"top:-3.0005em;",[342,1270],{"className":1271,"style":438},[437],[342,1273,1274],{},[342,1275,895],{"className":1276,"style":1278},[676,717,1277],"small-op","margin-right:0.1945em;",[342,1280,725],{"className":1281},[724],[342,1283,1285],{"className":1284},[426],[342,1286,1289],{"className":1287,"style":1288},[430],"height:1.0498em;",[342,1290],{},[342,1292,1295],{"className":1293},[1294],"mopen","(",[342,1297,1299],{"className":1298},[676],[342,1300,918],{"className":1301},[363,917],[342,1303],{"className":1304,"style":739},[738],[342,1306,1308],{"className":1307},[363,418],[342,1309,1311],{"className":1310},[422],[342,1312,1314],{"className":1313},[426],[342,1315,1317,1325],{"className":1316,"style":588},[430],[342,1318,1319,1322],{"style":433},[342,1320],{"className":1321,"style":438},[437],[342,1323,610],{"className":1324,"style":609},[363,364],[342,1326,1327,1330],{"style":613},[342,1328],{"className":1329,"style":438},[437],[342,1331,1333],{"className":1332,"style":620},[451],[342,1334,1336],{"className":1335,"style":625},[624],[627,1337,1338],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1339],{"d":638},[342,1341,1344],{"className":1342},[1343],"mclose",")",[342,1346],{"className":1347,"style":778},[738],[342,1349,783],{"className":1350},[782],[342,1352],{"className":1353,"style":778},[738],[342,1355,1357,1360,1391,1394,1397,1400],{"className":1356},[354],[342,1358],{"className":1359,"style":1192},[358],[342,1361,1363],{"className":1362},[363,418],[342,1364,1366],{"className":1365},[422],[342,1367,1369],{"className":1368},[426],[342,1370,1372,1380],{"className":1371,"style":1192},[430],[342,1373,1374,1377],{"style":433},[342,1375],{"className":1376,"style":438},[437],[342,1378,1214],{"className":1379,"style":1213},[363,364],[342,1381,1382,1385],{"style":1217},[342,1383],{"className":1384,"style":438},[437],[342,1386,1388],{"className":1387,"style":452},[451],[342,1389,456],{"className":1390},[363],[342,1392],{"className":1393,"style":739},[738],[342,1395],{"className":1396,"style":739},[738],[342,1398,801],{"className":1399},[363,800],[342,1401,1403],{"className":1402},[363,364],"A"," and the statement is\nexactly Green's Theorem. Stokes' Theorem is Green's Theorem for a curved surface.",[1406,1407],"tikz-figure",{"hash":1408},"a55093c3664b51f2d19bf634855d1362ee021889bcf3cede1ee785cb6b3fb7a0",[318,1410,1411,1412,1427,1428,1484,1485,1640],{},"A consequence: if two surfaces share the same boundary curve ",[342,1413,1415],{"className":1414},[345],[342,1416,1418],{"className":1417,"ariaHidden":350},[349],[342,1419,1421,1424],{"className":1420},[354],[342,1422],{"className":1423,"style":359},[358],[342,1425,384],{"className":1426,"style":383},[363,364],", then the flux of\n",[342,1429,1431],{"className":1430},[345],[342,1432,1434],{"className":1433,"ariaHidden":350},[349],[342,1435,1437,1440,1446,1449],{"className":1436},[354],[342,1438],{"className":1439,"style":588},[358],[342,1441,1443],{"className":1442},[676],[342,1444,918],{"className":1445},[363,917],[342,1447],{"className":1448,"style":739},[738],[342,1450,1452],{"className":1451},[363,418],[342,1453,1455],{"className":1454},[422],[342,1456,1458],{"className":1457},[426],[342,1459,1461,1469],{"className":1460,"style":588},[430],[342,1462,1463,1466],{"style":433},[342,1464],{"className":1465,"style":438},[437],[342,1467,610],{"className":1468,"style":609},[363,364],[342,1470,1471,1474],{"style":613},[342,1472],{"className":1473,"style":438},[437],[342,1475,1477],{"className":1476,"style":620},[451],[342,1478,1480],{"className":1479,"style":625},[624],[627,1481,1482],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1483],{"d":638}," through them is equal, because both equal\n",[342,1486,1488],{"className":1487},[345],[342,1489,1491,1596],{"className":1490,"ariaHidden":350},[349],[342,1492,1494,1498,1546,1549,1584,1587,1590,1593],{"className":1493},[354],[342,1495],{"className":1496,"style":1497},[358],"height:2.0162em;vertical-align:-1.0499em;",[342,1499,1501],{"className":1500},[676,677],[342,1502,1504,1537],{"className":1503},[422,681],[342,1505,1507,1534],{"className":1506},[426],[342,1508,1511,1523],{"className":1509,"style":1510},[430],"height:0.8056em;",[342,1512,1514,1517],{"style":1513},"top:-2.0501em;margin-left:-0.1945em;",[342,1515],{"className":1516,"style":438},[437],[342,1518,1520],{"className":1519},[699,700,701,702],[342,1521,384],{"className":1522,"style":383},[363,364,702],[342,1524,1526,1529],{"style":1525},"top:-3.0006em;",[342,1527],{"className":1528,"style":438},[437],[342,1530,1531],{},[342,1532,720],{"className":1533,"style":1278},[676,717,1277],[342,1535,725],{"className":1536},[724],[342,1538,1540],{"className":1539},[426],[342,1541,1544],{"className":1542,"style":1543},[430],"height:1.0499em;",[342,1545],{},[342,1547],{"className":1548,"style":739},[738],[342,1550,1552],{"className":1551},[363,418],[342,1553,1555],{"className":1554},[422],[342,1556,1558],{"className":1557},[426],[342,1559,1561,1569],{"className":1560,"style":588},[430],[342,1562,1563,1566],{"style":433},[342,1564],{"className":1565,"style":438},[437],[342,1567,610],{"className":1568,"style":609},[363,364],[342,1570,1571,1574],{"style":613},[342,1572],{"className":1573,"style":438},[437],[342,1575,1577],{"className":1576,"style":620},[451],[342,1578,1580],{"className":1579,"style":625},[624],[627,1581,1582],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1583],{"d":638},[342,1585],{"className":1586,"style":778},[738],[342,1588,783],{"className":1589},[782],[342,1591],{"className":1592,"style":739},[738],[342,1594],{"className":1595,"style":778},[738],[342,1597,1599,1602,1605],{"className":1598},[354],[342,1600],{"className":1601,"style":796},[358],[342,1603,801],{"className":1604},[363,800],[342,1606,1608],{"className":1607},[363,418],[342,1609,1611],{"className":1610},[422],[342,1612,1614],{"className":1613},[426],[342,1615,1617,1625],{"className":1616,"style":796},[430],[342,1618,1619,1622],{"style":433},[342,1620],{"className":1621,"style":438},[437],[342,1623,823],{"className":1624,"style":822},[363,364],[342,1626,1627,1630],{"style":433},[342,1628],{"className":1629,"style":438},[437],[342,1631,1633],{"className":1632,"style":832},[451],[342,1634,1636],{"className":1635,"style":625},[624],[627,1637,1638],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1639],{"d":638},". The flux of a curl depends only on the\nboundary, not on the surface spanning it. In particular a closed surface has no\nboundary, so the flux of any curl through a closed surface is zero.",[535,1642,1644,2341,3044,3191,3662],{"type":1643},"example",[318,1645,1646,1649,1650,1800,1801,1965,1966,1981,1982,2090,2091,2125,2126,2141,2142,2157,2158,2262,2263,2296,2297,2340],{},[326,1647,1648],{},"Worked example."," Evaluate ",[342,1651,1653],{"className":1652},[345],[342,1654,1656,1756],{"className":1655,"ariaHidden":350},[349],[342,1657,1659,1662,1706,1709,1744,1747,1750,1753],{"className":1658},[354],[342,1660],{"className":1661,"style":1497},[358],[342,1663,1665],{"className":1664},[676,677],[342,1666,1668,1698],{"className":1667},[422,681],[342,1669,1671,1695],{"className":1670},[426],[342,1672,1674,1685],{"className":1673,"style":1510},[430],[342,1675,1676,1679],{"style":1513},[342,1677],{"className":1678,"style":438},[437],[342,1680,1682],{"className":1681},[699,700,701,702],[342,1683,384],{"className":1684,"style":383},[363,364,702],[342,1686,1687,1690],{"style":1525},[342,1688],{"className":1689,"style":438},[437],[342,1691,1692],{},[342,1693,720],{"className":1694,"style":1278},[676,717,1277],[342,1696,725],{"className":1697},[724],[342,1699,1701],{"className":1700},[426],[342,1702,1704],{"className":1703,"style":1543},[430],[342,1705],{},[342,1707],{"className":1708,"style":739},[738],[342,1710,1712],{"className":1711},[363,418],[342,1713,1715],{"className":1714},[422],[342,1716,1718],{"className":1717},[426],[342,1719,1721,1729],{"className":1720,"style":588},[430],[342,1722,1723,1726],{"style":433},[342,1724],{"className":1725,"style":438},[437],[342,1727,610],{"className":1728,"style":609},[363,364],[342,1730,1731,1734],{"style":613},[342,1732],{"className":1733,"style":438},[437],[342,1735,1737],{"className":1736,"style":620},[451],[342,1738,1740],{"className":1739,"style":625},[624],[627,1741,1742],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1743],{"d":638},[342,1745],{"className":1746,"style":778},[738],[342,1748,783],{"className":1749},[782],[342,1751],{"className":1752,"style":739},[738],[342,1754],{"className":1755,"style":778},[738],[342,1757,1759,1762,1765],{"className":1758},[354],[342,1760],{"className":1761,"style":796},[358],[342,1763,801],{"className":1764},[363,800],[342,1766,1768],{"className":1767},[363,418],[342,1769,1771],{"className":1770},[422],[342,1772,1774],{"className":1773},[426],[342,1775,1777,1785],{"className":1776,"style":796},[430],[342,1778,1779,1782],{"style":433},[342,1780],{"className":1781,"style":438},[437],[342,1783,823],{"className":1784,"style":822},[363,364],[342,1786,1787,1790],{"style":433},[342,1788],{"className":1789,"style":438},[437],[342,1791,1793],{"className":1792,"style":832},[451],[342,1794,1796],{"className":1795,"style":625},[624],[627,1797,1798],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1799],{"d":638}," for\n",[342,1802,1804],{"className":1803},[345],[342,1805,1807,1857],{"className":1806,"ariaHidden":350},[349],[342,1808,1810,1813,1848,1851,1854],{"className":1809},[354],[342,1811],{"className":1812,"style":588},[358],[342,1814,1816],{"className":1815},[363,418],[342,1817,1819],{"className":1818},[422],[342,1820,1822],{"className":1821},[426],[342,1823,1825,1833],{"className":1824,"style":588},[430],[342,1826,1827,1830],{"style":433},[342,1828],{"className":1829,"style":438},[437],[342,1831,610],{"className":1832,"style":609},[363,364],[342,1834,1835,1838],{"style":613},[342,1836],{"className":1837,"style":438},[437],[342,1839,1841],{"className":1840,"style":620},[451],[342,1842,1844],{"className":1843,"style":625},[624],[627,1845,1846],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,1847],{"d":638},[342,1849],{"className":1850,"style":843},[738],[342,1852,848],{"className":1853},[847],[342,1855],{"className":1856,"style":843},[738],[342,1858,1860,1864,1868,1872,1906,1911,1915,1918,1921,1924,1927,1930,1961],{"className":1859},[354],[342,1861],{"className":1862,"style":1863},[358],"height:1.0641em;vertical-align:-0.25em;",[342,1865,1867],{"className":1866},[1294],"⟨",[342,1869,1871],{"className":1870},[363],"−",[342,1873,1875,1878],{"className":1874},[363],[342,1876,1178],{"className":1877,"style":1177},[363,364],[342,1879,1882],{"className":1880},[1881],"msupsub",[342,1883,1885],{"className":1884},[422],[342,1886,1888],{"className":1887},[426],[342,1889,1892],{"className":1890,"style":1891},[430],"height:0.8141em;",[342,1893,1895,1899],{"style":1894},"top:-3.063em;margin-right:0.05em;",[342,1896],{"className":1897,"style":1898},[437],"height:2.7em;",[342,1900,1902],{"className":1901},[699,700,701,702],[342,1903,1905],{"className":1904},[363,702],"2",[342,1907,1910],{"className":1908},[1909],"mpunct",",",[342,1912,1914],{"className":1913},[738]," ",[342,1916],{"className":1917,"style":739},[738],[342,1919,1173],{"className":1920},[363,364],[342,1922,1910],{"className":1923},[1909],[342,1925,1914],{"className":1926},[738],[342,1928],{"className":1929,"style":739},[738],[342,1931,1933,1938],{"className":1932},[363],[342,1934,1937],{"className":1935,"style":1936},[363,364],"margin-right:0.044em;","z",[342,1939,1941],{"className":1940},[1881],[342,1942,1944],{"className":1943},[422],[342,1945,1947],{"className":1946},[426],[342,1948,1950],{"className":1949,"style":1891},[430],[342,1951,1952,1955],{"style":1894},[342,1953],{"className":1954,"style":1898},[437],[342,1956,1958],{"className":1957},[699,700,701,702],[342,1959,1905],{"className":1960},[363,702],[342,1962,1964],{"className":1963},[1343],"⟩"," where ",[342,1967,1969],{"className":1968},[345],[342,1970,1972],{"className":1971,"ariaHidden":350},[349],[342,1973,1975,1978],{"className":1974},[354],[342,1976],{"className":1977,"style":359},[358],[342,1979,384],{"className":1980,"style":383},[363,364]," is the circle\n",[342,1983,1985],{"className":1984},[345],[342,1986,1988,2034,2079],{"className":1987,"ariaHidden":350},[349],[342,1989,1991,1995,2024,2027,2031],{"className":1990},[354],[342,1992],{"className":1993,"style":1994},[358],"height:0.8974em;vertical-align:-0.0833em;",[342,1996,1998,2001],{"className":1997},[363],[342,1999,1173],{"className":2000},[363,364],[342,2002,2004],{"className":2003},[1881],[342,2005,2007],{"className":2006},[422],[342,2008,2010],{"className":2009},[426],[342,2011,2013],{"className":2012,"style":1891},[430],[342,2014,2015,2018],{"style":1894},[342,2016],{"className":2017,"style":1898},[437],[342,2019,2021],{"className":2020},[699,700,701,702],[342,2022,1905],{"className":2023},[363,702],[342,2025],{"className":2026,"style":778},[738],[342,2028,2030],{"className":2029},[782],"+",[342,2032],{"className":2033,"style":778},[738],[342,2035,2037,2041,2070,2073,2076],{"className":2036},[354],[342,2038],{"className":2039,"style":2040},[358],"height:1.0085em;vertical-align:-0.1944em;",[342,2042,2044,2047],{"className":2043},[363],[342,2045,1178],{"className":2046,"style":1177},[363,364],[342,2048,2050],{"className":2049},[1881],[342,2051,2053],{"className":2052},[422],[342,2054,2056],{"className":2055},[426],[342,2057,2059],{"className":2058,"style":1891},[430],[342,2060,2061,2064],{"style":1894},[342,2062],{"className":2063,"style":1898},[437],[342,2065,2067],{"className":2066},[699,700,701,702],[342,2068,1905],{"className":2069},[363,702],[342,2071],{"className":2072,"style":843},[738],[342,2074,848],{"className":2075},[847],[342,2077],{"className":2078,"style":843},[738],[342,2080,2082,2086],{"className":2081},[354],[342,2083],{"className":2084,"style":2085},[358],"height:0.6444em;",[342,2087,2089],{"className":2088},[363],"1"," in the plane ",[342,2092,2094],{"className":2093},[345],[342,2095,2097,2116],{"className":2096,"ariaHidden":350},[349],[342,2098,2100,2104,2107,2110,2113],{"className":2099},[354],[342,2101],{"className":2102,"style":2103},[358],"height:0.4306em;",[342,2105,1937],{"className":2106,"style":1936},[363,364],[342,2108],{"className":2109,"style":843},[738],[342,2111,848],{"className":2112},[847],[342,2114],{"className":2115,"style":843},[738],[342,2117,2119,2122],{"className":2118},[354],[342,2120],{"className":2121,"style":2085},[358],[342,2123,2089],{"className":2124},[363],", oriented counterclockwise from above. Rather\nthan parametrize ",[342,2127,2129],{"className":2128},[345],[342,2130,2132],{"className":2131,"ariaHidden":350},[349],[342,2133,2135,2138],{"className":2134},[354],[342,2136],{"className":2137,"style":359},[358],[342,2139,384],{"className":2140,"style":383},[363,364],", use Stokes' Theorem with ",[342,2143,2145],{"className":2144},[345],[342,2146,2148],{"className":2147,"ariaHidden":350},[349],[342,2149,2151,2154],{"className":2150},[354],[342,2152],{"className":2153,"style":359},[358],[342,2155,366],{"className":2156,"style":365},[363,364]," the flat disk ",[342,2159,2161],{"className":2160},[345],[342,2162,2164,2208,2253],{"className":2163,"ariaHidden":350},[349],[342,2165,2167,2170,2199,2202,2205],{"className":2166},[354],[342,2168],{"className":2169,"style":1994},[358],[342,2171,2173,2176],{"className":2172},[363],[342,2174,1173],{"className":2175},[363,364],[342,2177,2179],{"className":2178},[1881],[342,2180,2182],{"className":2181},[422],[342,2183,2185],{"className":2184},[426],[342,2186,2188],{"className":2187,"style":1891},[430],[342,2189,2190,2193],{"style":1894},[342,2191],{"className":2192,"style":1898},[437],[342,2194,2196],{"className":2195},[699,700,701,702],[342,2197,1905],{"className":2198},[363,702],[342,2200],{"className":2201,"style":778},[738],[342,2203,2030],{"className":2204},[782],[342,2206],{"className":2207,"style":778},[738],[342,2209,2211,2214,2243,2246,2250],{"className":2210},[354],[342,2212],{"className":2213,"style":2040},[358],[342,2215,2217,2220],{"className":2216},[363],[342,2218,1178],{"className":2219,"style":1177},[363,364],[342,2221,2223],{"className":2222},[1881],[342,2224,2226],{"className":2225},[422],[342,2227,2229],{"className":2228},[426],[342,2230,2232],{"className":2231,"style":1891},[430],[342,2233,2234,2237],{"style":1894},[342,2235],{"className":2236,"style":1898},[437],[342,2238,2240],{"className":2239},[699,700,701,702],[342,2241,1905],{"className":2242},[363,702],[342,2244],{"className":2245,"style":843},[738],[342,2247,2249],{"className":2248},[847],"≤",[342,2251],{"className":2252,"style":843},[738],[342,2254,2256,2259],{"className":2255},[354],[342,2257],{"className":2258,"style":2085},[358],[342,2260,2089],{"className":2261},[363],"\nat ",[342,2264,2266],{"className":2265},[345],[342,2267,2269,2287],{"className":2268,"ariaHidden":350},[349],[342,2270,2272,2275,2278,2281,2284],{"className":2271},[354],[342,2273],{"className":2274,"style":2103},[358],[342,2276,1937],{"className":2277,"style":1936},[363,364],[342,2279],{"className":2280,"style":843},[738],[342,2282,848],{"className":2283},[847],[342,2285],{"className":2286,"style":843},[738],[342,2288,2290,2293],{"className":2289},[354],[342,2291],{"className":2292,"style":2085},[358],[342,2294,2089],{"className":2295},[363],", upward normal ",[342,2298,2300],{"className":2299},[345],[342,2301,2303],{"className":2302,"ariaHidden":350},[349],[342,2304,2306,2309],{"className":2305},[354],[342,2307],{"className":2308,"style":1192},[358],[342,2310,2312],{"className":2311},[363,418],[342,2313,2315],{"className":2314},[422],[342,2316,2318],{"className":2317},[426],[342,2319,2321,2329],{"className":2320,"style":1192},[430],[342,2322,2323,2326],{"style":433},[342,2324],{"className":2325,"style":438},[437],[342,2327,1214],{"className":2328,"style":1213},[363,364],[342,2330,2331,2334],{"style":1217},[342,2332],{"className":2333,"style":438},[437],[342,2335,2337],{"className":2336,"style":452},[451],[342,2338,456],{"className":2339},[363],". The curl is",[342,2342,2344],{"className":2343},[659],[342,2345,2347],{"className":2346},[345],[342,2348,2350,2409,2979,3026],{"className":2349,"ariaHidden":350},[349],[342,2351,2353,2356,2362,2365,2400,2403,2406],{"className":2352},[354],[342,2354],{"className":2355,"style":588},[358],[342,2357,2359],{"className":2358},[676],[342,2360,918],{"className":2361},[363,917],[342,2363],{"className":2364,"style":739},[738],[342,2366,2368],{"className":2367},[363,418],[342,2369,2371],{"className":2370},[422],[342,2372,2374],{"className":2373},[426],[342,2375,2377,2385],{"className":2376,"style":588},[430],[342,2378,2379,2382],{"style":433},[342,2380],{"className":2381,"style":438},[437],[342,2383,610],{"className":2384,"style":609},[363,364],[342,2386,2387,2390],{"style":613},[342,2388],{"className":2389,"style":438},[437],[342,2391,2393],{"className":2392,"style":620},[451],[342,2394,2396],{"className":2395,"style":625},[624],[627,2397,2398],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,2399],{"d":638},[342,2401],{"className":2402,"style":843},[738],[342,2404,848],{"className":2405},[847],[342,2407],{"className":2408,"style":843},[738],[342,2410,2412,2416,2970,2973,2976],{"className":2411},[354],[342,2413],{"className":2414,"style":2415},[358],"height:3.7179em;vertical-align:-1.6089em;",[342,2417,2420,2468,2933],{"className":2418},[2419],"minner",[342,2421,2423],{"className":2422},[1294],[342,2424,2428],{"className":2425},[2426,2427],"delimsizing","mult",[342,2429,2431,2459],{"className":2430},[422,681],[342,2432,2434,2456],{"className":2433},[426],[342,2435,2438],{"className":2436,"style":2437},[430],"height:2.05em;",[342,2439,2441,2445],{"style":2440},"top:-4.05em;",[342,2442],{"className":2443,"style":2444},[437],"height:5.6em;",[342,2446,2448],{"style":2447},"width:0.333em;height:3.6em;",[627,2449,2453],{"xmlns":629,"width":2450,"height":2451,"viewBox":2452},"0.333em","3.6em","0 0 333 3600",[636,2454],{"d":2455},"M145 15 v585 v2400 v585 c2.667,10,9.667,15,21,15\nc10,0,16.667,-5,20,-15 v-585 v-2400 v-585 c-2.667,-10,-9.667,-15,-21,-15\nc-10,0,-16.667,5,-20,15z M188 15 H145 v585 v2400 v585 h43z",[342,2457,725],{"className":2458},[724],[342,2460,2462],{"className":2461},[426],[342,2463,2466],{"className":2464,"style":2465},[430],"height:1.55em;",[342,2467],{},[342,2469,2471],{"className":2470},[363],[342,2472,2475,2637,2642,2645,2780,2783,2786],{"className":2473},[2474],"mtable",[342,2476,2479],{"className":2477},[2478],"col-align-c",[342,2480,2482,2628],{"className":2481},[422,681],[342,2483,2485,2625],{"className":2484},[426],[342,2486,2489,2530,2584],{"className":2487,"style":2488},[430],"height:2.1089em;",[342,2490,2492,2495],{"style":2491},"top:-4.1511em;",[342,2493],{"className":2494,"style":438},[437],[342,2496,2498],{"className":2497},[363],[342,2499,2501],{"className":2500},[363,418],[342,2502,2504],{"className":2503},[422],[342,2505,2507],{"className":2506},[426],[342,2508,2510,2519],{"className":2509,"style":414},[430],[342,2511,2512,2515],{"style":433},[342,2513],{"className":2514,"style":438},[437],[342,2516,2518],{"className":2517},[363,364],"",[342,2520,2521,2524],{"style":433},[342,2522],{"className":2523,"style":438},[437],[342,2525,2527],{"className":2526,"style":452},[451],[342,2528,456],{"className":2529},[363],[342,2531,2533,2536],{"style":2532},"top:-2.9511em;",[342,2534],{"className":2535,"style":438},[437],[342,2537,2539],{"className":2538},[363],[342,2540,2542,2547],{"className":2541},[363],[342,2543,2546],{"className":2544,"style":2545},[363],"margin-right:0.0556em;","∂",[342,2548,2550],{"className":2549},[1881],[342,2551,2553,2575],{"className":2552},[422,681],[342,2554,2556,2572],{"className":2555},[426],[342,2557,2560],{"className":2558,"style":2559},[430],"height:0.1514em;",[342,2561,2563,2566],{"style":2562},"top:-2.55em;margin-left:-0.0556em;margin-right:0.05em;",[342,2564],{"className":2565,"style":1898},[437],[342,2567,2569],{"className":2568},[699,700,701,702],[342,2570,1173],{"className":2571},[363,364,702],[342,2573,725],{"className":2574},[724],[342,2576,2578],{"className":2577},[426],[342,2579,2582],{"className":2580,"style":2581},[430],"height:0.15em;",[342,2583],{},[342,2585,2587,2590],{"style":2586},"top:-1.7511em;",[342,2588],{"className":2589,"style":438},[437],[342,2591,2593,2596],{"className":2592},[363],[342,2594,1871],{"className":2595},[363],[342,2597,2599,2602],{"className":2598},[363],[342,2600,1178],{"className":2601,"style":1177},[363,364],[342,2603,2605],{"className":2604},[1881],[342,2606,2608],{"className":2607},[422],[342,2609,2611],{"className":2610},[426],[342,2612,2614],{"className":2613,"style":1891},[430],[342,2615,2616,2619],{"style":1894},[342,2617],{"className":2618,"style":1898},[437],[342,2620,2622],{"className":2621},[699,700,701,702],[342,2623,1905],{"className":2624},[363,702],[342,2626,725],{"className":2627},[724],[342,2629,2631],{"className":2630},[426],[342,2632,2635],{"className":2633,"style":2634},[430],"height:1.6089em;",[342,2636],{},[342,2638],{"className":2639,"style":2641},[2640],"arraycolsep","width:0.5em;",[342,2643],{"className":2644,"style":2641},[2640],[342,2646,2648],{"className":2647},[2478],[342,2649,2651,2772],{"className":2650},[422,681],[342,2652,2654,2769],{"className":2653},[426],[342,2655,2657,2709,2758],{"className":2656,"style":2488},[430],[342,2658,2659,2662],{"style":2491},[342,2660],{"className":2661,"style":438},[437],[342,2663,2665],{"className":2664},[363],[342,2666,2668],{"className":2667},[363,418],[342,2669,2671,2700],{"className":2670},[422,681],[342,2672,2674,2697],{"className":2673},[426],[342,2675,2677,2686],{"className":2676,"style":414},[430],[342,2678,2679,2682],{"style":433},[342,2680],{"className":2681,"style":438},[437],[342,2683,2685],{"className":2684},[363,364],"",[342,2687,2688,2691],{"style":433},[342,2689],{"className":2690,"style":438},[437],[342,2692,2694],{"className":2693,"style":452},[451],[342,2695,456],{"className":2696},[363],[342,2698,725],{"className":2699},[724],[342,2701,2703],{"className":2702},[426],[342,2704,2707],{"className":2705,"style":2706},[430],"height:0.1944em;",[342,2708],{},[342,2710,2711,2714],{"style":2532},[342,2712],{"className":2713,"style":438},[437],[342,2715,2717],{"className":2716},[363],[342,2718,2720,2723],{"className":2719},[363],[342,2721,2546],{"className":2722,"style":2545},[363],[342,2724,2726],{"className":2725},[1881],[342,2727,2729,2749],{"className":2728},[422,681],[342,2730,2732,2746],{"className":2731},[426],[342,2733,2735],{"className":2734,"style":2559},[430],[342,2736,2737,2740],{"style":2562},[342,2738],{"className":2739,"style":1898},[437],[342,2741,2743],{"className":2742},[699,700,701,702],[342,2744,1178],{"className":2745,"style":1177},[363,364,702],[342,2747,725],{"className":2748},[724],[342,2750,2752],{"className":2751},[426],[342,2753,2756],{"className":2754,"style":2755},[430],"height:0.2861em;",[342,2757],{},[342,2759,2760,2763],{"style":2586},[342,2761],{"className":2762,"style":438},[437],[342,2764,2766],{"className":2765},[363],[342,2767,1173],{"className":2768},[363,364],[342,2770,725],{"className":2771},[724],[342,2773,2775],{"className":2774},[426],[342,2776,2778],{"className":2777,"style":2634},[430],[342,2779],{},[342,2781],{"className":2782,"style":2641},[2640],[342,2784],{"className":2785,"style":2641},[2640],[342,2787,2789],{"className":2788},[2478],[342,2790,2792,2925],{"className":2791},[422,681],[342,2793,2795,2922],{"className":2794},[426],[342,2796,2798,2837,2885],{"className":2797,"style":2488},[430],[342,2799,2800,2803],{"style":2491},[342,2801],{"className":2802,"style":438},[437],[342,2804,2806],{"className":2805},[363],[342,2807,2809],{"className":2808},[363,418],[342,2810,2812],{"className":2811},[422],[342,2813,2815],{"className":2814},[426],[342,2816,2818,2826],{"className":2817,"style":1192},[430],[342,2819,2820,2823],{"style":433},[342,2821],{"className":2822,"style":438},[437],[342,2824,1214],{"className":2825,"style":1213},[363,364],[342,2827,2828,2831],{"style":1217},[342,2829],{"className":2830,"style":438},[437],[342,2832,2834],{"className":2833,"style":452},[451],[342,2835,456],{"className":2836},[363],[342,2838,2839,2842],{"style":2532},[342,2840],{"className":2841,"style":438},[437],[342,2843,2845],{"className":2844},[363],[342,2846,2848,2851],{"className":2847},[363],[342,2849,2546],{"className":2850,"style":2545},[363],[342,2852,2854],{"className":2853},[1881],[342,2855,2857,2877],{"className":2856},[422,681],[342,2858,2860,2874],{"className":2859},[426],[342,2861,2863],{"className":2862,"style":2559},[430],[342,2864,2865,2868],{"style":2562},[342,2866],{"className":2867,"style":1898},[437],[342,2869,2871],{"className":2870},[699,700,701,702],[342,2872,1937],{"className":2873,"style":1936},[363,364,702],[342,2875,725],{"className":2876},[724],[342,2878,2880],{"className":2879},[426],[342,2881,2883],{"className":2882,"style":2581},[430],[342,2884],{},[342,2886,2887,2890],{"style":2586},[342,2888],{"className":2889,"style":438},[437],[342,2891,2893],{"className":2892},[363],[342,2894,2896,2899],{"className":2895},[363],[342,2897,1937],{"className":2898,"style":1936},[363,364],[342,2900,2902],{"className":2901},[1881],[342,2903,2905],{"className":2904},[422],[342,2906,2908],{"className":2907},[426],[342,2909,2911],{"className":2910,"style":1891},[430],[342,2912,2913,2916],{"style":1894},[342,2914],{"className":2915,"style":1898},[437],[342,2917,2919],{"className":2918},[699,700,701,702],[342,2920,1905],{"className":2921},[363,702],[342,2923,725],{"className":2924},[724],[342,2926,2928],{"className":2927},[426],[342,2929,2931],{"className":2930,"style":2634},[430],[342,2932],{},[342,2934,2936],{"className":2935},[1343],[342,2937,2939],{"className":2938},[2426,2427],[342,2940,2942,2962],{"className":2941},[422,681],[342,2943,2945,2959],{"className":2944},[426],[342,2946,2948],{"className":2947,"style":2437},[430],[342,2949,2950,2953],{"style":2440},[342,2951],{"className":2952,"style":2444},[437],[342,2954,2955],{"style":2447},[627,2956,2957],{"xmlns":629,"width":2450,"height":2451,"viewBox":2452},[636,2958],{"d":2455},[342,2960,725],{"className":2961},[724],[342,2963,2965],{"className":2964},[426],[342,2966,2968],{"className":2967,"style":2465},[430],[342,2969],{},[342,2971],{"className":2972,"style":843},[738],[342,2974,848],{"className":2975},[847],[342,2977],{"className":2978,"style":843},[738],[342,2980,2982,2986,2989,2993,2996,2999,3002,3005,3008,3011,3014,3017,3020,3023],{"className":2981},[354],[342,2983],{"className":2984,"style":2985},[358],"height:1em;vertical-align:-0.25em;",[342,2987,1867],{"className":2988},[1294],[342,2990,2992],{"className":2991},[363],"0",[342,2994,1910],{"className":2995},[1909],[342,2997,1914],{"className":2998},[738],[342,3000],{"className":3001,"style":739},[738],[342,3003,2992],{"className":3004},[363],[342,3006,1910],{"className":3007},[1909],[342,3009,1914],{"className":3010},[738],[342,3012],{"className":3013,"style":739},[738],[342,3015,2089],{"className":3016},[363],[342,3018],{"className":3019,"style":778},[738],[342,3021,2030],{"className":3022},[782],[342,3024],{"className":3025,"style":778},[738],[342,3027,3029,3032,3035,3038,3041],{"className":3028},[354],[342,3030],{"className":3031,"style":2985},[358],[342,3033,1905],{"className":3034},[363],[342,3036,1178],{"className":3037,"style":1177},[363,364],[342,3039,1964],{"className":3040},[1343],[342,3042,1910],{"className":3043},[1909],[318,3045,3046,3047,3190],{},"so ",[342,3048,3050],{"className":3049},[345],[342,3051,3053,3112,3158,3177],{"className":3052,"ariaHidden":350},[349],[342,3054,3056,3059,3065,3068,3103,3106,3109],{"className":3055},[354],[342,3057],{"className":3058,"style":588},[358],[342,3060,3062],{"className":3061},[676],[342,3063,918],{"className":3064},[363,917],[342,3066],{"className":3067,"style":739},[738],[342,3069,3071],{"className":3070},[363,418],[342,3072,3074],{"className":3073},[422],[342,3075,3077],{"className":3076},[426],[342,3078,3080,3088],{"className":3079,"style":588},[430],[342,3081,3082,3085],{"style":433},[342,3083],{"className":3084,"style":438},[437],[342,3086,610],{"className":3087,"style":609},[363,364],[342,3089,3090,3093],{"style":613},[342,3091],{"className":3092,"style":438},[437],[342,3094,3096],{"className":3095,"style":620},[451],[342,3097,3099],{"className":3098,"style":625},[624],[627,3100,3101],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,3102],{"d":638},[342,3104],{"className":3105,"style":778},[738],[342,3107,783],{"className":3108},[782],[342,3110],{"className":3111,"style":778},[738],[342,3113,3115,3118,3149,3152,3155],{"className":3114},[354],[342,3116],{"className":3117,"style":1192},[358],[342,3119,3121],{"className":3120},[363,418],[342,3122,3124],{"className":3123},[422],[342,3125,3127],{"className":3126},[426],[342,3128,3130,3138],{"className":3129,"style":1192},[430],[342,3131,3132,3135],{"style":433},[342,3133],{"className":3134,"style":438},[437],[342,3136,1214],{"className":3137,"style":1213},[363,364],[342,3139,3140,3143],{"style":1217},[342,3141],{"className":3142,"style":438},[437],[342,3144,3146],{"className":3145,"style":452},[451],[342,3147,456],{"className":3148},[363],[342,3150],{"className":3151,"style":843},[738],[342,3153,848],{"className":3154},[847],[342,3156],{"className":3157,"style":843},[738],[342,3159,3161,3165,3168,3171,3174],{"className":3160},[354],[342,3162],{"className":3163,"style":3164},[358],"height:0.7278em;vertical-align:-0.0833em;",[342,3166,2089],{"className":3167},[363],[342,3169],{"className":3170,"style":778},[738],[342,3172,2030],{"className":3173},[782],[342,3175],{"className":3176,"style":778},[738],[342,3178,3180,3184,3187],{"className":3179},[354],[342,3181],{"className":3182,"style":3183},[358],"height:0.8389em;vertical-align:-0.1944em;",[342,3185,1905],{"className":3186},[363],[342,3188,1178],{"className":3189,"style":1177},[363,364],", and",[342,3192,3194],{"className":3193},[659],[342,3195,3197],{"className":3196},[345],[342,3198,3200,3300,3353,3496,3532,3570,3612,3632,3650],{"className":3199,"ariaHidden":350},[349],[342,3201,3203,3206,3250,3253,3288,3291,3294,3297],{"className":3202},[354],[342,3204],{"className":3205,"style":672},[358],[342,3207,3209],{"className":3208},[676,677],[342,3210,3212,3242],{"className":3211},[422,681],[342,3213,3215,3239],{"className":3214},[426],[342,3216,3218,3229],{"className":3217,"style":688},[430],[342,3219,3220,3223],{"style":691},[342,3221],{"className":3222,"style":695},[437],[342,3224,3226],{"className":3225},[699,700,701,702],[342,3227,384],{"className":3228,"style":383},[363,364,702],[342,3230,3231,3234],{"style":708},[342,3232],{"className":3233,"style":695},[437],[342,3235,3236],{},[342,3237,720],{"className":3238,"style":719},[676,717,718],[342,3240,725],{"className":3241},[724],[342,3243,3245],{"className":3244},[426],[342,3246,3248],{"className":3247,"style":732},[430],[342,3249],{},[342,3251],{"className":3252,"style":739},[738],[342,3254,3256],{"className":3255},[363,418],[342,3257,3259],{"className":3258},[422],[342,3260,3262],{"className":3261},[426],[342,3263,3265,3273],{"className":3264,"style":588},[430],[342,3266,3267,3270],{"style":433},[342,3268],{"className":3269,"style":438},[437],[342,3271,610],{"className":3272,"style":609},[363,364],[342,3274,3275,3278],{"style":613},[342,3276],{"className":3277,"style":438},[437],[342,3279,3281],{"className":3280,"style":620},[451],[342,3282,3284],{"className":3283,"style":625},[624],[627,3285,3286],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,3287],{"d":638},[342,3289],{"className":3290,"style":778},[738],[342,3292,783],{"className":3293},[782],[342,3295],{"className":3296,"style":739},[738],[342,3298],{"className":3299,"style":778},[738],[342,3301,3303,3306,3309,3344,3347,3350],{"className":3302},[354],[342,3304],{"className":3305,"style":796},[358],[342,3307,801],{"className":3308},[363,800],[342,3310,3312],{"className":3311},[363,418],[342,3313,3315],{"className":3314},[422],[342,3316,3318],{"className":3317},[426],[342,3319,3321,3329],{"className":3320,"style":796},[430],[342,3322,3323,3326],{"style":433},[342,3324],{"className":3325,"style":438},[437],[342,3327,823],{"className":3328,"style":822},[363,364],[342,3330,3331,3334],{"style":433},[342,3332],{"className":3333,"style":438},[437],[342,3335,3337],{"className":3336,"style":832},[451],[342,3338,3340],{"className":3339,"style":625},[624],[627,3341,3342],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,3343],{"d":638},[342,3345],{"className":3346,"style":843},[738],[342,3348,848],{"className":3349},[847],[342,3351],{"className":3352,"style":843},[738],[342,3354,3356,3360,3481,3484,3487,3490,3493],{"className":3355},[354],[342,3357],{"className":3358,"style":3359},[358],"height:3.1465em;vertical-align:-1.7855em;",[342,3361,3363,3366],{"className":3362},[676,677],[342,3364],{"className":3365,"style":719},[738],[342,3367,3369,3472],{"className":3368},[422,681],[342,3370,3372,3469],{"className":3371},[426],[342,3373,3375,3459],{"className":3374,"style":871},[430],[342,3376,3378,3381],{"style":3377},"top:-1.8106em;margin-left:-0.4445em;",[342,3379],{"className":3380,"style":695},[437],[342,3382,3384],{"className":3383},[699,700,701,702],[342,3385,3387,3421,3424,3453,3456],{"className":3386},[363,702],[342,3388,3390,3393],{"className":3389},[363,702],[342,3391,1173],{"className":3392},[363,364,702],[342,3394,3396],{"className":3395},[1881],[342,3397,3399],{"className":3398},[422],[342,3400,3402],{"className":3401},[426],[342,3403,3406],{"className":3404,"style":3405},[430],"height:0.7463em;",[342,3407,3409,3413],{"style":3408},"top:-2.786em;margin-right:0.0714em;",[342,3410],{"className":3411,"style":3412},[437],"height:2.5em;",[342,3414,3418],{"className":3415},[699,3416,3417,702],"reset-size3","size1",[342,3419,1905],{"className":3420},[363,702],[342,3422,2030],{"className":3423},[782,702],[342,3425,3427,3430],{"className":3426},[363,702],[342,3428,1178],{"className":3429,"style":1177},[363,364,702],[342,3431,3433],{"className":3432},[1881],[342,3434,3436],{"className":3435},[422],[342,3437,3439],{"className":3438},[426],[342,3440,3442],{"className":3441,"style":3405},[430],[342,3443,3444,3447],{"style":3408},[342,3445],{"className":3446,"style":3412},[437],[342,3448,3450],{"className":3449},[699,3416,3417,702],[342,3451,1905],{"className":3452},[363,702],[342,3454,2249],{"className":3455},[847,702],[342,3457,2089],{"className":3458},[363,702],[342,3460,3461,3464],{"style":886},[342,3462],{"className":3463,"style":695},[437],[342,3465,3466],{},[342,3467,895],{"className":3468,"style":719},[676,717,718],[342,3470,725],{"className":3471},[724],[342,3473,3475],{"className":3474},[426],[342,3476,3479],{"className":3477,"style":3478},[430],"height:1.7855em;",[342,3480],{},[342,3482,1295],{"className":3483},[1294],[342,3485,2089],{"className":3486},[363],[342,3488],{"className":3489,"style":778},[738],[342,3491,2030],{"className":3492},[782],[342,3494],{"className":3495,"style":778},[738],[342,3497,3499,3502,3505,3508,3511,3514,3517,3520,3523,3526,3529],{"className":3498},[354],[342,3500],{"className":3501,"style":2985},[358],[342,3503,1905],{"className":3504},[363],[342,3506,1178],{"className":3507,"style":1177},[363,364],[342,3509,1344],{"className":3510},[1343],[342,3512],{"className":3513,"style":739},[738],[342,3515],{"className":3516,"style":739},[738],[342,3518,801],{"className":3519},[363,800],[342,3521,1403],{"className":3522},[363,364],[342,3524],{"className":3525,"style":843},[738],[342,3527,848],{"className":3528},[847],[342,3530],{"className":3531,"style":843},[738],[342,3533,3535,3539,3543,3546,3549,3552,3555,3558,3561,3564,3567],{"className":3534},[354],[342,3536],{"className":3537,"style":3538},[358],"height:2.222em;vertical-align:-0.862em;",[342,3540,895],{"className":3541,"style":3542},[676,717,718],"margin-right:0.4445em;position:relative;top:-0.001em;",[342,3544],{"className":3545,"style":739},[738],[342,3547,2089],{"className":3548},[363],[342,3550],{"className":3551,"style":739},[738],[342,3553],{"className":3554,"style":739},[738],[342,3556,801],{"className":3557},[363,800],[342,3559,1403],{"className":3560},[363,364],[342,3562],{"className":3563,"style":778},[738],[342,3565,2030],{"className":3566},[782],[342,3568],{"className":3569,"style":778},[738],[342,3571,3573,3576,3579,3582,3585,3588,3591,3594,3597,3600,3603,3606,3609],{"className":3572},[354],[342,3574],{"className":3575,"style":3538},[358],[342,3577,1905],{"className":3578},[363],[342,3580],{"className":3581,"style":739},[738],[342,3583,895],{"className":3584,"style":3542},[676,717,718],[342,3586],{"className":3587,"style":739},[738],[342,3589,1178],{"className":3590,"style":1177},[363,364],[342,3592],{"className":3593,"style":739},[738],[342,3595],{"className":3596,"style":739},[738],[342,3598,801],{"className":3599},[363,800],[342,3601,1403],{"className":3602},[363,364],[342,3604],{"className":3605,"style":843},[738],[342,3607,848],{"className":3608},[847],[342,3610],{"className":3611,"style":843},[738],[342,3613,3615,3619,3623,3626,3629],{"className":3614},[354],[342,3616],{"className":3617,"style":3618},[358],"height:0.6667em;vertical-align:-0.0833em;",[342,3620,3622],{"className":3621,"style":1177},[363,364],"π",[342,3624],{"className":3625,"style":778},[738],[342,3627,2030],{"className":3628},[782],[342,3630],{"className":3631,"style":778},[738],[342,3633,3635,3638,3641,3644,3647],{"className":3634},[354],[342,3636],{"className":3637,"style":2085},[358],[342,3639,2992],{"className":3640},[363],[342,3642],{"className":3643,"style":843},[738],[342,3645,848],{"className":3646},[847],[342,3648],{"className":3649,"style":843},[738],[342,3651,3653,3656,3659],{"className":3652},[354],[342,3654],{"className":3655,"style":1169},[358],[342,3657,3622],{"className":3658,"style":1177},[363,364],[342,3660,1910],{"className":3661},[1909],[318,3663,3664,3665,3718,3719,3734],{},"using that ",[342,3666,3668],{"className":3667},[345],[342,3669,3671,3709],{"className":3670,"ariaHidden":350},[349],[342,3672,3674,3678,3682,3685,3688,3691,3694,3697,3700,3703,3706],{"className":3673},[354],[342,3675],{"className":3676,"style":3677},[358],"height:1.111em;vertical-align:-0.306em;",[342,3679,895],{"className":3680,"style":3681},[676,717,1277],"margin-right:0.1945em;position:relative;top:-0.0005em;",[342,3683],{"className":3684,"style":739},[738],[342,3686,1178],{"className":3687,"style":1177},[363,364],[342,3689],{"className":3690,"style":739},[738],[342,3692],{"className":3693,"style":739},[738],[342,3695,801],{"className":3696},[363,800],[342,3698,1403],{"className":3699},[363,364],[342,3701],{"className":3702,"style":843},[738],[342,3704,848],{"className":3705},[847],[342,3707],{"className":3708,"style":843},[738],[342,3710,3712,3715],{"className":3711},[354],[342,3713],{"className":3714,"style":2085},[358],[342,3716,2992],{"className":3717},[363]," over a disk symmetric about the ",[342,3720,3722],{"className":3721},[345],[342,3723,3725],{"className":3724,"ariaHidden":350},[349],[342,3726,3728,3731],{"className":3727},[354],[342,3729],{"className":3730,"style":2103},[358],[342,3732,1173],{"className":3733},[363,364],"-axis. The surface\nintegral is easier than the line integral, which is the usual reason to apply the\ntheorem in this direction.",[335,3736,3738],{"id":3737},"the-divergence-theorem","The Divergence Theorem",[318,3740,3741,3742,3758,3759,3762,3763,3778],{},"The flux form of Green's Theorem lifts differently: the plane region becomes a\nsolid ",[342,3743,3745],{"className":3744},[345],[342,3746,3748],{"className":3747,"ariaHidden":350},[349],[342,3749,3751,3754],{"className":3750},[354],[342,3752],{"className":3753,"style":359},[358],[342,3755,3757],{"className":3756,"style":365},[363,364],"E",", and its boundary curve becomes the closed boundary ",[326,3760,3761],{},"surface"," ",[342,3764,3766],{"className":3765},[345],[342,3767,3769],{"className":3768,"ariaHidden":350},[349],[342,3770,3772,3775],{"className":3771},[354],[342,3773],{"className":3774,"style":359},[358],[342,3776,366],{"className":3777,"style":365},[363,364],",\noriented outward.",[535,3780,3781,3881],{"type":537},[318,3782,3783,543,3786,3801,3802,3817,3818,3865,3866,655],{},[326,3784,3785],{},"Theorem (Divergence, or Gauss).",[342,3787,3789],{"className":3788},[345],[342,3790,3792],{"className":3791,"ariaHidden":350},[349],[342,3793,3795,3798],{"className":3794},[354],[342,3796],{"className":3797,"style":359},[358],[342,3799,3757],{"className":3800,"style":365},[363,364]," be a simple solid region whose\nboundary surface ",[342,3803,3805],{"className":3804},[345],[342,3806,3808],{"className":3807,"ariaHidden":350},[349],[342,3809,3811,3814],{"className":3810},[354],[342,3812],{"className":3813,"style":359},[358],[342,3815,366],{"className":3816,"style":365},[363,364]," is oriented outward. If ",[342,3819,3821],{"className":3820},[345],[342,3822,3824],{"className":3823,"ariaHidden":350},[349],[342,3825,3827,3830],{"className":3826},[354],[342,3828],{"className":3829,"style":588},[358],[342,3831,3833],{"className":3832},[363,418],[342,3834,3836],{"className":3835},[422],[342,3837,3839],{"className":3838},[426],[342,3840,3842,3850],{"className":3841,"style":588},[430],[342,3843,3844,3847],{"style":433},[342,3845],{"className":3846,"style":438},[437],[342,3848,610],{"className":3849,"style":609},[363,364],[342,3851,3852,3855],{"style":613},[342,3853],{"className":3854,"style":438},[437],[342,3856,3858],{"className":3857,"style":620},[451],[342,3859,3861],{"className":3860,"style":625},[624],[627,3862,3863],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,3864],{"d":638}," has continuous partial\nderivatives on an open region containing ",[342,3867,3869],{"className":3868},[345],[342,3870,3872],{"className":3871,"ariaHidden":350},[349],[342,3873,3875,3878],{"className":3874},[354],[342,3876],{"className":3877,"style":359},[358],[342,3879,3757],{"className":3880,"style":365},[363,364],[342,3882,3884],{"className":3883},[659],[342,3885,3887],{"className":3886},[345],[342,3888,3890,3990,4043],{"className":3889,"ariaHidden":350},[349],[342,3891,3893,3896,3940,3943,3978,3981,3984,3987],{"className":3892},[354],[342,3894],{"className":3895,"style":858},[358],[342,3897,3899],{"className":3898},[676,677],[342,3900,3902,3932],{"className":3901},[422,681],[342,3903,3905,3929],{"className":3904},[426],[342,3906,3908,3919],{"className":3907,"style":871},[430],[342,3909,3910,3913],{"style":874},[342,3911],{"className":3912,"style":695},[437],[342,3914,3916],{"className":3915},[699,700,701,702],[342,3917,366],{"className":3918,"style":365},[363,364,702],[342,3920,3921,3924],{"style":886},[342,3922],{"className":3923,"style":695},[437],[342,3925,3926],{},[342,3927,895],{"className":3928,"style":719},[676,717,718],[342,3930,725],{"className":3931},[724],[342,3933,3935],{"className":3934},[426],[342,3936,3938],{"className":3937,"style":905},[430],[342,3939],{},[342,3941],{"className":3942,"style":739},[738],[342,3944,3946],{"className":3945},[363,418],[342,3947,3949],{"className":3948},[422],[342,3950,3952],{"className":3951},[426],[342,3953,3955,3963],{"className":3954,"style":588},[430],[342,3956,3957,3960],{"style":433},[342,3958],{"className":3959,"style":438},[437],[342,3961,610],{"className":3962,"style":609},[363,364],[342,3964,3965,3968],{"style":613},[342,3966],{"className":3967,"style":438},[437],[342,3969,3971],{"className":3970,"style":620},[451],[342,3972,3974],{"className":3973,"style":625},[624],[627,3975,3976],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,3977],{"d":638},[342,3979],{"className":3980,"style":778},[738],[342,3982,783],{"className":3983},[782],[342,3985],{"className":3986,"style":739},[738],[342,3988],{"className":3989,"style":778},[738],[342,3991,3993,3996,3999,4034,4037,4040],{"className":3992},[354],[342,3994],{"className":3995,"style":588},[358],[342,3997,801],{"className":3998},[363,800],[342,4000,4002],{"className":4001},[363,418],[342,4003,4005],{"className":4004},[422],[342,4006,4008],{"className":4007},[426],[342,4009,4011,4019],{"className":4010,"style":588},[430],[342,4012,4013,4016],{"style":433},[342,4014],{"className":4015,"style":438},[437],[342,4017,366],{"className":4018,"style":365},[363,364],[342,4020,4021,4024],{"style":613},[342,4022],{"className":4023,"style":438},[437],[342,4025,4027],{"className":4026,"style":620},[451],[342,4028,4030],{"className":4029,"style":625},[624],[627,4031,4032],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4033],{"d":638},[342,4035],{"className":4036,"style":843},[738],[342,4038,848],{"className":4039},[847],[342,4041],{"className":4042,"style":843},[738],[342,4044,4046,4049,4094,4097,4105,4108,4143,4146,4149,4152,4156],{"className":4045},[354],[342,4047],{"className":4048,"style":858},[358],[342,4050,4052],{"className":4051},[676,677],[342,4053,4055,4086],{"className":4054},[422,681],[342,4056,4058,4083],{"className":4057},[426],[342,4059,4061,4072],{"className":4060,"style":871},[430],[342,4062,4063,4066],{"style":874},[342,4064],{"className":4065,"style":695},[437],[342,4067,4069],{"className":4068},[699,700,701,702],[342,4070,3757],{"className":4071,"style":365},[363,364,702],[342,4073,4074,4077],{"style":886},[342,4075],{"className":4076,"style":695},[437],[342,4078,4079],{},[342,4080,4082],{"className":4081,"style":719},[676,717,718],"∭",[342,4084,725],{"className":4085},[724],[342,4087,4089],{"className":4088},[426],[342,4090,4092],{"className":4091,"style":905},[430],[342,4093],{},[342,4095],{"className":4096,"style":739},[738],[342,4098,4100],{"className":4099},[676],[342,4101,4104],{"className":4102,"style":4103},[363,917],"margin-right:0.0139em;","div",[342,4106],{"className":4107,"style":739},[738],[342,4109,4111],{"className":4110},[363,418],[342,4112,4114],{"className":4113},[422],[342,4115,4117],{"className":4116},[426],[342,4118,4120,4128],{"className":4119,"style":588},[430],[342,4121,4122,4125],{"style":433},[342,4123],{"className":4124,"style":438},[437],[342,4126,610],{"className":4127,"style":609},[363,364],[342,4129,4130,4133],{"style":613},[342,4131],{"className":4132,"style":438},[437],[342,4134,4136],{"className":4135,"style":620},[451],[342,4137,4139],{"className":4138,"style":625},[624],[627,4140,4141],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4142],{"d":638},[342,4144],{"className":4145,"style":739},[738],[342,4147],{"className":4148,"style":739},[738],[342,4150,801],{"className":4151},[363,800],[342,4153,4155],{"className":4154,"style":778},[363,364],"V",[342,4157,1016],{"className":4158},[363],[318,4160,4161,4162,4209,4210,4266],{},"The outward flux of ",[342,4163,4165],{"className":4164},[345],[342,4166,4168],{"className":4167,"ariaHidden":350},[349],[342,4169,4171,4174],{"className":4170},[354],[342,4172],{"className":4173,"style":588},[358],[342,4175,4177],{"className":4176},[363,418],[342,4178,4180],{"className":4179},[422],[342,4181,4183],{"className":4182},[426],[342,4184,4186,4194],{"className":4185,"style":588},[430],[342,4187,4188,4191],{"style":433},[342,4189],{"className":4190,"style":438},[437],[342,4192,610],{"className":4193,"style":609},[363,364],[342,4195,4196,4199],{"style":613},[342,4197],{"className":4198,"style":438},[437],[342,4200,4202],{"className":4201,"style":620},[451],[342,4203,4205],{"className":4204,"style":625},[624],[627,4206,4207],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4208],{"d":638}," across the closed surface equals the triple\nintegral of ",[342,4211,4213],{"className":4212},[345],[342,4214,4216],{"className":4215,"ariaHidden":350},[349],[342,4217,4219,4222,4228,4231],{"className":4218},[354],[342,4220],{"className":4221,"style":588},[358],[342,4223,4225],{"className":4224},[676],[342,4226,4104],{"className":4227,"style":4103},[363,917],[342,4229],{"className":4230,"style":739},[738],[342,4232,4234],{"className":4233},[363,418],[342,4235,4237],{"className":4236},[422],[342,4238,4240],{"className":4239},[426],[342,4241,4243,4251],{"className":4242,"style":588},[430],[342,4244,4245,4248],{"style":433},[342,4246],{"className":4247,"style":438},[437],[342,4249,610],{"className":4250,"style":609},[363,364],[342,4252,4253,4256],{"style":613},[342,4254],{"className":4255,"style":438},[437],[342,4257,4259],{"className":4258,"style":620},[451],[342,4260,4262],{"className":4261,"style":625},[624],[627,4263,4264],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4265],{"d":638}," over the solid it bounds. It matches\nthe physical reading of divergence as outflow per unit volume: adding up the local\noutflow over the whole solid gives the net flow across the surface, because\noutflow from one interior cell is inflow to the next and cancels, leaving only the\nboundary.",[1406,4268],{"hash":4269},"77254a95a90295fcc012405d0b026da73ef16f2947069911122cdb2bc12bab93",[535,4271,4272,4500,4956],{"type":1643},[318,4273,4274,4276,4277,4366,4367,4370,4371,1910],{},[326,4275,1648],{}," Find the outward flux of ",[342,4278,4280],{"className":4279},[345],[342,4281,4283,4333],{"className":4282,"ariaHidden":350},[349],[342,4284,4286,4289,4324,4327,4330],{"className":4285},[354],[342,4287],{"className":4288,"style":588},[358],[342,4290,4292],{"className":4291},[363,418],[342,4293,4295],{"className":4294},[422],[342,4296,4298],{"className":4297},[426],[342,4299,4301,4309],{"className":4300,"style":588},[430],[342,4302,4303,4306],{"style":433},[342,4304],{"className":4305,"style":438},[437],[342,4307,610],{"className":4308,"style":609},[363,364],[342,4310,4311,4314],{"style":613},[342,4312],{"className":4313,"style":438},[437],[342,4315,4317],{"className":4316,"style":620},[451],[342,4318,4320],{"className":4319,"style":625},[624],[627,4321,4322],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4323],{"d":638},[342,4325],{"className":4326,"style":843},[738],[342,4328,848],{"className":4329},[847],[342,4331],{"className":4332,"style":843},[738],[342,4334,4336,4339,4342,4345,4348,4351,4354,4357,4360,4363],{"className":4335},[354],[342,4337],{"className":4338,"style":2985},[358],[342,4340,1867],{"className":4341},[1294],[342,4343,1173],{"className":4344},[363,364],[342,4346,1910],{"className":4347},[1909],[342,4349],{"className":4350,"style":739},[738],[342,4352,1178],{"className":4353,"style":1177},[363,364],[342,4355,1910],{"className":4356},[1909],[342,4358],{"className":4359,"style":739},[738],[342,4361,1937],{"className":4362,"style":1936},[363,364],[342,4364,1964],{"className":4365},[1343],"\nacross the unit sphere. Computing the surface integral directly required a full\n",[321,4368,4369],{"href":303},"parametrization of the sphere",";\nthe Divergence Theorem does it in two lines. Since ",[342,4372,4374],{"className":4373},[345],[342,4375,4377,4436,4454,4472,4490],{"className":4376,"ariaHidden":350},[349],[342,4378,4380,4383,4389,4392,4427,4430,4433],{"className":4379},[354],[342,4381],{"className":4382,"style":588},[358],[342,4384,4386],{"className":4385},[676],[342,4387,4104],{"className":4388,"style":4103},[363,917],[342,4390],{"className":4391,"style":739},[738],[342,4393,4395],{"className":4394},[363,418],[342,4396,4398],{"className":4397},[422],[342,4399,4401],{"className":4400},[426],[342,4402,4404,4412],{"className":4403,"style":588},[430],[342,4405,4406,4409],{"style":433},[342,4407],{"className":4408,"style":438},[437],[342,4410,610],{"className":4411,"style":609},[363,364],[342,4413,4414,4417],{"style":613},[342,4415],{"className":4416,"style":438},[437],[342,4418,4420],{"className":4419,"style":620},[451],[342,4421,4423],{"className":4422,"style":625},[624],[627,4424,4425],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4426],{"d":638},[342,4428],{"className":4429,"style":843},[738],[342,4431,848],{"className":4432},[847],[342,4434],{"className":4435,"style":843},[738],[342,4437,4439,4442,4445,4448,4451],{"className":4438},[354],[342,4440],{"className":4441,"style":3164},[358],[342,4443,2089],{"className":4444},[363],[342,4446],{"className":4447,"style":778},[738],[342,4449,2030],{"className":4450},[782],[342,4452],{"className":4453,"style":778},[738],[342,4455,4457,4460,4463,4466,4469],{"className":4456},[354],[342,4458],{"className":4459,"style":3164},[358],[342,4461,2089],{"className":4462},[363],[342,4464],{"className":4465,"style":778},[738],[342,4467,2030],{"className":4468},[782],[342,4470],{"className":4471,"style":778},[738],[342,4473,4475,4478,4481,4484,4487],{"className":4474},[354],[342,4476],{"className":4477,"style":2085},[358],[342,4479,2089],{"className":4480},[363],[342,4482],{"className":4483,"style":843},[738],[342,4485,848],{"className":4486},[847],[342,4488],{"className":4489,"style":843},[738],[342,4491,4493,4496],{"className":4492},[354],[342,4494],{"className":4495,"style":2085},[358],[342,4497,4499],{"className":4498},[363],"3",[342,4501,4503],{"className":4502},[659],[342,4504,4506],{"className":4505},[345],[342,4507,4509,4609,4662,4739,4757,4789,4807,4941],{"className":4508,"ariaHidden":350},[349],[342,4510,4512,4515,4559,4562,4597,4600,4603,4606],{"className":4511},[354],[342,4513],{"className":4514,"style":858},[358],[342,4516,4518],{"className":4517},[676,677],[342,4519,4521,4551],{"className":4520},[422,681],[342,4522,4524,4548],{"className":4523},[426],[342,4525,4527,4538],{"className":4526,"style":871},[430],[342,4528,4529,4532],{"style":874},[342,4530],{"className":4531,"style":695},[437],[342,4533,4535],{"className":4534},[699,700,701,702],[342,4536,366],{"className":4537,"style":365},[363,364,702],[342,4539,4540,4543],{"style":886},[342,4541],{"className":4542,"style":695},[437],[342,4544,4545],{},[342,4546,895],{"className":4547,"style":719},[676,717,718],[342,4549,725],{"className":4550},[724],[342,4552,4554],{"className":4553},[426],[342,4555,4557],{"className":4556,"style":905},[430],[342,4558],{},[342,4560],{"className":4561,"style":739},[738],[342,4563,4565],{"className":4564},[363,418],[342,4566,4568],{"className":4567},[422],[342,4569,4571],{"className":4570},[426],[342,4572,4574,4582],{"className":4573,"style":588},[430],[342,4575,4576,4579],{"style":433},[342,4577],{"className":4578,"style":438},[437],[342,4580,610],{"className":4581,"style":609},[363,364],[342,4583,4584,4587],{"style":613},[342,4585],{"className":4586,"style":438},[437],[342,4588,4590],{"className":4589,"style":620},[451],[342,4591,4593],{"className":4592,"style":625},[624],[627,4594,4595],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4596],{"d":638},[342,4598],{"className":4599,"style":778},[738],[342,4601,783],{"className":4602},[782],[342,4604],{"className":4605,"style":739},[738],[342,4607],{"className":4608,"style":778},[738],[342,4610,4612,4615,4618,4653,4656,4659],{"className":4611},[354],[342,4613],{"className":4614,"style":588},[358],[342,4616,801],{"className":4617},[363,800],[342,4619,4621],{"className":4620},[363,418],[342,4622,4624],{"className":4623},[422],[342,4625,4627],{"className":4626},[426],[342,4628,4630,4638],{"className":4629,"style":588},[430],[342,4631,4632,4635],{"style":433},[342,4633],{"className":4634,"style":438},[437],[342,4636,366],{"className":4637,"style":365},[363,364],[342,4639,4640,4643],{"style":613},[342,4641],{"className":4642,"style":438},[437],[342,4644,4646],{"className":4645,"style":620},[451],[342,4647,4649],{"className":4648,"style":625},[624],[627,4650,4651],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,4652],{"d":638},[342,4654],{"className":4655,"style":843},[738],[342,4657,848],{"className":4658},[847],[342,4660],{"className":4661,"style":843},[738],[342,4663,4665,4668,4712,4715,4718,4721,4724,4727,4730,4733,4736],{"className":4664},[354],[342,4666],{"className":4667,"style":858},[358],[342,4669,4671],{"className":4670},[676,677],[342,4672,4674,4704],{"className":4673},[422,681],[342,4675,4677,4701],{"className":4676},[426],[342,4678,4680,4691],{"className":4679,"style":871},[430],[342,4681,4682,4685],{"style":874},[342,4683],{"className":4684,"style":695},[437],[342,4686,4688],{"className":4687},[699,700,701,702],[342,4689,3757],{"className":4690,"style":365},[363,364,702],[342,4692,4693,4696],{"style":886},[342,4694],{"className":4695,"style":695},[437],[342,4697,4698],{},[342,4699,4082],{"className":4700,"style":719},[676,717,718],[342,4702,725],{"className":4703},[724],[342,4705,4707],{"className":4706},[426],[342,4708,4710],{"className":4709,"style":905},[430],[342,4711],{},[342,4713],{"className":4714,"style":739},[738],[342,4716,4499],{"className":4717},[363],[342,4719],{"className":4720,"style":739},[738],[342,4722],{"className":4723,"style":739},[738],[342,4725,801],{"className":4726},[363,800],[342,4728,4155],{"className":4729,"style":778},[363,364],[342,4731],{"className":4732,"style":843},[738],[342,4734,848],{"className":4735},[847],[342,4737],{"className":4738,"style":843},[738],[342,4740,4742,4745,4748,4751,4754],{"className":4741},[354],[342,4743],{"className":4744,"style":2085},[358],[342,4746,4499],{"className":4747},[363],[342,4749],{"className":4750,"style":778},[738],[342,4752,783],{"className":4753},[782],[342,4755],{"className":4756,"style":778},[738],[342,4758,4760,4763,4771,4774,4777,4780,4783,4786],{"className":4759},[354],[342,4761],{"className":4762,"style":2985},[358],[342,4764,4767],{"className":4765},[363,4766],"text",[342,4768,4770],{"className":4769},[363],"vol",[342,4772,1295],{"className":4773},[1294],[342,4775,3757],{"className":4776,"style":365},[363,364],[342,4778,1344],{"className":4779},[1343],[342,4781],{"className":4782,"style":843},[738],[342,4784,848],{"className":4785},[847],[342,4787],{"className":4788,"style":843},[738],[342,4790,4792,4795,4798,4801,4804],{"className":4791},[354],[342,4793],{"className":4794,"style":2085},[358],[342,4796,4499],{"className":4797},[363],[342,4799],{"className":4800,"style":778},[738],[342,4802,783],{"className":4803},[782],[342,4805],{"className":4806,"style":778},[738],[342,4808,4810,4814,4892,4895,4898,4901,4932,4935,4938],{"className":4809},[354],[342,4811],{"className":4812,"style":4813},[358],"height:1.2091em;vertical-align:-0.345em;",[342,4815,4817,4821,4889],{"className":4816},[363],[342,4818],{"className":4819},[1294,4820],"nulldelimiter",[342,4822,4825],{"className":4823},[4824],"mfrac",[342,4826,4828,4880],{"className":4827},[422,681],[342,4829,4831,4877],{"className":4830},[426],[342,4832,4835,4850,4861],{"className":4833,"style":4834},[430],"height:0.8451em;",[342,4836,4838,4841],{"style":4837},"top:-2.655em;",[342,4839],{"className":4840,"style":438},[437],[342,4842,4844],{"className":4843},[699,700,701,702],[342,4845,4847],{"className":4846},[363,702],[342,4848,4499],{"className":4849},[363,702],[342,4851,4853,4856],{"style":4852},"top:-3.23em;",[342,4854],{"className":4855,"style":438},[437],[342,4857],{"className":4858,"style":4860},[4859],"frac-line","border-bottom-width:0.04em;",[342,4862,4864,4867],{"style":4863},"top:-3.394em;",[342,4865],{"className":4866,"style":438},[437],[342,4868,4870],{"className":4869},[699,700,701,702],[342,4871,4873],{"className":4872},[363,702],[342,4874,4876],{"className":4875},[363,702],"4",[342,4878,725],{"className":4879},[724],[342,4881,4883],{"className":4882},[426],[342,4884,4887],{"className":4885,"style":4886},[430],"height:0.345em;",[342,4888],{},[342,4890],{"className":4891},[1343,4820],[342,4893,3622],{"className":4894,"style":1177},[363,364],[342,4896,1295],{"className":4897},[1294],[342,4899,2089],{"className":4900},[363],[342,4902,4904,4907],{"className":4903},[1343],[342,4905,1344],{"className":4906},[1343],[342,4908,4910],{"className":4909},[1881],[342,4911,4913],{"className":4912},[422],[342,4914,4916],{"className":4915},[426],[342,4917,4920],{"className":4918,"style":4919},[430],"height:0.8641em;",[342,4921,4923,4926],{"style":4922},"top:-3.113em;margin-right:0.05em;",[342,4924],{"className":4925,"style":1898},[437],[342,4927,4929],{"className":4928},[699,700,701,702],[342,4930,4499],{"className":4931},[363,702],[342,4933],{"className":4934,"style":843},[738],[342,4936,848],{"className":4937},[847],[342,4939],{"className":4940,"style":843},[738],[342,4942,4944,4947,4950,4953],{"className":4943},[354],[342,4945],{"className":4946,"style":3183},[358],[342,4948,4876],{"className":4949},[363],[342,4951,3622],{"className":4952,"style":1177},[363,364],[342,4954,1910],{"className":4955},[1909],[318,4957,4958],{},"matching the earlier flux computation and explaining its value. The theorem\nconverts a hard surface integral into an easy volume integral whenever the\ndivergence is simple.",[535,4960,4961],{"type":1643},[318,4962,4963,4965,4966,5185,5186,5201,5202,5279,5280,5313,5314,5313,5347,5399,5400,5534,5535,5613],{},[326,4964,1648],{}," Find the flux of\n",[342,4967,4969],{"className":4968},[345],[342,4970,4972,5022,5084],{"className":4971,"ariaHidden":350},[349],[342,4973,4975,4978,5013,5016,5019],{"className":4974},[354],[342,4976],{"className":4977,"style":588},[358],[342,4979,4981],{"className":4980},[363,418],[342,4982,4984],{"className":4983},[422],[342,4985,4987],{"className":4986},[426],[342,4988,4990,4998],{"className":4989,"style":588},[430],[342,4991,4992,4995],{"style":433},[342,4993],{"className":4994,"style":438},[437],[342,4996,610],{"className":4997,"style":609},[363,364],[342,4999,5000,5003],{"style":613},[342,5001],{"className":5002,"style":438},[437],[342,5004,5006],{"className":5005,"style":620},[451],[342,5007,5009],{"className":5008,"style":625},[624],[627,5010,5011],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,5012],{"d":638},[342,5014],{"className":5015,"style":843},[738],[342,5017,848],{"className":5018},[847],[342,5020],{"className":5021,"style":843},[738],[342,5023,5025,5028,5031,5034,5037,5040,5043,5046,5075,5078,5081],{"className":5024},[354],[342,5026],{"className":5027,"style":1863},[358],[342,5029,1867],{"className":5030},[1294],[342,5032,1173],{"className":5033},[363,364],[342,5035,1178],{"className":5036,"style":1177},[363,364],[342,5038,1910],{"className":5039},[1909],[342,5041,1914],{"className":5042},[738],[342,5044],{"className":5045,"style":739},[738],[342,5047,5049,5052],{"className":5048},[363],[342,5050,1178],{"className":5051,"style":1177},[363,364],[342,5053,5055],{"className":5054},[1881],[342,5056,5058],{"className":5057},[422],[342,5059,5061],{"className":5060},[426],[342,5062,5064],{"className":5063,"style":1891},[430],[342,5065,5066,5069],{"style":1894},[342,5067],{"className":5068,"style":1898},[437],[342,5070,5072],{"className":5071},[699,700,701,702],[342,5073,1905],{"className":5074},[363,702],[342,5076],{"className":5077,"style":778},[738],[342,5079,2030],{"className":5080},[782],[342,5082],{"className":5083,"style":778},[738],[342,5085,5087,5091,5156,5159,5162,5165,5172,5175,5178,5181],{"className":5086},[354],[342,5088],{"className":5089,"style":5090},[358],"height:1.2369em;vertical-align:-0.25em;",[342,5092,5094,5098],{"className":5093},[363],[342,5095,5097],{"className":5096},[363,364],"e",[342,5099,5101],{"className":5100},[1881],[342,5102,5104],{"className":5103},[422],[342,5105,5107],{"className":5106},[426],[342,5108,5111],{"className":5109,"style":5110},[430],"height:0.9869em;",[342,5112,5113,5116],{"style":1894},[342,5114],{"className":5115,"style":1898},[437],[342,5117,5119],{"className":5118},[699,700,701,702],[342,5120,5122,5125],{"className":5121},[363,702],[342,5123,1173],{"className":5124},[363,364,702],[342,5126,5128,5131],{"className":5127},[363,702],[342,5129,1937],{"className":5130,"style":1936},[363,364,702],[342,5132,5134],{"className":5133},[1881],[342,5135,5137],{"className":5136},[422],[342,5138,5140],{"className":5139},[426],[342,5141,5144],{"className":5142,"style":5143},[430],"height:0.8913em;",[342,5145,5147,5150],{"style":5146},"top:-2.931em;margin-right:0.0714em;",[342,5148],{"className":5149,"style":3412},[437],[342,5151,5153],{"className":5152},[699,3416,3417,702],[342,5154,1905],{"className":5155},[363,702],[342,5157,1910],{"className":5158},[1909],[342,5160,1914],{"className":5161},[738],[342,5163],{"className":5164,"style":739},[738],[342,5166,5168],{"className":5167},[676],[342,5169,5171],{"className":5170},[363,917],"sin",[342,5173,1295],{"className":5174},[1294],[342,5176,1173],{"className":5177},[363,364],[342,5179,1178],{"className":5180,"style":1177},[363,364],[342,5182,5184],{"className":5183},[1343],")⟩"," outward across the\nboundary of the solid ",[342,5187,5189],{"className":5188},[345],[342,5190,5192],{"className":5191,"ariaHidden":350},[349],[342,5193,5195,5198],{"className":5194},[354],[342,5196],{"className":5197,"style":359},[358],[342,5199,3757],{"className":5200,"style":365},[363,364]," bounded by the parabolic cylinder ",[342,5203,5205],{"className":5204},[345],[342,5206,5208,5226,5244],{"className":5207,"ariaHidden":350},[349],[342,5209,5211,5214,5217,5220,5223],{"className":5210},[354],[342,5212],{"className":5213,"style":2103},[358],[342,5215,1937],{"className":5216,"style":1936},[363,364],[342,5218],{"className":5219,"style":843},[738],[342,5221,848],{"className":5222},[847],[342,5224],{"className":5225,"style":843},[738],[342,5227,5229,5232,5235,5238,5241],{"className":5228},[354],[342,5230],{"className":5231,"style":3164},[358],[342,5233,2089],{"className":5234},[363],[342,5236],{"className":5237,"style":778},[738],[342,5239,1871],{"className":5240},[782],[342,5242],{"className":5243,"style":778},[738],[342,5245,5247,5250],{"className":5246},[354],[342,5248],{"className":5249,"style":1891},[358],[342,5251,5253,5256],{"className":5252},[363],[342,5254,1173],{"className":5255},[363,364],[342,5257,5259],{"className":5258},[1881],[342,5260,5262],{"className":5261},[422],[342,5263,5265],{"className":5264},[426],[342,5266,5268],{"className":5267,"style":1891},[430],[342,5269,5270,5273],{"style":1894},[342,5271],{"className":5272,"style":1898},[437],[342,5274,5276],{"className":5275},[699,700,701,702],[342,5277,1905],{"className":5278},[363,702]," and the\nplanes ",[342,5281,5283],{"className":5282},[345],[342,5284,5286,5304],{"className":5285,"ariaHidden":350},[349],[342,5287,5289,5292,5295,5298,5301],{"className":5288},[354],[342,5290],{"className":5291,"style":2103},[358],[342,5293,1937],{"className":5294,"style":1936},[363,364],[342,5296],{"className":5297,"style":843},[738],[342,5299,848],{"className":5300},[847],[342,5302],{"className":5303,"style":843},[738],[342,5305,5307,5310],{"className":5306},[354],[342,5308],{"className":5309,"style":2085},[358],[342,5311,2992],{"className":5312},[363],", ",[342,5315,5317],{"className":5316},[345],[342,5318,5320,5338],{"className":5319,"ariaHidden":350},[349],[342,5321,5323,5326,5329,5332,5335],{"className":5322},[354],[342,5324],{"className":5325,"style":1169},[358],[342,5327,1178],{"className":5328,"style":1177},[363,364],[342,5330],{"className":5331,"style":843},[738],[342,5333,848],{"className":5334},[847],[342,5336],{"className":5337,"style":843},[738],[342,5339,5341,5344],{"className":5340},[354],[342,5342],{"className":5343,"style":2085},[358],[342,5345,2992],{"className":5346},[363],[342,5348,5350],{"className":5349},[345],[342,5351,5353,5372,5390],{"className":5352,"ariaHidden":350},[349],[342,5354,5356,5360,5363,5366,5369],{"className":5355},[354],[342,5357],{"className":5358,"style":5359},[358],"height:0.7778em;vertical-align:-0.1944em;",[342,5361,1178],{"className":5362,"style":1177},[363,364],[342,5364],{"className":5365,"style":778},[738],[342,5367,2030],{"className":5368},[782],[342,5370],{"className":5371,"style":778},[738],[342,5373,5375,5378,5381,5384,5387],{"className":5374},[354],[342,5376],{"className":5377,"style":2103},[358],[342,5379,1937],{"className":5380,"style":1936},[363,364],[342,5382],{"className":5383,"style":843},[738],[342,5385,848],{"className":5386},[847],[342,5388],{"className":5389,"style":843},[738],[342,5391,5393,5396],{"className":5392},[354],[342,5394],{"className":5395,"style":2085},[358],[342,5397,1905],{"className":5398},[363],". The surface has five faces; integrating over\neach would be tedious. But ",[342,5401,5403],{"className":5402},[345],[342,5404,5406,5465,5483,5504,5522],{"className":5405,"ariaHidden":350},[349],[342,5407,5409,5412,5418,5421,5456,5459,5462],{"className":5408},[354],[342,5410],{"className":5411,"style":588},[358],[342,5413,5415],{"className":5414},[676],[342,5416,4104],{"className":5417,"style":4103},[363,917],[342,5419],{"className":5420,"style":739},[738],[342,5422,5424],{"className":5423},[363,418],[342,5425,5427],{"className":5426},[422],[342,5428,5430],{"className":5429},[426],[342,5431,5433,5441],{"className":5432,"style":588},[430],[342,5434,5435,5438],{"style":433},[342,5436],{"className":5437,"style":438},[437],[342,5439,610],{"className":5440,"style":609},[363,364],[342,5442,5443,5446],{"style":613},[342,5444],{"className":5445,"style":438},[437],[342,5447,5449],{"className":5448,"style":620},[451],[342,5450,5452],{"className":5451,"style":625},[624],[627,5453,5454],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,5455],{"d":638},[342,5457],{"className":5458,"style":843},[738],[342,5460,848],{"className":5461},[847],[342,5463],{"className":5464,"style":843},[738],[342,5466,5468,5471,5474,5477,5480],{"className":5467},[354],[342,5469],{"className":5470,"style":5359},[358],[342,5472,1178],{"className":5473,"style":1177},[363,364],[342,5475],{"className":5476,"style":778},[738],[342,5478,2030],{"className":5479},[782],[342,5481],{"className":5482,"style":778},[738],[342,5484,5486,5489,5492,5495,5498,5501],{"className":5485},[354],[342,5487],{"className":5488,"style":3183},[358],[342,5490,1905],{"className":5491},[363],[342,5493,1178],{"className":5494,"style":1177},[363,364],[342,5496],{"className":5497,"style":778},[738],[342,5499,2030],{"className":5500},[782],[342,5502],{"className":5503,"style":778},[738],[342,5505,5507,5510,5513,5516,5519],{"className":5506},[354],[342,5508],{"className":5509,"style":2085},[358],[342,5511,2992],{"className":5512},[363],[342,5514],{"className":5515,"style":843},[738],[342,5517,848],{"className":5518},[847],[342,5520],{"className":5521,"style":843},[738],[342,5523,5525,5528,5531],{"className":5524},[354],[342,5526],{"className":5527,"style":3183},[358],[342,5529,4499],{"className":5530},[363],[342,5532,1178],{"className":5533,"style":1177},[363,364]," is a\npolynomial, and ",[342,5536,5538],{"className":5537},[345],[342,5539,5541],{"className":5540,"ariaHidden":350},[349],[342,5542,5544,5548,5592,5595,5598,5601,5604,5607,5610],{"className":5543},[354],[342,5545],{"className":5546,"style":5547},[358],"height:1.8553em;vertical-align:-1.0498em;",[342,5549,5551],{"className":5550},[676,677],[342,5552,5554,5584],{"className":5553},[422,681],[342,5555,5557,5581],{"className":5556},[426],[342,5558,5560,5571],{"className":5559,"style":1253},[430],[342,5561,5562,5565],{"style":1256},[342,5563],{"className":5564,"style":438},[437],[342,5566,5568],{"className":5567},[699,700,701,702],[342,5569,3757],{"className":5570,"style":365},[363,364,702],[342,5572,5573,5576],{"style":1268},[342,5574],{"className":5575,"style":438},[437],[342,5577,5578],{},[342,5579,4082],{"className":5580,"style":1278},[676,717,1277],[342,5582,725],{"className":5583},[724],[342,5585,5587],{"className":5586},[426],[342,5588,5590],{"className":5589,"style":1288},[430],[342,5591],{},[342,5593],{"className":5594,"style":739},[738],[342,5596,4499],{"className":5597},[363],[342,5599,1178],{"className":5600,"style":1177},[363,364],[342,5602],{"className":5603,"style":739},[738],[342,5605],{"className":5606,"style":739},[738],[342,5608,801],{"className":5609},[363,800],[342,5611,4155],{"className":5612,"style":778},[363,364]," over the described solid is a routine iterated\nintegral. The Divergence Theorem replaces a five-face surface integral with a\nsingle triple integral. This asymmetry, one side far easier than the other, is\nthe practical value of every theorem in the group.",[335,5615,5617],{"id":5616},"one-theorem-in-every-dimension","One theorem in every dimension",[318,5619,5620,5621,5668,5669,5716],{},"The four fundamental theorems of this subject share a form: the integral of a\nderivative of ",[342,5622,5624],{"className":5623},[345],[342,5625,5627],{"className":5626,"ariaHidden":350},[349],[342,5628,5630,5633],{"className":5629},[354],[342,5631],{"className":5632,"style":588},[358],[342,5634,5636],{"className":5635},[363,418],[342,5637,5639],{"className":5638},[422],[342,5640,5642],{"className":5641},[426],[342,5643,5645,5653],{"className":5644,"style":588},[430],[342,5646,5647,5650],{"style":433},[342,5648],{"className":5649,"style":438},[437],[342,5651,610],{"className":5652,"style":609},[363,364],[342,5654,5655,5658],{"style":613},[342,5656],{"className":5657,"style":438},[437],[342,5659,5661],{"className":5660,"style":620},[451],[342,5662,5664],{"className":5663,"style":625},[624],[627,5665,5666],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,5667],{"d":638}," over an oriented region equals the integral of\n",[342,5670,5672],{"className":5671},[345],[342,5673,5675],{"className":5674,"ariaHidden":350},[349],[342,5676,5678,5681],{"className":5677},[354],[342,5679],{"className":5680,"style":588},[358],[342,5682,5684],{"className":5683},[363,418],[342,5685,5687],{"className":5686},[422],[342,5688,5690],{"className":5689},[426],[342,5691,5693,5701],{"className":5692,"style":588},[430],[342,5694,5695,5698],{"style":433},[342,5696],{"className":5697,"style":438},[437],[342,5699,610],{"className":5700,"style":609},[363,364],[342,5702,5703,5706],{"style":613},[342,5704],{"className":5705,"style":438},[437],[342,5707,5709],{"className":5708,"style":620},[451],[342,5710,5712],{"className":5711,"style":625},[624],[627,5713,5714],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,5715],{"d":638}," over the oriented boundary of that region.",[342,5718,5720],{"className":5719},[659],[342,5721,5723],{"className":5722},[345],[342,5724,5726,5847],{"className":5725,"ariaHidden":350},[349],[342,5727,5729,5733,5790,5793,5800,5835,5838,5841,5844],{"className":5728},[354],[342,5730],{"className":5731,"style":5732},[358],"height:3.0919em;vertical-align:-1.7307em;",[342,5734,5736,5739],{"className":5735},[676,677],[342,5737],{"className":5738,"style":719},[738],[342,5740,5742,5781],{"className":5741},[422,681],[342,5743,5745,5778],{"className":5744},[426],[342,5746,5748,5767],{"className":5747,"style":688},[430],[342,5749,5751,5754],{"style":5750},"top:-1.8654em;margin-left:-0.4445em;",[342,5752],{"className":5753,"style":695},[437],[342,5755,5757],{"className":5756},[699,700,701,702],[342,5758,5760],{"className":5759},[363,702],[342,5761,5763],{"className":5762},[363,4766,702],[342,5764,5766],{"className":5765},[363,702],"region",[342,5768,5769,5772],{"style":708},[342,5770],{"className":5771,"style":695},[437],[342,5773,5774],{},[342,5775,5777],{"className":5776,"style":719},[676,717,718],"∫",[342,5779,725],{"className":5780},[724],[342,5782,5784],{"className":5783},[426],[342,5785,5788],{"className":5786,"style":5787},[430],"height:1.7307em;",[342,5789],{},[342,5791,1295],{"className":5792},[1294],[342,5794,5796],{"className":5795},[363,4766],[342,5797,5799],{"className":5798},[363],"derivative of ",[342,5801,5803],{"className":5802},[363,418],[342,5804,5806],{"className":5805},[422],[342,5807,5809],{"className":5808},[426],[342,5810,5812,5820],{"className":5811,"style":588},[430],[342,5813,5814,5817],{"style":433},[342,5815],{"className":5816,"style":438},[437],[342,5818,610],{"className":5819,"style":609},[363,364],[342,5821,5822,5825],{"style":613},[342,5823],{"className":5824,"style":438},[437],[342,5826,5828],{"className":5827,"style":620},[451],[342,5829,5831],{"className":5830,"style":625},[624],[627,5832,5833],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,5834],{"d":638},[342,5836,1344],{"className":5837},[1343],[342,5839],{"className":5840,"style":843},[738],[342,5842,848],{"className":5843},[847],[342,5845],{"className":5846,"style":843},[738],[342,5848,5850,5854,5918,5921,5956],{"className":5849},[354],[342,5851],{"className":5852,"style":5853},[358],"height:3.1883em;vertical-align:-1.8271em;",[342,5855,5857,5860],{"className":5856},[676,677],[342,5858],{"className":5859,"style":719},[738],[342,5861,5863,5909],{"className":5862},[422,681],[342,5864,5866,5906],{"className":5865},[426],[342,5867,5869,5896],{"className":5868,"style":688},[430],[342,5870,5872,5875],{"style":5871},"top:-1.8079em;margin-left:-0.4445em;",[342,5873],{"className":5874,"style":695},[437],[342,5876,5878],{"className":5877},[699,700,701,702],[342,5879,5881,5884,5887,5893],{"className":5880},[363,702],[342,5882,2546],{"className":5883,"style":2545},[363,702],[342,5885,1295],{"className":5886},[1294,702],[342,5888,5890],{"className":5889},[363,4766,702],[342,5891,5766],{"className":5892},[363,702],[342,5894,1344],{"className":5895},[1343,702],[342,5897,5898,5901],{"style":708},[342,5899],{"className":5900,"style":695},[437],[342,5902,5903],{},[342,5904,5777],{"className":5905,"style":719},[676,717,718],[342,5907,725],{"className":5908},[724],[342,5910,5912],{"className":5911},[426],[342,5913,5916],{"className":5914,"style":5915},[430],"height:1.8271em;",[342,5917],{},[342,5919],{"className":5920,"style":739},[738],[342,5922,5924],{"className":5923},[363,418],[342,5925,5927],{"className":5926},[422],[342,5928,5930],{"className":5929},[426],[342,5931,5933,5941],{"className":5932,"style":588},[430],[342,5934,5935,5938],{"style":433},[342,5936],{"className":5937,"style":438},[437],[342,5939,610],{"className":5940,"style":609},[363,364],[342,5942,5943,5946],{"style":613},[342,5944],{"className":5945,"style":438},[437],[342,5947,5949],{"className":5948,"style":620},[451],[342,5950,5952],{"className":5951,"style":625},[624],[627,5953,5954],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,5955],{"d":638},[342,5957,1016],{"className":5958},[363],[318,5960,5961],{},"Each theorem instantiates it one dimension higher, with the derivative and the\nboundary changing to match.",[1406,5963],{"hash":5964},"00e45214c86af3dd0f02cfd5e2793c2f9d2f059633d82d351233b42f65958990",[318,5966,5967],{},"The correspondence is exact once the derivative and boundary are named for each\ncase.",[5969,5970,5971,6040],"table",{},[5972,5973,5974],"thead",{},[5975,5976,5977,5981,5984,5987,6037],"tr",{},[5978,5979,5980],"th",{},"Theorem",[5978,5982,5983],{},"Region",[5978,5985,5986],{},"Boundary",[5978,5988,5989,5990],{},"Derivative of ",[342,5991,5993],{"className":5992},[345],[342,5994,5996],{"className":5995,"ariaHidden":350},[349],[342,5997,5999,6002],{"className":5998},[354],[342,6000],{"className":6001,"style":588},[358],[342,6003,6005],{"className":6004},[363,418],[342,6006,6008],{"className":6007},[422],[342,6009,6011],{"className":6010},[426],[342,6012,6014,6022],{"className":6013,"style":588},[430],[342,6015,6016,6019],{"style":433},[342,6017],{"className":6018,"style":438},[437],[342,6020,610],{"className":6021,"style":609},[363,364],[342,6023,6024,6027],{"style":613},[342,6025],{"className":6026,"style":438},[437],[342,6028,6030],{"className":6029,"style":620},[451],[342,6031,6033],{"className":6032,"style":625},[624],[627,6034,6035],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,6036],{"d":638},[5978,6038,6039],{},"Statement",[6041,6042,6043,6308,6534,7031,7456],"tbody",{},[5975,6044,6045,6049,6085,6088,6136],{},[6046,6047,6048],"td",{},"FTC",[6046,6050,6051,6052],{},"interval ",[342,6053,6055],{"className":6054},[345],[342,6056,6058],{"className":6057,"ariaHidden":350},[349],[342,6059,6061,6064,6068,6071,6074,6077,6081],{"className":6060},[354],[342,6062],{"className":6063,"style":2985},[358],[342,6065,6067],{"className":6066},[1294],"[",[342,6069,321],{"className":6070},[363,364],[342,6072,1910],{"className":6073},[1909],[342,6075],{"className":6076,"style":739},[738],[342,6078,6080],{"className":6079},[363,364],"b",[342,6082,6084],{"className":6083},[1343],"]",[6046,6086,6087],{},"two endpoints",[6046,6089,6090],{},[342,6091,6093],{"className":6092},[345],[342,6094,6096],{"className":6095,"ariaHidden":350},[349],[342,6097,6099,6103],{"className":6098},[354],[342,6100],{"className":6101,"style":6102},[358],"height:0.7519em;",[342,6104,6106,6109],{"className":6105},[363],[342,6107,610],{"className":6108,"style":609},[363,364],[342,6110,6112],{"className":6111},[1881],[342,6113,6115],{"className":6114},[422],[342,6116,6118],{"className":6117},[426],[342,6119,6121],{"className":6120,"style":6102},[430],[342,6122,6123,6126],{"style":1894},[342,6124],{"className":6125,"style":1898},[437],[342,6127,6129],{"className":6128},[699,700,701,702],[342,6130,6132],{"className":6131},[363,702],[342,6133,6135],{"className":6134},[363,702],"′",[6046,6137,6138],{},[342,6139,6141],{"className":6140},[345],[342,6142,6144,6263,6290],{"className":6143,"ariaHidden":350},[349],[342,6145,6147,6151,6207,6210,6242,6245,6248,6251,6254,6257,6260],{"className":6146},[354],[342,6148],{"className":6149,"style":6150},[358],"height:1.3998em;vertical-align:-0.3558em;",[342,6152,6154,6158],{"className":6153},[676],[342,6155,5777],{"className":6156,"style":6157},[676,717,1277],"margin-right:0.1945em;position:relative;top:-0.0006em;",[342,6159,6161],{"className":6160},[1881],[342,6162,6164,6198],{"className":6163},[422,681],[342,6165,6167,6195],{"className":6166},[426],[342,6168,6171,6183],{"className":6169,"style":6170},[430],"height:1.044em;",[342,6172,6174,6177],{"style":6173},"top:-2.3442em;margin-left:-0.1945em;margin-right:0.05em;",[342,6175],{"className":6176,"style":1898},[437],[342,6178,6180],{"className":6179},[699,700,701,702],[342,6181,321],{"className":6182},[363,364,702],[342,6184,6186,6189],{"style":6185},"top:-3.2579em;margin-right:0.05em;",[342,6187],{"className":6188,"style":1898},[437],[342,6190,6192],{"className":6191},[699,700,701,702],[342,6193,6080],{"className":6194},[363,364,702],[342,6196,725],{"className":6197},[724],[342,6199,6201],{"className":6200},[426],[342,6202,6205],{"className":6203,"style":6204},[430],"height:0.3558em;",[342,6206],{},[342,6208],{"className":6209,"style":739},[738],[342,6211,6213,6216],{"className":6212},[363],[342,6214,610],{"className":6215,"style":609},[363,364],[342,6217,6219],{"className":6218},[1881],[342,6220,6222],{"className":6221},[422],[342,6223,6225],{"className":6224},[426],[342,6226,6228],{"className":6227,"style":6102},[430],[342,6229,6230,6233],{"style":1894},[342,6231],{"className":6232,"style":1898},[437],[342,6234,6236],{"className":6235},[699,700,701,702],[342,6237,6239],{"className":6238},[363,702],[342,6240,6135],{"className":6241},[363,702],[342,6243],{"className":6244,"style":739},[738],[342,6246],{"className":6247,"style":739},[738],[342,6249,801],{"className":6250},[363,800],[342,6252,1173],{"className":6253},[363,364],[342,6255],{"className":6256,"style":843},[738],[342,6258,848],{"className":6259},[847],[342,6261],{"className":6262,"style":843},[738],[342,6264,6266,6269,6272,6275,6278,6281,6284,6287],{"className":6265},[354],[342,6267],{"className":6268,"style":2985},[358],[342,6270,610],{"className":6271,"style":609},[363,364],[342,6273,1295],{"className":6274},[1294],[342,6276,6080],{"className":6277},[363,364],[342,6279,1344],{"className":6280},[1343],[342,6282],{"className":6283,"style":778},[738],[342,6285,1871],{"className":6286},[782],[342,6288],{"className":6289,"style":778},[738],[342,6291,6293,6296,6299,6302,6305],{"className":6292},[354],[342,6294],{"className":6295,"style":2985},[358],[342,6297,610],{"className":6298,"style":609},[363,364],[342,6300,1295],{"className":6301},[1294],[342,6303,321],{"className":6304},[363,364],[342,6306,1344],{"className":6307},[1343],[5975,6309,6310,6313,6331,6333,6357],{},[6046,6311,6312],{},"Line integrals",[6046,6314,6315,6316],{},"curve ",[342,6317,6319],{"className":6318},[345],[342,6320,6322],{"className":6321,"ariaHidden":350},[349],[342,6323,6325,6328],{"className":6324},[354],[342,6326],{"className":6327,"style":359},[358],[342,6329,384],{"className":6330,"style":383},[363,364],[6046,6332,6087],{},[6046,6334,6335],{},[342,6336,6338],{"className":6337},[345],[342,6339,6341],{"className":6340,"ariaHidden":350},[349],[342,6342,6344,6348,6352],{"className":6343},[354],[342,6345],{"className":6346,"style":6347},[358],"height:0.8889em;vertical-align:-0.1944em;",[342,6349,6351],{"className":6350},[363],"∇",[342,6353,6356],{"className":6354,"style":6355},[363,364],"margin-right:0.1076em;","f",[6046,6358,6359],{},[342,6360,6362],{"className":6361},[345],[342,6363,6365,6434,6487,6516],{"className":6364,"ariaHidden":350},[349],[342,6366,6368,6372,6413,6416,6419,6422,6425,6428,6431],{"className":6367},[354],[342,6369],{"className":6370,"style":6371},[358],"height:1.1608em;vertical-align:-0.3558em;",[342,6373,6375,6378],{"className":6374},[676],[342,6376,5777],{"className":6377,"style":6157},[676,717,1277],[342,6379,6381],{"className":6380},[1881],[342,6382,6384,6405],{"className":6383},[422,681],[342,6385,6387,6402],{"className":6386},[426],[342,6388,6391],{"className":6389,"style":6390},[430],"height:0.1225em;",[342,6392,6393,6396],{"style":6173},[342,6394],{"className":6395,"style":1898},[437],[342,6397,6399],{"className":6398},[699,700,701,702],[342,6400,384],{"className":6401,"style":383},[363,364,702],[342,6403,725],{"className":6404},[724],[342,6406,6408],{"className":6407},[426],[342,6409,6411],{"className":6410,"style":6204},[430],[342,6412],{},[342,6414],{"className":6415,"style":739},[738],[342,6417,6351],{"className":6418},[363],[342,6420,6356],{"className":6421,"style":6355},[363,364],[342,6423],{"className":6424,"style":778},[738],[342,6426,783],{"className":6427},[782],[342,6429],{"className":6430,"style":739},[738],[342,6432],{"className":6433,"style":778},[738],[342,6435,6437,6440,6443,6478,6481,6484],{"className":6436},[354],[342,6438],{"className":6439,"style":796},[358],[342,6441,801],{"className":6442},[363,800],[342,6444,6446],{"className":6445},[363,418],[342,6447,6449],{"className":6448},[422],[342,6450,6452],{"className":6451},[426],[342,6453,6455,6463],{"className":6454,"style":796},[430],[342,6456,6457,6460],{"style":433},[342,6458],{"className":6459,"style":438},[437],[342,6461,823],{"className":6462,"style":822},[363,364],[342,6464,6465,6468],{"style":433},[342,6466],{"className":6467,"style":438},[437],[342,6469,6471],{"className":6470,"style":832},[451],[342,6472,6474],{"className":6473,"style":625},[624],[627,6475,6476],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,6477],{"d":638},[342,6479],{"className":6480,"style":843},[738],[342,6482,848],{"className":6483},[847],[342,6485],{"className":6486,"style":843},[738],[342,6488,6490,6493,6496,6499,6504,6507,6510,6513],{"className":6489},[354],[342,6491],{"className":6492,"style":2985},[358],[342,6494,6356],{"className":6495,"style":6355},[363,364],[342,6497,1295],{"className":6498},[1294],[342,6500,6503],{"className":6501,"style":6502},[363,364],"margin-right:0.0502em;","B",[342,6505,1344],{"className":6506},[1343],[342,6508],{"className":6509,"style":778},[738],[342,6511,1871],{"className":6512},[782],[342,6514],{"className":6515,"style":778},[738],[342,6517,6519,6522,6525,6528,6531],{"className":6518},[354],[342,6520],{"className":6521,"style":2985},[358],[342,6523,6356],{"className":6524,"style":6355},[363,364],[342,6526,1295],{"className":6527},[1294],[342,6529,1403],{"className":6530},[363,364],[342,6532,1344],{"className":6533},[1343],[5975,6535,6536,6539,6558,6579,6694],{},[6046,6537,6538],{},"Green",[6046,6540,6541,6542],{},"plane region ",[342,6543,6545],{"className":6544},[345],[342,6546,6548],{"className":6547,"ariaHidden":350},[349],[342,6549,6551,6554],{"className":6550},[354],[342,6552],{"className":6553,"style":359},[358],[342,6555,6557],{"className":6556,"style":822},[363,364],"D",[6046,6559,6560,6561],{},"closed curve ",[342,6562,6564],{"className":6563},[345],[342,6565,6567],{"className":6566,"ariaHidden":350},[349],[342,6568,6570,6573,6576],{"className":6569},[354],[342,6571],{"className":6572,"style":414},[358],[342,6574,2546],{"className":6575,"style":2545},[363],[342,6577,6557],{"className":6578,"style":822},[363,364],[6046,6580,6581],{},[342,6582,6584],{"className":6583},[345],[342,6585,6587,6645],{"className":6586,"ariaHidden":350},[349],[342,6588,6590,6594,6636,6639,6642],{"className":6589},[354],[342,6591],{"className":6592,"style":6593},[358],"height:0.8778em;vertical-align:-0.1944em;",[342,6595,6597,6601],{"className":6596},[363],[342,6598,6600],{"className":6599},[363,364],"Q",[342,6602,6604],{"className":6603},[1881],[342,6605,6607,6628],{"className":6606},[422,681],[342,6608,6610,6625],{"className":6609},[426],[342,6611,6613],{"className":6612,"style":2559},[430],[342,6614,6616,6619],{"style":6615},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[342,6617],{"className":6618,"style":1898},[437],[342,6620,6622],{"className":6621},[699,700,701,702],[342,6623,1173],{"className":6624},[363,364,702],[342,6626,725],{"className":6627},[724],[342,6629,6631],{"className":6630},[426],[342,6632,6634],{"className":6633,"style":2581},[430],[342,6635],{},[342,6637],{"className":6638,"style":778},[738],[342,6640,1871],{"className":6641},[782],[342,6643],{"className":6644,"style":778},[738],[342,6646,6648,6652],{"className":6647},[354],[342,6649],{"className":6650,"style":6651},[358],"height:0.9694em;vertical-align:-0.2861em;",[342,6653,6655,6659],{"className":6654},[363],[342,6656,6658],{"className":6657,"style":609},[363,364],"P",[342,6660,6662],{"className":6661},[1881],[342,6663,6665,6686],{"className":6664},[422,681],[342,6666,6668,6683],{"className":6667},[426],[342,6669,6671],{"className":6670,"style":2559},[430],[342,6672,6674,6677],{"style":6673},"top:-2.55em;margin-left:-0.1389em;margin-right:0.05em;",[342,6675],{"className":6676,"style":1898},[437],[342,6678,6680],{"className":6679},[699,700,701,702],[342,6681,1178],{"className":6682,"style":1177},[363,364,702],[342,6684,725],{"className":6685},[724],[342,6687,6689],{"className":6688},[426],[342,6690,6692],{"className":6691,"style":2755},[430],[342,6693],{},[6046,6695,6696],{},[342,6697,6699],{"className":6698},[345],[342,6700,6702,6814,6867,6969],{"className":6701,"ariaHidden":350},[349],[342,6703,6705,6709,6764,6767,6802,6805,6808,6811],{"className":6704},[354],[342,6706],{"className":6707,"style":6708},[358],"height:2.024em;vertical-align:-1.0577em;",[342,6710,6712,6715],{"className":6711},[676,677],[342,6713],{"className":6714,"style":1278},[738],[342,6716,6718,6755],{"className":6717},[422,681],[342,6719,6721,6752],{"className":6720},[426],[342,6722,6724,6742],{"className":6723,"style":1510},[430],[342,6725,6727,6730],{"style":6726},"top:-2.0423em;margin-left:-0.1945em;",[342,6728],{"className":6729,"style":438},[437],[342,6731,6733],{"className":6732},[699,700,701,702],[342,6734,6736,6739],{"className":6735},[363,702],[342,6737,2546],{"className":6738,"style":2545},[363,702],[342,6740,6557],{"className":6741,"style":822},[363,364,702],[342,6743,6744,6747],{"style":1525},[342,6745],{"className":6746,"style":438},[437],[342,6748,6749],{},[342,6750,720],{"className":6751,"style":1278},[676,717,1277],[342,6753,725],{"className":6754},[724],[342,6756,6758],{"className":6757},[426],[342,6759,6762],{"className":6760,"style":6761},[430],"height:1.0577em;",[342,6763],{},[342,6765],{"className":6766,"style":739},[738],[342,6768,6770],{"className":6769},[363,418],[342,6771,6773],{"className":6772},[422],[342,6774,6776],{"className":6775},[426],[342,6777,6779,6787],{"className":6778,"style":588},[430],[342,6780,6781,6784],{"style":433},[342,6782],{"className":6783,"style":438},[437],[342,6785,610],{"className":6786,"style":609},[363,364],[342,6788,6789,6792],{"style":613},[342,6790],{"className":6791,"style":438},[437],[342,6793,6795],{"className":6794,"style":620},[451],[342,6796,6798],{"className":6797,"style":625},[624],[627,6799,6800],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,6801],{"d":638},[342,6803],{"className":6804,"style":778},[738],[342,6806,783],{"className":6807},[782],[342,6809],{"className":6810,"style":739},[738],[342,6812],{"className":6813,"style":778},[738],[342,6815,6817,6820,6823,6858,6861,6864],{"className":6816},[354],[342,6818],{"className":6819,"style":796},[358],[342,6821,801],{"className":6822},[363,800],[342,6824,6826],{"className":6825},[363,418],[342,6827,6829],{"className":6828},[422],[342,6830,6832],{"className":6831},[426],[342,6833,6835,6843],{"className":6834,"style":796},[430],[342,6836,6837,6840],{"style":433},[342,6838],{"className":6839,"style":438},[437],[342,6841,823],{"className":6842,"style":822},[363,364],[342,6844,6845,6848],{"style":433},[342,6846],{"className":6847,"style":438},[437],[342,6849,6851],{"className":6850,"style":832},[451],[342,6852,6854],{"className":6853,"style":625},[624],[627,6855,6856],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,6857],{"d":638},[342,6859],{"className":6860,"style":843},[738],[342,6862,848],{"className":6863},[847],[342,6865],{"className":6866,"style":843},[738],[342,6868,6870,6873,6917,6920,6960,6963,6966],{"className":6869},[354],[342,6871],{"className":6872,"style":5547},[358],[342,6874,6876],{"className":6875},[676,677],[342,6877,6879,6909],{"className":6878},[422,681],[342,6880,6882,6906],{"className":6881},[426],[342,6883,6885,6896],{"className":6884,"style":1253},[430],[342,6886,6887,6890],{"style":1256},[342,6888],{"className":6889,"style":438},[437],[342,6891,6893],{"className":6892},[699,700,701,702],[342,6894,6557],{"className":6895,"style":822},[363,364,702],[342,6897,6898,6901],{"style":1268},[342,6899],{"className":6900,"style":438},[437],[342,6902,6903],{},[342,6904,895],{"className":6905,"style":1278},[676,717,1277],[342,6907,725],{"className":6908},[724],[342,6910,6912],{"className":6911},[426],[342,6913,6915],{"className":6914,"style":1288},[430],[342,6916],{},[342,6918,1295],{"className":6919},[1294],[342,6921,6923,6926],{"className":6922},[363],[342,6924,6600],{"className":6925},[363,364],[342,6927,6929],{"className":6928},[1881],[342,6930,6932,6952],{"className":6931},[422,681],[342,6933,6935,6949],{"className":6934},[426],[342,6936,6938],{"className":6937,"style":2559},[430],[342,6939,6940,6943],{"style":6615},[342,6941],{"className":6942,"style":1898},[437],[342,6944,6946],{"className":6945},[699,700,701,702],[342,6947,1173],{"className":6948},[363,364,702],[342,6950,725],{"className":6951},[724],[342,6953,6955],{"className":6954},[426],[342,6956,6958],{"className":6957,"style":2581},[430],[342,6959],{},[342,6961],{"className":6962,"style":778},[738],[342,6964,1871],{"className":6965},[782],[342,6967],{"className":6968,"style":778},[738],[342,6970,6972,6976,7016,7019,7022,7025,7028],{"className":6971},[354],[342,6973],{"className":6974,"style":6975},[358],"height:1.0361em;vertical-align:-0.2861em;",[342,6977,6979,6982],{"className":6978},[363],[342,6980,6658],{"className":6981,"style":609},[363,364],[342,6983,6985],{"className":6984},[1881],[342,6986,6988,7008],{"className":6987},[422,681],[342,6989,6991,7005],{"className":6990},[426],[342,6992,6994],{"className":6993,"style":2559},[430],[342,6995,6996,6999],{"style":6673},[342,6997],{"className":6998,"style":1898},[437],[342,7000,7002],{"className":7001},[699,700,701,702],[342,7003,1178],{"className":7004,"style":1177},[363,364,702],[342,7006,725],{"className":7007},[724],[342,7009,7011],{"className":7010},[426],[342,7012,7014],{"className":7013,"style":2755},[430],[342,7015],{},[342,7017,1344],{"className":7018},[1343],[342,7020],{"className":7021,"style":739},[738],[342,7023],{"className":7024,"style":739},[738],[342,7026,801],{"className":7027},[363,800],[342,7029,1403],{"className":7030},[363,364],[5975,7032,7033,7036,7054,7075,7133],{},[6046,7034,7035],{},"Stokes",[6046,7037,7038,7039],{},"surface ",[342,7040,7042],{"className":7041},[345],[342,7043,7045],{"className":7044,"ariaHidden":350},[349],[342,7046,7048,7051],{"className":7047},[354],[342,7049],{"className":7050,"style":359},[358],[342,7052,366],{"className":7053,"style":365},[363,364],[6046,7055,7056,7057],{},"boundary curve ",[342,7058,7060],{"className":7059},[345],[342,7061,7063],{"className":7062,"ariaHidden":350},[349],[342,7064,7066,7069,7072],{"className":7065},[354],[342,7067],{"className":7068,"style":414},[358],[342,7070,2546],{"className":7071,"style":2545},[363],[342,7073,366],{"className":7074,"style":365},[363,364],[6046,7076,7077],{},[342,7078,7080],{"className":7079},[345],[342,7081,7083],{"className":7082,"ariaHidden":350},[349],[342,7084,7086,7089,7095,7098],{"className":7085},[354],[342,7087],{"className":7088,"style":588},[358],[342,7090,7092],{"className":7091},[676],[342,7093,918],{"className":7094},[363,917],[342,7096],{"className":7097,"style":739},[738],[342,7099,7101],{"className":7100},[363,418],[342,7102,7104],{"className":7103},[422],[342,7105,7107],{"className":7106},[426],[342,7108,7110,7118],{"className":7109,"style":588},[430],[342,7111,7112,7115],{"style":433},[342,7113],{"className":7114,"style":438},[437],[342,7116,610],{"className":7117,"style":609},[363,364],[342,7119,7120,7123],{"style":613},[342,7121],{"className":7122,"style":438},[437],[342,7124,7126],{"className":7125,"style":620},[451],[342,7127,7129],{"className":7128,"style":625},[624],[627,7130,7131],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7132],{"d":638},[6046,7134,7135],{},[342,7136,7138],{"className":7137},[345],[342,7139,7141,7250,7303,7412],{"className":7140,"ariaHidden":350},[349],[342,7142,7144,7147,7200,7203,7238,7241,7244,7247],{"className":7143},[354],[342,7145],{"className":7146,"style":6708},[358],[342,7148,7150,7153],{"className":7149},[676,677],[342,7151],{"className":7152,"style":1278},[738],[342,7154,7156,7192],{"className":7155},[422,681],[342,7157,7159,7189],{"className":7158},[426],[342,7160,7162,7179],{"className":7161,"style":1510},[430],[342,7163,7164,7167],{"style":6726},[342,7165],{"className":7166,"style":438},[437],[342,7168,7170],{"className":7169},[699,700,701,702],[342,7171,7173,7176],{"className":7172},[363,702],[342,7174,2546],{"className":7175,"style":2545},[363,702],[342,7177,366],{"className":7178,"style":365},[363,364,702],[342,7180,7181,7184],{"style":1525},[342,7182],{"className":7183,"style":438},[437],[342,7185,7186],{},[342,7187,720],{"className":7188,"style":1278},[676,717,1277],[342,7190,725],{"className":7191},[724],[342,7193,7195],{"className":7194},[426],[342,7196,7198],{"className":7197,"style":6761},[430],[342,7199],{},[342,7201],{"className":7202,"style":739},[738],[342,7204,7206],{"className":7205},[363,418],[342,7207,7209],{"className":7208},[422],[342,7210,7212],{"className":7211},[426],[342,7213,7215,7223],{"className":7214,"style":588},[430],[342,7216,7217,7220],{"style":433},[342,7218],{"className":7219,"style":438},[437],[342,7221,610],{"className":7222,"style":609},[363,364],[342,7224,7225,7228],{"style":613},[342,7226],{"className":7227,"style":438},[437],[342,7229,7231],{"className":7230,"style":620},[451],[342,7232,7234],{"className":7233,"style":625},[624],[627,7235,7236],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7237],{"d":638},[342,7239],{"className":7240,"style":778},[738],[342,7242,783],{"className":7243},[782],[342,7245],{"className":7246,"style":739},[738],[342,7248],{"className":7249,"style":778},[738],[342,7251,7253,7256,7259,7294,7297,7300],{"className":7252},[354],[342,7254],{"className":7255,"style":796},[358],[342,7257,801],{"className":7258},[363,800],[342,7260,7262],{"className":7261},[363,418],[342,7263,7265],{"className":7264},[422],[342,7266,7268],{"className":7267},[426],[342,7269,7271,7279],{"className":7270,"style":796},[430],[342,7272,7273,7276],{"style":433},[342,7274],{"className":7275,"style":438},[437],[342,7277,823],{"className":7278,"style":822},[363,364],[342,7280,7281,7284],{"style":433},[342,7282],{"className":7283,"style":438},[437],[342,7285,7287],{"className":7286,"style":832},[451],[342,7288,7290],{"className":7289,"style":625},[624],[627,7291,7292],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7293],{"d":638},[342,7295],{"className":7296,"style":843},[738],[342,7298,848],{"className":7299},[847],[342,7301],{"className":7302,"style":843},[738],[342,7304,7306,7309,7353,7356,7362,7365,7400,7403,7406,7409],{"className":7305},[354],[342,7307],{"className":7308,"style":1240},[358],[342,7310,7312],{"className":7311},[676,677],[342,7313,7315,7345],{"className":7314},[422,681],[342,7316,7318,7342],{"className":7317},[426],[342,7319,7321,7332],{"className":7320,"style":1253},[430],[342,7322,7323,7326],{"style":1256},[342,7324],{"className":7325,"style":438},[437],[342,7327,7329],{"className":7328},[699,700,701,702],[342,7330,366],{"className":7331,"style":365},[363,364,702],[342,7333,7334,7337],{"style":1268},[342,7335],{"className":7336,"style":438},[437],[342,7338,7339],{},[342,7340,895],{"className":7341,"style":1278},[676,717,1277],[342,7343,725],{"className":7344},[724],[342,7346,7348],{"className":7347},[426],[342,7349,7351],{"className":7350,"style":1288},[430],[342,7352],{},[342,7354],{"className":7355,"style":739},[738],[342,7357,7359],{"className":7358},[676],[342,7360,918],{"className":7361},[363,917],[342,7363],{"className":7364,"style":739},[738],[342,7366,7368],{"className":7367},[363,418],[342,7369,7371],{"className":7370},[422],[342,7372,7374],{"className":7373},[426],[342,7375,7377,7385],{"className":7376,"style":588},[430],[342,7378,7379,7382],{"style":433},[342,7380],{"className":7381,"style":438},[437],[342,7383,610],{"className":7384,"style":609},[363,364],[342,7386,7387,7390],{"style":613},[342,7388],{"className":7389,"style":438},[437],[342,7391,7393],{"className":7392,"style":620},[451],[342,7394,7396],{"className":7395,"style":625},[624],[627,7397,7398],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7399],{"d":638},[342,7401],{"className":7402,"style":778},[738],[342,7404,783],{"className":7405},[782],[342,7407],{"className":7408,"style":739},[738],[342,7410],{"className":7411,"style":778},[738],[342,7413,7415,7418,7421],{"className":7414},[354],[342,7416],{"className":7417,"style":588},[358],[342,7419,801],{"className":7420},[363,800],[342,7422,7424],{"className":7423},[363,418],[342,7425,7427],{"className":7426},[422],[342,7428,7430],{"className":7429},[426],[342,7431,7433,7441],{"className":7432,"style":588},[430],[342,7434,7435,7438],{"style":433},[342,7436],{"className":7437,"style":438},[437],[342,7439,366],{"className":7440,"style":365},[363,364],[342,7442,7443,7446],{"style":613},[342,7444],{"className":7445,"style":438},[437],[342,7447,7449],{"className":7448,"style":620},[451],[342,7450,7452],{"className":7451,"style":625},[624],[627,7453,7454],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7455],{"d":638},[5975,7457,7458,7461,7479,7500,7558],{},[6046,7459,7460],{},"Divergence",[6046,7462,7463,7464],{},"solid ",[342,7465,7467],{"className":7466},[345],[342,7468,7470],{"className":7469,"ariaHidden":350},[349],[342,7471,7473,7476],{"className":7472},[354],[342,7474],{"className":7475,"style":359},[358],[342,7477,3757],{"className":7478,"style":365},[363,364],[6046,7480,7481,7482],{},"closed surface ",[342,7483,7485],{"className":7484},[345],[342,7486,7488],{"className":7487,"ariaHidden":350},[349],[342,7489,7491,7494,7497],{"className":7490},[354],[342,7492],{"className":7493,"style":414},[358],[342,7495,2546],{"className":7496,"style":2545},[363],[342,7498,3757],{"className":7499,"style":365},[363,364],[6046,7501,7502],{},[342,7503,7505],{"className":7504},[345],[342,7506,7508],{"className":7507,"ariaHidden":350},[349],[342,7509,7511,7514,7520,7523],{"className":7510},[354],[342,7512],{"className":7513,"style":588},[358],[342,7515,7517],{"className":7516},[676],[342,7518,4104],{"className":7519,"style":4103},[363,917],[342,7521],{"className":7522,"style":739},[738],[342,7524,7526],{"className":7525},[363,418],[342,7527,7529],{"className":7528},[422],[342,7530,7532],{"className":7531},[426],[342,7533,7535,7543],{"className":7534,"style":588},[430],[342,7536,7537,7540],{"style":433},[342,7538],{"className":7539,"style":438},[437],[342,7541,610],{"className":7542,"style":609},[363,364],[342,7544,7545,7548],{"style":613},[342,7546],{"className":7547,"style":438},[437],[342,7549,7551],{"className":7550,"style":620},[451],[342,7552,7554],{"className":7553,"style":625},[624],[627,7555,7556],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7557],{"d":638},[6046,7559,7560],{},[342,7561,7563],{"className":7562},[345],[342,7564,7566,7678,7731],{"className":7565,"ariaHidden":350},[349],[342,7567,7569,7573,7628,7631,7666,7669,7672,7675],{"className":7568},[354],[342,7570],{"className":7571,"style":7572},[358],"height:2.0239em;vertical-align:-1.0576em;",[342,7574,7576,7579],{"className":7575},[676,677],[342,7577],{"className":7578,"style":1278},[738],[342,7580,7582,7619],{"className":7581},[422,681],[342,7583,7585,7616],{"className":7584},[426],[342,7586,7588,7606],{"className":7587,"style":1253},[430],[342,7589,7591,7594],{"style":7590},"top:-2.0424em;margin-left:-0.1945em;",[342,7592],{"className":7593,"style":438},[437],[342,7595,7597],{"className":7596},[699,700,701,702],[342,7598,7600,7603],{"className":7599},[363,702],[342,7601,2546],{"className":7602,"style":2545},[363,702],[342,7604,3757],{"className":7605,"style":365},[363,364,702],[342,7607,7608,7611],{"style":1268},[342,7609],{"className":7610,"style":438},[437],[342,7612,7613],{},[342,7614,895],{"className":7615,"style":1278},[676,717,1277],[342,7617,725],{"className":7618},[724],[342,7620,7622],{"className":7621},[426],[342,7623,7626],{"className":7624,"style":7625},[430],"height:1.0576em;",[342,7627],{},[342,7629],{"className":7630,"style":739},[738],[342,7632,7634],{"className":7633},[363,418],[342,7635,7637],{"className":7636},[422],[342,7638,7640],{"className":7639},[426],[342,7641,7643,7651],{"className":7642,"style":588},[430],[342,7644,7645,7648],{"style":433},[342,7646],{"className":7647,"style":438},[437],[342,7649,610],{"className":7650,"style":609},[363,364],[342,7652,7653,7656],{"style":613},[342,7654],{"className":7655,"style":438},[437],[342,7657,7659],{"className":7658,"style":620},[451],[342,7660,7662],{"className":7661,"style":625},[624],[627,7663,7664],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7665],{"d":638},[342,7667],{"className":7668,"style":778},[738],[342,7670,783],{"className":7671},[782],[342,7673],{"className":7674,"style":739},[738],[342,7676],{"className":7677,"style":778},[738],[342,7679,7681,7684,7687,7722,7725,7728],{"className":7680},[354],[342,7682],{"className":7683,"style":588},[358],[342,7685,801],{"className":7686},[363,800],[342,7688,7690],{"className":7689},[363,418],[342,7691,7693],{"className":7692},[422],[342,7694,7696],{"className":7695},[426],[342,7697,7699,7707],{"className":7698,"style":588},[430],[342,7700,7701,7704],{"style":433},[342,7702],{"className":7703,"style":438},[437],[342,7705,366],{"className":7706,"style":365},[363,364],[342,7708,7709,7712],{"style":613},[342,7710],{"className":7711,"style":438},[437],[342,7713,7715],{"className":7714,"style":620},[451],[342,7716,7718],{"className":7717,"style":625},[624],[627,7719,7720],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7721],{"d":638},[342,7723],{"className":7724,"style":843},[738],[342,7726,848],{"className":7727},[847],[342,7729],{"className":7730,"style":843},[738],[342,7732,7734,7737,7781,7784,7790,7793,7828,7831,7834,7837],{"className":7733},[354],[342,7735],{"className":7736,"style":1240},[358],[342,7738,7740],{"className":7739},[676,677],[342,7741,7743,7773],{"className":7742},[422,681],[342,7744,7746,7770],{"className":7745},[426],[342,7747,7749,7760],{"className":7748,"style":1253},[430],[342,7750,7751,7754],{"style":1256},[342,7752],{"className":7753,"style":438},[437],[342,7755,7757],{"className":7756},[699,700,701,702],[342,7758,3757],{"className":7759,"style":365},[363,364,702],[342,7761,7762,7765],{"style":1268},[342,7763],{"className":7764,"style":438},[437],[342,7766,7767],{},[342,7768,4082],{"className":7769,"style":1278},[676,717,1277],[342,7771,725],{"className":7772},[724],[342,7774,7776],{"className":7775},[426],[342,7777,7779],{"className":7778,"style":1288},[430],[342,7780],{},[342,7782],{"className":7783,"style":739},[738],[342,7785,7787],{"className":7786},[676],[342,7788,4104],{"className":7789,"style":4103},[363,917],[342,7791],{"className":7792,"style":739},[738],[342,7794,7796],{"className":7795},[363,418],[342,7797,7799],{"className":7798},[422],[342,7800,7802],{"className":7801},[426],[342,7803,7805,7813],{"className":7804,"style":588},[430],[342,7806,7807,7810],{"style":433},[342,7808],{"className":7809,"style":438},[437],[342,7811,610],{"className":7812,"style":609},[363,364],[342,7814,7815,7818],{"style":613},[342,7816],{"className":7817,"style":438},[437],[342,7819,7821],{"className":7820,"style":620},[451],[342,7822,7824],{"className":7823,"style":625},[624],[627,7825,7826],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7827],{"d":638},[342,7829],{"className":7830,"style":739},[738],[342,7832],{"className":7833,"style":739},[738],[342,7835,801],{"className":7836},[363,800],[342,7838,4155],{"className":7839,"style":778},[363,364],[318,7841,7842,7843,7926,7927,8014,8015,8018],{},"The three derivative operators — gradient, curl, divergence — are the successive\nderivatives that appear as the dimension climbs, and the two identities\n",[342,7844,7846],{"className":7845},[345],[342,7847,7849,7882],{"className":7848,"ariaHidden":350},[349],[342,7850,7852,7855,7861,7864,7867,7870,7873,7876,7879],{"className":7851},[354],[342,7853],{"className":7854,"style":2985},[358],[342,7856,7858],{"className":7857},[676],[342,7859,918],{"className":7860},[363,917],[342,7862,1295],{"className":7863},[1294],[342,7865,6351],{"className":7866},[363],[342,7868,6356],{"className":7869,"style":6355},[363,364],[342,7871,1344],{"className":7872},[1343],[342,7874],{"className":7875,"style":843},[738],[342,7877,848],{"className":7878},[847],[342,7880],{"className":7881,"style":843},[738],[342,7883,7885,7889],{"className":7884},[354],[342,7886],{"className":7887,"style":7888},[358],"height:0.9274em;",[342,7890,7892],{"className":7891},[363,418],[342,7893,7895],{"className":7894},[422],[342,7896,7898],{"className":7897},[426],[342,7899,7901,7909],{"className":7900,"style":7888},[430],[342,7902,7903,7906],{"style":433},[342,7904],{"className":7905,"style":438},[437],[342,7907,2992],{"className":7908},[363],[342,7910,7912,7915],{"style":7911},"top:-3.2134em;",[342,7913],{"className":7914,"style":438},[437],[342,7916,7919],{"className":7917,"style":7918},[451],"left:-0.2355em;",[342,7920,7922],{"className":7921,"style":625},[624],[627,7923,7924],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7925],{"d":638}," and\n",[342,7928,7930],{"className":7929},[345],[342,7931,7933,8005],{"className":7932,"ariaHidden":350},[349],[342,7934,7936,7940,7946,7949,7955,7958,7993,7996,7999,8002],{"className":7935},[354],[342,7937],{"className":7938,"style":7939},[358],"height:1.2163em;vertical-align:-0.25em;",[342,7941,7943],{"className":7942},[676],[342,7944,4104],{"className":7945,"style":4103},[363,917],[342,7947,1295],{"className":7948},[1294],[342,7950,7952],{"className":7951},[676],[342,7953,918],{"className":7954},[363,917],[342,7956],{"className":7957,"style":739},[738],[342,7959,7961],{"className":7960},[363,418],[342,7962,7964],{"className":7963},[422],[342,7965,7967],{"className":7966},[426],[342,7968,7970,7978],{"className":7969,"style":588},[430],[342,7971,7972,7975],{"style":433},[342,7973],{"className":7974,"style":438},[437],[342,7976,610],{"className":7977,"style":609},[363,364],[342,7979,7980,7983],{"style":613},[342,7981],{"className":7982,"style":438},[437],[342,7984,7986],{"className":7985,"style":620},[451],[342,7987,7989],{"className":7988,"style":625},[624],[627,7990,7991],{"xmlns":629,"width":630,"height":631,"style":632,"viewBox":633,"preserveAspectRatio":634},[636,7992],{"d":638},[342,7994,1344],{"className":7995},[1343],[342,7997],{"className":7998,"style":843},[738],[342,8000,848],{"className":8001},[847],[342,8003],{"className":8004,"style":843},[738],[342,8006,8008,8011],{"className":8007},[354],[342,8009],{"className":8010,"style":2085},[358],[342,8012,2992],{"className":8013},[363]," from the\n",[321,8016,8017],{"href":298},"curl-and-divergence lesson","\nsay that applying two consecutive operators annihilates the field. That is the\nstatement, in the language of vector calculus, that the boundary of a boundary is\nempty: the edge of a surface is a closed loop with no endpoints, and the boundary\nof a solid is a closed surface with no edge.",[335,8020,8022],{"id":8021},"differential-forms","Differential forms",[318,8024,8025,8026,8179,8180,8183,8184,5313,8199,8214,8215,8230,8231],{},"The single form ",[342,8027,8029],{"className":8028},[345],[342,8030,8032,8109],{"className":8031,"ariaHidden":350},[349],[342,8033,8035,8039,8087,8090,8093,8096,8100,8103,8106],{"className":8034},[354],[342,8036],{"className":8037,"style":8038},[358],"height:1.2969em;vertical-align:-0.4919em;",[342,8040,8042,8045],{"className":8041},[676],[342,8043,5777],{"className":8044,"style":6157},[676,717,1277],[342,8046,8048],{"className":8047},[1881],[342,8049,8051,8078],{"className":8050},[422,681],[342,8052,8054,8075],{"className":8053},[426],[342,8055,8058],{"className":8056,"style":8057},[430],"height:0.1117em;",[342,8059,8060,8063],{"style":6173},[342,8061],{"className":8062,"style":1898},[437],[342,8064,8066],{"className":8065},[699,700,701,702],[342,8067,8069],{"className":8068},[363,702],[342,8070,8072],{"className":8071},[363,4766,702],[342,8073,5766],{"className":8074},[363,702],[342,8076,725],{"className":8077},[724],[342,8079,8081],{"className":8080},[426],[342,8082,8085],{"className":8083,"style":8084},[430],"height:0.4919em;",[342,8086],{},[342,8088],{"className":8089,"style":739},[738],[342,8091],{"className":8092,"style":739},[738],[342,8094,801],{"className":8095},[363,800],[342,8097,8099],{"className":8098,"style":1177},[363,364],"ω",[342,8101],{"className":8102,"style":843},[738],[342,8104,848],{"className":8105},[847],[342,8107],{"className":8108,"style":843},[738],[342,8110,8112,8116,8173,8176],{"className":8111},[354],[342,8113],{"className":8114,"style":8115},[358],"height:1.3358em;vertical-align:-0.5308em;",[342,8117,8119,8122],{"className":8118},[676],[342,8120,5777],{"className":8121,"style":6157},[676,717,1277],[342,8123,8125],{"className":8124},[1881],[342,8126,8128,8164],{"className":8127},[422,681],[342,8129,8131,8161],{"className":8130},[426],[342,8132,8135],{"className":8133,"style":8134},[430],"height:0.1692em;",[342,8136,8137,8140],{"style":6173},[342,8138],{"className":8139,"style":1898},[437],[342,8141,8143],{"className":8142},[699,700,701,702],[342,8144,8146,8149,8152,8158],{"className":8145},[363,702],[342,8147,2546],{"className":8148,"style":2545},[363,702],[342,8150,1295],{"className":8151},[1294,702],[342,8153,8155],{"className":8154},[363,4766,702],[342,8156,5766],{"className":8157},[363,702],[342,8159,1344],{"className":8160},[1343,702],[342,8162,725],{"className":8163},[724],[342,8165,8167],{"className":8166},[426],[342,8168,8171],{"className":8169,"style":8170},[430],"height:0.5308em;",[342,8172],{},[342,8174],{"className":8175,"style":739},[738],[342,8177,8099],{"className":8178,"style":1177},[363,364],"\nis made precise by the theory of differential forms, where FTC, Green's, Stokes',\nand the Divergence Theorem are literally one equation, the ",[326,8181,8182],{},"generalized Stokes'\nTheorem",", applied to forms of degree ",[342,8185,8187],{"className":8186},[345],[342,8188,8190],{"className":8189,"ariaHidden":350},[349],[342,8191,8193,8196],{"className":8192},[354],[342,8194],{"className":8195,"style":2085},[358],[342,8197,2992],{"className":8198},[363],[342,8200,8202],{"className":8201},[345],[342,8203,8205],{"className":8204,"ariaHidden":350},[349],[342,8206,8208,8211],{"className":8207},[354],[342,8209],{"className":8210,"style":2085},[358],[342,8212,2089],{"className":8213},[363],", and ",[342,8216,8218],{"className":8217},[345],[342,8219,8221],{"className":8220,"ariaHidden":350},[349],[342,8222,8224,8227],{"className":8223},[354],[342,8225],{"className":8226,"style":2085},[358],[342,8228,1905],{"className":8229},[363],". Vector calculus is the\nthree-dimensional case of that statement, and the operators gradient, curl, and\ndivergence are the exterior derivative acting on functions, vector fields, and\nflux fields in turn.",[8232,8233,8234],"sup",{},[321,8235,2089],{"href":8236,"ariaDescribedBy":8237,"dataFootnoteRef":313,"id":8239},"#user-content-fn-stewart168",[8238],"footnote-label","user-content-fnref-stewart168",[8241,8242,8245,8250],"section",{"className":8243,"dataFootnotes":313},[8244],"footnotes",[335,8246,8249],{"className":8247,"id":8238},[8248],"sr-only","Footnotes",[8251,8252,8253],"ol",{},[8254,8255,8257,8258],"li",{"id":8256},"user-content-fn-stewart168","Stewart, §16.8 — Stokes' Theorem; §16.9 — The Divergence Theorem; §16.10 — Summary. The right-hand-rule orientation of a surface and its boundary, the surface-independence of the flux of a curl, and the unifying view of the fundamental theorems of vector calculus as one statement relating a region's interior derivative to its oriented boundary. ",[321,8259,8264],{"href":8260,"ariaLabel":8261,"className":8262,"dataFootnoteBackref":313},"#user-content-fnref-stewart168","Back to reference 1",[8263],"data-footnote-backref","↩",{"title":313,"searchDepth":17,"depth":17,"links":8266},[8267,8268,8269,8270,8271],{"id":337,"depth":17,"text":328},{"id":3737,"depth":17,"text":3738},{"id":5616,"depth":17,"text":5617},{"id":8021,"depth":17,"text":8022},{"id":8238,"depth":17,"text":8249},[],"computer-science","Green's Theorem\nhad two vector forms in the plane: circulation around a boundary curve equals\nintegrated curl over the region, and flux across the boundary equals integrated\ndivergence. Each lifts into three dimensions. The circulation form becomes\nStokes' Theorem, with the flat region replaced by a surface in space and its\nboundary a space curve. The flux form becomes the Divergence Theorem, with\nthe plane region replaced by a solid and its boundary a closed surface. All\nfour fundamental theorems are the same statement at different dimensions.",false,"md",{"moduleNumber":278,"lessonNumber":121,"order":8278},1206,true,[],"---\ntitle: Stokes' Theorem and the Divergence Theorem\nmodule: Multiple Integrals and Vector Calculus\nmoduleNumber: 12\nlessonNumber: 6\norder: 1206\nsummary: >\n  Stokes' Theorem lifts Green's Theorem into space: the line integral of a field\n  around the boundary of a surface equals the flux of its curl through the\n  surface. The Divergence Theorem relates the outward flux across a closed\n  surface to the triple integral of divergence over the solid it encloses.\n  Together with the Fundamental Theorem of Calculus and its line-integral and\n  Green counterparts, they are one theorem: the integral of a derivative over a\n  region equals the integral of the field over its oriented boundary.\ntopics: [Multiple Integrals and Vector Calculus]\ndraft: false\nsources:\n  - book: Stewart\n    ref: \"Ch. 16 — Vector Calculus; §16.8 Stokes' Theorem, §16.9 The Divergence Theorem\"\n  - book: Stewart\n    ref: \"§16.10 Summary\"\n---\n\n[Green's Theorem](\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence)\nhad two vector forms in the plane: circulation around a boundary curve equals\nintegrated curl over the region, and flux across the boundary equals integrated\ndivergence. Each lifts into three dimensions. The circulation form becomes\n**Stokes' Theorem**, with the flat region replaced by a surface in space and its\nboundary a space curve. The flux form becomes the **Divergence Theorem**, with\nthe plane region replaced by a solid and its boundary a closed surface. All\nfour fundamental theorems are the same statement at different dimensions.\n\n## Stokes' Theorem\n\nA surface $S$ in space has a boundary curve $C$, the edge where the surface stops.\nAn orientation of $S$ (a choice of unit normal $\\hat{n}$) induces a positive\norientation of $C$ by the right-hand rule: point the thumb along $\\hat{n}$ and\nthe fingers curl in the direction $C$ is traced.\n\n> **Theorem (Stokes).** Let $S$ be an oriented, piecewise-smooth surface bounded\n> by a simple, closed, piecewise-smooth boundary curve $C$ with positive\n> orientation. If $\\vec{F}$ has continuous partial derivatives on an open region\n> containing $S$, then\n> $$\n> \\oint\\limits_C \\vec{F}\\cdot \\d\\vec{r} = \\iint\\limits_S \\operatorname{curl}\\vec{F}\\cdot \\d\\vec{S} .\n> $$\n\nThe line integral around the boundary of the tangential component of $\\vec{F}$\nequals the surface integral over $S$ of the normal component of\n$\\operatorname{curl}\\vec{F}$. When $S$ is a flat region in the $xy$-plane with\nupward normal $\\hat{k}$, the right side is\n$\\iint\\limits_S (\\operatorname{curl}\\vec{F})\\cdot\\hat{k}\\,\\d A$ and the statement is\nexactly Green's Theorem. Stokes' Theorem is Green's Theorem for a curved surface.\n\n$$\n% caption: Stokes' Theorem: circulation of $\\mathbf{F}$ around the boundary curve\n% $C$ equals the flux of $\\operatorname{curl}\\mathbf{F}$ through the surface $S$;\n% the normal and the boundary orientation obey the right-hand rule.\n\\begin{tikzpicture}[scale=1.0]\n\\definecolor{acc}{HTML}{4A6FA5}\n% a curved cap surface with an elliptical boundary\n\\fill[acc!10] (0.6,1.0) .. controls (1.5,2.0) and (3.9,2.0) .. (4.8,1.0)\n  .. controls (3.9,0.2) and (1.5,0.2) .. (0.6,1.0) -- cycle;\n\\draw[acc, very thick] (0.6,1.0) .. controls (1.5,2.0) and (3.9,2.0) .. (4.8,1.0)\n  .. controls (3.9,0.2) and (1.5,0.2) .. (0.6,1.0) -- cycle;\n% bulge the surface up (grid hint)\n\\draw[black] (1.3,1.05) .. controls (2.4,1.9) and (3.0,1.9) .. (4.1,1.05);\n\\draw[black] (2.0,0.55) .. controls (2.4,1.7) and (2.9,1.7) .. (2.7,1.5);\n\\node[font=\\small] at (2.7,1.15) {$S$};\n% normal\n\\draw[black, thick, ->] (2.7,1.35) -- (2.9,2.35);\n\\node[font=\\small, anchor=west] at (2.9,2.25) {$\\mathbf{n}$};\n% boundary orientation arrows\n\\draw[acc, very thick, ->] (4.4,0.7) -- (4.0,0.42);\n\\draw[acc, very thick, ->] (1.0,1.3) -- (1.4,1.65);\n\\node[acc, font=\\small, anchor=east] at (0.55,1.0) {boundary $C$};\n\\end{tikzpicture}\n$$\n\nA consequence: if two surfaces share the same boundary curve $C$, then the flux of\n$\\operatorname{curl}\\vec{F}$ through them is equal, because both equal\n$\\oint\\limits_C \\vec{F}\\cdot \\d\\vec{r}$. The flux of a curl depends only on the\nboundary, not on the surface spanning it. In particular a closed surface has no\nboundary, so the flux of any curl through a closed surface is zero.\n\n> **Worked example.** Evaluate $\\oint\\limits_C \\vec{F}\\cdot \\d\\vec{r}$ for\n> $\\vec{F} = \\langle -y^2,\\ x,\\ z^2\\rangle$ where $C$ is the circle\n> $x^2 + y^2 = 1$ in the plane $z = 1$, oriented counterclockwise from above. Rather\n> than parametrize $C$, use Stokes' Theorem with $S$ the flat disk $x^2 + y^2 \\le 1$\n> at $z = 1$, upward normal $\\hat{k}$. The curl is\n>\n> $$\n> \\operatorname{curl}\\vec{F} = \\begin{vmatrix} \\hat\\imath & \\hat\\jmath & \\hat{k} \\\\ \\partial_x & \\partial_y & \\partial_z \\\\ -y^2 & x & z^2 \\end{vmatrix} = \\langle 0,\\ 0,\\ 1 + 2y\\rangle,\n> $$\n>\n> so $\\operatorname{curl}\\vec{F}\\cdot\\hat{k} = 1 + 2y$, and\n>\n> $$\n> \\oint\\limits_C \\vec{F}\\cdot \\d\\vec{r} = \\iint\\limits_{x^2+y^2\\le 1}(1 + 2y)\\,\\d A = \\iint 1\\,\\d A + 2\\iint y\\,\\d A = \\pi + 0 = \\pi,\n> $$\n>\n> using that $\\iint y\\,\\d A = 0$ over a disk symmetric about the $x$-axis. The surface\n> integral is easier than the line integral, which is the usual reason to apply the\n> theorem in this direction.\n\n## The Divergence Theorem\n\nThe flux form of Green's Theorem lifts differently: the plane region becomes a\nsolid $E$, and its boundary curve becomes the closed boundary **surface** $S$,\noriented outward.\n\n> **Theorem (Divergence, or Gauss).** Let $E$ be a simple solid region whose\n> boundary surface $S$ is oriented outward. If $\\vec{F}$ has continuous partial\n> derivatives on an open region containing $E$, then\n> $$\n> \\iint\\limits_S \\vec{F}\\cdot \\d\\vec{S} = \\iiint\\limits_E \\operatorname{div}\\vec{F}\\,\\d V .\n> $$\n\nThe outward flux of $\\vec{F}$ across the closed surface equals the triple\nintegral of $\\operatorname{div}\\vec{F}$ over the solid it bounds. It matches\nthe physical reading of divergence as outflow per unit volume: adding up the local\noutflow over the whole solid gives the net flow across the surface, because\noutflow from one interior cell is inflow to the next and cancels, leaving only the\nboundary.\n\n$$\n% caption: The Divergence Theorem: outward flux across the closed boundary\n% surface $S$ equals the integrated divergence over the enclosed solid $E$;\n% interior outflows cancel, leaving only the boundary.\n\\begin{tikzpicture}[scale=1.0]\n\\definecolor{acc}{HTML}{4A6FA5}\n% a closed blobby solid\n\\fill[acc!10] (2.6,0.4) .. controls (4.4,0.4) and (4.6,2.2) .. (3.4,2.9)\n  .. controls (2.2,3.5) and (0.4,2.6) .. (0.6,1.4)\n  .. controls (0.8,0.6) and (1.6,0.4) .. (2.6,0.4) -- cycle;\n\\draw[acc, very thick] (2.6,0.4) .. controls (4.4,0.4) and (4.6,2.2) .. (3.4,2.9)\n  .. controls (2.2,3.5) and (0.4,2.6) .. (0.6,1.4)\n  .. controls (0.8,0.6) and (1.6,0.4) .. (2.6,0.4) -- cycle;\n\\node[font=\\small] at (2.3,1.5) {$E$};\n\\node[acc, font=\\small, anchor=north west] at (3.8,1.0) {boundary $S$};\n% outward flux arrows around boundary\n\\foreach \\a in {20,70,130,180,240,300} {\n  \\draw[black, thick, ->] ({2.4+1.7*cos(\\a)},{1.6+1.2*sin(\\a)}) -- ({2.4+2.1*cos(\\a)},{1.6+1.5*sin(\\a)});\n}\n\\node[font=\\small, anchor=north] at (2.4,-0.15) {outward f\\\u002Flux};\n\\end{tikzpicture}\n$$\n\n> **Worked example.** Find the outward flux of $\\vec{F} = \\langle x, y, z\\rangle$\n> across the unit sphere. Computing the surface integral directly required a full\n> [parametrization of the sphere](\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals);\n> the Divergence Theorem does it in two lines. Since $\\operatorname{div}\\vec{F} = 1 + 1 + 1 = 3$,\n>\n> $$\n> \\iint\\limits_S \\vec{F}\\cdot \\d\\vec{S} = \\iiint\\limits_E 3\\,\\d V = 3\\cdot\\text{vol}(E) = 3\\cdot\\tfrac{4}{3}\\pi(1)^3 = 4\\pi,\n> $$\n>\n> matching the earlier flux computation and explaining its value. The theorem\n> converts a hard surface integral into an easy volume integral whenever the\n> divergence is simple.\n\n> **Worked example.** Find the flux of\n> $\\vec{F} = \\langle xy,\\ y^2 + e^{xz^2},\\ \\sin(xy)\\rangle$ outward across the\n> boundary of the solid $E$ bounded by the parabolic cylinder $z = 1 - x^2$ and the\n> planes $z = 0$, $y = 0$, $y + z = 2$. The surface has five faces; integrating over\n> each would be tedious. But $\\operatorname{div}\\vec{F} = y + 2y + 0 = 3y$ is a\n> polynomial, and $\\iiint\\limits_E 3y\\,\\d V$ over the described solid is a routine iterated\n> integral. The Divergence Theorem replaces a five-face surface integral with a\n> single triple integral. This asymmetry, one side far easier than the other, is\n> the practical value of every theorem in the group.\n\n## One theorem in every dimension\n\nThe four fundamental theorems of this subject share a form: the integral of a\nderivative of $\\vec{F}$ over an oriented region equals the integral of\n$\\vec{F}$ over the oriented boundary of that region.\n\n$$\n\\int_{\\text{region}} (\\text{derivative of } \\vec{F}) = \\int_{\\partial(\\text{region})} \\vec{F} .\n$$\n\nEach theorem instantiates it one dimension higher, with the derivative and the\nboundary changing to match.\n\n$$\n% caption: The four fundamental theorems nest by dimension: each integrates a\n% derivative of the field over a region and recovers the field on the oriented\n% boundary of that region.\n\\begin{tikzpicture}[scale=1.0]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\node[draw, thick, align=center, minimum width=58mm, font=\\small] (ftc) at (0,3.3)\n  {FTC\\\\interval, two endpoints};\n\\node[draw, thick, align=center, minimum width=58mm, font=\\small] (ftli) at (0,1.7)\n  {Line integrals\\\\curve, two endpoints};\n\\node[draw, thick, align=center, minimum width=58mm, font=\\small] (green) at (0,0.1)\n  {Green \u002F Stokes\\\\surface, boundary curve};\n\\node[draw, thick, align=center, minimum width=58mm, font=\\small] (div) at (0,-1.5)\n  {Divergence\\\\solid, boundary surface};\n\\draw[->, acc, thick] (ftc) -- (ftli);\n\\draw[->, acc, thick] (ftli) -- (green);\n\\draw[->, acc, thick] (green) -- (div);\n\\node[font=\\small, anchor=west, text=acc] at (2.9,2.5) {add a dimension};\n\\end{tikzpicture}\n$$\n\nThe correspondence is exact once the derivative and boundary are named for each\ncase.\n\n| Theorem | Region | Boundary | Derivative of $\\vec{F}$ | Statement |\n| --- | --- | --- | --- | --- |\n| FTC | interval $[a,b]$ | two endpoints | $F'$ | $\\int_a^b F'\\,\\d x = F(b)-F(a)$ |\n| Line integrals | curve $C$ | two endpoints | $\\nabla f$ | $\\int_C \\nabla f\\cdot \\d\\vec{r} = f(B)-f(A)$ |\n| Green | plane region $D$ | closed curve $\\partial D$ | $Q_x - P_y$ | $\\oint\\limits_{\\partial D}\\vec{F}\\cdot \\d\\vec{r} = \\iint\\limits_D (Q_x-P_y)\\,\\d A$ |\n| Stokes | surface $S$ | boundary curve $\\partial S$ | $\\operatorname{curl}\\vec{F}$ | $\\oint\\limits_{\\partial S}\\vec{F}\\cdot \\d\\vec{r} = \\iint\\limits_S \\operatorname{curl}\\vec{F}\\cdot \\d\\vec{S}$ |\n| Divergence | solid $E$ | closed surface $\\partial E$ | $\\operatorname{div}\\vec{F}$ | $\\iint\\limits_{\\partial E}\\vec{F}\\cdot \\d\\vec{S} = \\iiint\\limits_E \\operatorname{div}\\vec{F}\\,\\d V$ |\n\nThe three derivative operators — gradient, curl, divergence — are the successive\nderivatives that appear as the dimension climbs, and the two identities\n$\\operatorname{curl}(\\nabla f) = \\vec{0}$ and\n$\\operatorname{div}(\\operatorname{curl}\\vec{F}) = 0$ from the\n[curl-and-divergence lesson](\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence)\nsay that applying two consecutive operators annihilates the field. That is the\nstatement, in the language of vector calculus, that the boundary of a boundary is\nempty: the edge of a surface is a closed loop with no endpoints, and the boundary\nof a solid is a closed surface with no edge.\n\n## Differential forms\n\nThe single form $\\int_{\\text{region}} \\d\\omega = \\int_{\\partial(\\text{region})}\\omega$\nis made precise by the theory of differential forms, where FTC, Green's, Stokes',\nand the Divergence Theorem are literally one equation, the **generalized Stokes'\nTheorem**, applied to forms of degree $0$, $1$, and $2$. Vector calculus is the\nthree-dimensional case of that statement, and the operators gradient, curl, and\ndivergence are the exterior derivative acting on functions, vector fields, and\nflux fields in turn.[^stewart168]\n\n[^stewart168]: Stewart, §16.8 — Stokes' Theorem; §16.9 — The Divergence Theorem; §16.10 — Summary. The right-hand-rule orientation of a surface and its boundary, the surface-independence of the flux of a curl, and the unifying view of the fundamental theorems of vector calculus as one statement relating a region's interior derivative to its oriented boundary.\n",{"text":8283,"minutes":8284,"time":8285,"words":8286},"5 min read",4.35,261000,870,{"title":307,"description":8274},[8289,8292],{"book":8290,"ref":8291},"Stewart","Ch. 16 — Vector Calculus; §16.8 Stokes' Theorem, §16.9 The Divergence Theorem",{"book":8290,"ref":8293},"§16.10 Summary","available","01.calculus\u002F12.multiple-integrals-and-vector-calculus\u002F06.stokes-and-the-divergence-theorem",[277],"mX6KiQw8_4T2BnqCLdZw9SqUJ-z0OgekWKtEsfw9lz0",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":8299,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":8300,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":8301,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":8302,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":8303,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":8304,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":8305,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":8306,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":8307,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":8308,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":8309,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":8310,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":8311,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":8312,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":8313,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":8314,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":8315,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":8316,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":8317,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":8318,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":8319,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":8320,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":8321,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":8322,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":8323,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":8324,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":8325,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":8326,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":8327,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":8328,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":8329,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":8330,"\u002Falgorithms\u002Fsequences\u002Ftries":8331,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":8332,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":8333,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":8334,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":8335,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":8336,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":8337,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":8338,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":8339,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":8340,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":8341,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":8342,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":8343,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":8344,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":8345,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":8346,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":8347,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":8348,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":8349,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":8350,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":8351,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":8352,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":8353,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":8354,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":8355,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":8356,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":8357,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":8358,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":8359,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":8360,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":8361,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":8362,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":8363,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":8364,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":8365,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":8366,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":8367,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":8368,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":8369,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":8370,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":8371,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":8372,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":8373,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":8374,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":8375,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":8376,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":8377,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":8378,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":8379,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":8380,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":8381,"\u002Falgorithms":8382,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":8383,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":8384,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":8385,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":8386,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":8387,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":8388,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":8389,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":8390,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":8391,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":8392,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":8393,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":8394,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":8395,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":8396,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":8397,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":8398,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":8399,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":8400,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":8401,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":8402,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":8403,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":8404,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":8405,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":8406,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":8407,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":8408,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":8409,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":8410,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":8411,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":8412,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":8413,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":8414,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":8415,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":8416,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":8397,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":8417,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":8418,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":8419,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":8387,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":8420,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":8421,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":8422,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":8423,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":8424,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":8425,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":8426,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":8427,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":8428,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":8286,"\u002Fcalculus":8429,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":8430,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":8431,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":8432,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":8433,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":8434,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":8435,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":8436,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":8437,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":8438,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":8439,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":8440,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":8441,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":8442,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":8443,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":8444,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":8445,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":8446,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":8447,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":8448,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":8449,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":8450,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":8451,"\u002Fmechanics\u002Frotation\u002Frolling-motion":8452,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":8453,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":8454,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":8455,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":8456,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":8457,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":8458,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":8459,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":8460,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":8461,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":8462,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":8463,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":8464,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":8465,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":8466,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":8467,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":8468,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":8469,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":8470,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":8471,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":8472,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":8473,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":8474,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":8475,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":8476,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":8477,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":8478,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":8479,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":8480,"\u002Fmechanics":8481,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":8482,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":8483,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":8484,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":8485,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":8486,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":8487,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":8488,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":8489,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":8490,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":8491,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":8492,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":8493,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":8470,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":8494,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":8495,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":8496,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":8466,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":8332,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":8497,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":8457,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":8498,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":8499,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":8500,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":8501,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":8502,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":8503,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":8504,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":8505,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":8506,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":8431,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":8507,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":8508,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":8509,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":8510,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":8511,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":8512,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":8513,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":8514,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":8449,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":8448,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":8515,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":8516,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":8517,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":8518,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":8519,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":8520,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":8521,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":8522,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":8523,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":8475,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":8473,"\u002Felectricity-and-magnetism":8524,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":8525,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":8526,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":8527,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":8528,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":8529,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":8530,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":8531,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":8532,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":8533,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":8384,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":8534,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":8535,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":8388,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":8536,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":8537,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":8538,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":8539,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":8540,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":8541,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":8542,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":8543,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":8544,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":8545,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":8546,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":8547,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":8548,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":8549,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":8550,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":8551,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":8552,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":8553,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":8554,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":8555,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":8423,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":8556,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":8557,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":8558,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":8559,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":8560,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":8561,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":8562,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":8563,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":8564,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":8565,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":8566,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":8567,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":8568,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":8569,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":8570,"\u002Flinear-algebra":8571,"\u002Ftheory-of-computation":8572,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":8573,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":8574,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":8575,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":8576,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":8577,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":8578,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":8579,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":8580,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":8581,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":8582,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":8583,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":8584,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":8585,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":8586,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":8587,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":8588,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":8589,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":8590,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":8591,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":8592,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":8593,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":8594,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":8595,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":8596,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":8597,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":8598,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":8599,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":8600,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":8601,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":8602,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":8603,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":8604,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":8605,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":8606,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":8607,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":8608,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":8609,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":8610,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":8611,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":8612,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":8613,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":8614,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":8615,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":8616,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":8617,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":8618,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":8619,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":8620,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":8621,"\u002Fcomputer-architecture":8572,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":8622,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":8623,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":8624,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":8388,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":8625,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":8387,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":8394,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":8626,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":8627,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":8428,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":8628,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":8629,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":8630,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":8631,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":8632,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":8633,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":8634,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":8635,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":8636,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":8637,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":8638,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":8639,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":8634,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":8640,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":8641,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":8642,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":8643,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":8644,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":8645,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":8646,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":8647,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":8648,"\u002Fdifferential-equations":8649,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":8650,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":8651,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":8652,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":8653,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":8532,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":8654,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":8655,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":8656,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":8657,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":8658,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":8659,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":8403,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":8660,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":8661,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":8662,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":8663,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":8664,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":8665,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":8666,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":8667,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":8668,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":8669,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":8624,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":8670,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":8671,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":8672,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":8673,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":8674,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":8553,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":8675,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":8676,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":8563,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":8677,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":8678,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":8679,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":8680,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":8681,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":8682,"\u002Frelativity":8683,"\u002Fphysical-computing":8572,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":8684,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":8663,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":8685,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":8686,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":8687,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":8688,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":8689,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":8690,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":8691,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":8639,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":8563,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":8692,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":8693,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":8694,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":8695,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":8691,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":8696,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":8671,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":8425,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":8697,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":8698,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":8405,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":8699,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":8700,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":8701,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":8702,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":8703,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":8704,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":8705,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":8706,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":8707,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":8663,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":8708,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":8709,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":8710,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":8697,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":8386,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":8711,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":8712,"\u002Fquantum-mechanics":8713,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":8647,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":8714,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":8715,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":8536,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":8716,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":8423,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":8717,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":8718,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":8559,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":8669,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":8719,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":8720,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":8721,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":8722,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":8723,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":8696,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":8724,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":8529,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":8725,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":8726,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":8384,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":8727,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":8728,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":8685,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":8413,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":8563,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":8729,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":8730,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":8548,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":8673,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":8731,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":8732,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":8733,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":8568,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":8734,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":8735,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":8736,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":8736,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":8737,"\u002Freal-analysis":8738,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":8739,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":8740,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":8741,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":8742,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":8743,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":8744,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":8745,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":8746,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":8747,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":8748,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":8712,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":8749,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":8741,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":8658,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":8750,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":8751,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":8752,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":8753,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":8754,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":8755,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":8756,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":8757,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":8751,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":8758,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":8727,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":8759,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":8760,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":8761,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":8762,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":8763,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":8764,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":8765,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":8766,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":8767,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":8768,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":8402,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":8769,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":8770,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":8643,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":8771,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":8772,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":8700,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":8772,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":8773,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":8774,"\u002Fabstract-algebra":8775,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":8776,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":8777,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":8778,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":8779,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":8780,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":8692,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":8781,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":8782,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":8783,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":8784,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":8785,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":8786,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":8787,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":8526,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":8655,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":8402,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":8788,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":8386,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":8789,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":8790,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":8424,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":8717,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":8791,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":8792,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":8793,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":8794,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":8795,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":8796,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":8797,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":8798,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":8799,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":8800,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":8801,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":8802,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":8803,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":8804,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":8748,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":8805,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":8806,"\u002Fatomic-physics":8807,"\u002Fdatabases":8572,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":8808,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":8809,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":8810,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":8739,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":8811,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":8812,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":8813,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":8814,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":8815,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":8816,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":8817,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":8818,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":8819,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":8820,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":8821,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":8822,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":8823,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":8824,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":8825,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":8826,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":8827,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":8828,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":8829,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":8830,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":8821,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":8831,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":8832,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":8833,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":8834,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":8835,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":8780,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":8836,"\u002Fcategory-theory":8837,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":8838,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":8839,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":8840,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":8841,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":8842,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":8843,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":8802,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":8844,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":8845,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":8846,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":8847,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":8848,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":8849,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":8850,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":8851,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":8852,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":8853,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":8854,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":8855,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":8856,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":8857,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":8858,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":8859,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":8860,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":8861,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":8862,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":8863,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":8864,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":8865,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":8866,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":8867,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":8868,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":8869,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":8870,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":8814,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":8871,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":8872,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":8873,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":8874,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":8875,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":8876,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":8877,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":8367,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":8878,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":8879,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":8602,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":8880,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":8881,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":8882,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":8883,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":8884,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":8885,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":8886,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":8887,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":8888,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":8889,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":8890,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":8891,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":8575,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":8892,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":8893,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":8894,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":8895,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":8612,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":8896,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":8897,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":8898,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":8899,"\u002Fdeep-learning":8572,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":8900,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":8697,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":8901,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":8902,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":8903,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":8904,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":8905,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":8906,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":8907,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":8908,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":8744,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":8909,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":8910,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":8911,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":8631,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":8425,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":8912,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":8913,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":8914,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":8558,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":8915,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":8916,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":8636,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":8563,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":8917,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":8532,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":8403,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":8419,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":8918,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":8919,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":8920,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":8550,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":8921,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":8413,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":8922,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":8923,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":8924,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":8925,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":8746,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":8926,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":8927,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":8928,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":8929,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":8692,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":8930,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":8670,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":8931,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":8531,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":8932,"\u002Fstatistical-mechanics":8933,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":8934,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":8398,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":8657,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":8935,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":8936,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":8937,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":8938,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":8939,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":8940,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":8530,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":8941,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":8942,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":8943,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":8944,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":8673,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":8945,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":8946,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":8947,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":8948,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":8949,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":8728,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":8672,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":8950,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":8951,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":8952,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":8953,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":8663,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":8954,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":8955,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":8900,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":8800,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":8527,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":8956,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":8394,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":8957,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":8958,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":8538,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":8959,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":8793,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":8960,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":8386,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":8961,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":8397,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":8962,"\u002Fcondensed-matter":8713,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":8963,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":8964,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":8965,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":8966,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":8411,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":8967,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":8968,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":8411,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":8969,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":8823,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":8970,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":8971,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":8972,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":8970,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":8973,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":8974,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":8975,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":8976,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":8977,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":8978,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":8979,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":8980,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":8901,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":8981,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":8974,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":8982,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":8983,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":8616,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":8984,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":8801,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":8985,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":8986,"\u002Flogic":8987,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":8988,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":8989,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":8602,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":8990,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":8991,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":8992,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":8993,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":8983,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":8994,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":8995,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":8996,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":8894,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":8997,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":8998,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":8999,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":9000,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":9001,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":8619,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":9002,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":9003,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":9004,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":9005,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":8810,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":9006,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":8982,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":9007,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":9008,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":9009,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":8630,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":9010,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":8760,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":9011,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":9012,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":8592,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":9013,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":9014,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":9015,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":9016,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":9017,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":8870,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":9018,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":9019,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":9020,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":8905,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":9021,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":9022,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":9023,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":8619,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":8686,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":9024,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":9025,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":9026,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":9027,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":9028,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":9029,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":9030,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":9031,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":9032,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":9033,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":9034,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":9035,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":9036,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":9037,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":9038,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":9039,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":9040,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":9041,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":9042,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":9043,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":9044,"\u002Freinforcement-learning":8572,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":9045,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":9046,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":9047,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":9048,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":9049,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":9050,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":9051,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":9052,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":9053,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":9054,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":9055,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":9056,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":9057,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":8899,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":8754,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":9058,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":9059,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":9060,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":9061,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":9062,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":9063,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":8881,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":9064,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":9065,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":9066,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":9067,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":9068,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":9069,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":9070,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":9071,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":9072,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":9073,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":9074,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":9075,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":8813,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":9065,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":9076,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":8354,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":9077,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":9078,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":9079,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":9080,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":9081,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":8862,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":9082,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":9083,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":9084,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":9085,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":9086,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":9087,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":9088,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":9089,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":9090,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":9091,"\u002Fartificial-intelligence":8572,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":8829,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":9092,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":8390,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":8388,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":8923,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":9093,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":8416,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":8725,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":9094,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":9095,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":9096,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":8785,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":9097,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":9098,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":9099,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":8984,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":9100,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":9101,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":8400,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":8628,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":9102,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":8729,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":9103,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":9104,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":8624,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":8712,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":9105,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":9106,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":9107,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":8395,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":8769,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":8631,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":9108,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":8679,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":8743,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":9109,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":9110,"\u002Fnuclear-physics":9111,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":9112,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":9113,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":8750,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":9114,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":9115,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":9116,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":8598,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":9117,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":9118,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":8895,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":9119,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":9064,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":9120,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":9121,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":9122,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":9123,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":9124,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":9125,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":9126,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":8576,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":9127,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":9128,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":9070,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":9129,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":9130,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":9131,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":9132,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":9133,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":9134,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":9135,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":9136,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":8994,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":9137,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":9138,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":9139,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":9140,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":9141,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":9142,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":9143,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":9144,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":9145,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":9146,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":9147,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":9148,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":8848,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":9015,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":8604,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":9149,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":9150,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":9151,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":9152,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":8862,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":9153,"\u002Fnatural-language-processing":8572,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":9154,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":8770,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":9155,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":8915,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":9156,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":9157,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":9105,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":9158,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":9159,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":8720,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":8423,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":9160,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":8674,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":9161,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":8707,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":9162,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":8961,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":9163,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":9164,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":8930,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":9165,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":8394,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":9166,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":9167,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":9168,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":8711,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":8927,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":9169,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":9170,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":8786,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":9171,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":8831,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":9172,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":9173,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":8720,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":8753,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":9174,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":9175,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":9176,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":8809,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":9177,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":8550,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":9178,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":8653,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":9179,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":9180,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":8977,"\u002Fparticle-physics":9181,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":8771,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":8925,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":9182,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":8710,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":9183,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":8770,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":8682,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":9184,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":9185,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":9186,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":9187,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":9188,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":8976,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":8907,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":9189,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":9190,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":9191,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":9192,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":9104,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":9193,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":8666,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":8729,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":8711,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":9194,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":8795,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":8412,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":9195,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":9196,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":8926,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":9197,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":9198,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":9199,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":9200,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":8393,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":9201,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":9202,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":8653,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":9203,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":9204,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":8919,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":8574,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":9205,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":9206,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":8831,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":8817,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":8829,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":8926,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":9207,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":8392,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":8583,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":9208,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":8670,"\u002Fastrophysics-cosmology":8775,"\u002Fcolophon":9209,"\u002F":8572},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,154,4073,5140,4961,5127,4870,5382,5195,4955,5369,4501,5576,3824,4132,4289,4307,4570,3403,5084,5105,5201,5116,5341,5175,5368,5188,5211,5499,5155,4981,5125,5415,5255,5304,5130,5167,5552,5164,5094,5239,5036,5190,5004,5099,5035,5159,5088,5026,4937,5023,5264,5244,133,5114,5078,5043,5312,5170,5342,5139,5151,5049,5212,5013,5068,5079,5102,5121,5081,5029,5379,5854,5110,2139,3798,5055,5364,4984,4935,4895,4972,5289,5112,5156,4987,5031,5025,5149,5302,5042,5002,4979,4922,4960,5279,126,1877,1180,1129,907,958,1112,1300,1053,1250,1181,1241,1234,966,1050,734,1190,484,1082,926,733,761,571,607,798,804,952,977,731,784,645,771,1017,742,1004,1000,1562,1254,1288,1101,1011,1486,1061,856,992,1169,988,137,0,2037,1782,2384,2254,2123,2332,1643,1714,2089,1751,1367,1660,2511,1998,1892,1854,1791,2438,2487,1917,2375,2525,2266,1845,2275,1810,1631,2310,2166,2233,2113,2505,2347,2672,2112,2473,2592,2380,3013,2513,3256,3218,2194,2173,2205,2326,2081,3342,3152,1799,1670,1027,960,1095,1291,986,897,1209,1055,1817,1801,1593,1465,1196,1464,1201,1230,1435,1684,1461,1926,1500,1409,1284,1774,1869,162,1487,1122,1188,1001,1351,982,1005,979,1325,1046,943,1279,824,1008,989,1798,1277,1025,987,1043,1211,1074,981,939,1002,739,1139,1108,1013,1070,978,1458,1317,157,1357,1077,2355,1116,1037,1178,1637,1314,1109,1056,1702,1474,1071,1158,832,993,1404,1024,1068,1339,1106,1264,1248,913,1848,1328,1633,1224,1143,135,1378,959,1028,998,911,1527,1203,1266,1483,1165,990,938,965,1257,1418,1099,942,1352,956,1035,1398,1003,1094,1292,138,1721,1827,1449,1354,1148,1184,1285,1281,1213,1290,1271,1252,1274,1778,1591,1503,1437,1571,1584,1957,1117,1781,1648,1342,1667,1510,1965,1607,1365,1849,1259,1303,1356,1238,2208,1564,173,1671,1286,1227,1638,1529,668,1078,918,709,865,880,940,1534,1015,874,922,841,794,1194,822,1105,1658,1359,1296,1438,1921,1844,1570,1429,1324,1400,140,1787,1558,1654,1492,1747,2224,2002,2009,1323,1349,1785,1573,1722,1829,1353,1548,1552,1583,1624,1585,1245,1364,1514,1343,1397,1355,2211,1481,1770,160,2388,2293,2256,2552,2569,2478,2039,2496,2578,2814,2519,2461,2587,2492,2714,3278,2654,3050,2447,2849,2238,2369,2061,2214,2602,2563,2186,2985,2749,3364,2038,2282,2409,2126,2573,2206,2176,2268,2182,2402,2705,2633,2414,2213,2801,3313,3410,3195,1952,2017,1509,2537,2645,2027,2415,2838,2356,1906,3184,2950,2807,2954,1683,1316,1034,1138,1763,1822,1705,1246,1701,1097,1104,1187,1032,1083,1228,916,1489,1033,1652,997,692,837,1023,888,864,1089,1231,1214,1675,1156,1075,1520,1309,139,1205,1051,735,1123,1072,915,567,768,825,1253,983,1007,762,1058,861,862,971,1208,1149,1145,1029,1084,927,810,838,857,807,936,949,2321,1622,1069,1113,1057,854,1958,1528,1618,2049,1432,1679,1796,1685,1346,1275,1476,1505,1610,2018,1599,1215,1838,1909,132,3902,2215,2240,3266,3208,3073,2454,2969,2451,1875,2728,1884,2371,2516,2842,1690,1904,2346,3146,1386,2607,1966,2668,1665,2885,1606,2577,3074,2869,2403,2433,2082,1939,1587,2460,2747,2032,2642,1619,3123,1993,2090,2339,3829,1737,2622,2340,2322,3828,4409,2305,3411,2510,4527,3030,3569,3043,2457,1946,2277,2044,2909,1693,1945,2093,2399,2115,2898,2742,2242,3895,3378,3376,2769,2223,3062,3262,2651,2949,2768,3128,2423,1977,2087,2866,3388,2830,2210,2489,2884,3945,2099,2713,3402,1692,2931,4195,3989,3206,4391,3004,3704,3494,2902,999,881,901,919,748,869,1018,1045,1049,1333,954,1092,1019,976,1771,1480,1396,953,1026,161,3533,2495,1818,3007,2595,3427,3537,2216,1895,2304,3396,1739,2073,1962,2203,1767,2666,2264,2276,2852,1807,3735,1560,4144,1669,1676,1972,2418,3291,1525,2040,2766,2337,2220,2800,3001,2078,1759,2836,1896,2026,1758,1543,1047,896,946,1060,1384,1482,815,1414,1322,1440,1240,1468,1098,1133,847,1009,1381,1052,1191,1258,1370,1712,1441,1199,957,1079,150,1262,1417,1368,1219,1136,1064,1463,1636,1059,931,1115,1736,1174,1376,1363,1411,1247,1746,1313,1299,1617,1102,1076,1495,1265,1193,1263,80,{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":9211,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":9216,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":9220,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":9224,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":9228,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":9232,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":9236,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":9241,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":9245,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":9249,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":9253,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":9258,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":9262,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":9266,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":9270,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":9275,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":9279,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":9283,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":9287,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":9291,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":9295,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":9299,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":9303,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":9307,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":9311,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":9315,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":9319,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":9324,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":9328,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":9332,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":9336,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":9340,"\u002Falgorithms\u002Fsequences\u002Ftries":9344,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":9348,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":9352,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":9357,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":9361,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":9365,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":9369,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":9373,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":9377,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":9381,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":9385,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":9389,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":9393,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":9397,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":9401,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":9405,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":9409,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":9414,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":9418,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":9422,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":9426,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":9430,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":9435,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":9439,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":9443,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":9447,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":9451,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":9455,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":9459,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":9463,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":9467,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":9471,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":9475,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":9480,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":9484,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":9488,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":9492,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":9497,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":9501,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":9505,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":9509,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":9513,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":9517,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":9521,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":9526,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":9530,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":9534,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":9538,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":9543,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":9547,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":9551,"\u002Falgorithms":9555,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":9558,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":9559,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":9560,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":9561,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":9562,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":9563,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":9564,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":9565,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":9566,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":9567,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":9568,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":9569,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":9570,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":9571,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":9572,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":9573,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":9574,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":9575,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":9576,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":9577,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":9578,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":9579,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":9580,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":9581,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":9582,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":9583,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":9584,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":9585,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":9586,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":9587,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":9588,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":9589,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":9590,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":9591,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":9592,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":9593,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":9594,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":9595,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":9596,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":9597,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":9598,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":9599,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":9600,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":9601,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":9602,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":9603,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":9604,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":9605,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":9606,"\u002Fcalculus":9607,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":9610,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":9614,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":9618,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":9623,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":9627,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":9631,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":9635,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":9639,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":9644,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":9648,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":9652,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":9656,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":9660,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":9665,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":9669,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":9673,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":9677,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":9681,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":9686,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":9690,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":9694,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":9699,"\u002Fmechanics\u002Frotation\u002Frolling-motion":9703,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":9707,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":9711,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":9715,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":9719,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":9724,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":9728,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":9732,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":9736,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":9740,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":9744,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":9748,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":9753,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":9757,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":9761,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":9765,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":9769,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":9773,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":9777,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":9781,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":9785,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":9789,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":9793,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":9797,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":9802,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":9806,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":9810,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":9814,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":9818,"\u002Fmechanics":9822,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":9825,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":9830,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":9834,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":9838,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":9842,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":9846,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":9851,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":9855,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":9860,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":9864,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":9868,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":9872,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":9876,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":9881,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":9885,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":9889,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":9893,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":9898,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":9902,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":9906,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":9911,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":9915,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":9919,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":9923,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":9927,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":9932,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":9936,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":9940,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":9944,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":9948,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":9952,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":9957,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":9961,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":9965,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":9969,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":9973,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":9977,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":9981,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":9985,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":9990,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":9994,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":9998,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":10002,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":10006,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":10011,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":10015,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":10019,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":10023,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":10027,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":10032,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":10036,"\u002Felectricity-and-magnetism":10040,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":10043,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":10048,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":10052,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":10056,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":10060,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":10064,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":10069,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":10073,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":10077,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":10081,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":10085,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":10090,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":10094,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":10098,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":10103,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":10107,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":10111,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":10115,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":10119,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":10123,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":10127,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":10132,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":10136,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":10140,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":10144,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":10148,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":10152,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":10156,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":10161,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":10165,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":10169,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":10173,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":10177,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":10181,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":10186,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":10190,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":10194,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":10198,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":10202,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":10207,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":10211,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":10215,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":10219,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":10223,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":10227,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":10232,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":10236,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":10240,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":10244,"\u002Flinear-algebra":10248,"\u002Ftheory-of-computation":10251,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":10254,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":10258,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":10262,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":10266,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":10270,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":10274,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":10279,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":10283,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":10287,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":10291,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":10295,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":10299,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":10303,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":10308,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":10312,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":10316,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":10320,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":10324,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":10329,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":10333,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":10337,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":10341,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":10345,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":10350,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":10354,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":10358,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":10362,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":10366,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":10371,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":10375,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":10379,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":10383,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":10387,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":10392,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":10396,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":10400,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":10404,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":10408,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":10413,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":10417,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":10421,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":10426,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":10430,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":10435,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":10439,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":10443,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":10447,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":10451,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":10456,"\u002Fcomputer-architecture":10460,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":10463,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":10467,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":10471,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":10476,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":10480,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":10484,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":10488,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":10492,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":10496,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":10501,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":10505,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":10509,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":10513,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":10517,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":10521,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":10526,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":10530,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":10534,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":10539,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":10543,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":10548,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":10552,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":10556,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":10561,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":10565,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":10570,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":10574,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":10578,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":10583,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":10587,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":10591,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":10596,"\u002Fdifferential-equations":10600,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":10603,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":10608,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":10612,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":10616,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":10620,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":10624,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":10629,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":10633,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":10637,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":10641,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":10646,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":10650,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":10654,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":10658,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":10663,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":10667,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":10671,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":10675,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":10680,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":10684,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":10688,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":10692,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":10696,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":10700,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":10705,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":10709,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":10713,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":10718,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":10722,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":10726,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":10730,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":10735,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":10739,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":10743,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":10748,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":10752,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":10756,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":10761,"\u002Frelativity":10765,"\u002Fphysical-computing":10768,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":10771,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":10776,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":10780,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":10784,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":10788,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":10793,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":10797,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":10801,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":10806,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":10810,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":10814,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":10818,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":10822,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":10826,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":10831,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":10835,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":10839,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":10843,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":10847,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":10851,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":10856,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":10860,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":10864,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":10868,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":10872,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":10876,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":10880,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":10885,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":10889,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":10893,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":10898,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":10902,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":10906,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":10911,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":10915,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":10920,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":10924,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":10928,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":10932,"\u002Fquantum-mechanics":10936,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":10939,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":10944,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":10948,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":10952,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":10956,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":10961,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":10965,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":10969,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":10973,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":10977,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":10981,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":10986,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":10990,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":10994,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":10998,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":11002,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":11006,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":11010,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":11014,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":11018,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":11022,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":11026,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":11031,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":11035,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":11039,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":11043,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":11048,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":11052,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":11056,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":11059,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":11063,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":11068,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":11072,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":11076,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":11080,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":11085,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":11089,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":11093,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":11097,"\u002Freal-analysis":11101,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":11104,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":11108,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":11112,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":11117,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":11121,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":11125,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":11129,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":11134,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":11138,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":11142,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":11146,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":11150,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":11154,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":11159,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":11163,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":11167,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":11171,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":11176,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":11180,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":11184,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":11188,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":11193,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":11197,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":11201,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":11206,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":11210,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":11214,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":11218,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":11223,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":11227,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":11231,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":11235,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":11240,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":11244,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":11248,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":11253,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":11257,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":11261,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":11265,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":11270,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":11274,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":11278,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":11282,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":11286,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":11291,"\u002Fabstract-algebra":11295,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":11298,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":11303,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":11307,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":11311,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":11315,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":11319,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":11324,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":11328,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":11332,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":11336,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":11340,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":11344,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":11348,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":11353,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":11357,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":11361,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":11365,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":11370,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":11374,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":11378,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":11383,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":11387,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":11391,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":11395,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":11399,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":11403,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":11408,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":11412,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":11416,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":11421,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":11425,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":11429,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":11433,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":11438,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":11442,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":11446,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":11451,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":11455,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":11459,"\u002Fatomic-physics":11463,"\u002Fdatabases":11466,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":11469,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":11473,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":11477,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":11481,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":11485,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":11489,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":11493,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":11498,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":11502,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":11506,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":11511,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":11515,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":11519,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":11524,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":11528,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":11532,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":11536,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":11540,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":11545,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":11549,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":11553,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":11557,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":11562,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":11566,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":11570,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":11574,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":11579,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":11583,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":11587,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":11591,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":11596,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":11600,"\u002Fcategory-theory":11604,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":11607,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":11611,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":11615,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":11619,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":11622,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":11626,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":11630,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":11634,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":11639,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":11643,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":11647,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":11651,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":11655,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":11660,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":11664,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":11668,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":11672,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":11676,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":11681,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":11685,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":11689,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":11693,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":11698,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":11702,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":11706,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":11710,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":11714,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":11718,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":11722,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":11726,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":11730,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":11735,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":11739,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":11743,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":11747,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":11751,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":11756,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":11760,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":11764,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":11768,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":11772,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":11776,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":11780,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":11785,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":11789,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":11793,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":11798,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":11802,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":11806,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":11810,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":11814,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":11818,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":11822,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":11827,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":11831,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":11835,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":11839,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":11843,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":11847,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":11851,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":11855,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":11859,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":11863,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":11867,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":11872,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":11876,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":11880,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":11884,"\u002Fdeep-learning":11888,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":11891,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":11895,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":11899,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":11903,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":11907,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":11911,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":11916,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":11920,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":11924,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":11928,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":11933,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":11937,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":11941,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":11945,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":11950,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":11954,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":11958,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":11962,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":11966,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":11971,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":11975,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":11979,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":11984,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":11988,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":11992,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":11997,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":12001,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":12005,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":12009,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":12014,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":12018,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":12022,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":12026,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":12030,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":12034,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":12039,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":12043,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":12047,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":12051,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":12056,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":12060,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":12064,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":12069,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":12073,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":12077,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":12081,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":12085,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":12090,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":12094,"\u002Fstatistical-mechanics":12098,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":12101,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":12106,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":12110,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":12114,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":12118,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":12123,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":12127,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":12131,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":12135,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":12140,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":12144,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":12148,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":12152,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":12157,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":12161,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":12165,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":12169,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":12174,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":12178,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":12182,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":12186,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":12191,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":12195,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":12199,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":12203,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":12208,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":12212,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":12216,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":12220,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":12224,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":12229,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":12233,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":12238,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":12242,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":12246,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":12250,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":12255,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":12259,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":12263,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":12267,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":12271,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":12276,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":12280,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":12284,"\u002Fcondensed-matter":12288,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":12291,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":12295,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":12300,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":12304,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":12308,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":12312,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":12316,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":12320,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":12324,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":12329,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":12333,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":12337,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":12341,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":12346,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":12350,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":12354,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":12358,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":12363,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":12367,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":12371,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":12375,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":12380,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":12384,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":12388,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":12392,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":12397,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":12401,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":12405,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":12410,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":12414,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":12419,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":12423,"\u002Flogic":12427,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":12430,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":12434,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":12438,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":12442,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":12446,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":12450,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":12454,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":12458,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":12462,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":12466,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":12470,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":12474,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":12478,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":12482,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":12486,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":12490,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":12494,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":12498,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":12502,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":12507,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":12511,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":12515,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":12519,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":12523,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":12527,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":12531,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":12535,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":12539,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":12543,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":12547,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":12551,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":12555,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":12559,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":12563,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":12567,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":12571,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":12575,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":12579,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":12583,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":12587,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":12591,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":12596,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":12600,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":12604,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":12608,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":12612,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":12616,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":12620,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":12624,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":12628,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":12632,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":12636,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":12640,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":12644,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":12648,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":12652,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":12656,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":12660,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":12664,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":12668,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":12672,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":12676,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":12680,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":12685,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":12689,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":12693,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":12697,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":12701,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":12705,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":12709,"\u002Freinforcement-learning":12713,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":12715,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":12719,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":12723,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":12727,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":12731,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":12736,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":12740,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":12744,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":12748,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":12752,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":12756,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":12760,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":12764,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":12768,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":12772,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":12776,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":12780,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":12785,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":12789,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":12793,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":12797,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":12801,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":12805,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":12809,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":12813,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":12817,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":12821,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":12825,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":12829,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":12834,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":12838,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":12842,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":12846,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":12850,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":12854,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":12858,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":12861,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":12865,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":12869,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":12874,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":12878,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":12882,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":12886,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":12889,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":12893,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":12897,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":12901,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":12906,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":12910,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":12914,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":12918,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":12922,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":12926,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":12930,"\u002Fartificial-intelligence":12934,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":12937,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":12942,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":12946,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":12950,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":12954,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":12958,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":12963,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":12967,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":12971,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":12975,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":12980,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":12984,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":12988,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":12992,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":12997,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":13001,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":13006,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":13010,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":13015,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":13019,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":13023,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":13027,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":13032,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":13036,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":13040,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":13045,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":13049,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":13053,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":13058,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":13062,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":13067,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":13071,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":13075,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":13080,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":13084,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":13088,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":13092,"\u002Fnuclear-physics":13096,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":13099,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":13103,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":13107,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":13111,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":13115,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":13119,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":13124,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":13128,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":13132,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":13136,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":13141,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":13145,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":13149,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":13153,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":13157,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":13161,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":13165,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":13168,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":13171,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":13175,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":13179,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":13183,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":13188,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":13192,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":13196,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":13200,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":13204,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":13208,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":13212,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":13216,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":13220,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":13224,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":13228,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":13232,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":13236,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":13240,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":13244,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":13248,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":13252,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":13256,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":13260,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":13264,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":13268,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":13272,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":13276,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":13280,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":13284,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":13288,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":13292,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":13296,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":13301,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":13305,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":13309,"\u002Fnatural-language-processing":13313,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":13316,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":13320,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":13324,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":13328,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":13333,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":13337,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":13341,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":13345,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":13350,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":13354,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":13358,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":13362,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":13367,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":13371,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":13375,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":13379,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":13384,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":13388,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":13392,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":13397,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":13401,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":13405,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":13409,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":13414,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":13418,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":13422,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":13426,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":13431,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":13435,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":13439,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":13443,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":13448,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":13452,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":13456,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":13460,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":13464,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":13469,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":13473,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":13477,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":13482,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":13486,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":13490,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":13494,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":13498,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":13502,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":13506,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":13510,"\u002Fparticle-physics":13514,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":13517,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":13522,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":13526,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":13530,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":13535,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":13539,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":13543,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":13547,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":13552,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":13556,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":13560,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":13564,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":13569,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":13573,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":13577,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":13581,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":13586,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":13590,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":13594,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":13598,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":13603,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":13607,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":13611,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":13616,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":13620,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":13624,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":13628,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":13632,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":13636,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":13640,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":13644,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":13648,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":13653,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":13657,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":13661,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":13665,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":13670,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":13674,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":13678,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":13682,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":13686,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":13691,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":13695,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":13698,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":13702,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":13706,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":13711,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":13715,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":13719,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":13723,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":13727,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":13731,"\u002Fastrophysics-cosmology":13735,"\u002Fcolophon":13738,"\u002F":13741},{"path":9212,"title":9213,"module":9214,"summary":9215},"\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":9217,"title":9218,"module":9214,"summary":9219},"\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":9221,"title":9222,"module":9214,"summary":9223},"\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":9225,"title":9226,"module":9214,"summary":9227},"\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":9229,"title":9230,"module":9214,"summary":9231},"\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":9233,"title":9234,"module":9214,"summary":9235},"\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":9237,"title":9238,"module":9239,"summary":9240},"\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":9242,"title":9243,"module":9239,"summary":9244},"\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":9246,"title":9247,"module":9239,"summary":9248},"\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":9250,"title":9251,"module":9239,"summary":9252},"\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":9254,"title":9255,"module":9256,"summary":9257},"\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":9259,"title":9260,"module":9256,"summary":9261},"\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":9263,"title":9264,"module":9256,"summary":9265},"\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":9267,"title":9268,"module":9256,"summary":9269},"\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":9271,"title":9272,"module":9273,"summary":9274},"\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":9276,"title":9277,"module":9273,"summary":9278},"\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":9280,"title":9281,"module":9273,"summary":9282},"\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":9284,"title":9285,"module":9273,"summary":9286},"\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":9288,"title":9289,"module":9273,"summary":9290},"\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":9292,"title":9293,"module":9273,"summary":9294},"\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":9296,"title":9297,"module":9273,"summary":9298},"\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":9300,"title":9301,"module":9273,"summary":9302},"\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":9304,"title":9305,"module":9273,"summary":9306},"\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":9308,"title":9309,"module":9273,"summary":9310},"\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":9312,"title":9313,"module":9273,"summary":9314},"\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":9316,"title":9317,"module":9273,"summary":9318},"\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":9320,"title":9321,"module":9322,"summary":9323},"\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":9325,"title":9326,"module":9322,"summary":9327},"\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":9329,"title":9330,"module":9322,"summary":9331},"\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":9333,"title":9334,"module":9322,"summary":9335},"\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":9337,"title":9338,"module":9322,"summary":9339},"\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":9341,"title":9342,"module":9322,"summary":9343},"\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":9345,"title":9346,"module":9322,"summary":9347},"\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":9349,"title":9350,"module":9322,"summary":9351},"\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":9353,"title":9354,"module":9355,"summary":9356},"\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":9358,"title":9359,"module":9355,"summary":9360},"\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":9362,"title":9363,"module":9355,"summary":9364},"\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":9366,"title":9367,"module":9355,"summary":9368},"\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":9370,"title":9371,"module":9355,"summary":9372},"\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":9374,"title":9375,"module":9355,"summary":9376},"\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":9378,"title":9379,"module":9355,"summary":9380},"\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":9382,"title":9383,"module":9355,"summary":9384},"\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":9386,"title":9387,"module":9355,"summary":9388},"\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":9390,"title":9391,"module":9355,"summary":9392},"\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":9394,"title":9395,"module":9355,"summary":9396},"\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":9398,"title":9399,"module":9355,"summary":9400},"\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":9402,"title":9403,"module":9355,"summary":9404},"\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":9406,"title":9407,"module":9355,"summary":9408},"\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":9410,"title":9411,"module":9412,"summary":9413},"\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":9415,"title":9416,"module":9412,"summary":9417},"\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":9419,"title":9420,"module":9412,"summary":9421},"\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":9423,"title":9424,"module":9412,"summary":9425},"\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":9427,"title":9428,"module":9412,"summary":9429},"\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":9431,"title":9432,"module":9433,"summary":9434},"\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":9436,"title":9437,"module":9433,"summary":9438},"\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":9440,"title":9441,"module":9433,"summary":9442},"\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":9444,"title":9445,"module":9433,"summary":9446},"\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":9448,"title":9449,"module":9433,"summary":9450},"\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":9452,"title":9453,"module":9433,"summary":9454},"\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":9456,"title":9457,"module":9433,"summary":9458},"\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":9460,"title":9461,"module":9433,"summary":9462},"\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":9464,"title":9465,"module":9433,"summary":9466},"\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":9468,"title":9469,"module":9433,"summary":9470},"\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":9472,"title":9473,"module":9433,"summary":9474},"\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":9476,"title":9477,"module":9478,"summary":9479},"\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":9481,"title":9482,"module":9478,"summary":9483},"\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":9485,"title":9486,"module":9478,"summary":9487},"\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":9489,"title":9490,"module":9478,"summary":9491},"\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":9493,"title":9494,"module":9495,"summary":9496},"\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":9498,"title":9499,"module":9495,"summary":9500},"\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":9502,"title":9503,"module":9495,"summary":9504},"\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":9506,"title":9507,"module":9495,"summary":9508},"\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":9510,"title":9511,"module":9495,"summary":9512},"\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":9514,"title":9515,"module":9495,"summary":9516},"\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":9518,"title":9519,"module":9495,"summary":9520},"\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":9522,"title":9523,"module":9524,"summary":9525},"\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":9527,"title":9528,"module":9524,"summary":9529},"\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":9531,"title":9532,"module":9524,"summary":9533},"\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":9535,"title":9536,"module":9524,"summary":9537},"\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":9539,"title":9540,"module":9541,"summary":9542},"\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":9544,"title":9545,"module":9541,"summary":9546},"\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":9548,"title":9549,"module":9541,"summary":9550},"\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":9552,"title":9553,"module":9541,"summary":9554},"\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":9556,"title":9557,"module":313,"summary":313},"\u002Falgorithms","Algorithms",{"path":11,"title":10,"module":5,"summary":13},{"path":16,"title":15,"module":5,"summary":19},{"path":22,"title":21,"module":5,"summary":25},{"path":28,"title":27,"module":5,"summary":31},{"path":38,"title":37,"module":33,"summary":40},{"path":43,"title":42,"module":33,"summary":45},{"path":48,"title":47,"module":33,"summary":50},{"path":53,"title":52,"module":33,"summary":55},{"path":62,"title":61,"module":57,"summary":64},{"path":67,"title":66,"module":57,"summary":69},{"path":72,"title":71,"module":57,"summary":74},{"path":77,"title":76,"module":57,"summary":79},{"path":86,"title":85,"module":81,"summary":88},{"path":91,"title":90,"module":81,"summary":93},{"path":96,"title":95,"module":81,"summary":98},{"path":106,"title":105,"module":100,"summary":108},{"path":111,"title":110,"module":100,"summary":113},{"path":116,"title":115,"module":100,"summary":118},{"path":126,"title":125,"module":120,"summary":131},{"path":134,"title":133,"module":120,"summary":136},{"path":139,"title":138,"module":120,"summary":141},{"path":149,"title":148,"module":143,"summary":151},{"path":154,"title":153,"module":143,"summary":156},{"path":159,"title":158,"module":143,"summary":161},{"path":164,"title":163,"module":143,"summary":166},{"path":174,"title":173,"module":168,"summary":176},{"path":179,"title":178,"module":168,"summary":181},{"path":184,"title":183,"module":168,"summary":186},{"path":194,"title":193,"module":188,"summary":196},{"path":199,"title":198,"module":188,"summary":201},{"path":204,"title":203,"module":188,"summary":206},{"path":209,"title":208,"module":188,"summary":211},{"path":214,"title":213,"module":188,"summary":216},{"path":224,"title":223,"module":218,"summary":226},{"path":229,"title":228,"module":218,"summary":231},{"path":234,"title":233,"module":218,"summary":236},{"path":239,"title":238,"module":218,"summary":241},{"path":244,"title":243,"module":218,"summary":246},{"path":254,"title":253,"module":248,"summary":256},{"path":258,"title":248,"module":248,"summary":260},{"path":263,"title":262,"module":248,"summary":265},{"path":268,"title":267,"module":248,"summary":270},{"path":273,"title":272,"module":248,"summary":275},{"path":283,"title":282,"module":277,"summary":285},{"path":288,"title":287,"module":277,"summary":290},{"path":293,"title":292,"module":277,"summary":295},{"path":298,"title":297,"module":277,"summary":300},{"path":303,"title":302,"module":277,"summary":305},{"path":308,"title":307,"module":277,"summary":310},{"path":9608,"title":9609,"module":313,"summary":313},"\u002Fcalculus","Calculus",{"path":9611,"title":9612,"module":9214,"summary":9613},"\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":9615,"title":9616,"module":9214,"summary":9617},"\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":9619,"title":9620,"module":9621,"summary":9622},"\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":9624,"title":9625,"module":9621,"summary":9626},"\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":9628,"title":9629,"module":9621,"summary":9630},"\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":9632,"title":9633,"module":9621,"summary":9634},"\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":9636,"title":9637,"module":9621,"summary":9638},"\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":9640,"title":9641,"module":9642,"summary":9643},"\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":9645,"title":9646,"module":9642,"summary":9647},"\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":9649,"title":9650,"module":9642,"summary":9651},"\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":9653,"title":9654,"module":9642,"summary":9655},"\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":9657,"title":9658,"module":9642,"summary":9659},"\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":9661,"title":9662,"module":9663,"summary":9664},"\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":9666,"title":9667,"module":9663,"summary":9668},"\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":9670,"title":9671,"module":9663,"summary":9672},"\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":9674,"title":9675,"module":9663,"summary":9676},"\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":9678,"title":9679,"module":9663,"summary":9680},"\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":9682,"title":9683,"module":9684,"summary":9685},"\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":9687,"title":9688,"module":9684,"summary":9689},"\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":9691,"title":9692,"module":9684,"summary":9693},"\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":9695,"title":9696,"module":9697,"summary":9698},"\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":9700,"title":9701,"module":9697,"summary":9702},"\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":9704,"title":9705,"module":9697,"summary":9706},"\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":9708,"title":9709,"module":9697,"summary":9710},"\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":9712,"title":9713,"module":9697,"summary":9714},"\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":9716,"title":9717,"module":9697,"summary":9718},"\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":9720,"title":9721,"module":9722,"summary":9723},"\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":9725,"title":9726,"module":9722,"summary":9727},"\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":9729,"title":9730,"module":9722,"summary":9731},"\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":9733,"title":9734,"module":9722,"summary":9735},"\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":9737,"title":9738,"module":9722,"summary":9739},"\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":9741,"title":9742,"module":9722,"summary":9743},"\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":9745,"title":9746,"module":9722,"summary":9747},"\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":9749,"title":9750,"module":9751,"summary":9752},"\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":9754,"title":9755,"module":9751,"summary":9756},"\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":9758,"title":9759,"module":9751,"summary":9760},"\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":9762,"title":9763,"module":9751,"summary":9764},"\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":9766,"title":9767,"module":9751,"summary":9768},"\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":9770,"title":9771,"module":9751,"summary":9772},"\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":9774,"title":9775,"module":9751,"summary":9776},"\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":9778,"title":9779,"module":9751,"summary":9780},"\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":9782,"title":9783,"module":9751,"summary":9784},"\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":9786,"title":9787,"module":9751,"summary":9788},"\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":9790,"title":9791,"module":9751,"summary":9792},"\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":9794,"title":9795,"module":9751,"summary":9796},"\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":9798,"title":9799,"module":9800,"summary":9801},"\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":9803,"title":9804,"module":9800,"summary":9805},"\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":9807,"title":9808,"module":9800,"summary":9809},"\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":9811,"title":9812,"module":9800,"summary":9813},"\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":9815,"title":9816,"module":9800,"summary":9817},"\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":9819,"title":9820,"module":9800,"summary":9821},"\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":9823,"title":9824,"module":313,"summary":313},"\u002Fmechanics","Mechanics & Dynamics",{"path":9826,"title":9827,"module":9828,"summary":9829},"\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":9831,"title":9832,"module":9828,"summary":9833},"\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":9835,"title":9836,"module":9828,"summary":9837},"\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":9839,"title":9840,"module":9828,"summary":9841},"\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":9843,"title":9844,"module":9828,"summary":9845},"\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":9847,"title":9848,"module":9849,"summary":9850},"\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":9852,"title":9853,"module":9849,"summary":9854},"\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":9856,"title":9857,"module":9858,"summary":9859},"\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":9861,"title":9862,"module":9858,"summary":9863},"\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":9865,"title":9866,"module":9858,"summary":9867},"\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":9869,"title":9870,"module":9858,"summary":9871},"\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":9873,"title":9874,"module":9858,"summary":9875},"\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":9877,"title":9878,"module":9879,"summary":9880},"\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":9882,"title":9883,"module":9879,"summary":9884},"\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":9886,"title":9887,"module":9879,"summary":9888},"\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":9890,"title":9891,"module":9879,"summary":9892},"\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":9894,"title":9895,"module":9896,"summary":9897},"\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":9899,"title":9900,"module":9896,"summary":9901},"\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":9903,"title":9904,"module":9896,"summary":9905},"\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":9907,"title":9908,"module":9909,"summary":9910},"\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":9912,"title":9913,"module":9909,"summary":9914},"\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":9916,"title":9917,"module":9909,"summary":9918},"\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":9920,"title":9921,"module":9909,"summary":9922},"\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":9924,"title":9925,"module":9909,"summary":9926},"\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":9928,"title":9929,"module":9930,"summary":9931},"\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":9933,"title":9934,"module":9930,"summary":9935},"\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":9937,"title":9938,"module":9930,"summary":9939},"\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":9941,"title":9942,"module":9930,"summary":9943},"\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":9945,"title":9946,"module":9930,"summary":9947},"\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":9949,"title":9950,"module":9930,"summary":9951},"\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":9953,"title":9954,"module":9955,"summary":9956},"\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":9958,"title":9959,"module":9955,"summary":9960},"\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":9962,"title":9963,"module":9955,"summary":9964},"\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":9966,"title":9967,"module":9955,"summary":9968},"\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":9970,"title":9971,"module":9955,"summary":9972},"\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":9974,"title":9975,"module":9955,"summary":9976},"\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":9978,"title":9979,"module":9955,"summary":9980},"\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":9982,"title":9983,"module":9955,"summary":9984},"\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":9986,"title":9987,"module":9988,"summary":9989},"\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":9991,"title":9992,"module":9988,"summary":9993},"\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":9995,"title":9996,"module":9988,"summary":9997},"\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":9999,"title":10000,"module":9988,"summary":10001},"\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":10003,"title":10004,"module":9988,"summary":10005},"\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":10007,"title":10008,"module":10009,"summary":10010},"\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":10012,"title":10013,"module":10009,"summary":10014},"\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":10016,"title":10017,"module":10009,"summary":10018},"\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":10020,"title":10021,"module":10009,"summary":10022},"\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":10024,"title":10025,"module":10009,"summary":10026},"\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":10028,"title":10029,"module":10030,"summary":10031},"\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":10033,"title":10034,"module":10030,"summary":10035},"\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":10037,"title":10038,"module":10030,"summary":10039},"\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":10041,"title":10042,"module":313,"summary":313},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":10044,"title":10045,"module":10046,"summary":10047},"\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":10049,"title":10050,"module":10046,"summary":10051},"\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":10053,"title":10054,"module":10046,"summary":10055},"\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":10057,"title":10058,"module":10046,"summary":10059},"\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":10061,"title":10062,"module":10046,"summary":10063},"\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":10065,"title":10066,"module":10067,"summary":10068},"\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":10070,"title":10071,"module":10067,"summary":10072},"\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":10074,"title":10075,"module":10067,"summary":10076},"\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":10078,"title":10079,"module":10067,"summary":10080},"\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":10082,"title":10083,"module":10067,"summary":10084},"\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":10086,"title":10087,"module":10088,"summary":10089},"\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":10091,"title":10092,"module":10088,"summary":10093},"\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":10095,"title":10096,"module":10088,"summary":10097},"\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":10099,"title":10100,"module":10101,"summary":10102},"\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":10104,"title":10105,"module":10101,"summary":10106},"\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":10108,"title":10109,"module":10101,"summary":10110},"\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":10112,"title":10113,"module":10101,"summary":10114},"\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":10116,"title":10117,"module":10101,"summary":10118},"\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":10120,"title":10121,"module":10101,"summary":10122},"\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":10124,"title":10125,"module":10101,"summary":10126},"\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":10128,"title":10129,"module":10130,"summary":10131},"\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":10133,"title":10134,"module":10130,"summary":10135},"\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":10137,"title":10138,"module":10130,"summary":10139},"\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":10141,"title":10142,"module":10130,"summary":10143},"\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":10145,"title":10146,"module":10130,"summary":10147},"\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":10149,"title":10150,"module":10130,"summary":10151},"\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":10153,"title":10154,"module":10130,"summary":10155},"\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":10157,"title":10158,"module":10159,"summary":10160},"\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":10162,"title":10163,"module":10159,"summary":10164},"\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":10166,"title":10167,"module":10159,"summary":10168},"\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":10170,"title":10171,"module":10159,"summary":10172},"\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":10174,"title":10175,"module":10159,"summary":10176},"\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":10178,"title":10179,"module":10159,"summary":10180},"\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":10182,"title":10183,"module":10184,"summary":10185},"\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":10187,"title":10188,"module":10184,"summary":10189},"\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":10191,"title":10192,"module":10184,"summary":10193},"\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":10195,"title":10196,"module":10184,"summary":10197},"\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":10199,"title":10200,"module":10184,"summary":10201},"\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":10203,"title":10204,"module":10205,"summary":10206},"\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":10208,"title":10209,"module":10205,"summary":10210},"\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":10212,"title":10213,"module":10205,"summary":10214},"\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":10216,"title":10217,"module":10205,"summary":10218},"\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":10220,"title":10221,"module":10205,"summary":10222},"\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":10224,"title":10225,"module":10205,"summary":10226},"\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":10228,"title":10229,"module":10230,"summary":10231},"\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":10233,"title":10234,"module":10230,"summary":10235},"\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":10237,"title":10238,"module":10230,"summary":10239},"\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":10241,"title":10242,"module":10230,"summary":10243},"\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":10245,"title":10246,"module":10230,"summary":10247},"\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":10249,"title":10250,"module":313,"summary":313},"\u002Flinear-algebra","Linear Algebra",{"path":10252,"title":10253,"module":313,"summary":313},"\u002Ftheory-of-computation","Theory of Computation",{"path":10255,"title":10256,"module":9214,"summary":10257},"\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":10259,"title":10260,"module":9214,"summary":10261},"\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":10263,"title":10264,"module":9214,"summary":10265},"\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":10267,"title":10268,"module":9214,"summary":10269},"\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":10271,"title":10272,"module":9214,"summary":10273},"\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":10275,"title":10276,"module":10277,"summary":10278},"\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":10280,"title":10281,"module":10277,"summary":10282},"\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":10284,"title":10285,"module":10277,"summary":10286},"\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":10288,"title":10289,"module":10277,"summary":10290},"\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":10292,"title":10293,"module":10277,"summary":10294},"\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":10296,"title":10297,"module":10277,"summary":10298},"\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":10300,"title":10301,"module":10277,"summary":10302},"\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":10304,"title":10305,"module":10306,"summary":10307},"\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":10309,"title":10310,"module":10306,"summary":10311},"\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":10313,"title":10314,"module":10306,"summary":10315},"\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":10317,"title":10318,"module":10306,"summary":10319},"\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":10321,"title":10322,"module":10306,"summary":10323},"\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":10325,"title":10326,"module":10327,"summary":10328},"\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":10330,"title":10331,"module":10327,"summary":10332},"\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":10334,"title":10335,"module":10327,"summary":10336},"\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":10338,"title":10339,"module":10327,"summary":10340},"\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":10342,"title":10343,"module":10327,"summary":10344},"\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":10346,"title":10347,"module":10348,"summary":10349},"\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":10351,"title":10352,"module":10348,"summary":10353},"\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":10355,"title":10356,"module":10348,"summary":10357},"\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":10359,"title":10360,"module":10348,"summary":10361},"\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":10363,"title":10364,"module":10348,"summary":10365},"\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":10367,"title":10368,"module":10369,"summary":10370},"\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":10372,"title":10373,"module":10369,"summary":10374},"\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":10376,"title":10377,"module":10369,"summary":10378},"\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":10380,"title":10381,"module":10369,"summary":10382},"\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":10384,"title":10385,"module":10369,"summary":10386},"\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":10388,"title":10389,"module":10390,"summary":10391},"\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":10393,"title":10394,"module":10390,"summary":10395},"\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":10397,"title":10398,"module":10390,"summary":10399},"\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":10401,"title":10402,"module":10390,"summary":10403},"\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":10405,"title":10406,"module":10390,"summary":10407},"\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":10409,"title":10410,"module":10411,"summary":10412},"\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":10414,"title":10415,"module":10411,"summary":10416},"\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":10418,"title":10419,"module":10411,"summary":10420},"\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":10422,"title":10423,"module":10424,"summary":10425},"\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":10427,"title":10428,"module":10424,"summary":10429},"\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":10431,"title":10432,"module":10433,"summary":10434},"\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":10436,"title":10437,"module":10433,"summary":10438},"\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":10440,"title":10441,"module":10433,"summary":10442},"\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":10444,"title":10445,"module":10433,"summary":10446},"\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":10448,"title":10449,"module":10433,"summary":10450},"\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":10452,"title":10453,"module":10454,"summary":10455},"\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":10457,"title":10458,"module":10454,"summary":10459},"\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":10461,"title":10462,"module":313,"summary":313},"\u002Fcomputer-architecture","Computer Architecture",{"path":10464,"title":10465,"module":9214,"summary":10466},"\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":10468,"title":10469,"module":9214,"summary":10470},"\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":10472,"title":10473,"module":10474,"summary":10475},"\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":10477,"title":10478,"module":10474,"summary":10479},"\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":10481,"title":10482,"module":10474,"summary":10483},"\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":10485,"title":10486,"module":10474,"summary":10487},"\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":10489,"title":10490,"module":10474,"summary":10491},"\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":10493,"title":10494,"module":10474,"summary":10495},"\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":10497,"title":10498,"module":10499,"summary":10500},"\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":10502,"title":10503,"module":10499,"summary":10504},"\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":10506,"title":10507,"module":10499,"summary":10508},"\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":10510,"title":10511,"module":10499,"summary":10512},"\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":10514,"title":10515,"module":10499,"summary":10516},"\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":10518,"title":10519,"module":10499,"summary":10520},"\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":10522,"title":10523,"module":10524,"summary":10525},"\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":10527,"title":10528,"module":10524,"summary":10529},"\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":10531,"title":10532,"module":10524,"summary":10533},"\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":10535,"title":10536,"module":10537,"summary":10538},"\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":10540,"title":10541,"module":10537,"summary":10542},"\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":10544,"title":10545,"module":10546,"summary":10547},"\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":10549,"title":10550,"module":10546,"summary":10551},"\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":10553,"title":10554,"module":10546,"summary":10555},"\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":10557,"title":10558,"module":10559,"summary":10560},"\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":10562,"title":10563,"module":10559,"summary":10564},"\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":10566,"title":10567,"module":10568,"summary":10569},"\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":10571,"title":10572,"module":10568,"summary":10573},"\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":10575,"title":10576,"module":10568,"summary":10577},"\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":10579,"title":10580,"module":10581,"summary":10582},"\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":10584,"title":10585,"module":10581,"summary":10586},"\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":10588,"title":10589,"module":10581,"summary":10590},"\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":10592,"title":10593,"module":10594,"summary":10595},"\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":10597,"title":10598,"module":10594,"summary":10599},"\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":10601,"title":10602,"module":313,"summary":313},"\u002Fdifferential-equations","Differential Equations",{"path":10604,"title":10605,"module":10606,"summary":10607},"\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":10609,"title":10610,"module":10606,"summary":10611},"\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":10613,"title":10614,"module":10606,"summary":10615},"\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":10617,"title":10618,"module":10606,"summary":10619},"\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":10621,"title":10622,"module":10606,"summary":10623},"\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":10625,"title":10626,"module":10627,"summary":10628},"\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":10630,"title":10631,"module":10627,"summary":10632},"\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":10634,"title":10635,"module":10627,"summary":10636},"\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":10638,"title":10639,"module":10627,"summary":10640},"\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":10642,"title":10643,"module":10644,"summary":10645},"\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":10647,"title":10648,"module":10644,"summary":10649},"\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":10651,"title":10652,"module":10644,"summary":10653},"\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":10655,"title":10656,"module":10644,"summary":10657},"\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":10659,"title":10660,"module":10661,"summary":10662},"\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":10664,"title":10665,"module":10661,"summary":10666},"\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":10668,"title":10669,"module":10661,"summary":10670},"\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":10672,"title":10673,"module":10661,"summary":10674},"\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":10676,"title":10677,"module":10678,"summary":10679},"\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":10681,"title":10682,"module":10678,"summary":10683},"\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":10685,"title":10686,"module":10678,"summary":10687},"\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":10689,"title":10690,"module":10678,"summary":10691},"\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":10693,"title":10694,"module":10678,"summary":10695},"\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":10697,"title":10698,"module":10678,"summary":10699},"\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":10701,"title":10702,"module":10703,"summary":10704},"\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":10706,"title":10707,"module":10703,"summary":10708},"\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":10710,"title":10711,"module":10703,"summary":10712},"\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":10714,"title":10715,"module":10716,"summary":10717},"\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":10719,"title":10720,"module":10716,"summary":10721},"\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":10723,"title":10724,"module":10716,"summary":10725},"\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":10727,"title":10728,"module":10716,"summary":10729},"\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":10731,"title":10732,"module":10733,"summary":10734},"\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":10736,"title":10737,"module":10733,"summary":10738},"\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":10740,"title":10741,"module":10733,"summary":10742},"\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":10744,"title":10745,"module":10746,"summary":10747},"\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":10749,"title":10750,"module":10746,"summary":10751},"\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":10753,"title":10754,"module":10746,"summary":10755},"\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":10757,"title":10758,"module":10759,"summary":10760},"\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":10762,"title":10763,"module":10759,"summary":10764},"\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":10766,"title":10767,"module":313,"summary":313},"\u002Frelativity","Relativity",{"path":10769,"title":10770,"module":313,"summary":313},"\u002Fphysical-computing","Physical Computing",{"path":10772,"title":10773,"module":10774,"summary":10775},"\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":10777,"title":10778,"module":10774,"summary":10779},"\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":10781,"title":10782,"module":10774,"summary":10783},"\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":10785,"title":10786,"module":10774,"summary":10787},"\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":10789,"title":10790,"module":10791,"summary":10792},"\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":10794,"title":10795,"module":10791,"summary":10796},"\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":10798,"title":10799,"module":10791,"summary":10800},"\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":10802,"title":10803,"module":10804,"summary":10805},"\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":10807,"title":10808,"module":10804,"summary":10809},"\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":10811,"title":10812,"module":10804,"summary":10813},"\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":10815,"title":10816,"module":10804,"summary":10817},"\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":10819,"title":10820,"module":10804,"summary":10821},"\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":10823,"title":10824,"module":10804,"summary":10825},"\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":10827,"title":10828,"module":10829,"summary":10830},"\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":10832,"title":10833,"module":10829,"summary":10834},"\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":10836,"title":10837,"module":10829,"summary":10838},"\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":10840,"title":10841,"module":10829,"summary":10842},"\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":10844,"title":10845,"module":10829,"summary":10846},"\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":10848,"title":10849,"module":10829,"summary":10850},"\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":10852,"title":10853,"module":10854,"summary":10855},"\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":10857,"title":10858,"module":10854,"summary":10859},"\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":10861,"title":10862,"module":10854,"summary":10863},"\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":10865,"title":10866,"module":10854,"summary":10867},"\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":10869,"title":10870,"module":9709,"summary":10871},"\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":10873,"title":10874,"module":9709,"summary":10875},"\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":10877,"title":10878,"module":9709,"summary":10879},"\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":10881,"title":10882,"module":10883,"summary":10884},"\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":10886,"title":10887,"module":10883,"summary":10888},"\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":10890,"title":10891,"module":10883,"summary":10892},"\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":10894,"title":10895,"module":10896,"summary":10897},"\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":10899,"title":10900,"module":10896,"summary":10901},"\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":10903,"title":10904,"module":10896,"summary":10905},"\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":10907,"title":10908,"module":10909,"summary":10910},"\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":10912,"title":10913,"module":10909,"summary":10914},"\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":10916,"title":10917,"module":10918,"summary":10919},"\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":10921,"title":10922,"module":10918,"summary":10923},"\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":10925,"title":10926,"module":10918,"summary":10927},"\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":10929,"title":10930,"module":10918,"summary":10931},"\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":10933,"title":10934,"module":10918,"summary":10935},"\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":10937,"title":10938,"module":313,"summary":313},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":10940,"title":10941,"module":10942,"summary":10943},"\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":10945,"title":10946,"module":10942,"summary":10947},"\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":10949,"title":10950,"module":10942,"summary":10951},"\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":10953,"title":10954,"module":10942,"summary":10955},"\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":10957,"title":10958,"module":10959,"summary":10960},"\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":10962,"title":10963,"module":10959,"summary":10964},"\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":10966,"title":10967,"module":10959,"summary":10968},"\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":10970,"title":10971,"module":10959,"summary":10972},"\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":10974,"title":10975,"module":10959,"summary":10976},"\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":10978,"title":10979,"module":10959,"summary":10980},"\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":10982,"title":10983,"module":10984,"summary":10985},"\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":10987,"title":10988,"module":10984,"summary":10989},"\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":10991,"title":10992,"module":10984,"summary":10993},"\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":10995,"title":10996,"module":10984,"summary":10997},"\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":10999,"title":11000,"module":10984,"summary":11001},"\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":11003,"title":11004,"module":5,"summary":11005},"\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":11007,"title":11008,"module":5,"summary":11009},"\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":11011,"title":11012,"module":5,"summary":11013},"\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":11015,"title":11016,"module":5,"summary":11017},"\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":11019,"title":11020,"module":5,"summary":11021},"\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":11023,"title":11024,"module":5,"summary":11025},"\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":11027,"title":11028,"module":11029,"summary":11030},"\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":11032,"title":11033,"module":11029,"summary":11034},"\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":11036,"title":11037,"module":11029,"summary":11038},"\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":11040,"title":11041,"module":11029,"summary":11042},"\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":11044,"title":11045,"module":11046,"summary":11047},"\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":11049,"title":11050,"module":11046,"summary":11051},"\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":11053,"title":11054,"module":11046,"summary":11055},"\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":11057,"title":90,"module":11046,"summary":11058},"\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":11060,"title":11061,"module":11046,"summary":11062},"\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":11064,"title":11065,"module":11066,"summary":11067},"\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":11069,"title":11070,"module":11066,"summary":11071},"\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":11073,"title":11074,"module":11066,"summary":11075},"\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":11077,"title":11078,"module":11066,"summary":11079},"\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":11081,"title":11082,"module":11083,"summary":11084},"\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":11086,"title":11087,"module":11083,"summary":11088},"\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":11090,"title":11091,"module":11083,"summary":11092},"\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":11094,"title":11095,"module":11083,"summary":11096},"\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":11098,"title":11099,"module":11083,"summary":11100},"\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":11102,"title":11103,"module":313,"summary":313},"\u002Freal-analysis","Real Analysis",{"path":11105,"title":11106,"module":9214,"summary":11107},"\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":11109,"title":11110,"module":9214,"summary":11111},"\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":11113,"title":11114,"module":11115,"summary":11116},"\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":11118,"title":11119,"module":11115,"summary":11120},"\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":11122,"title":11123,"module":11115,"summary":11124},"\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":11126,"title":11127,"module":11115,"summary":11128},"\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":11130,"title":11131,"module":11132,"summary":11133},"\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":11135,"title":11136,"module":11132,"summary":11137},"\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":11139,"title":11140,"module":11132,"summary":11141},"\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":11143,"title":11144,"module":11132,"summary":11145},"\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":11147,"title":11148,"module":11132,"summary":11149},"\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":11151,"title":11152,"module":11132,"summary":11153},"\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":11155,"title":11156,"module":11157,"summary":11158},"\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":11160,"title":11161,"module":11157,"summary":11162},"\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":11164,"title":11165,"module":11157,"summary":11166},"\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":11168,"title":11169,"module":11157,"summary":11170},"\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":11172,"title":11173,"module":11174,"summary":11175},"\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":11177,"title":11178,"module":11174,"summary":11179},"\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":11181,"title":11182,"module":11174,"summary":11183},"\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":11185,"title":11186,"module":11174,"summary":11187},"\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":11189,"title":11190,"module":11191,"summary":11192},"\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":11194,"title":11195,"module":11191,"summary":11196},"\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":11198,"title":11199,"module":11191,"summary":11200},"\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":11202,"title":11203,"module":11204,"summary":11205},"\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":11207,"title":11208,"module":11204,"summary":11209},"\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":11211,"title":11212,"module":11204,"summary":11213},"\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":11215,"title":11216,"module":11204,"summary":11217},"\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":11219,"title":11220,"module":11221,"summary":11222},"\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":11224,"title":11225,"module":11221,"summary":11226},"\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":11228,"title":11229,"module":11221,"summary":11230},"\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":11232,"title":11233,"module":11221,"summary":11234},"\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":11236,"title":11237,"module":11238,"summary":11239},"\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":11241,"title":11242,"module":11238,"summary":11243},"\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":11245,"title":11246,"module":11238,"summary":11247},"\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":11249,"title":11250,"module":11251,"summary":11252},"\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":11254,"title":11255,"module":11251,"summary":11256},"\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":11258,"title":11259,"module":11251,"summary":11260},"\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":11262,"title":11263,"module":11251,"summary":11264},"\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":11266,"title":11267,"module":11268,"summary":11269},"\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":11271,"title":11272,"module":11268,"summary":11273},"\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":11275,"title":11276,"module":11268,"summary":11277},"\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":11279,"title":11280,"module":11268,"summary":11281},"\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":11283,"title":11284,"module":11268,"summary":11285},"\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":11287,"title":11288,"module":11289,"summary":11290},"\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":11292,"title":11293,"module":11289,"summary":11294},"\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":11296,"title":11297,"module":313,"summary":313},"\u002Fabstract-algebra","Abstract Algebra",{"path":11299,"title":11300,"module":11301,"summary":11302},"\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":11304,"title":11305,"module":11301,"summary":11306},"\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":11308,"title":11309,"module":11301,"summary":11310},"\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":11312,"title":11313,"module":11301,"summary":11314},"\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":11316,"title":11317,"module":11301,"summary":11318},"\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":11320,"title":11321,"module":11322,"summary":11323},"\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":11325,"title":11326,"module":11322,"summary":11327},"\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":11329,"title":11330,"module":11322,"summary":11331},"\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":11333,"title":11334,"module":11322,"summary":11335},"\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":11337,"title":11338,"module":11322,"summary":11339},"\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":11341,"title":11342,"module":11322,"summary":11343},"\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":11345,"title":11346,"module":11322,"summary":11347},"\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":11349,"title":11350,"module":11351,"summary":11352},"\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":11354,"title":11355,"module":11351,"summary":11356},"\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":11358,"title":11359,"module":11351,"summary":11360},"\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":11362,"title":11363,"module":11351,"summary":11364},"\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":11366,"title":11367,"module":11368,"summary":11369},"\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":11371,"title":11372,"module":11368,"summary":11373},"\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":11375,"title":11376,"module":11368,"summary":11377},"\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":11379,"title":11380,"module":11381,"summary":11382},"\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":11384,"title":11385,"module":11381,"summary":11386},"\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":11388,"title":11389,"module":11381,"summary":11390},"\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":11392,"title":11393,"module":11381,"summary":11394},"\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":11396,"title":11397,"module":11381,"summary":11398},"\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":11400,"title":11401,"module":11381,"summary":11402},"\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":11404,"title":11405,"module":11406,"summary":11407},"\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":11409,"title":11410,"module":11406,"summary":11411},"\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":11413,"title":11414,"module":11406,"summary":11415},"\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":11417,"title":11418,"module":11419,"summary":11420},"\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":11422,"title":11423,"module":11419,"summary":11424},"\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":11426,"title":11427,"module":11419,"summary":11428},"\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":11430,"title":11431,"module":11419,"summary":11432},"\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":11434,"title":11435,"module":11436,"summary":11437},"\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":11439,"title":11440,"module":11436,"summary":11441},"\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":11443,"title":11444,"module":11436,"summary":11445},"\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":11447,"title":11448,"module":11449,"summary":11450},"\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":11452,"title":11453,"module":11449,"summary":11454},"\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":11456,"title":11457,"module":11449,"summary":11458},"\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":11460,"title":11461,"module":11449,"summary":11462},"\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":11464,"title":11465,"module":313,"summary":313},"\u002Fatomic-physics","Atomic Physics",{"path":11467,"title":11468,"module":313,"summary":313},"\u002Fdatabases","Databases",{"path":11470,"title":11471,"module":9214,"summary":11472},"\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":11474,"title":11475,"module":9214,"summary":11476},"\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":11478,"title":11479,"module":9214,"summary":11480},"\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":11482,"title":11483,"module":9214,"summary":11484},"\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":11486,"title":11487,"module":9214,"summary":11488},"\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":11490,"title":11491,"module":9214,"summary":11492},"\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":11494,"title":11495,"module":11496,"summary":11497},"\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":11499,"title":11500,"module":11496,"summary":11501},"\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":11503,"title":11504,"module":11496,"summary":11505},"\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":11507,"title":11508,"module":11509,"summary":11510},"\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":11512,"title":11513,"module":11509,"summary":11514},"\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":11516,"title":11517,"module":11509,"summary":11518},"\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":11520,"title":11521,"module":11522,"summary":11523},"\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":11525,"title":11526,"module":11522,"summary":11527},"\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":11529,"title":11530,"module":11522,"summary":11531},"\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":11533,"title":11534,"module":11522,"summary":11535},"\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":11537,"title":11538,"module":11522,"summary":11539},"\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":11541,"title":11542,"module":11543,"summary":11544},"\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":11546,"title":11547,"module":11543,"summary":11548},"\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":11550,"title":11551,"module":11543,"summary":11552},"\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":11554,"title":11555,"module":11543,"summary":11556},"\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":11558,"title":11559,"module":11560,"summary":11561},"\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":11563,"title":11564,"module":11560,"summary":11565},"\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":11567,"title":11568,"module":11560,"summary":11569},"\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":11571,"title":11572,"module":11560,"summary":11573},"\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":11575,"title":11576,"module":11577,"summary":11578},"\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":11580,"title":11581,"module":11577,"summary":11582},"\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":11584,"title":11585,"module":11577,"summary":11586},"\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":11588,"title":11589,"module":11577,"summary":11590},"\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":11592,"title":11593,"module":11594,"summary":11595},"\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":11597,"title":11598,"module":11594,"summary":11599},"\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":11601,"title":11602,"module":11594,"summary":11603},"\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":11605,"title":11606,"module":313,"summary":313},"\u002Fcategory-theory","Category Theory",{"path":11608,"title":10250,"module":11609,"summary":11610},"\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":11612,"title":11613,"module":11609,"summary":11614},"\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":11616,"title":11617,"module":11609,"summary":11618},"\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":11620,"title":9609,"module":11609,"summary":11621},"\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":11623,"title":11624,"module":9214,"summary":11625},"\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":11627,"title":11628,"module":9214,"summary":11629},"\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":11631,"title":11632,"module":9214,"summary":11633},"\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":11635,"title":11636,"module":11637,"summary":11638},"\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":11640,"title":11641,"module":11637,"summary":11642},"\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":11644,"title":11645,"module":11637,"summary":11646},"\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":11648,"title":11649,"module":11637,"summary":11650},"\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":11652,"title":11653,"module":11637,"summary":11654},"\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":11656,"title":11657,"module":11658,"summary":11659},"\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":11661,"title":11662,"module":11658,"summary":11663},"\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":11665,"title":11666,"module":11658,"summary":11667},"\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":11669,"title":11670,"module":11658,"summary":11671},"\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":11673,"title":11674,"module":11658,"summary":11675},"\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":11677,"title":11678,"module":11679,"summary":11680},"\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":11682,"title":11683,"module":11679,"summary":11684},"\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":11686,"title":11687,"module":11679,"summary":11688},"\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":11690,"title":11691,"module":11679,"summary":11692},"\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":11694,"title":11695,"module":11696,"summary":11697},"\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":11699,"title":11700,"module":11696,"summary":11701},"\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":11703,"title":11704,"module":11696,"summary":11705},"\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":11707,"title":11708,"module":11696,"summary":11709},"\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":11711,"title":11712,"module":11696,"summary":11713},"\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":11715,"title":11716,"module":11696,"summary":11717},"\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":11719,"title":11720,"module":11696,"summary":11721},"\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":11723,"title":11724,"module":11696,"summary":11725},"\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":11727,"title":11728,"module":11696,"summary":11729},"\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":11731,"title":11732,"module":11733,"summary":11734},"\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":11736,"title":11737,"module":11733,"summary":11738},"\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":11740,"title":11741,"module":11733,"summary":11742},"\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":11744,"title":11745,"module":11733,"summary":11746},"\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":11748,"title":11749,"module":11733,"summary":11750},"\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":11752,"title":11753,"module":11754,"summary":11755},"\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":11757,"title":11758,"module":11754,"summary":11759},"\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":11761,"title":11762,"module":11754,"summary":11763},"\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":11765,"title":11766,"module":11754,"summary":11767},"\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":11769,"title":11770,"module":11754,"summary":11771},"\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":11773,"title":11774,"module":11754,"summary":11775},"\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":11777,"title":11778,"module":11754,"summary":11779},"\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":11781,"title":11782,"module":11783,"summary":11784},"\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":11786,"title":11787,"module":11783,"summary":11788},"\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":11790,"title":11791,"module":11783,"summary":11792},"\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":11794,"title":11795,"module":11796,"summary":11797},"\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":11799,"title":11800,"module":11796,"summary":11801},"\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":11803,"title":11804,"module":11796,"summary":11805},"\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":11807,"title":11808,"module":11796,"summary":11809},"\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":11811,"title":11812,"module":11796,"summary":11813},"\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":11815,"title":11816,"module":11796,"summary":11817},"\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":11819,"title":11820,"module":11796,"summary":11821},"\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":11823,"title":11824,"module":11825,"summary":11826},"\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":11828,"title":11829,"module":11825,"summary":11830},"\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":11832,"title":11833,"module":11825,"summary":11834},"\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":11836,"title":11837,"module":11825,"summary":11838},"\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":11840,"title":11841,"module":11825,"summary":11842},"\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":11844,"title":11845,"module":11825,"summary":11846},"\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":11848,"title":11849,"module":11825,"summary":11850},"\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":11852,"title":11853,"module":11825,"summary":11854},"\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":11856,"title":11857,"module":11825,"summary":11858},"\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":11860,"title":11861,"module":11825,"summary":11862},"\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":11864,"title":11865,"module":11825,"summary":11866},"\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":11868,"title":11869,"module":11870,"summary":11871},"\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":11873,"title":11874,"module":11870,"summary":11875},"\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":11877,"title":11878,"module":11870,"summary":11879},"\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":11881,"title":11882,"module":11870,"summary":11883},"\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":11885,"title":11886,"module":11870,"summary":11887},"\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":11889,"title":11890,"module":313,"summary":313},"\u002Fdeep-learning","Deep Learning",{"path":11892,"title":11893,"module":9800,"summary":11894},"\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":11896,"title":11897,"module":9800,"summary":11898},"\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":11900,"title":11901,"module":9800,"summary":11902},"\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":11904,"title":11905,"module":9800,"summary":11906},"\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":11908,"title":11909,"module":9800,"summary":11910},"\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":11912,"title":11913,"module":11914,"summary":11915},"\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":11917,"title":11918,"module":11914,"summary":11919},"\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":11921,"title":11922,"module":11914,"summary":11923},"\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":11925,"title":11926,"module":11914,"summary":11927},"\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":11929,"title":11930,"module":11931,"summary":11932},"\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":11934,"title":11935,"module":11931,"summary":11936},"\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":11938,"title":11939,"module":11931,"summary":11940},"\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":11942,"title":11943,"module":11931,"summary":11944},"\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":11946,"title":11947,"module":11948,"summary":11949},"\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":11951,"title":11952,"module":11948,"summary":11953},"\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":11955,"title":11956,"module":11948,"summary":11957},"\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":11959,"title":11960,"module":11948,"summary":11961},"\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":11963,"title":11964,"module":11948,"summary":11965},"\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":11967,"title":11968,"module":11969,"summary":11970},"\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":11972,"title":11973,"module":11969,"summary":11974},"\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":11976,"title":11977,"module":11969,"summary":11978},"\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":11980,"title":11981,"module":11982,"summary":11983},"\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":11985,"title":11986,"module":11982,"summary":11987},"\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":11989,"title":11990,"module":11982,"summary":11991},"\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":11993,"title":11994,"module":11995,"summary":11996},"\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":11998,"title":11999,"module":11995,"summary":12000},"\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":12002,"title":12003,"module":11995,"summary":12004},"\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":12006,"title":12007,"module":11995,"summary":12008},"\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":12010,"title":12011,"module":12012,"summary":12013},"\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":12015,"title":12016,"module":12012,"summary":12017},"\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":12019,"title":12020,"module":12012,"summary":12021},"\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":12023,"title":12024,"module":12012,"summary":12025},"\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":12027,"title":12028,"module":12012,"summary":12029},"\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":12031,"title":12032,"module":12012,"summary":12033},"\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":12035,"title":12036,"module":12037,"summary":12038},"\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":12040,"title":12041,"module":12037,"summary":12042},"\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":12044,"title":12045,"module":12037,"summary":12046},"\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":12048,"title":12049,"module":12037,"summary":12050},"\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":12052,"title":12053,"module":12054,"summary":12055},"\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":12057,"title":12058,"module":12054,"summary":12059},"\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":12061,"title":12062,"module":12054,"summary":12063},"\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":12065,"title":12066,"module":12067,"summary":12068},"\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":12070,"title":12071,"module":12067,"summary":12072},"\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":12074,"title":12075,"module":12067,"summary":12076},"\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":12078,"title":12079,"module":12067,"summary":12080},"\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":12082,"title":12083,"module":12067,"summary":12084},"\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":12086,"title":12087,"module":12088,"summary":12089},"\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":12091,"title":12092,"module":12088,"summary":12093},"\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":12095,"title":12096,"module":12088,"summary":12097},"\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":12099,"title":12100,"module":313,"summary":313},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":12102,"title":12103,"module":12104,"summary":12105},"\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":12107,"title":12108,"module":12104,"summary":12109},"\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":12111,"title":12112,"module":12104,"summary":12113},"\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":12115,"title":12116,"module":12104,"summary":12117},"\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":12119,"title":12120,"module":12121,"summary":12122},"\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":12124,"title":12125,"module":12121,"summary":12126},"\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":12128,"title":12129,"module":12121,"summary":12130},"\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":12132,"title":12133,"module":12121,"summary":12134},"\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":12136,"title":12137,"module":12138,"summary":12139},"\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":12141,"title":12142,"module":12138,"summary":12143},"\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":12145,"title":12146,"module":12138,"summary":12147},"\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":12149,"title":12150,"module":12138,"summary":12151},"\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":12153,"title":12154,"module":12155,"summary":12156},"\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":12158,"title":12159,"module":12155,"summary":12160},"\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":12162,"title":12163,"module":12155,"summary":12164},"\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":12166,"title":12167,"module":12155,"summary":12168},"\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":12170,"title":12171,"module":12172,"summary":12173},"\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":12175,"title":12176,"module":12172,"summary":12177},"\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":12179,"title":12180,"module":12172,"summary":12181},"\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":12183,"title":12184,"module":12172,"summary":12185},"\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":12187,"title":12188,"module":12189,"summary":12190},"\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":12192,"title":12193,"module":12189,"summary":12194},"\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":12196,"title":12197,"module":12189,"summary":12198},"\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":12200,"title":12201,"module":12189,"summary":12202},"\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":12204,"title":12205,"module":12206,"summary":12207},"\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":12209,"title":12210,"module":12206,"summary":12211},"\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":12213,"title":12214,"module":12206,"summary":12215},"\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":12217,"title":12218,"module":12206,"summary":12219},"\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":12221,"title":12222,"module":12206,"summary":12223},"\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":12225,"title":12226,"module":12227,"summary":12228},"\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":12230,"title":12231,"module":12227,"summary":12232},"\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":12234,"title":12235,"module":12236,"summary":12237},"\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":12239,"title":12240,"module":12236,"summary":12241},"\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":12243,"title":12244,"module":12236,"summary":12245},"\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":12247,"title":12248,"module":12236,"summary":12249},"\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":12251,"title":12252,"module":12253,"summary":12254},"\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":12256,"title":12257,"module":12253,"summary":12258},"\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":12260,"title":12261,"module":12253,"summary":12262},"\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":12264,"title":12265,"module":12253,"summary":12266},"\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":12268,"title":12269,"module":12253,"summary":12270},"\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":12272,"title":12273,"module":12274,"summary":12275},"\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":12277,"title":12278,"module":12274,"summary":12279},"\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":12281,"title":12282,"module":12274,"summary":12283},"\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":12285,"title":12286,"module":12274,"summary":12287},"\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":12289,"title":12290,"module":313,"summary":313},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":12292,"title":12293,"module":9214,"summary":12294},"\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":12296,"title":12297,"module":12298,"summary":12299},"\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":12301,"title":12302,"module":12298,"summary":12303},"\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":12305,"title":12306,"module":12298,"summary":12307},"\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":12309,"title":12310,"module":12298,"summary":12311},"\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":12313,"title":12314,"module":12298,"summary":12315},"\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":12317,"title":12318,"module":12298,"summary":12319},"\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":12321,"title":12322,"module":12298,"summary":12323},"\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":12325,"title":12326,"module":12327,"summary":12328},"\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":12330,"title":12331,"module":12327,"summary":12332},"\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":12334,"title":12335,"module":12327,"summary":12336},"\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":12338,"title":12339,"module":12327,"summary":12340},"\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":12342,"title":12343,"module":12344,"summary":12345},"\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":12347,"title":12348,"module":12344,"summary":12349},"\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":12351,"title":12352,"module":12344,"summary":12353},"\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":12355,"title":12356,"module":12344,"summary":12357},"\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":12359,"title":12360,"module":12361,"summary":12362},"\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":12364,"title":12365,"module":12361,"summary":12366},"\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":12368,"title":12369,"module":12361,"summary":12370},"\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":12372,"title":12373,"module":12361,"summary":12374},"\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":12376,"title":12377,"module":12378,"summary":12379},"\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":12381,"title":12382,"module":12378,"summary":12383},"\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":12385,"title":12386,"module":12378,"summary":12387},"\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":12389,"title":12390,"module":12378,"summary":12391},"\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":12393,"title":12394,"module":12395,"summary":12396},"\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":12398,"title":12399,"module":12395,"summary":12400},"\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":12402,"title":12403,"module":12395,"summary":12404},"\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":12406,"title":12407,"module":12408,"summary":12409},"\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":12411,"title":12412,"module":12408,"summary":12413},"\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":12415,"title":12416,"module":12417,"summary":12418},"\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":12420,"title":12421,"module":12417,"summary":12422},"\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":12424,"title":12425,"module":12417,"summary":12426},"\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":12428,"title":12429,"module":313,"summary":313},"\u002Flogic","Logic",{"path":12431,"title":12432,"module":9214,"summary":12433},"\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":12435,"title":12436,"module":9214,"summary":12437},"\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":12439,"title":12440,"module":9214,"summary":12441},"\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":12443,"title":12444,"module":9214,"summary":12445},"\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":12447,"title":12448,"module":9214,"summary":12449},"\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":12451,"title":12452,"module":9214,"summary":12453},"\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":12455,"title":9433,"module":12456,"summary":12457},"\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":12459,"title":12460,"module":12456,"summary":12461},"\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":12463,"title":12464,"module":12456,"summary":12465},"\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":12467,"title":12468,"module":12456,"summary":12469},"\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":12471,"title":12472,"module":12456,"summary":12473},"\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":12475,"title":12476,"module":12456,"summary":12477},"\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":12479,"title":12480,"module":12456,"summary":12481},"\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":12483,"title":12484,"module":12456,"summary":12485},"\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":12487,"title":12488,"module":12456,"summary":12489},"\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":12491,"title":12492,"module":12456,"summary":12493},"\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":12495,"title":12496,"module":12456,"summary":12497},"\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":12499,"title":12500,"module":12456,"summary":12501},"\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":12503,"title":12504,"module":12505,"summary":12506},"\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":12508,"title":12509,"module":12505,"summary":12510},"\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":12512,"title":12513,"module":12505,"summary":12514},"\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":12516,"title":12517,"module":12505,"summary":12518},"\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":12520,"title":12521,"module":12505,"summary":12522},"\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":12524,"title":12525,"module":12505,"summary":12526},"\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":12528,"title":12529,"module":12505,"summary":12530},"\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":12532,"title":12533,"module":12505,"summary":12534},"\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":12536,"title":12537,"module":12505,"summary":12538},"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods","Policy Gradient Methods","Every method so far learned values and read a policy off them. Policy gradient methods drop the intermediary: parameterize the policy directly and climb the performance gradient. We build the softmax-in-preferences parameterization, prove the policy gradient theorem that makes the gradient computable without the unknown state distribution, and derive REINFORCE and its variance-cutting state-value baseline — the launch point for the bootstrapping actor-critic that follows.\n",{"path":12540,"title":12541,"module":12505,"summary":12542},"\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":12544,"title":12545,"module":12505,"summary":12546},"\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":12548,"title":12549,"module":12505,"summary":12550},"\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":12552,"title":12553,"module":12505,"summary":12554},"\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":12556,"title":12557,"module":12505,"summary":12558},"\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":12560,"title":11878,"module":12561,"summary":12562},"\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":12564,"title":12565,"module":12561,"summary":12566},"\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":12568,"title":12569,"module":12561,"summary":12570},"\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":12572,"title":12573,"module":12561,"summary":12574},"\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":12576,"title":12577,"module":12561,"summary":12578},"\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":12580,"title":12581,"module":12561,"summary":12582},"\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":12584,"title":12585,"module":12561,"summary":12586},"\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":12588,"title":12589,"module":12561,"summary":12590},"\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":12592,"title":12593,"module":12594,"summary":12595},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow","Sharpening DQN: Improvements and the Distributional Idea","Modern Deep Reinforcement Learning","In the years after the 2015 DQN paper, a stream of focused improvements each fixed one weakness of the baseline without disturbing its frame. This lesson recaps five that keep the scalar $Q$-value — Double DQN, multi-step returns, dueling networks, prioritized replay, and NoisyNets, each changing a different slot of the same Q-learning loop — then develops the sixth, distributional RL, which changes the objective itself: learn the whole return distribution $Z(s,a)$. We build the distributional Bellman equation and the C51 categorical algorithm, projection step and all, worked end to end on real numbers. A companion lesson takes up QR-DQN, Rainbow, and the modern distributional line.\n",{"path":12597,"title":12598,"module":12594,"summary":12599},"\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":12601,"title":12602,"module":12594,"summary":12603},"\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":12605,"title":12606,"module":12594,"summary":12607},"\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":12609,"title":12610,"module":12594,"summary":12611},"\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":12613,"title":12614,"module":12594,"summary":12615},"\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":12617,"title":12618,"module":12594,"summary":12619},"\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":12621,"title":12622,"module":12594,"summary":12623},"\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":12625,"title":12626,"module":12594,"summary":12627},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl","Offline RL: The Problem and Value-Based Fixes","Offline reinforcement learning learns a policy from a fixed logged dataset with no further environment interaction — off-policy learning pushed to the extreme, and it breaks for the extreme version of the same reason. Bootstrapping queries the value function at out-of-distribution actions the data never covers, those errors are optimistic, and with no online feedback to correct them they compound through the Bellman backup. This lesson sets up the failure and off-policy evaluation, then builds the first two families of pessimistic fixes: policy constraint (BCQ) and conservative value estimation (CQL). A companion lesson takes up implicit methods, model-based offline RL, and Decision Transformer.\n",{"path":12629,"title":12630,"module":12594,"summary":12631},"\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":12633,"title":12634,"module":12594,"summary":12635},"\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":12637,"title":12638,"module":12594,"summary":12639},"\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":12641,"title":12642,"module":12594,"summary":12643},"\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":12645,"title":12646,"module":12594,"summary":12647},"\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":12649,"title":12650,"module":12594,"summary":12651},"\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":12653,"title":12654,"module":12594,"summary":12655},"\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":12657,"title":12658,"module":12594,"summary":12659},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models","RLHF and Language Models","A language model trained to predict the next token is fluent but not helpful, honest, or harmless — the objective it was optimized for is not the objective we want. RLHF closes that gap by turning the one thing humans do reliably, comparing two outputs, into a reward. We build the three-stage pipeline: supervised fine-tuning, a Bradley-Terry reward model fit to preference pairs, then PPO against that reward with a KL penalty keeping it near the reference policy. We then cover reward hacking and why the KL penalty matters, Direct Preference Optimization, which folds the reward model into a single classification loss, and the RLAIF and verifiable-reward variants. This pipeline is what makes the largest models usable as assistants.\n",{"path":12661,"title":12662,"module":12594,"summary":12663},"\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":12665,"title":12666,"module":12594,"summary":12667},"\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":12669,"title":12670,"module":12594,"summary":12671},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl","Safe and Constrained RL: The CMDP and Policy Methods","Maximizing a scalar reward is not the same as behaving well: a capable optimizer will find and exploit any gap between the reward and what its designer actually meant, a failure called specification gaming or reward hacking. The remedy is to add explicit cost constraints — the constrained MDP — maximizing return subject to an expected-cost budget. This lesson builds the core toolkit: the CMDP itself, Lagrangian primal-dual methods that learn a multiplier on the constraint (RCPO), and constrained policy optimization (CPO) with its trust-region cost bound. A companion lesson covers risk-sensitivity, safe exploration, and the alignment framing.\n",{"path":12673,"title":12674,"module":12594,"summary":12675},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2","Safe RL: Risk, Safe Exploration, and Alignment","A companion to the constrained-MDP lesson. Constraining the mean cost is not enough: a policy safe on average can be catastrophic in the tail, and a policy safe at convergence can violate its limits wildly while learning. This lesson optimizes the tail with risk-sensitive objectives (CVaR), then makes exploration itself safe with shields, Lyapunov methods, and safety layers that project unsafe actions onto the feasible set — closing with benchmarks, safe RLHF, robustness, and the alignment framing that ties safety back to the problem of incompletely specified reward.\n",{"path":12677,"title":12678,"module":12594,"summary":12679},"\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":12681,"title":12682,"module":12683,"summary":12684},"\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":12686,"title":12687,"module":12683,"summary":12688},"\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":12690,"title":12691,"module":12683,"summary":12692},"\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":12694,"title":12695,"module":12683,"summary":12696},"\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":12698,"title":12699,"module":12683,"summary":12700},"\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":12702,"title":12703,"module":12683,"summary":12704},"\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":12706,"title":12707,"module":12683,"summary":12708},"\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":12710,"title":12711,"module":12683,"summary":12712},"\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":12714,"title":11870,"module":313,"summary":313},"\u002Freinforcement-learning",{"path":12716,"title":12717,"module":9214,"summary":12718},"\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":12720,"title":12721,"module":9214,"summary":12722},"\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":12724,"title":12725,"module":9214,"summary":12726},"\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":12728,"title":12729,"module":9214,"summary":12730},"\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":12732,"title":12733,"module":12734,"summary":12735},"\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":12737,"title":12738,"module":12734,"summary":12739},"\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":12741,"title":12742,"module":12734,"summary":12743},"\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":12745,"title":12746,"module":12734,"summary":12747},"\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":12749,"title":12750,"module":12734,"summary":12751},"\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":12753,"title":12754,"module":12734,"summary":12755},"\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":12757,"title":12758,"module":12734,"summary":12759},"\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":12761,"title":12762,"module":12734,"summary":12763},"\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":12765,"title":12766,"module":12734,"summary":12767},"\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":12769,"title":12770,"module":12734,"summary":12771},"\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":12773,"title":12774,"module":12734,"summary":12775},"\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":12777,"title":12778,"module":12734,"summary":12779},"\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":12781,"title":12782,"module":12783,"summary":12784},"\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":12786,"title":12787,"module":12783,"summary":12788},"\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":12790,"title":12791,"module":12783,"summary":12792},"\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":12794,"title":12795,"module":12783,"summary":12796},"\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":12798,"title":12799,"module":12783,"summary":12800},"\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":12802,"title":12803,"module":12783,"summary":12804},"\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":12806,"title":12807,"module":12783,"summary":12808},"\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":12810,"title":12811,"module":12783,"summary":12812},"\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":12814,"title":12815,"module":12783,"summary":12816},"\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":12818,"title":12819,"module":12783,"summary":12820},"\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":12822,"title":12823,"module":12783,"summary":12824},"\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":12826,"title":12827,"module":12783,"summary":12828},"\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":12830,"title":12831,"module":12832,"summary":12833},"\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":12835,"title":12836,"module":12832,"summary":12837},"\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":12839,"title":12840,"module":12832,"summary":12841},"\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":12843,"title":12844,"module":12832,"summary":12845},"\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":12847,"title":12848,"module":12832,"summary":12849},"\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":12851,"title":12852,"module":12832,"summary":12853},"\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":12855,"title":12856,"module":12832,"summary":12857},"\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":12859,"title":12448,"module":12832,"summary":12860},"\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":12862,"title":12863,"module":12832,"summary":12864},"\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":12866,"title":12867,"module":12832,"summary":12868},"\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":12870,"title":12871,"module":12872,"summary":12873},"\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":12875,"title":12876,"module":12872,"summary":12877},"\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":12879,"title":12880,"module":12872,"summary":12881},"\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":12883,"title":12884,"module":12872,"summary":12885},"\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":12887,"title":11870,"module":12872,"summary":12888},"\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":12890,"title":12891,"module":12872,"summary":12892},"\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":12894,"title":12895,"module":12872,"summary":12896},"\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":12898,"title":12899,"module":12872,"summary":12900},"\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":12902,"title":12903,"module":12904,"summary":12905},"\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":12907,"title":12908,"module":12904,"summary":12909},"\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":12911,"title":12912,"module":12904,"summary":12913},"\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":12915,"title":12916,"module":12904,"summary":12917},"\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":12919,"title":12920,"module":12904,"summary":12921},"\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":12923,"title":12924,"module":12904,"summary":12925},"\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":12927,"title":12928,"module":12904,"summary":12929},"\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":12931,"title":12932,"module":12904,"summary":12933},"\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":12935,"title":12936,"module":313,"summary":313},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":12938,"title":12939,"module":12940,"summary":12941},"\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":12943,"title":12944,"module":12940,"summary":12945},"\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":12947,"title":12948,"module":12940,"summary":12949},"\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":12951,"title":12952,"module":12940,"summary":12953},"\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":12955,"title":12956,"module":12940,"summary":12957},"\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":12959,"title":12960,"module":12961,"summary":12962},"\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":12964,"title":12965,"module":12961,"summary":12966},"\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":12968,"title":12969,"module":12961,"summary":12970},"\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":12972,"title":12973,"module":12961,"summary":12974},"\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":12976,"title":12977,"module":12978,"summary":12979},"\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":12981,"title":12982,"module":12978,"summary":12983},"\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":12985,"title":12986,"module":12978,"summary":12987},"\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":12989,"title":12990,"module":12978,"summary":12991},"\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":12993,"title":12994,"module":12995,"summary":12996},"\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":12998,"title":12999,"module":12995,"summary":13000},"\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":13002,"title":13003,"module":13004,"summary":13005},"\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":13007,"title":13008,"module":13004,"summary":13009},"\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":13011,"title":13012,"module":13013,"summary":13014},"\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":13016,"title":13017,"module":13013,"summary":13018},"\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":13020,"title":13021,"module":13013,"summary":13022},"\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":13024,"title":13025,"module":13013,"summary":13026},"\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":13028,"title":13029,"module":13030,"summary":13031},"\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":13033,"title":13034,"module":13030,"summary":13035},"\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":13037,"title":13038,"module":13030,"summary":13039},"\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":13041,"title":13042,"module":13043,"summary":13044},"\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":13046,"title":13047,"module":13043,"summary":13048},"\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":13050,"title":13051,"module":13043,"summary":13052},"\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":13054,"title":13055,"module":13056,"summary":13057},"\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":13059,"title":13060,"module":13056,"summary":13061},"\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":13063,"title":13064,"module":13065,"summary":13066},"\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":13068,"title":13069,"module":13065,"summary":13070},"\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":13072,"title":13073,"module":13065,"summary":13074},"\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":13076,"title":13077,"module":13078,"summary":13079},"\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":13081,"title":13082,"module":13078,"summary":13083},"\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":13085,"title":13086,"module":13078,"summary":13087},"\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":13089,"title":13090,"module":13078,"summary":13091},"\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":13093,"title":13094,"module":13078,"summary":13095},"\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":13097,"title":13098,"module":313,"summary":313},"\u002Fnuclear-physics","Nuclear Physics",{"path":13100,"title":13101,"module":9214,"summary":13102},"\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":13104,"title":13105,"module":9214,"summary":13106},"\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":13108,"title":13109,"module":9214,"summary":13110},"\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":13112,"title":13113,"module":9214,"summary":13114},"\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":13116,"title":13117,"module":9214,"summary":13118},"\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":13120,"title":13121,"module":13122,"summary":13123},"\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":13125,"title":13126,"module":13122,"summary":13127},"\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":13129,"title":13130,"module":13122,"summary":13131},"\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":13133,"title":13134,"module":13122,"summary":13135},"\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":13137,"title":13138,"module":13139,"summary":13140},"\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":13142,"title":13143,"module":13139,"summary":13144},"\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":13146,"title":13147,"module":13139,"summary":13148},"\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":13150,"title":13151,"module":193,"summary":13152},"\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":13154,"title":13155,"module":193,"summary":13156},"\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":13158,"title":13159,"module":193,"summary":13160},"\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":13162,"title":13163,"module":10004,"summary":13164},"\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":13166,"title":11716,"module":10004,"summary":13167},"\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":13169,"title":11824,"module":10004,"summary":13170},"\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":13172,"title":13173,"module":10004,"summary":13174},"\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":13176,"title":13177,"module":10004,"summary":13178},"\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":13180,"title":13181,"module":10004,"summary":13182},"\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":13184,"title":13185,"module":13186,"summary":13187},"\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":13189,"title":13190,"module":13186,"summary":13191},"\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":13193,"title":13194,"module":13186,"summary":13195},"\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":13197,"title":13198,"module":13186,"summary":13199},"\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":13201,"title":13202,"module":13186,"summary":13203},"\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":13205,"title":13206,"module":13186,"summary":13207},"\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":13209,"title":13210,"module":13186,"summary":13211},"\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":13213,"title":13214,"module":13186,"summary":13215},"\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":13217,"title":13218,"module":13186,"summary":13219},"\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":13221,"title":13222,"module":13186,"summary":13223},"\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":13225,"title":13226,"module":13186,"summary":13227},"\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":13229,"title":13230,"module":13186,"summary":13231},"\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":13233,"title":13234,"module":13186,"summary":13235},"\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":13237,"title":13238,"module":13186,"summary":13239},"\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":13241,"title":13242,"module":13186,"summary":13243},"\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":13245,"title":13246,"module":13186,"summary":13247},"\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":13249,"title":13250,"module":13186,"summary":13251},"\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":13253,"title":13254,"module":13186,"summary":13255},"\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":13257,"title":13258,"module":13186,"summary":13259},"\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":13261,"title":13262,"module":13186,"summary":13263},"\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":13265,"title":13266,"module":11812,"summary":13267},"\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":13269,"title":13270,"module":11812,"summary":13271},"\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":13273,"title":13274,"module":11812,"summary":13275},"\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":13277,"title":13278,"module":11812,"summary":13279},"\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":13281,"title":13282,"module":11812,"summary":13283},"\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":13285,"title":13286,"module":11812,"summary":13287},"\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":13289,"title":13290,"module":11812,"summary":13291},"\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":13293,"title":13294,"module":11812,"summary":13295},"\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":13297,"title":13298,"module":13299,"summary":13300},"\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":13302,"title":13303,"module":13299,"summary":13304},"\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":13306,"title":13307,"module":13299,"summary":13308},"\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":13310,"title":13311,"module":13299,"summary":13312},"\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":13314,"title":13315,"module":313,"summary":313},"\u002Fnatural-language-processing","Natural Language Processing",{"path":13317,"title":13318,"module":9214,"summary":13319},"\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":13321,"title":13322,"module":9214,"summary":13323},"\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":13325,"title":13326,"module":9214,"summary":13327},"\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":13329,"title":13330,"module":13331,"summary":13332},"\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":13334,"title":13335,"module":13331,"summary":13336},"\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":13338,"title":13339,"module":13331,"summary":13340},"\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":13342,"title":13343,"module":13331,"summary":13344},"\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":13346,"title":13347,"module":13348,"summary":13349},"\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":13351,"title":13352,"module":13348,"summary":13353},"\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":13355,"title":13356,"module":13348,"summary":13357},"\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":13359,"title":13360,"module":13348,"summary":13361},"\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":13363,"title":13364,"module":13365,"summary":13366},"\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":13368,"title":13369,"module":13365,"summary":13370},"\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":13372,"title":13373,"module":13365,"summary":13374},"\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":13376,"title":13377,"module":13365,"summary":13378},"\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":13380,"title":13381,"module":13382,"summary":13383},"\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":13385,"title":13386,"module":13382,"summary":13387},"\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":13389,"title":13390,"module":13382,"summary":13391},"\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":13393,"title":13394,"module":13395,"summary":13396},"\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":13398,"title":13399,"module":13395,"summary":13400},"\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":13402,"title":13403,"module":13395,"summary":13404},"\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":13406,"title":13407,"module":13395,"summary":13408},"\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":13410,"title":13411,"module":13412,"summary":13413},"\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":13415,"title":13416,"module":13412,"summary":13417},"\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":13419,"title":13420,"module":13412,"summary":13421},"\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":13423,"title":13424,"module":13412,"summary":13425},"\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":13427,"title":13428,"module":13429,"summary":13430},"\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":13432,"title":13433,"module":13429,"summary":13434},"\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":13436,"title":13437,"module":13429,"summary":13438},"\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":13440,"title":13441,"module":13429,"summary":13442},"\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":13444,"title":13445,"module":13446,"summary":13447},"\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":13449,"title":13450,"module":13446,"summary":13451},"\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":13453,"title":13454,"module":13446,"summary":13455},"\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":13457,"title":13458,"module":13446,"summary":13459},"\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":13461,"title":13462,"module":13446,"summary":13463},"\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":13465,"title":13466,"module":13467,"summary":13468},"\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":13470,"title":13471,"module":13467,"summary":13472},"\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":13474,"title":13475,"module":13467,"summary":13476},"\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":13478,"title":13479,"module":13480,"summary":13481},"\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":13483,"title":13484,"module":13480,"summary":13485},"\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":13487,"title":13488,"module":13480,"summary":13489},"\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":13491,"title":13492,"module":13492,"summary":13493},"\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":13495,"title":13496,"module":13492,"summary":13497},"\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":13499,"title":13500,"module":13492,"summary":13501},"\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":13503,"title":13504,"module":13492,"summary":13505},"\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":13507,"title":13508,"module":13492,"summary":13509},"\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":13511,"title":13512,"module":13492,"summary":13513},"\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":13515,"title":13516,"module":313,"summary":313},"\u002Fparticle-physics","Particle Physics",{"path":13518,"title":13519,"module":13520,"summary":13521},"\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":13523,"title":13524,"module":13520,"summary":13525},"\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":13527,"title":13528,"module":13520,"summary":13529},"\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":13531,"title":13532,"module":13533,"summary":13534},"\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":13536,"title":13537,"module":13533,"summary":13538},"\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":13540,"title":13541,"module":13533,"summary":13542},"\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":13544,"title":13545,"module":13533,"summary":13546},"\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":13548,"title":13549,"module":13550,"summary":13551},"\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":13553,"title":13554,"module":13550,"summary":13555},"\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":13557,"title":13558,"module":13550,"summary":13559},"\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":13561,"title":13562,"module":13550,"summary":13563},"\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":13565,"title":13566,"module":13567,"summary":13568},"\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":13570,"title":13571,"module":13567,"summary":13572},"\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":13574,"title":13575,"module":13567,"summary":13576},"\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":13578,"title":13579,"module":13567,"summary":13580},"\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":13582,"title":13583,"module":13584,"summary":13585},"\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":13587,"title":13588,"module":13584,"summary":13589},"\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":13591,"title":13592,"module":13584,"summary":13593},"\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":13595,"title":13596,"module":13584,"summary":13597},"\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":13599,"title":13600,"module":13601,"summary":13602},"\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":13604,"title":13605,"module":13601,"summary":13606},"\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":13608,"title":13609,"module":13601,"summary":13610},"\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":13612,"title":13613,"module":13614,"summary":13615},"\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":13617,"title":13618,"module":13614,"summary":13619},"\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":13621,"title":13622,"module":13614,"summary":13623},"\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":13625,"title":13626,"module":13614,"summary":13627},"\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":13629,"title":12045,"module":13630,"summary":13631},"\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":13633,"title":13634,"module":13630,"summary":13635},"\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":13637,"title":13638,"module":13630,"summary":13639},"\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":13641,"title":13642,"module":13630,"summary":13643},"\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":13645,"title":13646,"module":13630,"summary":13647},"\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":13649,"title":13650,"module":13651,"summary":13652},"\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":13654,"title":13655,"module":13651,"summary":13656},"\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":13658,"title":13659,"module":13651,"summary":13660},"\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":13662,"title":13663,"module":13651,"summary":13664},"\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":13666,"title":13667,"module":13668,"summary":13669},"\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":13671,"title":13672,"module":13668,"summary":13673},"\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":13675,"title":13676,"module":13668,"summary":13677},"\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":13679,"title":13680,"module":13668,"summary":13681},"\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":13683,"title":13684,"module":13668,"summary":13685},"\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":13687,"title":13688,"module":13689,"summary":13690},"\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":13692,"title":13693,"module":13689,"summary":13694},"\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":13696,"title":10763,"module":13689,"summary":13697},"\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":13699,"title":13700,"module":13689,"summary":13701},"\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":13703,"title":13704,"module":13689,"summary":13705},"\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":13707,"title":13708,"module":13709,"summary":13710},"\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":13712,"title":13713,"module":13709,"summary":13714},"\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":13716,"title":13717,"module":13709,"summary":13718},"\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":13720,"title":13721,"module":13709,"summary":13722},"\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":13724,"title":13725,"module":13709,"summary":13726},"\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":13728,"title":13729,"module":13709,"summary":13730},"\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":13732,"title":13733,"module":13709,"summary":13734},"\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":13736,"title":13737,"module":313,"summary":313},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":13739,"title":13740,"module":313,"summary":313},"\u002Fcolophon","Colophon",{"path":13742,"title":13743,"module":313,"summary":313},"\u002F","Study Notes","\u003Csvg style=\"width:100%;max-width:248.816px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 186.612 70.261\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M-11.76-31.371c25.608-28.453 93.894-28.453 119.502 0C82.134-8.61 13.848-8.61-11.76-31.371\"\u002F>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-11.76-31.371c25.608-28.453 93.894-28.453 119.502 0C82.134-8.61 13.848-8.61-11.76-31.371Z\" style=\"stroke-width:1.2\"\u002F>\u003Cpath fill=\"none\" d=\"M8.157-32.794c31.298-24.184 48.37-24.184 79.668 0\"\u002F>\u003Cpath fill=\"none\" d=\"M28.074-18.567c11.381-32.72 25.607-32.72 19.917-27.03\"\u002F>\u003Cg transform=\"translate(73.741 -29.645)\">\u003Cpath d=\"M-28.203-2.720L-28.255-2.720Q-28.343-2.720-28.343-2.839L-27.833-4.878Q-27.816-4.961-27.741-4.961L-27.636-4.961Q-27.543-4.961-27.543-4.843Q-27.618-4.522-27.618-4.311Q-27.618-3.652-27.157-3.344Q-26.695-3.037-26.005-3.037Q-25.610-3.037-25.238-3.270Q-24.867-3.502-24.643-3.880Q-24.419-4.258-24.419-4.654Q-24.419-4.983-24.592-5.225Q-24.766-5.467-25.069-5.546L-26.212-5.836Q-26.660-5.950-26.939-6.313Q-27.218-6.675-27.218-7.141Q-27.218-7.545-27.027-7.934Q-26.836-8.323-26.506-8.624Q-26.177-8.925-25.770-9.095Q-25.364-9.264-24.959-9.264Q-24.037-9.264-23.637-8.631L-23.127-9.229Q-23.083-9.264-23.052-9.264L-22.999-9.264Q-22.907-9.264-22.907-9.145L-23.421-7.102Q-23.439-7.022-23.514-7.022L-23.619-7.022Q-23.711-7.022-23.711-7.141Q-23.672-7.378-23.672-7.607Q-23.672-8.038-23.819-8.345Q-23.966-8.653-24.256-8.813Q-24.546-8.974-24.977-8.974Q-25.267-8.974-25.544-8.855Q-25.821-8.736-26.047-8.532Q-26.273-8.328-26.405-8.062Q-26.537-7.796-26.537-7.519Q-26.537-7.321-26.456-7.150Q-26.374-6.979-26.225-6.860Q-26.076-6.741-25.887-6.689L-24.753-6.403Q-24.450-6.324-24.219-6.124Q-23.988-5.924-23.863-5.634Q-23.738-5.344-23.738-5.032Q-23.738-4.606-23.927-4.190Q-24.116-3.775-24.445-3.439Q-24.775-3.103-25.186-2.911Q-25.597-2.720-26.032-2.720Q-26.524-2.720-26.946-2.865Q-27.368-3.010-27.627-3.349L-28.128-2.755Q-28.163-2.720-28.203-2.720\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m47.99-41.33 5.534-27.668\"\u002F>\u003Cpath fill=\"none\" d=\"M50.04-67.492c1.928-.092 3-.94 3.563-1.898.151 1.1.814 2.296 2.56 3.122\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799976\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(86.046 -62.019)\">\u003Cpath d=\"M-26.084-2.918L-28.400-2.918L-28.400-3.397L-27.785-3.397L-27.785-6.166Q-27.785-6.337-27.956-6.379Q-28.128-6.420-28.400-6.420L-28.400-6.895L-26.805-6.970L-26.805-6.060Q-26.656-6.337-26.405-6.543Q-26.155-6.750-25.843-6.860Q-25.531-6.970-25.223-6.970Q-24.494-6.970-24.124-6.673Q-23.755-6.376-23.755-5.673L-23.755-3.397L-23.144-3.397L-23.144-2.918L-25.456-2.918L-25.456-3.397L-24.845-3.397L-24.845-5.647Q-24.845-6.064-24.929-6.324Q-25.012-6.583-25.337-6.583Q-25.698-6.583-26.012-6.405Q-26.326-6.227-26.513-5.915Q-26.700-5.603-26.700-5.247L-26.700-3.397L-26.084-3.397\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"m96.36-22.835-10.397 7.278\"\u002F>\u003Cpath fill=\"none\" d=\"M90.167-13.806c-1.779-1.571-3.417-1.754-4.696-1.407.764-1.082 1.153-2.684.285-4.893\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:1.199976\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M-.379-39.907 10.1-49.075\"\u002F>\u003Cpath fill=\"none\" d=\"M5.731-50.362c1.937 1.37 3.586 1.375 4.82.892-.643 1.159-.857 2.793.244 4.895\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:1.199952\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-size=\"9\">\u003Cg transform=\"translate(-36.772 -26.203)\">\u003Cpath d=\"M-27.596-2.918L-27.886-2.918L-27.886-8.244Q-27.886-8.486-27.956-8.594Q-28.027-8.701-28.161-8.725Q-28.295-8.750-28.581-8.750L-28.581-9.066L-27.209-9.163L-27.209-6.363Q-26.963-6.614-26.629-6.754Q-26.295-6.895-25.944-6.895Q-25.544-6.895-25.181-6.732Q-24.819-6.570-24.562-6.291Q-24.305-6.012-24.155-5.634Q-24.006-5.256-24.006-4.860Q-24.006-4.298-24.283-3.832Q-24.560-3.366-25.034-3.092Q-25.509-2.817-26.058-2.817Q-26.423-2.817-26.744-2.986Q-27.064-3.155-27.284-3.450L-27.596-2.918M-27.183-5.950L-27.183-3.819Q-27.025-3.485-26.741-3.283Q-26.458-3.081-26.115-3.081Q-25.425-3.081-25.122-3.601Q-24.819-4.122-24.819-4.860Q-24.819-5.585-25.085-6.111Q-25.351-6.636-26.014-6.636Q-26.374-6.636-26.689-6.451Q-27.003-6.267-27.183-5.950\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.772 -26.203)\">\u003Cpath d=\"M-23.177-4.825Q-23.177-5.392-22.904-5.880Q-22.632-6.368-22.162-6.660Q-21.691-6.952-21.124-6.952Q-20.703-6.952-20.327-6.783Q-19.951-6.614-19.674-6.322Q-19.397-6.029-19.239-5.634Q-19.081-5.238-19.081-4.825Q-19.081-4.276-19.360-3.814Q-19.639-3.353-20.107-3.085Q-20.575-2.817-21.124-2.817Q-21.678-2.817-22.148-3.085Q-22.619-3.353-22.898-3.814Q-23.177-4.276-23.177-4.825M-21.124-3.107Q-20.628-3.107-20.351-3.368Q-20.074-3.630-19.982-4.034Q-19.890-4.439-19.890-4.935Q-19.890-5.410-19.988-5.799Q-20.087-6.188-20.360-6.438Q-20.632-6.689-21.124-6.689Q-21.836-6.689-22.100-6.194Q-22.364-5.700-22.364-4.935Q-22.364-4.135-22.109-3.621Q-21.854-3.107-21.124-3.107M-17.829-3.990L-17.829-5.977Q-17.829-6.218-17.899-6.326Q-17.969-6.434-18.103-6.458Q-18.237-6.482-18.519-6.482L-18.519-6.798L-17.125-6.895L-17.125-4.025Q-17.125-3.647-17.079-3.461Q-17.033-3.274-16.862-3.177Q-16.690-3.081-16.334-3.081Q-16-3.081-15.761-3.272Q-15.521-3.463-15.396-3.766Q-15.271-4.069-15.271-4.386L-15.271-5.977Q-15.271-6.218-15.341-6.326Q-15.412-6.434-15.546-6.458Q-15.680-6.482-15.965-6.482L-15.965-6.798L-14.568-6.895L-14.568-3.735Q-14.568-3.498-14.498-3.390Q-14.427-3.283-14.293-3.259Q-14.159-3.234-13.878-3.234L-13.878-2.918L-15.245-2.817L-15.245-3.538Q-15.412-3.212-15.717-3.015Q-16.022-2.817-16.378-2.817Q-17.038-2.817-17.433-3.087Q-17.829-3.357-17.829-3.990M-11.294-2.918L-13.381-2.918L-13.381-3.234Q-13.074-3.234-12.883-3.287Q-12.691-3.340-12.691-3.529L-12.691-5.977Q-12.691-6.218-12.762-6.326Q-12.832-6.434-12.966-6.458Q-13.100-6.482-13.381-6.482L-13.381-6.798L-12.041-6.895L-12.041-6.060Q-11.843-6.442-11.489-6.669Q-11.136-6.895-10.709-6.895Q-9.431-6.895-9.431-5.682L-9.431-3.529Q-9.431-3.340-9.239-3.287Q-9.048-3.234-8.741-3.234L-8.741-2.918L-10.828-2.918L-10.828-3.234Q-10.516-3.234-10.325-3.287Q-10.134-3.340-10.134-3.529L-10.134-5.647Q-10.134-5.906-10.178-6.128Q-10.222-6.350-10.367-6.493Q-10.512-6.636-10.771-6.636Q-11.114-6.636-11.395-6.447Q-11.676-6.258-11.832-5.946Q-11.988-5.634-11.988-5.287L-11.988-3.529Q-11.988-3.340-11.795-3.287Q-11.602-3.234-11.294-3.234L-11.294-2.918M-6.293-2.817Q-6.838-2.817-7.282-3.100Q-7.726-3.384-7.980-3.856Q-8.235-4.329-8.235-4.860Q-8.235-5.414-7.958-5.880Q-7.682-6.346-7.209-6.620Q-6.737-6.895-6.192-6.895Q-5.858-6.895-5.555-6.763Q-5.251-6.631-5.032-6.394L-5.032-8.244Q-5.032-8.486-5.102-8.594Q-5.172-8.701-5.306-8.725Q-5.440-8.750-5.726-8.750L-5.726-9.066L-4.359-9.163L-4.359-3.735Q-4.359-3.498-4.289-3.390Q-4.219-3.283-4.082-3.259Q-3.946-3.234-3.665-3.234L-3.665-2.918L-5.058-2.817L-5.058-3.366Q-5.309-3.103-5.627-2.960Q-5.946-2.817-6.293-2.817M-6.231-3.081Q-5.862-3.081-5.552-3.292Q-5.243-3.502-5.058-3.845L-5.058-5.977Q-5.229-6.280-5.511-6.458Q-5.792-6.636-6.130-6.636Q-6.820-6.636-7.123-6.115Q-7.427-5.594-7.427-4.852Q-7.427-4.131-7.156-3.606Q-6.886-3.081-6.231-3.081M-3.037-3.828Q-3.037-4.368-2.604-4.702Q-2.171-5.036-1.564-5.175Q-0.958-5.313-0.426-5.313L-0.426-5.647Q-0.426-5.906-0.545-6.150Q-0.664-6.394-0.872-6.541Q-1.081-6.689-1.353-6.689Q-1.916-6.689-2.228-6.491Q-2.079-6.464-1.986-6.346Q-1.894-6.227-1.894-6.069Q-1.894-5.893-2.019-5.763Q-2.144-5.634-2.325-5.634Q-2.514-5.634-2.641-5.761Q-2.769-5.889-2.769-6.069Q-2.769-6.539-2.329-6.746Q-1.890-6.952-1.353-6.952Q-1.063-6.952-0.776-6.864Q-0.488-6.776-0.255-6.616Q-0.022-6.456 0.127-6.216Q0.277-5.977 0.277-5.682L0.277-3.647Q0.277-3.494 0.352-3.355Q0.426-3.217 0.571-3.217Q0.725-3.217 0.798-3.353Q0.870-3.489 0.870-3.647L0.870-4.223L1.156-4.223L1.156-3.647Q1.156-3.314 0.908-3.089Q0.659-2.865 0.330-2.865Q0.070-2.865-0.112-3.059Q-0.294-3.252-0.338-3.529Q-0.505-3.208-0.839-3.012Q-1.173-2.817-1.542-2.817Q-2.096-2.817-2.566-3.065Q-3.037-3.314-3.037-3.828M-2.281-3.828Q-2.281-3.516-2.039-3.298Q-1.797-3.081-1.481-3.081Q-1.046-3.081-0.736-3.390Q-0.426-3.700-0.426-4.131L-0.426-5.058Q-0.844-5.058-1.270-4.931Q-1.696-4.803-1.988-4.526Q-2.281-4.250-2.281-3.828M3.696-2.918L1.463-2.918L1.463-3.234Q1.775-3.234 1.967-3.287Q2.158-3.340 2.158-3.529L2.158-5.977Q2.158-6.218 2.087-6.326Q2.017-6.434 1.883-6.458Q1.749-6.482 1.463-6.482L1.463-6.798L2.777-6.895L2.777-6.034Q2.940-6.425 3.208-6.660Q3.476-6.895 3.867-6.895Q4.140-6.895 4.355-6.732Q4.570-6.570 4.570-6.311Q4.570-6.135 4.452-6.016Q4.333-5.897 4.157-5.897Q3.977-5.897 3.858-6.016Q3.740-6.135 3.740-6.311Q3.740-6.526 3.894-6.636L3.876-6.636Q3.498-6.636 3.265-6.374Q3.032-6.113 2.933-5.726Q2.835-5.339 2.835-4.979L2.835-3.529Q2.835-3.340 3.092-3.287Q3.349-3.234 3.696-3.234L3.696-2.918M5.506-1.441Q5.673-1.336 5.854-1.336Q6.179-1.336 6.416-1.580Q6.653-1.824 6.803-2.171L7.106-2.918L5.739-6.183Q5.647-6.381 5.484-6.431Q5.322-6.482 5.019-6.482L5.019-6.798L6.943-6.798L6.943-6.482Q6.451-6.482 6.451-6.267Q6.451-6.245 6.469-6.183L7.475-3.793L8.376-5.933Q8.411-6.016 8.411-6.122Q8.411-6.284 8.290-6.383Q8.169-6.482 8.007-6.482L8.007-6.798L9.510-6.798L9.510-6.482Q9.224-6.482 9.011-6.339Q8.798-6.196 8.692-5.933L7.106-2.171Q6.917-1.718 6.603-1.395Q6.289-1.072 5.854-1.072Q5.528-1.072 5.269-1.292Q5.010-1.512 5.010-1.837Q5.010-2.004 5.128-2.118Q5.247-2.232 5.414-2.232Q5.528-2.232 5.618-2.182Q5.709-2.131 5.759-2.043Q5.810-1.956 5.810-1.837Q5.810-1.692 5.728-1.582Q5.647-1.472 5.506-1.441\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-36.772 -26.203)\">\u003Cpath d=\"M14.146-4.891Q14.146-4.061 14.633-3.549Q15.121-3.037 15.956-3.037Q16.527-3.037 17.061-3.318Q17.595-3.599 17.980-4.080Q18.364-4.562 18.509-5.115Q18.518-5.146 18.542-5.170Q18.566-5.194 18.602-5.194L18.707-5.194Q18.799-5.194 18.799-5.080Q18.637-4.443 18.184-3.898Q17.731-3.353 17.105-3.037Q16.479-2.720 15.811-2.720Q15.082-2.720 14.506-3.037Q13.930-3.353 13.601-3.918Q13.271-4.482 13.271-5.212Q13.271-5.977 13.620-6.713Q13.970-7.449 14.552-8.018Q15.134-8.587 15.886-8.925Q16.637-9.264 17.393-9.264Q17.863-9.264 18.261-9.059Q18.659-8.855 18.905-8.473L19.617-9.246Q19.634-9.264 19.674-9.264L19.727-9.264Q19.814-9.264 19.814-9.145L19.212-6.750Q19.195-6.671 19.125-6.671L18.988-6.671Q18.896-6.671 18.896-6.790Q18.936-6.970 18.936-7.220Q18.936-7.682 18.771-8.077Q18.606-8.473 18.276-8.710Q17.947-8.947 17.477-8.947Q16.738-8.947 16.121-8.589Q15.503-8.231 15.062-7.636Q14.620-7.040 14.383-6.317Q14.146-5.594 14.146-4.891\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Stokes' Theorem: circulation of \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6861em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathbf\">F\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> around the boundary curve \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6833em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0715em;\">C\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> equals the flux of \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6944em;\">\u003C\u002Fspan>\u003Cspan class=\"mop\">\u003Cspan class=\"mord mathrm\">curl\u003C\u002Fspan>\u003C\u002Fspan>\u003Cspan class=\"mspace\" style=\"margin-right:0.1667em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathbf\">F\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> through the surface \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6833em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0576em;\">S\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>; the normal and the boundary orientation obey the right-hand rule.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:218.656px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 163.992 123.568\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M-3.095 16.534c51.215 0 56.906-51.215 22.762-71.132C-14.476-71.67-65.691-46.063-60-11.92c5.69 22.762 28.452 28.453 56.905 28.453\"\u002F>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-3.095 16.534c51.215 0 56.906-51.215 22.762-71.132C-14.476-71.67-65.691-46.063-60-11.92c5.69 22.762 28.452 28.453 56.905 28.453Z\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(61.782 -39.604)\">\u003Cpath d=\"M-71.509 27.915L-76.593 27.915Q-76.703 27.915-76.703 27.796Q-76.703 27.735-76.670 27.667Q-76.637 27.599-76.575 27.599Q-76.074 27.599-75.846 27.546Q-75.727 27.502-75.648 27.269L-74.426 22.352Q-74.409 22.264-74.409 22.220Q-74.409 22.154-74.435 22.136Q-74.607 22.083-75.138 22.083Q-75.244 22.083-75.244 21.965Q-75.244 21.903-75.211 21.835Q-75.178 21.767-75.121 21.767L-70.151 21.767Q-70.107 21.767-70.076 21.802Q-70.045 21.837-70.045 21.886L-70.252 23.723Q-70.269 23.828-70.357 23.828L-70.441 23.828Q-70.537 23.828-70.537 23.705Q-70.493 23.178-70.493 23.063Q-70.493 22.712-70.619 22.508Q-70.744 22.303-70.955 22.215Q-71.166 22.127-71.421 22.105Q-71.676 22.083-72.084 22.083L-73.156 22.083Q-73.416 22.083-73.490 22.130Q-73.565 22.176-73.627 22.417L-74.163 24.566L-73.447 24.566Q-72.968 24.566-72.737 24.505Q-72.506 24.443-72.368 24.246Q-72.229 24.048-72.115 23.595Q-72.097 23.516-72.014 23.516L-71.935 23.516Q-71.895 23.516-71.864 23.547Q-71.834 23.578-71.834 23.622L-71.834 23.657L-72.383 25.854Q-72.414 25.933-72.484 25.933L-72.563 25.933Q-72.607 25.933-72.640 25.896Q-72.673 25.858-72.673 25.819Q-72.673 25.766-72.627 25.582Q-72.581 25.397-72.581 25.278Q-72.581 25.015-72.825 24.949Q-73.069 24.883-73.464 24.883L-74.238 24.883L-74.848 27.331Q-74.884 27.471-74.884 27.537Q-74.884 27.599-74.598 27.599L-73.464 27.599Q-72.814 27.599-72.401 27.502Q-71.988 27.405-71.722 27.188Q-71.456 26.970-71.256 26.627Q-71.056 26.285-70.770 25.621Q-70.726 25.555-70.674 25.555L-70.590 25.555Q-70.546 25.555-70.520 25.588Q-70.493 25.621-70.493 25.665Q-70.493 25.700-70.502 25.709L-71.421 27.853Q-71.451 27.915-71.509 27.915\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-size=\"9\">\u003Cg transform=\"translate(111.653 -18.67)\">\u003Cpath d=\"M-75.837 27.915L-76.127 27.915L-76.127 22.589Q-76.127 22.347-76.197 22.239Q-76.268 22.132-76.402 22.108Q-76.536 22.083-76.822 22.083L-76.822 21.767L-75.450 21.670L-75.450 24.470Q-75.204 24.219-74.870 24.079Q-74.536 23.938-74.185 23.938Q-73.785 23.938-73.422 24.101Q-73.060 24.263-72.803 24.542Q-72.546 24.821-72.396 25.199Q-72.247 25.577-72.247 25.973Q-72.247 26.535-72.524 27.001Q-72.801 27.467-73.275 27.741Q-73.750 28.016-74.299 28.016Q-74.664 28.016-74.985 27.847Q-75.305 27.678-75.525 27.383L-75.837 27.915M-75.424 24.883L-75.424 27.014Q-75.266 27.348-74.982 27.550Q-74.699 27.752-74.356 27.752Q-73.666 27.752-73.363 27.232Q-73.060 26.711-73.060 25.973Q-73.060 25.248-73.326 24.722Q-73.592 24.197-74.255 24.197Q-74.615 24.197-74.930 24.382Q-75.244 24.566-75.424 24.883\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(111.653 -18.67)\">\u003Cpath d=\"M-71.417 26.008Q-71.417 25.441-71.144 24.953Q-70.872 24.465-70.402 24.173Q-69.931 23.881-69.364 23.881Q-68.943 23.881-68.567 24.050Q-68.191 24.219-67.914 24.511Q-67.637 24.804-67.479 25.199Q-67.321 25.595-67.321 26.008Q-67.321 26.557-67.600 27.019Q-67.879 27.480-68.347 27.748Q-68.815 28.016-69.364 28.016Q-69.918 28.016-70.388 27.748Q-70.859 27.480-71.138 27.019Q-71.417 26.557-71.417 26.008M-69.364 27.726Q-68.868 27.726-68.591 27.465Q-68.314 27.203-68.222 26.799Q-68.130 26.394-68.130 25.898Q-68.130 25.423-68.228 25.034Q-68.327 24.645-68.600 24.395Q-68.872 24.144-69.364 24.144Q-70.076 24.144-70.340 24.639Q-70.604 25.133-70.604 25.898Q-70.604 26.698-70.349 27.212Q-70.094 27.726-69.364 27.726M-66.069 26.843L-66.069 24.856Q-66.069 24.615-66.139 24.507Q-66.209 24.399-66.343 24.375Q-66.477 24.351-66.759 24.351L-66.759 24.035L-65.365 23.938L-65.365 26.808Q-65.365 27.186-65.319 27.372Q-65.273 27.559-65.102 27.656Q-64.930 27.752-64.574 27.752Q-64.240 27.752-64.001 27.561Q-63.761 27.370-63.636 27.067Q-63.511 26.764-63.511 26.447L-63.511 24.856Q-63.511 24.615-63.581 24.507Q-63.652 24.399-63.786 24.375Q-63.920 24.351-64.205 24.351L-64.205 24.035L-62.808 23.938L-62.808 27.098Q-62.808 27.335-62.738 27.443Q-62.667 27.550-62.533 27.574Q-62.399 27.599-62.118 27.599L-62.118 27.915L-63.485 28.016L-63.485 27.295Q-63.652 27.621-63.957 27.818Q-64.262 28.016-64.618 28.016Q-65.278 28.016-65.673 27.746Q-66.069 27.476-66.069 26.843M-59.534 27.915L-61.621 27.915L-61.621 27.599Q-61.314 27.599-61.123 27.546Q-60.931 27.493-60.931 27.304L-60.931 24.856Q-60.931 24.615-61.002 24.507Q-61.072 24.399-61.206 24.375Q-61.340 24.351-61.621 24.351L-61.621 24.035L-60.281 23.938L-60.281 24.773Q-60.083 24.391-59.729 24.164Q-59.376 23.938-58.949 23.938Q-57.671 23.938-57.671 25.151L-57.671 27.304Q-57.671 27.493-57.479 27.546Q-57.288 27.599-56.981 27.599L-56.981 27.915L-59.068 27.915L-59.068 27.599Q-58.756 27.599-58.565 27.546Q-58.374 27.493-58.374 27.304L-58.374 25.186Q-58.374 24.927-58.418 24.705Q-58.462 24.483-58.607 24.340Q-58.752 24.197-59.011 24.197Q-59.354 24.197-59.635 24.386Q-59.916 24.575-60.072 24.887Q-60.228 25.199-60.228 25.546L-60.228 27.304Q-60.228 27.493-60.035 27.546Q-59.842 27.599-59.534 27.599L-59.534 27.915M-54.533 28.016Q-55.078 28.016-55.522 27.733Q-55.966 27.449-56.220 26.977Q-56.475 26.504-56.475 25.973Q-56.475 25.419-56.198 24.953Q-55.922 24.487-55.449 24.213Q-54.977 23.938-54.432 23.938Q-54.098 23.938-53.795 24.070Q-53.491 24.202-53.272 24.439L-53.272 22.589Q-53.272 22.347-53.342 22.239Q-53.412 22.132-53.546 22.108Q-53.680 22.083-53.966 22.083L-53.966 21.767L-52.599 21.670L-52.599 27.098Q-52.599 27.335-52.529 27.443Q-52.459 27.550-52.322 27.574Q-52.186 27.599-51.905 27.599L-51.905 27.915L-53.298 28.016L-53.298 27.467Q-53.549 27.730-53.867 27.873Q-54.186 28.016-54.533 28.016M-54.471 27.752Q-54.102 27.752-53.792 27.541Q-53.483 27.331-53.298 26.988L-53.298 24.856Q-53.469 24.553-53.751 24.375Q-54.032 24.197-54.370 24.197Q-55.060 24.197-55.364 24.718Q-55.667 25.239-55.667 25.981Q-55.667 26.702-55.396 27.227Q-55.126 27.752-54.471 27.752M-51.277 27.005Q-51.277 26.465-50.844 26.131Q-50.411 25.797-49.804 25.658Q-49.198 25.520-48.666 25.520L-48.666 25.186Q-48.666 24.927-48.785 24.683Q-48.904 24.439-49.112 24.292Q-49.321 24.144-49.593 24.144Q-50.156 24.144-50.468 24.342Q-50.319 24.369-50.226 24.487Q-50.134 24.606-50.134 24.764Q-50.134 24.940-50.259 25.070Q-50.384 25.199-50.565 25.199Q-50.754 25.199-50.881 25.072Q-51.009 24.944-51.009 24.764Q-51.009 24.294-50.569 24.087Q-50.130 23.881-49.593 23.881Q-49.303 23.881-49.016 23.969Q-48.728 24.057-48.495 24.217Q-48.262 24.377-48.113 24.617Q-47.963 24.856-47.963 25.151L-47.963 27.186Q-47.963 27.339-47.888 27.478Q-47.814 27.616-47.669 27.616Q-47.515 27.616-47.442 27.480Q-47.370 27.344-47.370 27.186L-47.370 26.610L-47.084 26.610L-47.084 27.186Q-47.084 27.519-47.332 27.744Q-47.581 27.968-47.910 27.968Q-48.170 27.968-48.352 27.774Q-48.534 27.581-48.578 27.304Q-48.745 27.625-49.079 27.821Q-49.413 28.016-49.782 28.016Q-50.336 28.016-50.806 27.768Q-51.277 27.519-51.277 27.005M-50.521 27.005Q-50.521 27.317-50.279 27.535Q-50.037 27.752-49.721 27.752Q-49.286 27.752-48.976 27.443Q-48.666 27.133-48.666 26.702L-48.666 25.775Q-49.084 25.775-49.510 25.902Q-49.936 26.030-50.228 26.307Q-50.521 26.583-50.521 27.005M-44.544 27.915L-46.777 27.915L-46.777 27.599Q-46.465 27.599-46.273 27.546Q-46.082 27.493-46.082 27.304L-46.082 24.856Q-46.082 24.615-46.153 24.507Q-46.223 24.399-46.357 24.375Q-46.491 24.351-46.777 24.351L-46.777 24.035L-45.463 23.938L-45.463 24.799Q-45.300 24.408-45.032 24.173Q-44.764 23.938-44.373 23.938Q-44.100 23.938-43.885 24.101Q-43.670 24.263-43.670 24.522Q-43.670 24.698-43.788 24.817Q-43.907 24.936-44.083 24.936Q-44.263 24.936-44.382 24.817Q-44.500 24.698-44.500 24.522Q-44.500 24.307-44.346 24.197L-44.364 24.197Q-44.742 24.197-44.975 24.459Q-45.208 24.720-45.307 25.107Q-45.405 25.494-45.405 25.854L-45.405 27.304Q-45.405 27.493-45.148 27.546Q-44.891 27.599-44.544 27.599L-44.544 27.915M-42.734 29.392Q-42.567 29.497-42.386 29.497Q-42.061 29.497-41.824 29.253Q-41.587 29.009-41.437 28.662L-41.134 27.915L-42.501 24.650Q-42.593 24.452-42.756 24.402Q-42.918 24.351-43.221 24.351L-43.221 24.035L-41.297 24.035L-41.297 24.351Q-41.789 24.351-41.789 24.566Q-41.789 24.588-41.771 24.650L-40.765 27.040L-39.864 24.900Q-39.829 24.817-39.829 24.711Q-39.829 24.549-39.950 24.450Q-40.071 24.351-40.233 24.351L-40.233 24.035L-38.730 24.035L-38.730 24.351Q-39.016 24.351-39.229 24.494Q-39.442 24.637-39.548 24.900L-41.134 28.662Q-41.323 29.115-41.637 29.438Q-41.951 29.761-42.386 29.761Q-42.712 29.761-42.971 29.541Q-43.230 29.321-43.230 28.996Q-43.230 28.829-43.112 28.715Q-42.993 28.601-42.826 28.601Q-42.712 28.601-42.622 28.651Q-42.531 28.702-42.481 28.790Q-42.430 28.877-42.430 28.996Q-42.430 29.141-42.512 29.251Q-42.593 29.361-42.734 29.392\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(111.653 -18.67)\">\u003Cpath d=\"M-34.799 28.113L-34.851 28.113Q-34.939 28.113-34.939 27.994L-34.429 25.955Q-34.412 25.872-34.337 25.872L-34.232 25.872Q-34.139 25.872-34.139 25.990Q-34.214 26.311-34.214 26.522Q-34.214 27.181-33.753 27.489Q-33.291 27.796-32.601 27.796Q-32.206 27.796-31.834 27.563Q-31.463 27.331-31.239 26.953Q-31.015 26.575-31.015 26.179Q-31.015 25.850-31.188 25.608Q-31.362 25.366-31.665 25.287L-32.808 24.997Q-33.256 24.883-33.535 24.520Q-33.814 24.158-33.814 23.692Q-33.814 23.288-33.623 22.899Q-33.432 22.510-33.102 22.209Q-32.773 21.908-32.366 21.738Q-31.960 21.569-31.555 21.569Q-30.633 21.569-30.233 22.202L-29.723 21.604Q-29.679 21.569-29.648 21.569L-29.595 21.569Q-29.503 21.569-29.503 21.688L-30.017 23.731Q-30.035 23.811-30.110 23.811L-30.215 23.811Q-30.307 23.811-30.307 23.692Q-30.268 23.455-30.268 23.226Q-30.268 22.795-30.415 22.488Q-30.562 22.180-30.852 22.020Q-31.142 21.859-31.573 21.859Q-31.863 21.859-32.140 21.978Q-32.417 22.097-32.643 22.301Q-32.869 22.505-33.001 22.771Q-33.133 23.037-33.133 23.314Q-33.133 23.512-33.052 23.683Q-32.970 23.854-32.821 23.973Q-32.672 24.092-32.483 24.144L-31.349 24.430Q-31.046 24.509-30.815 24.709Q-30.584 24.909-30.459 25.199Q-30.334 25.489-30.334 25.801Q-30.334 26.227-30.523 26.643Q-30.712 27.058-31.041 27.394Q-31.371 27.730-31.782 27.922Q-32.193 28.113-32.628 28.113Q-33.120 28.113-33.542 27.968Q-33.964 27.823-34.223 27.484L-34.724 28.078Q-34.759 28.113-34.799 28.113\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m36.667-29.287 9.923-2.71\"\u002F>\u003Cpath fill=\"none\" d=\"M43.684-34.44c.945 1.684 2.183 2.263 3.292 2.338-.917.628-1.69 1.756-1.647 3.687\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799968\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m7.758-49.694 3.543-7.302\"\u002F>\u003Cpath fill=\"none\" d=\"M7.549-56.416c1.89.397 3.14-.154 3.927-.94-.131 1.104.21 2.428 1.691 3.667\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799968\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m-39.877-43.765-6.72-6.005\"\u002F>\u003Cpath fill=\"none\" d=\"M-47.067-46.003c.9-1.709.713-3.063.172-4.034 1.026.428 2.393.463 3.99-.622\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.7999520000000001\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-57.155-17.61h-10.582\"\u002F>\u003Cpath fill=\"none\" d=\"M-65.577-14.487c-.467-1.874-1.51-2.759-2.56-3.123 1.05-.364 2.093-1.249 2.56-3.123\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m-32.97 11.959-5.203 6.758\"\u002F>\u003Cpath fill=\"none\" d=\"M-34.382 18.91c-1.77-.772-3.106-.485-4.035.124.352-1.054.286-2.42-.913-3.933\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.79996\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m15.399 11.959 5.203 6.758\"\u002F>\u003Cpath fill=\"none\" d=\"M21.758 15.101c-1.199 1.514-1.264 2.88-.912 3.933-.93-.61-2.266-.896-4.036-.123\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.79996\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr9\" font-size=\"9\">\u003Cg transform=\"translate(42.23 14.05)\">\u003Cpath d=\"M-76.813 26.008Q-76.813 25.441-76.540 24.953Q-76.268 24.465-75.798 24.173Q-75.327 23.881-74.760 23.881Q-74.339 23.881-73.963 24.050Q-73.587 24.219-73.310 24.511Q-73.033 24.804-72.875 25.199Q-72.717 25.595-72.717 26.008Q-72.717 26.557-72.996 27.019Q-73.275 27.480-73.743 27.748Q-74.211 28.016-74.760 28.016Q-75.314 28.016-75.784 27.748Q-76.255 27.480-76.534 27.019Q-76.813 26.557-76.813 26.008M-74.760 27.726Q-74.264 27.726-73.987 27.465Q-73.710 27.203-73.618 26.799Q-73.526 26.394-73.526 25.898Q-73.526 25.423-73.624 25.034Q-73.723 24.645-73.996 24.395Q-74.268 24.144-74.760 24.144Q-75.472 24.144-75.736 24.639Q-76 25.133-76 25.898Q-76 26.698-75.745 27.212Q-75.490 27.726-74.760 27.726M-71.465 26.843L-71.465 24.856Q-71.465 24.615-71.535 24.507Q-71.605 24.399-71.739 24.375Q-71.873 24.351-72.155 24.351L-72.155 24.035L-70.761 23.938L-70.761 26.808Q-70.761 27.186-70.715 27.372Q-70.669 27.559-70.498 27.656Q-70.326 27.752-69.970 27.752Q-69.636 27.752-69.397 27.561Q-69.157 27.370-69.032 27.067Q-68.907 26.764-68.907 26.447L-68.907 24.856Q-68.907 24.615-68.977 24.507Q-69.048 24.399-69.182 24.375Q-69.316 24.351-69.601 24.351L-69.601 24.035L-68.204 23.938L-68.204 27.098Q-68.204 27.335-68.134 27.443Q-68.063 27.550-67.929 27.574Q-67.795 27.599-67.514 27.599L-67.514 27.915L-68.881 28.016L-68.881 27.295Q-69.048 27.621-69.353 27.818Q-69.658 28.016-70.014 28.016Q-70.674 28.016-71.069 27.746Q-71.465 27.476-71.465 26.843M-66.380 26.843L-66.380 24.351L-67.145 24.351L-67.145 24.092Q-66.740 24.092-66.475 23.826Q-66.209 23.560-66.088 23.160Q-65.967 22.760-65.967 22.378L-65.677 22.378L-65.677 24.035L-64.389 24.035L-64.389 24.351L-65.677 24.351L-65.677 26.808Q-65.677 27.177-65.552 27.451Q-65.426 27.726-65.101 27.726Q-64.802 27.726-64.664 27.432Q-64.526 27.137-64.526 26.808L-64.526 26.285L-64.240 26.285L-64.240 26.843Q-64.240 27.120-64.350 27.392Q-64.460 27.665-64.673 27.840Q-64.886 28.016-65.167 28.016Q-65.528 28.016-65.800 27.878Q-66.072 27.739-66.226 27.476Q-66.380 27.212-66.380 26.843\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.23 14.05)\">\u003Cpath d=\"M-61.942 27.897L-63.133 24.650Q-63.208 24.452-63.353 24.402Q-63.498 24.351-63.788 24.351L-63.788 24.035L-61.907 24.035L-61.907 24.351Q-62.430 24.351-62.430 24.575Q-62.430 24.606-62.412 24.650L-61.547 27.032L-60.791 24.944L-60.901 24.650Q-60.975 24.452-61.123 24.402Q-61.270 24.351-61.555 24.351L-61.555 24.035L-59.767 24.035L-59.767 24.351Q-60.277 24.351-60.277 24.575Q-60.277 24.628-60.268 24.650L-59.349 27.150L-58.532 24.900Q-58.514 24.856-58.514 24.755Q-58.514 24.562-58.666 24.457Q-58.818 24.351-59.020 24.351L-59.020 24.035L-57.477 24.035L-57.477 24.351Q-57.745 24.351-57.941 24.500Q-58.136 24.650-58.224 24.900L-59.323 27.897Q-59.354 28.016-59.486 28.016L-59.547 28.016Q-59.666 28.016-59.710 27.897L-60.628 25.366L-61.555 27.897Q-61.599 28.016-61.718 28.016L-61.780 28.016Q-61.911 28.016-61.942 27.897\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.23 14.05)\">\u003Cpath d=\"M-57.175 27.005Q-57.175 26.465-56.742 26.131Q-56.309 25.797-55.703 25.658Q-55.096 25.520-54.565 25.520L-54.565 25.186Q-54.565 24.927-54.683 24.683Q-54.802 24.439-55.011 24.292Q-55.219 24.144-55.492 24.144Q-56.054 24.144-56.366 24.342Q-56.217 24.369-56.125 24.487Q-56.032 24.606-56.032 24.764Q-56.032 24.940-56.158 25.070Q-56.283 25.199-56.463 25.199Q-56.652 25.199-56.779 25.072Q-56.907 24.944-56.907 24.764Q-56.907 24.294-56.467 24.087Q-56.028 23.881-55.492 23.881Q-55.202 23.881-54.914 23.969Q-54.626 24.057-54.393 24.217Q-54.160 24.377-54.011 24.617Q-53.861 24.856-53.861 25.151L-53.861 27.186Q-53.861 27.339-53.787 27.478Q-53.712 27.616-53.567 27.616Q-53.413 27.616-53.341 27.480Q-53.268 27.344-53.268 27.186L-53.268 26.610L-52.982 26.610L-52.982 27.186Q-52.982 27.519-53.231 27.744Q-53.479 27.968-53.809 27.968Q-54.068 27.968-54.250 27.774Q-54.433 27.581-54.477 27.304Q-54.644 27.625-54.978 27.821Q-55.312 28.016-55.681 28.016Q-56.234 28.016-56.705 27.768Q-57.175 27.519-57.175 27.005M-56.419 27.005Q-56.419 27.317-56.177 27.535Q-55.936 27.752-55.619 27.752Q-55.184 27.752-54.874 27.443Q-54.565 27.133-54.565 26.702L-54.565 25.775Q-54.982 25.775-55.408 25.902Q-55.835 26.030-56.127 26.307Q-56.419 26.583-56.419 27.005M-50.442 27.915L-52.675 27.915L-52.675 27.599Q-52.363 27.599-52.172 27.546Q-51.981 27.493-51.981 27.304L-51.981 24.856Q-51.981 24.615-52.051 24.507Q-52.121 24.399-52.255 24.375Q-52.389 24.351-52.675 24.351L-52.675 24.035L-51.361 23.938L-51.361 24.799Q-51.198 24.408-50.930 24.173Q-50.662 23.938-50.271 23.938Q-49.999 23.938-49.783 24.101Q-49.568 24.263-49.568 24.522Q-49.568 24.698-49.687 24.817Q-49.805 24.936-49.981 24.936Q-50.161 24.936-50.280 24.817Q-50.398 24.698-50.398 24.522Q-50.398 24.307-50.245 24.197L-50.262 24.197Q-50.640 24.197-50.873 24.459Q-51.106 24.720-51.205 25.107Q-51.304 25.494-51.304 25.854L-51.304 27.304Q-51.304 27.493-51.047 27.546Q-50.790 27.599-50.442 27.599L-50.442 27.915M-47.059 28.016Q-47.604 28.016-48.047 27.733Q-48.491 27.449-48.746 26.977Q-49.001 26.504-49.001 25.973Q-49.001 25.419-48.724 24.953Q-48.447 24.487-47.975 24.213Q-47.502 23.938-46.958 23.938Q-46.624 23.938-46.320 24.070Q-46.017 24.202-45.797 24.439L-45.797 22.589Q-45.797 22.347-45.868 22.239Q-45.938 22.132-46.072 22.108Q-46.206 22.083-46.492 22.083L-46.492 21.767L-45.125 21.670L-45.125 27.098Q-45.125 27.335-45.055 27.443Q-44.984 27.550-44.848 27.574Q-44.712 27.599-44.431 27.599L-44.431 27.915L-45.824 28.016L-45.824 27.467Q-46.074 27.730-46.393 27.873Q-46.711 28.016-47.059 28.016M-46.997 27.752Q-46.628 27.752-46.318 27.541Q-46.008 27.331-45.824 26.988L-45.824 24.856Q-45.995 24.553-46.276 24.375Q-46.558 24.197-46.896 24.197Q-47.586 24.197-47.889 24.718Q-48.192 25.239-48.192 25.981Q-48.192 26.702-47.922 27.227Q-47.652 27.752-46.997 27.752\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.23 14.05)\">\u003Cpath d=\"M-38.539 27.915L-40.771 27.915L-40.771 27.599Q-40.464 27.599-40.273 27.546Q-40.081 27.493-40.081 27.304L-40.081 24.351L-40.771 24.351L-40.771 24.035L-40.081 24.035L-40.081 22.967Q-40.081 22.584-39.868 22.261Q-39.655 21.938-39.301 21.754Q-38.948 21.569-38.570 21.569Q-38.249 21.569-37.998 21.747Q-37.748 21.925-37.748 22.237Q-37.748 22.413-37.867 22.532Q-37.985 22.650-38.161 22.650Q-38.341 22.650-38.464 22.532Q-38.587 22.413-38.587 22.237Q-38.587 21.996-38.372 21.868Q-38.477 21.833-38.614 21.833Q-38.882 21.833-39.064 22.015Q-39.246 22.198-39.339 22.468Q-39.431 22.738-39.431 23.002L-39.431 24.035L-38.381 24.035L-38.381 24.351L-39.405 24.351L-39.405 27.304Q-39.405 27.493-39.148 27.546Q-38.891 27.599-38.539 27.599\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.23 14.05)\">\u003Cpath d=\"M-35.179 27.915L-37.240 27.915L-37.240 27.599Q-36.933 27.599-36.742 27.546Q-36.550 27.493-36.550 27.304L-36.550 22.589Q-36.550 22.347-36.621 22.239Q-36.691 22.132-36.825 22.108Q-36.959 22.083-37.240 22.083L-37.240 21.767L-35.874 21.670L-35.874 27.304Q-35.874 27.493-35.680 27.546Q-35.487 27.599-35.179 27.599L-35.179 27.915M-33.993 26.843L-33.993 24.856Q-33.993 24.615-34.063 24.507Q-34.133 24.399-34.267 24.375Q-34.402 24.351-34.683 24.351L-34.683 24.035L-33.290 23.938L-33.290 26.808Q-33.290 27.186-33.244 27.372Q-33.197 27.559-33.026 27.656Q-32.855 27.752-32.499 27.752Q-32.165 27.752-31.925 27.561Q-31.686 27.370-31.560 27.067Q-31.435 26.764-31.435 26.447L-31.435 24.856Q-31.435 24.615-31.506 24.507Q-31.576 24.399-31.710 24.375Q-31.844 24.351-32.130 24.351L-32.130 24.035L-30.732 23.938L-30.732 27.098Q-30.732 27.335-30.662 27.443Q-30.591 27.550-30.457 27.574Q-30.323 27.599-30.042 27.599L-30.042 27.915L-31.409 28.016L-31.409 27.295Q-31.576 27.621-31.881 27.818Q-32.187 28.016-32.543 28.016Q-33.202 28.016-33.597 27.746Q-33.993 27.476-33.993 26.843M-28.043 27.915L-29.717 27.915L-29.717 27.599Q-29.374 27.599-29.069 27.458Q-28.763 27.317-28.548 27.049L-27.722 26.034L-28.790 24.650Q-28.961 24.448-29.143 24.399Q-29.326 24.351-29.673 24.351L-29.673 24.035L-27.775 24.035L-27.775 24.351Q-27.884 24.351-27.979 24.406Q-28.073 24.461-28.073 24.558Q-28.073 24.597-28.043 24.650L-27.335 25.555L-26.795 24.900Q-26.685 24.760-26.685 24.610Q-26.685 24.500-26.753 24.426Q-26.821 24.351-26.926 24.351L-26.926 24.035L-25.256 24.035L-25.256 24.351Q-25.599 24.351-25.907 24.494Q-26.215 24.637-26.425 24.900L-27.155 25.792L-25.973 27.304Q-25.854 27.445-25.725 27.509Q-25.595 27.572-25.463 27.585Q-25.331 27.599-25.094 27.599L-25.094 27.915L-27.001 27.915L-27.001 27.599Q-26.896 27.599-26.795 27.544Q-26.694 27.489-26.694 27.392Q-26.694 27.344-26.720 27.304L-27.533 26.258L-28.179 27.049Q-28.289 27.199-28.289 27.339Q-28.289 27.445-28.216 27.522Q-28.144 27.599-28.043 27.599\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The Divergence Theorem: outward flux across the closed boundary surface \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6833em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0576em;\">S\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan> equals the integrated divergence over the enclosed solid \u003Cspan class=\"katex\">\u003Cspan class=\"katex-html\" aria-hidden=\"true\">\u003Cspan class=\"base\">\u003Cspan class=\"strut\" style=\"height:0.6833em;\">\u003C\u002Fspan>\u003Cspan class=\"mord mathnormal\" style=\"margin-right:0.0576em;\">E\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fspan>; interior outflows cancel, leaving only the boundary.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:330.628px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 247.971 168.939\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-68.537-46.304H96.49V-71.87H-68.537Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr9\" font-size=\"9\">\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M53.796 23.807L50.891 23.807L50.891 23.491Q51.810 23.491 51.810 23.196L51.810 18.270Q51.810 17.975 50.891 17.975L50.891 17.659L55.958 17.659L56.209 19.720L55.923 19.720Q55.826 18.951 55.653 18.597Q55.479 18.244 55.108 18.109Q54.736 17.975 53.967 17.975L53.115 17.975Q52.864 17.975 52.759 18.024Q52.653 18.072 52.653 18.270L52.653 20.577L53.321 20.577Q53.783 20.577 54.005 20.500Q54.227 20.423 54.312 20.201Q54.398 19.979 54.398 19.522L54.688 19.522L54.688 21.944L54.398 21.944Q54.398 21.487 54.312 21.265Q54.227 21.043 54.005 20.966Q53.783 20.889 53.321 20.889L52.653 20.889L52.653 23.196Q52.653 23.491 53.796 23.491L53.796 23.807M61.653 23.807L58.217 23.807L58.217 23.491Q59.078 23.491 59.294 23.438Q59.381 23.425 59.447 23.354Q59.513 23.284 59.513 23.196L59.513 18.270Q59.513 18.077 59.408 18.026Q59.302 17.975 59.052 17.975L58.648 17.975Q58.292 17.975 58.032 18.039Q57.773 18.103 57.575 18.301Q57.408 18.463 57.345 18.773Q57.281 19.083 57.215 19.720L56.929 19.720L57.109 17.659L62.752 17.659L62.932 19.720L62.642 19.720Q62.620 19.439 62.583 19.153Q62.545 18.868 62.475 18.643Q62.405 18.419 62.282 18.301Q61.970 17.975 61.214 17.975L60.818 17.975Q60.568 17.975 60.462 18.024Q60.357 18.072 60.357 18.270L60.357 23.196Q60.357 23.284 60.423 23.354Q60.489 23.425 60.572 23.438Q60.788 23.491 61.653 23.491L61.653 23.807M65.354 22.845Q65.674 23.236 66.149 23.462Q66.624 23.688 67.138 23.688Q67.700 23.688 68.157 23.405Q68.614 23.121 68.878 22.638Q69.142 22.155 69.142 21.610Q69.142 21.579 69.172 21.555Q69.203 21.531 69.234 21.531L69.339 21.531Q69.432 21.531 69.432 21.645Q69.432 22.286 69.102 22.829Q68.773 23.372 68.214 23.688Q67.656 24.005 67.019 24.005Q66.140 24.005 65.398 23.561Q64.655 23.117 64.222 22.361Q63.789 21.605 63.789 20.731Q63.789 20.085 64.037 19.485Q64.286 18.885 64.734 18.428Q65.182 17.971 65.771 17.716Q66.360 17.461 67.019 17.461Q67.494 17.461 67.935 17.668Q68.377 17.874 68.702 18.235L69.225 17.496Q69.243 17.461 69.287 17.461L69.339 17.461Q69.375 17.461 69.403 17.490Q69.432 17.518 69.432 17.545L69.432 19.975Q69.432 19.997 69.399 20.026Q69.366 20.054 69.339 20.054L69.208 20.054Q69.181 20.054 69.148 20.026Q69.115 19.997 69.115 19.975Q69.115 19.689 68.975 19.296Q68.834 18.903 68.667 18.661Q68.390 18.257 67.993 18.017Q67.595 17.778 67.129 17.778Q66.791 17.778 66.461 17.879Q66.131 17.980 65.848 18.173Q65.565 18.367 65.354 18.621Q64.743 19.373 64.743 20.731Q64.743 21.350 64.879 21.889Q65.015 22.427 65.354 22.845\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M16.270 34.807L14.284 34.807L14.284 34.491Q14.591 34.491 14.782 34.438Q14.974 34.385 14.974 34.196L14.974 31.748Q14.974 31.502 14.908 31.397Q14.842 31.291 14.716 31.267Q14.591 31.243 14.319 31.243L14.319 30.927L15.650 30.830L15.650 34.196Q15.650 34.390 15.815 34.440Q15.980 34.491 16.270 34.491L16.270 34.807M14.670 29.283Q14.670 29.077 14.820 28.927Q14.969 28.778 15.171 28.778Q15.303 28.778 15.420 28.848Q15.536 28.918 15.606 29.035Q15.677 29.151 15.677 29.283Q15.677 29.485 15.527 29.635Q15.378 29.784 15.171 29.784Q14.969 29.784 14.820 29.635Q14.670 29.485 14.670 29.283M18.929 34.807L16.841 34.807L16.841 34.491Q17.149 34.491 17.340 34.438Q17.531 34.385 17.531 34.196L17.531 31.748Q17.531 31.507 17.461 31.399Q17.391 31.291 17.257 31.267Q17.122 31.243 16.841 31.243L16.841 30.927L18.182 30.830L18.182 31.665Q18.379 31.283 18.733 31.056Q19.087 30.830 19.513 30.830Q20.792 30.830 20.792 32.043L20.792 34.196Q20.792 34.385 20.983 34.438Q21.174 34.491 21.482 34.491L21.482 34.807L19.394 34.807L19.394 34.491Q19.706 34.491 19.898 34.438Q20.089 34.385 20.089 34.196L20.089 32.078Q20.089 31.819 20.045 31.597Q20.001 31.375 19.856 31.232Q19.711 31.089 19.452 31.089Q19.109 31.089 18.828 31.278Q18.546 31.467 18.390 31.779Q18.234 32.091 18.234 32.438L18.234 34.196Q18.234 34.385 18.428 34.438Q18.621 34.491 18.929 34.491\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M22.364 33.735L22.364 31.243L21.599 31.243L21.599 30.984Q22.004 30.984 22.270 30.718Q22.535 30.452 22.656 30.052Q22.777 29.652 22.777 29.270L23.067 29.270L23.067 30.927L24.355 30.927L24.355 31.243L23.067 31.243L23.067 33.700Q23.067 34.069 23.192 34.343Q23.318 34.618 23.643 34.618Q23.942 34.618 24.080 34.324Q24.219 34.029 24.219 33.700L24.219 33.177L24.504 33.177L24.504 33.735Q24.504 34.012 24.394 34.284Q24.284 34.557 24.071 34.732Q23.858 34.908 23.577 34.908Q23.217 34.908 22.944 34.770Q22.672 34.631 22.518 34.368Q22.364 34.104 22.364 33.735M27.330 34.908Q26.772 34.908 26.299 34.625Q25.827 34.341 25.552 33.864Q25.278 33.388 25.278 32.834Q25.278 32.438 25.420 32.063Q25.563 31.687 25.820 31.399Q26.077 31.111 26.436 30.942Q26.794 30.773 27.198 30.773Q27.743 30.773 28.114 31.010Q28.486 31.247 28.672 31.665Q28.859 32.082 28.859 32.619Q28.859 32.671 28.835 32.709Q28.811 32.746 28.762 32.746L26.091 32.746L26.091 32.825Q26.091 33.572 26.403 34.095Q26.715 34.618 27.413 34.618Q27.818 34.618 28.138 34.361Q28.459 34.104 28.582 33.700Q28.600 33.620 28.683 33.620L28.762 33.620Q28.802 33.620 28.831 33.651Q28.859 33.682 28.859 33.726L28.859 33.761Q28.754 34.104 28.532 34.363Q28.310 34.622 27.996 34.765Q27.681 34.908 27.330 34.908M26.099 32.495L28.213 32.495Q28.213 32.227 28.160 31.981Q28.108 31.735 27.987 31.513Q27.866 31.291 27.668 31.164Q27.470 31.036 27.198 31.036Q26.855 31.036 26.603 31.261Q26.350 31.485 26.225 31.823Q26.099 32.161 26.099 32.495M31.615 34.807L29.382 34.807L29.382 34.491Q29.694 34.491 29.885 34.438Q30.076 34.385 30.076 34.196L30.076 31.748Q30.076 31.507 30.006 31.399Q29.936 31.291 29.802 31.267Q29.668 31.243 29.382 31.243L29.382 30.927L30.696 30.830L30.696 31.691Q30.859 31.300 31.127 31.065Q31.395 30.830 31.786 30.830Q32.058 30.830 32.274 30.993Q32.489 31.155 32.489 31.414Q32.489 31.590 32.370 31.709Q32.252 31.828 32.076 31.828Q31.896 31.828 31.777 31.709Q31.658 31.590 31.658 31.414Q31.658 31.199 31.812 31.089L31.795 31.089Q31.417 31.089 31.184 31.351Q30.951 31.612 30.852 31.999Q30.753 32.386 30.753 32.746L30.753 34.196Q30.753 34.385 31.010 34.438Q31.267 34.491 31.615 34.491L31.615 34.807M34.981 34.789L33.649 31.542Q33.561 31.344 33.397 31.294Q33.232 31.243 32.928 31.243L32.928 30.927L34.853 30.927L34.853 31.243Q34.361 31.243 34.361 31.458Q34.361 31.480 34.379 31.542L35.394 34.016L36.303 31.792Q36.339 31.709 36.339 31.612Q36.339 31.441 36.216 31.342Q36.093 31.243 35.926 31.243L35.926 30.927L37.437 30.927L37.437 31.243Q37.152 31.243 36.938 31.386Q36.725 31.529 36.620 31.792L35.385 34.789Q35.341 34.908 35.214 34.908L35.152 34.908Q35.025 34.908 34.981 34.789\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M37.494 33.897Q37.494 33.357 37.927 33.023Q38.360 32.689 38.966 32.550Q39.573 32.412 40.104 32.412L40.104 32.078Q40.104 31.819 39.986 31.575Q39.867 31.331 39.658 31.184Q39.450 31.036 39.177 31.036Q38.615 31.036 38.303 31.234Q38.452 31.261 38.544 31.379Q38.637 31.498 38.637 31.656Q38.637 31.832 38.511 31.962Q38.386 32.091 38.206 32.091Q38.017 32.091 37.890 31.964Q37.762 31.836 37.762 31.656Q37.762 31.186 38.202 30.979Q38.641 30.773 39.177 30.773Q39.467 30.773 39.755 30.861Q40.043 30.949 40.276 31.109Q40.509 31.269 40.658 31.509Q40.808 31.748 40.808 32.043L40.808 34.078Q40.808 34.231 40.882 34.370Q40.957 34.508 41.102 34.508Q41.256 34.508 41.328 34.372Q41.401 34.236 41.401 34.078L41.401 33.502L41.687 33.502L41.687 34.078Q41.687 34.411 41.438 34.636Q41.190 34.860 40.860 34.860Q40.601 34.860 40.419 34.666Q40.236 34.473 40.192 34.196Q40.025 34.517 39.691 34.713Q39.357 34.908 38.988 34.908Q38.435 34.908 37.964 34.660Q37.494 34.411 37.494 33.897M38.250 33.897Q38.250 34.209 38.492 34.427Q38.733 34.644 39.050 34.644Q39.485 34.644 39.795 34.335Q40.104 34.025 40.104 33.594L40.104 32.667Q39.687 32.667 39.261 32.794Q38.834 32.922 38.542 33.199Q38.250 33.475 38.250 33.897M44.112 34.807L42.051 34.807L42.051 34.491Q42.359 34.491 42.550 34.438Q42.741 34.385 42.741 34.196L42.741 29.481Q42.741 29.239 42.671 29.131Q42.601 29.024 42.467 29Q42.333 28.975 42.051 28.975L42.051 28.659L43.418 28.562L43.418 34.196Q43.418 34.385 43.611 34.438Q43.805 34.491 44.112 34.491L44.112 34.807M45.211 36.411Q45.211 36.371 45.246 36.336Q45.571 36.024 45.751 35.618Q45.932 35.211 45.932 34.763L45.932 34.680Q45.791 34.807 45.589 34.807Q45.444 34.807 45.330 34.741Q45.215 34.675 45.149 34.563Q45.083 34.451 45.083 34.302Q45.083 34.082 45.224 33.941Q45.365 33.801 45.589 33.801Q45.910 33.801 46.050 34.099Q46.191 34.398 46.191 34.763Q46.191 35.273 45.987 35.728Q45.782 36.182 45.417 36.534Q45.382 36.552 45.356 36.552Q45.299 36.552 45.255 36.508Q45.211 36.464 45.211 36.411\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M50.909 33.735L50.909 31.243L50.144 31.243L50.144 30.984Q50.549 30.984 50.815 30.718Q51.080 30.452 51.201 30.052Q51.322 29.652 51.322 29.270L51.612 29.270L51.612 30.927L52.900 30.927L52.900 31.243L51.612 31.243L51.612 33.700Q51.612 34.069 51.737 34.343Q51.863 34.618 52.188 34.618Q52.487 34.618 52.625 34.324Q52.764 34.029 52.764 33.700L52.764 33.177L53.049 33.177L53.049 33.735Q53.049 34.012 52.939 34.284Q52.829 34.557 52.616 34.732Q52.403 34.908 52.122 34.908Q51.762 34.908 51.489 34.770Q51.217 34.631 51.063 34.368Q50.909 34.104 50.909 33.735\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M55.339 34.789L54.148 31.542Q54.073 31.344 53.928 31.294Q53.783 31.243 53.493 31.243L53.493 30.927L55.374 30.927L55.374 31.243Q54.851 31.243 54.851 31.467Q54.851 31.498 54.869 31.542L55.734 33.924L56.490 31.836L56.380 31.542Q56.306 31.344 56.158 31.294Q56.011 31.243 55.726 31.243L55.726 30.927L57.514 30.927L57.514 31.243Q57.004 31.243 57.004 31.467Q57.004 31.520 57.013 31.542L57.932 34.042L58.749 31.792Q58.767 31.748 58.767 31.647Q58.767 31.454 58.615 31.349Q58.463 31.243 58.261 31.243L58.261 30.927L59.804 30.927L59.804 31.243Q59.536 31.243 59.340 31.392Q59.145 31.542 59.057 31.792L57.958 34.789Q57.927 34.908 57.795 34.908L57.734 34.908Q57.615 34.908 57.571 34.789L56.653 32.258L55.726 34.789Q55.682 34.908 55.563 34.908L55.501 34.908Q55.370 34.908 55.339 34.789\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M59.995 32.900Q59.995 32.333 60.268 31.845Q60.540 31.357 61.010 31.065Q61.481 30.773 62.048 30.773Q62.469 30.773 62.845 30.942Q63.221 31.111 63.498 31.403Q63.775 31.696 63.933 32.091Q64.091 32.487 64.091 32.900Q64.091 33.449 63.812 33.911Q63.533 34.372 63.065 34.640Q62.597 34.908 62.048 34.908Q61.494 34.908 61.024 34.640Q60.553 34.372 60.274 33.911Q59.995 33.449 59.995 32.900M62.048 34.618Q62.544 34.618 62.821 34.357Q63.098 34.095 63.190 33.691Q63.282 33.286 63.282 32.790Q63.282 32.315 63.184 31.926Q63.085 31.537 62.812 31.287Q62.540 31.036 62.048 31.036Q61.336 31.036 61.072 31.531Q60.808 32.025 60.808 32.790Q60.808 33.590 61.063 34.104Q61.318 34.618 62.048 34.618\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M69.757 34.908Q69.198 34.908 68.726 34.625Q68.254 34.341 67.979 33.864Q67.704 33.388 67.704 32.834Q67.704 32.438 67.847 32.063Q67.990 31.687 68.247 31.399Q68.504 31.111 68.862 30.942Q69.220 30.773 69.625 30.773Q70.170 30.773 70.541 31.010Q70.912 31.247 71.099 31.665Q71.286 32.082 71.286 32.619Q71.286 32.671 71.262 32.709Q71.237 32.746 71.189 32.746L68.517 32.746L68.517 32.825Q68.517 33.572 68.829 34.095Q69.141 34.618 69.840 34.618Q70.244 34.618 70.565 34.361Q70.886 34.104 71.009 33.700Q71.027 33.620 71.110 33.620L71.189 33.620Q71.229 33.620 71.257 33.651Q71.286 33.682 71.286 33.726L71.286 33.761Q71.180 34.104 70.958 34.363Q70.737 34.622 70.422 34.765Q70.108 34.908 69.757 34.908M68.526 32.495L70.640 32.495Q70.640 32.227 70.587 31.981Q70.534 31.735 70.414 31.513Q70.293 31.291 70.095 31.164Q69.897 31.036 69.625 31.036Q69.282 31.036 69.029 31.261Q68.777 31.485 68.651 31.823Q68.526 32.161 68.526 32.495M73.945 34.807L71.857 34.807L71.857 34.491Q72.165 34.491 72.356 34.438Q72.547 34.385 72.547 34.196L72.547 31.748Q72.547 31.507 72.477 31.399Q72.406 31.291 72.272 31.267Q72.138 31.243 71.857 31.243L71.857 30.927L73.197 30.830L73.197 31.665Q73.395 31.283 73.749 31.056Q74.103 30.830 74.529 30.830Q75.808 30.830 75.808 32.043L75.808 34.196Q75.808 34.385 75.999 34.438Q76.190 34.491 76.498 34.491L76.498 34.807L74.410 34.807L74.410 34.491Q74.722 34.491 74.914 34.438Q75.105 34.385 75.105 34.196L75.105 32.078Q75.105 31.819 75.061 31.597Q75.017 31.375 74.872 31.232Q74.727 31.089 74.467 31.089Q74.125 31.089 73.843 31.278Q73.562 31.467 73.406 31.779Q73.250 32.091 73.250 32.438L73.250 34.196Q73.250 34.385 73.444 34.438Q73.637 34.491 73.945 34.491L73.945 34.807M78.945 34.908Q78.401 34.908 77.957 34.625Q77.513 34.341 77.258 33.869Q77.003 33.396 77.003 32.865Q77.003 32.311 77.280 31.845Q77.557 31.379 78.029 31.105Q78.502 30.830 79.047 30.830Q79.381 30.830 79.684 30.962Q79.987 31.094 80.207 31.331L80.207 29.481Q80.207 29.239 80.136 29.131Q80.066 29.024 79.932 29Q79.798 28.975 79.512 28.975L79.512 28.659L80.879 28.562L80.879 33.990Q80.879 34.227 80.949 34.335Q81.020 34.442 81.156 34.466Q81.292 34.491 81.573 34.491L81.573 34.807L80.180 34.908L80.180 34.359Q79.930 34.622 79.611 34.765Q79.293 34.908 78.945 34.908M79.007 34.644Q79.376 34.644 79.686 34.433Q79.996 34.223 80.180 33.880L80.180 31.748Q80.009 31.445 79.728 31.267Q79.446 31.089 79.108 31.089Q78.418 31.089 78.115 31.610Q77.812 32.131 77.812 32.873Q77.812 33.594 78.082 34.119Q78.352 34.644 79.007 34.644M84.171 36.552L82.083 36.552L82.083 36.240Q82.395 36.240 82.586 36.189Q82.778 36.139 82.778 35.941L82.778 31.603Q82.778 31.362 82.604 31.302Q82.430 31.243 82.083 31.243L82.083 30.927L83.454 30.830L83.454 31.370Q83.714 31.102 84.048 30.966Q84.382 30.830 84.751 30.830Q85.151 30.830 85.507 30.997Q85.862 31.164 86.117 31.445Q86.372 31.726 86.515 32.091Q86.658 32.456 86.658 32.865Q86.658 33.427 86.381 33.893Q86.104 34.359 85.630 34.633Q85.155 34.908 84.606 34.908Q84.294 34.908 84.004 34.774Q83.714 34.640 83.481 34.394L83.481 35.941Q83.481 36.139 83.672 36.189Q83.863 36.240 84.171 36.240L84.171 36.552M83.481 31.784L83.481 33.915Q83.639 34.240 83.922 34.442Q84.206 34.644 84.549 34.644Q84.962 34.644 85.256 34.368Q85.550 34.091 85.698 33.673Q85.845 33.256 85.845 32.865Q85.845 32.487 85.711 32.078Q85.577 31.669 85.302 31.392Q85.028 31.116 84.650 31.116Q84.408 31.116 84.193 31.192Q83.977 31.269 83.786 31.430Q83.595 31.590 83.481 31.784\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M87.492 32.900Q87.492 32.333 87.765 31.845Q88.037 31.357 88.507 31.065Q88.978 30.773 89.545 30.773Q89.966 30.773 90.342 30.942Q90.718 31.111 90.995 31.403Q91.272 31.696 91.430 32.091Q91.588 32.487 91.588 32.900Q91.588 33.449 91.309 33.911Q91.030 34.372 90.562 34.640Q90.094 34.908 89.545 34.908Q88.991 34.908 88.521 34.640Q88.050 34.372 87.771 33.911Q87.492 33.449 87.492 32.900M89.545 34.618Q90.041 34.618 90.318 34.357Q90.595 34.095 90.687 33.691Q90.779 33.286 90.779 32.790Q90.779 32.315 90.681 31.926Q90.582 31.537 90.309 31.287Q90.037 31.036 89.545 31.036Q88.833 31.036 88.569 31.531Q88.305 32.025 88.305 32.790Q88.305 33.590 88.560 34.104Q88.815 34.618 89.545 34.618M94.146 34.807L92.159 34.807L92.159 34.491Q92.467 34.491 92.658 34.438Q92.849 34.385 92.849 34.196L92.849 31.748Q92.849 31.502 92.783 31.397Q92.717 31.291 92.592 31.267Q92.467 31.243 92.194 31.243L92.194 30.927L93.526 30.830L93.526 34.196Q93.526 34.390 93.691 34.440Q93.856 34.491 94.146 34.491L94.146 34.807M92.546 29.283Q92.546 29.077 92.695 28.927Q92.845 28.778 93.047 28.778Q93.179 28.778 93.295 28.848Q93.412 28.918 93.482 29.035Q93.552 29.151 93.552 29.283Q93.552 29.485 93.403 29.635Q93.254 29.784 93.047 29.784Q92.845 29.784 92.695 29.635Q92.546 29.485 92.546 29.283M96.804 34.807L94.717 34.807L94.717 34.491Q95.025 34.491 95.216 34.438Q95.407 34.385 95.407 34.196L95.407 31.748Q95.407 31.507 95.337 31.399Q95.266 31.291 95.132 31.267Q94.998 31.243 94.717 31.243L94.717 30.927L96.057 30.830L96.057 31.665Q96.255 31.283 96.609 31.056Q96.962 30.830 97.389 30.830Q98.668 30.830 98.668 32.043L98.668 34.196Q98.668 34.385 98.859 34.438Q99.050 34.491 99.358 34.491L99.358 34.807L97.270 34.807L97.270 34.491Q97.582 34.491 97.773 34.438Q97.964 34.385 97.964 34.196L97.964 32.078Q97.964 31.819 97.921 31.597Q97.877 31.375 97.732 31.232Q97.587 31.089 97.327 31.089Q96.984 31.089 96.703 31.278Q96.422 31.467 96.266 31.779Q96.110 32.091 96.110 32.438L96.110 34.196Q96.110 34.385 96.303 34.438Q96.497 34.491 96.804 34.491\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.29 -86.194)\">\u003Cpath d=\"M100.245 33.735L100.245 31.243L99.480 31.243L99.480 30.984Q99.885 30.984 100.151 30.718Q100.416 30.452 100.537 30.052Q100.658 29.652 100.658 29.270L100.948 29.270L100.948 30.927L102.236 30.927L102.236 31.243L100.948 31.243L100.948 33.700Q100.948 34.069 101.073 34.343Q101.199 34.618 101.524 34.618Q101.823 34.618 101.961 34.324Q102.100 34.029 102.100 33.700L102.100 33.177L102.385 33.177L102.385 33.735Q102.385 34.012 102.275 34.284Q102.165 34.557 101.952 34.732Q101.739 34.908 101.458 34.908Q101.098 34.908 100.825 34.770Q100.553 34.631 100.399 34.368Q100.245 34.104 100.245 33.735M103.207 34.825L103.207 33.383Q103.207 33.352 103.236 33.328Q103.264 33.304 103.295 33.304L103.405 33.304Q103.440 33.304 103.462 33.326Q103.484 33.348 103.493 33.383Q103.752 34.644 104.719 34.644Q105.145 34.644 105.439 34.460Q105.734 34.275 105.734 33.871Q105.734 33.577 105.503 33.381Q105.272 33.185 104.960 33.124L104.358 33.005Q103.892 32.917 103.550 32.634Q103.207 32.350 103.207 31.911Q103.207 31.318 103.644 31.045Q104.081 30.773 104.719 30.773Q105.198 30.773 105.545 31.019L105.795 30.795Q105.852 30.773 105.852 30.773L105.905 30.773Q105.932 30.773 105.965 30.799Q105.997 30.826 105.997 30.856L105.997 32.016Q105.997 32.047 105.962 32.074Q105.927 32.100 105.905 32.100L105.795 32.100Q105.773 32.100 105.740 32.071Q105.707 32.043 105.707 32.016Q105.707 31.551 105.442 31.280Q105.176 31.010 104.710 31.010Q104.306 31.010 104.002 31.155Q103.699 31.300 103.699 31.656Q103.699 31.902 103.917 32.056Q104.134 32.210 104.411 32.267L105.039 32.394Q105.356 32.456 105.626 32.623Q105.896 32.790 106.063 33.056Q106.230 33.322 106.230 33.638Q106.230 34.280 105.804 34.594Q105.378 34.908 104.719 34.908Q104.446 34.908 104.180 34.814Q103.914 34.719 103.734 34.530L103.413 34.869Q103.396 34.908 103.348 34.908L103.295 34.908Q103.273 34.908 103.240 34.880Q103.207 34.851 103.207 34.825\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-68.537-.73H96.49v-25.665H-68.537Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr9\" font-size=\"9\">\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M33.558 23.807L28.755 23.807L28.755 23.491Q29.674 23.491 29.674 23.196L29.674 18.270Q29.674 17.975 28.755 17.975L28.755 17.659L31.660 17.659L31.660 17.975Q30.517 17.975 30.517 18.270L30.517 23.196Q30.517 23.390 30.623 23.440Q30.728 23.491 30.979 23.491L31.695 23.491Q32.372 23.491 32.752 23.247Q33.132 23.003 33.290 22.574Q33.449 22.146 33.523 21.447L33.813 21.447L33.558 23.807M36.503 23.807L34.516 23.807L34.516 23.491Q34.824 23.491 35.015 23.438Q35.206 23.385 35.206 23.196L35.206 20.748Q35.206 20.502 35.140 20.397Q35.075 20.291 34.949 20.267Q34.824 20.243 34.552 20.243L34.552 19.927L35.883 19.830L35.883 23.196Q35.883 23.390 36.048 23.440Q36.213 23.491 36.503 23.491L36.503 23.807M34.903 18.283Q34.903 18.077 35.053 17.927Q35.202 17.778 35.404 17.778Q35.536 17.778 35.652 17.848Q35.769 17.918 35.839 18.035Q35.909 18.151 35.909 18.283Q35.909 18.485 35.760 18.635Q35.611 18.784 35.404 18.784Q35.202 18.784 35.053 18.635Q34.903 18.485 34.903 18.283M39.161 23.807L37.074 23.807L37.074 23.491Q37.382 23.491 37.573 23.438Q37.764 23.385 37.764 23.196L37.764 20.748Q37.764 20.507 37.694 20.399Q37.623 20.291 37.489 20.267Q37.355 20.243 37.074 20.243L37.074 19.927L38.414 19.830L38.414 20.665Q38.612 20.283 38.966 20.056Q39.320 19.830 39.746 19.830Q41.025 19.830 41.025 21.043L41.025 23.196Q41.025 23.385 41.216 23.438Q41.407 23.491 41.715 23.491L41.715 23.807L39.627 23.807L39.627 23.491Q39.939 23.491 40.130 23.438Q40.322 23.385 40.322 23.196L40.322 21.078Q40.322 20.819 40.278 20.597Q40.234 20.375 40.089 20.232Q39.944 20.089 39.684 20.089Q39.342 20.089 39.060 20.278Q38.779 20.467 38.623 20.779Q38.467 21.091 38.467 21.438L38.467 23.196Q38.467 23.385 38.660 23.438Q38.854 23.491 39.161 23.491L39.161 23.807M44.224 23.908Q43.666 23.908 43.193 23.625Q42.721 23.341 42.446 22.864Q42.172 22.388 42.172 21.834Q42.172 21.438 42.315 21.063Q42.457 20.687 42.714 20.399Q42.972 20.111 43.330 19.942Q43.688 19.773 44.092 19.773Q44.637 19.773 45.008 20.010Q45.380 20.247 45.566 20.665Q45.753 21.082 45.753 21.619Q45.753 21.671 45.729 21.709Q45.705 21.746 45.657 21.746L42.985 21.746L42.985 21.825Q42.985 22.572 43.297 23.095Q43.609 23.618 44.307 23.618Q44.712 23.618 45.033 23.361Q45.353 23.104 45.476 22.700Q45.494 22.620 45.577 22.620L45.657 22.620Q45.696 22.620 45.725 22.651Q45.753 22.682 45.753 22.726L45.753 22.761Q45.648 23.104 45.426 23.363Q45.204 23.622 44.890 23.765Q44.576 23.908 44.224 23.908M42.993 21.495L45.107 21.495Q45.107 21.227 45.055 20.981Q45.002 20.735 44.881 20.513Q44.760 20.291 44.562 20.164Q44.365 20.036 44.092 20.036Q43.749 20.036 43.497 20.261Q43.244 20.485 43.119 20.823Q42.993 21.161 42.993 21.495\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M51.410 23.807L49.424 23.807L49.424 23.491Q49.731 23.491 49.922 23.438Q50.114 23.385 50.114 23.196L50.114 20.748Q50.114 20.502 50.048 20.397Q49.982 20.291 49.856 20.267Q49.731 20.243 49.459 20.243L49.459 19.927L50.790 19.830L50.790 23.196Q50.790 23.390 50.955 23.440Q51.120 23.491 51.410 23.491L51.410 23.807M49.810 18.283Q49.810 18.077 49.960 17.927Q50.109 17.778 50.311 17.778Q50.443 17.778 50.560 17.848Q50.676 17.918 50.746 18.035Q50.817 18.151 50.817 18.283Q50.817 18.485 50.667 18.635Q50.518 18.784 50.311 18.784Q50.109 18.784 49.960 18.635Q49.810 18.485 49.810 18.283M54.069 23.807L51.981 23.807L51.981 23.491Q52.289 23.491 52.480 23.438Q52.671 23.385 52.671 23.196L52.671 20.748Q52.671 20.507 52.601 20.399Q52.531 20.291 52.397 20.267Q52.262 20.243 51.981 20.243L51.981 19.927L53.322 19.830L53.322 20.665Q53.519 20.283 53.873 20.056Q54.227 19.830 54.653 19.830Q55.932 19.830 55.932 21.043L55.932 23.196Q55.932 23.385 56.123 23.438Q56.314 23.491 56.622 23.491L56.622 23.807L54.534 23.807L54.534 23.491Q54.846 23.491 55.038 23.438Q55.229 23.385 55.229 23.196L55.229 21.078Q55.229 20.819 55.185 20.597Q55.141 20.375 54.996 20.232Q54.851 20.089 54.592 20.089Q54.249 20.089 53.968 20.278Q53.686 20.467 53.530 20.779Q53.374 21.091 53.374 21.438L53.374 23.196Q53.374 23.385 53.568 23.438Q53.761 23.491 54.069 23.491\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M57.504 22.735L57.504 20.243L56.739 20.243L56.739 19.984Q57.144 19.984 57.410 19.718Q57.675 19.452 57.796 19.052Q57.917 18.652 57.917 18.270L58.207 18.270L58.207 19.927L59.495 19.927L59.495 20.243L58.207 20.243L58.207 22.700Q58.207 23.069 58.332 23.343Q58.458 23.618 58.783 23.618Q59.082 23.618 59.220 23.324Q59.359 23.029 59.359 22.700L59.359 22.177L59.644 22.177L59.644 22.735Q59.644 23.012 59.534 23.284Q59.424 23.557 59.211 23.732Q58.998 23.908 58.717 23.908Q58.357 23.908 58.084 23.770Q57.812 23.631 57.658 23.368Q57.504 23.104 57.504 22.735M62.470 23.908Q61.912 23.908 61.439 23.625Q60.967 23.341 60.692 22.864Q60.418 22.388 60.418 21.834Q60.418 21.438 60.560 21.063Q60.703 20.687 60.960 20.399Q61.217 20.111 61.576 19.942Q61.934 19.773 62.338 19.773Q62.883 19.773 63.254 20.010Q63.626 20.247 63.812 20.665Q63.999 21.082 63.999 21.619Q63.999 21.671 63.975 21.709Q63.951 21.746 63.902 21.746L61.231 21.746L61.231 21.825Q61.231 22.572 61.543 23.095Q61.855 23.618 62.553 23.618Q62.958 23.618 63.278 23.361Q63.599 23.104 63.722 22.700Q63.740 22.620 63.823 22.620L63.902 22.620Q63.942 22.620 63.971 22.651Q63.999 22.682 63.999 22.726L63.999 22.761Q63.894 23.104 63.672 23.363Q63.450 23.622 63.136 23.765Q62.821 23.908 62.470 23.908M61.239 21.495L63.353 21.495Q63.353 21.227 63.300 20.981Q63.248 20.735 63.127 20.513Q63.006 20.291 62.808 20.164Q62.610 20.036 62.338 20.036Q61.995 20.036 61.743 20.261Q61.490 20.485 61.365 20.823Q61.239 21.161 61.239 21.495M64.531 24.501Q64.531 24.189 64.759 23.950Q64.988 23.710 65.309 23.609Q65.129 23.469 65.034 23.260Q64.940 23.051 64.940 22.818Q64.940 22.405 65.216 22.071Q64.803 21.667 64.803 21.153Q64.803 20.762 65.023 20.463Q65.243 20.164 65.594 19.997Q65.946 19.830 66.324 19.830Q66.878 19.830 67.295 20.142Q67.484 19.949 67.745 19.839Q68.007 19.729 68.293 19.729Q68.495 19.729 68.629 19.872Q68.763 20.015 68.763 20.208Q68.763 20.335 68.679 20.414Q68.596 20.494 68.473 20.494Q68.354 20.494 68.271 20.414Q68.187 20.335 68.187 20.208Q68.187 20.133 68.196 20.107Q68.214 20.072 68.235 20.039Q68.257 20.006 68.266 19.993Q67.822 19.993 67.475 20.296Q67.836 20.678 67.836 21.153Q67.836 21.447 67.708 21.693Q67.581 21.939 67.368 22.115Q67.154 22.291 66.875 22.388Q66.596 22.484 66.324 22.484Q65.814 22.484 65.405 22.216Q65.278 22.388 65.278 22.594Q65.278 22.836 65.436 23.007Q65.594 23.179 65.827 23.179L66.592 23.179Q67.137 23.179 67.583 23.275Q68.029 23.372 68.328 23.662Q68.627 23.952 68.627 24.501Q68.627 25.081 67.941 25.371Q67.255 25.661 66.583 25.661Q65.911 25.661 65.221 25.371Q64.531 25.081 64.531 24.501M65.071 24.501Q65.071 24.796 65.324 24.994Q65.577 25.191 65.937 25.286Q66.297 25.380 66.583 25.380Q67.084 25.380 67.585 25.154Q68.086 24.928 68.086 24.501Q68.086 24.044 67.644 23.912Q67.203 23.781 66.592 23.781L65.827 23.781Q65.634 23.781 65.456 23.875Q65.278 23.970 65.175 24.134Q65.071 24.299 65.071 24.501M66.315 22.203L66.324 22.203Q67.106 22.203 67.106 21.153Q67.106 20.107 66.324 20.107Q65.533 20.107 65.533 21.153Q65.533 22.203 66.315 22.203M71.373 23.807L69.141 23.807L69.141 23.491Q69.453 23.491 69.644 23.438Q69.835 23.385 69.835 23.196L69.835 20.748Q69.835 20.507 69.765 20.399Q69.694 20.291 69.560 20.267Q69.426 20.243 69.141 20.243L69.141 19.927L70.455 19.830L70.455 20.691Q70.617 20.300 70.885 20.065Q71.153 19.830 71.545 19.830Q71.817 19.830 72.032 19.993Q72.248 20.155 72.248 20.414Q72.248 20.590 72.129 20.709Q72.010 20.828 71.835 20.828Q71.654 20.828 71.536 20.709Q71.417 20.590 71.417 20.414Q71.417 20.199 71.571 20.089L71.553 20.089Q71.175 20.089 70.943 20.351Q70.710 20.612 70.611 20.999Q70.512 21.386 70.512 21.746L70.512 23.196Q70.512 23.385 70.769 23.438Q71.026 23.491 71.373 23.491L71.373 23.807M72.876 22.897Q72.876 22.357 73.309 22.023Q73.742 21.689 74.348 21.550Q74.955 21.412 75.486 21.412L75.486 21.078Q75.486 20.819 75.368 20.575Q75.249 20.331 75.040 20.184Q74.832 20.036 74.559 20.036Q73.997 20.036 73.685 20.234Q73.834 20.261 73.926 20.379Q74.019 20.498 74.019 20.656Q74.019 20.832 73.893 20.962Q73.768 21.091 73.588 21.091Q73.399 21.091 73.272 20.964Q73.144 20.836 73.144 20.656Q73.144 20.186 73.584 19.979Q74.023 19.773 74.559 19.773Q74.849 19.773 75.137 19.861Q75.425 19.949 75.658 20.109Q75.891 20.269 76.040 20.509Q76.190 20.748 76.190 21.043L76.190 23.078Q76.190 23.231 76.264 23.370Q76.339 23.508 76.484 23.508Q76.638 23.508 76.710 23.372Q76.783 23.236 76.783 23.078L76.783 22.502L77.068 22.502L77.068 23.078Q77.068 23.411 76.820 23.636Q76.572 23.860 76.242 23.860Q75.983 23.860 75.801 23.666Q75.618 23.473 75.574 23.196Q75.407 23.517 75.073 23.713Q74.739 23.908 74.370 23.908Q73.817 23.908 73.346 23.660Q72.876 23.411 72.876 22.897M73.632 22.897Q73.632 23.209 73.874 23.427Q74.115 23.644 74.432 23.644Q74.867 23.644 75.177 23.335Q75.486 23.025 75.486 22.594L75.486 21.667Q75.069 21.667 74.643 21.794Q74.216 21.922 73.924 22.199Q73.632 22.475 73.632 22.897M79.494 23.807L77.433 23.807L77.433 23.491Q77.741 23.491 77.932 23.438Q78.123 23.385 78.123 23.196L78.123 18.481Q78.123 18.239 78.053 18.131Q77.983 18.024 77.849 18Q77.714 17.975 77.433 17.975L77.433 17.659L78.800 17.562L78.800 23.196Q78.800 23.385 78.993 23.438Q79.187 23.491 79.494 23.491L79.494 23.807M80 23.825L80 22.383Q80 22.352 80.028 22.328Q80.057 22.304 80.088 22.304L80.197 22.304Q80.233 22.304 80.255 22.326Q80.276 22.348 80.285 22.383Q80.545 23.644 81.511 23.644Q81.938 23.644 82.232 23.460Q82.526 23.275 82.526 22.871Q82.526 22.577 82.296 22.381Q82.065 22.185 81.753 22.124L81.151 22.005Q80.685 21.917 80.342 21.634Q80 21.350 80 20.911Q80 20.318 80.437 20.045Q80.874 19.773 81.511 19.773Q81.990 19.773 82.338 20.019L82.588 19.795Q82.645 19.773 82.645 19.773L82.698 19.773Q82.724 19.773 82.757 19.799Q82.790 19.826 82.790 19.856L82.790 21.016Q82.790 21.047 82.755 21.074Q82.720 21.100 82.698 21.100L82.588 21.100Q82.566 21.100 82.533 21.071Q82.500 21.043 82.500 21.016Q82.500 20.551 82.234 20.280Q81.968 20.010 81.503 20.010Q81.098 20.010 80.795 20.155Q80.492 20.300 80.492 20.656Q80.492 20.902 80.709 21.056Q80.927 21.210 81.204 21.267L81.832 21.394Q82.149 21.456 82.419 21.623Q82.689 21.790 82.856 22.056Q83.023 22.322 83.023 22.638Q83.023 23.280 82.597 23.594Q82.171 23.908 81.511 23.908Q81.239 23.908 80.973 23.814Q80.707 23.719 80.527 23.530L80.206 23.869Q80.189 23.908 80.140 23.908L80.088 23.908Q80.066 23.908 80.033 23.880Q80 23.851 80 23.825\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M16.288 34.908Q15.738 34.908 15.279 34.629Q14.820 34.350 14.552 33.880Q14.284 33.410 14.284 32.865Q14.284 32.452 14.433 32.074Q14.582 31.696 14.857 31.401Q15.132 31.107 15.501 30.940Q15.870 30.773 16.288 30.773Q16.622 30.773 16.942 30.839Q17.263 30.905 17.492 31.091Q17.720 31.278 17.720 31.603Q17.720 31.779 17.593 31.907Q17.465 32.034 17.289 32.034Q17.105 32.034 16.975 31.909Q16.846 31.784 16.846 31.603Q16.846 31.467 16.920 31.355Q16.995 31.243 17.127 31.190Q16.819 31.063 16.288 31.063Q15.852 31.063 15.584 31.340Q15.316 31.617 15.204 32.032Q15.092 32.447 15.092 32.865Q15.092 33.295 15.231 33.697Q15.369 34.099 15.664 34.359Q15.958 34.618 16.397 34.618Q16.819 34.618 17.122 34.368Q17.426 34.117 17.531 33.708Q17.540 33.678 17.564 33.653Q17.588 33.629 17.619 33.629L17.729 33.629Q17.817 33.629 17.817 33.744Q17.672 34.280 17.259 34.594Q16.846 34.908 16.288 34.908M19.069 33.735L19.069 31.748Q19.069 31.507 18.999 31.399Q18.929 31.291 18.795 31.267Q18.661 31.243 18.379 31.243L18.379 30.927L19.772 30.830L19.772 33.700Q19.772 34.078 19.819 34.264Q19.865 34.451 20.036 34.548Q20.207 34.644 20.563 34.644Q20.897 34.644 21.137 34.453Q21.376 34.262 21.502 33.959Q21.627 33.656 21.627 33.339L21.627 31.748Q21.627 31.507 21.557 31.399Q21.486 31.291 21.352 31.267Q21.218 31.243 20.933 31.243L20.933 30.927L22.330 30.830L22.330 33.990Q22.330 34.227 22.400 34.335Q22.471 34.442 22.605 34.466Q22.739 34.491 23.020 34.491L23.020 34.807L21.653 34.908L21.653 34.187Q21.486 34.513 21.181 34.710Q20.875 34.908 20.519 34.908Q19.860 34.908 19.465 34.638Q19.069 34.368 19.069 33.735M25.701 34.807L23.468 34.807L23.468 34.491Q23.780 34.491 23.971 34.438Q24.163 34.385 24.163 34.196L24.163 31.748Q24.163 31.507 24.092 31.399Q24.022 31.291 23.888 31.267Q23.754 31.243 23.468 31.243L23.468 30.927L24.782 30.830L24.782 31.691Q24.945 31.300 25.213 31.065Q25.481 30.830 25.872 30.830Q26.144 30.830 26.360 30.993Q26.575 31.155 26.575 31.414Q26.575 31.590 26.456 31.709Q26.338 31.828 26.162 31.828Q25.982 31.828 25.863 31.709Q25.745 31.590 25.745 31.414Q25.745 31.199 25.898 31.089L25.881 31.089Q25.503 31.089 25.270 31.351Q25.037 31.612 24.938 31.999Q24.839 32.386 24.839 32.746L24.839 34.196Q24.839 34.385 25.096 34.438Q25.353 34.491 25.701 34.491L25.701 34.807M29.067 34.789L27.735 31.542Q27.647 31.344 27.483 31.294Q27.318 31.243 27.015 31.243L27.015 30.927L28.939 30.927L28.939 31.243Q28.447 31.243 28.447 31.458Q28.447 31.480 28.465 31.542L29.480 34.016L30.390 31.792Q30.425 31.709 30.425 31.612Q30.425 31.441 30.302 31.342Q30.179 31.243 30.012 31.243L30.012 30.927L31.523 30.927L31.523 31.243Q31.238 31.243 31.025 31.386Q30.811 31.529 30.706 31.792L29.471 34.789Q29.427 34.908 29.300 34.908L29.238 34.908Q29.111 34.908 29.067 34.789\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M33.781 34.908Q33.222 34.908 32.750 34.625Q32.278 34.341 32.003 33.864Q31.728 33.388 31.728 32.834Q31.728 32.438 31.871 32.063Q32.014 31.687 32.271 31.399Q32.528 31.111 32.886 30.942Q33.244 30.773 33.649 30.773Q34.194 30.773 34.565 31.010Q34.936 31.247 35.123 31.665Q35.310 32.082 35.310 32.619Q35.310 32.671 35.286 32.709Q35.261 32.746 35.213 32.746L32.541 32.746L32.541 32.825Q32.541 33.572 32.853 34.095Q33.165 34.618 33.864 34.618Q34.268 34.618 34.589 34.361Q34.910 34.104 35.033 33.700Q35.051 33.620 35.134 33.620L35.213 33.620Q35.253 33.620 35.281 33.651Q35.310 33.682 35.310 33.726L35.310 33.761Q35.204 34.104 34.982 34.363Q34.761 34.622 34.446 34.765Q34.132 34.908 33.781 34.908M32.550 32.495L34.664 32.495Q34.664 32.227 34.611 31.981Q34.558 31.735 34.438 31.513Q34.317 31.291 34.119 31.164Q33.921 31.036 33.649 31.036Q33.306 31.036 33.053 31.261Q32.801 31.485 32.675 31.823Q32.550 32.161 32.550 32.495M36.483 36.411Q36.483 36.371 36.518 36.336Q36.844 36.024 37.024 35.618Q37.204 35.211 37.204 34.763L37.204 34.680Q37.063 34.807 36.861 34.807Q36.716 34.807 36.602 34.741Q36.488 34.675 36.422 34.563Q36.356 34.451 36.356 34.302Q36.356 34.082 36.496 33.941Q36.637 33.801 36.861 33.801Q37.182 33.801 37.323 34.099Q37.463 34.398 37.463 34.763Q37.463 35.273 37.259 35.728Q37.054 36.182 36.690 36.534Q36.655 36.552 36.628 36.552Q36.571 36.552 36.527 36.508Q36.483 36.464 36.483 36.411\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M42.173 33.735L42.173 31.243L41.408 31.243L41.408 30.984Q41.813 30.984 42.079 30.718Q42.344 30.452 42.465 30.052Q42.586 29.652 42.586 29.270L42.876 29.270L42.876 30.927L44.164 30.927L44.164 31.243L42.876 31.243L42.876 33.700Q42.876 34.069 43.001 34.343Q43.127 34.618 43.452 34.618Q43.751 34.618 43.889 34.324Q44.028 34.029 44.028 33.700L44.028 33.177L44.313 33.177L44.313 33.735Q44.313 34.012 44.203 34.284Q44.093 34.557 43.880 34.732Q43.667 34.908 43.386 34.908Q43.026 34.908 42.753 34.770Q42.481 34.631 42.327 34.368Q42.173 34.104 42.173 33.735\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M46.603 34.789L45.412 31.542Q45.337 31.344 45.192 31.294Q45.047 31.243 44.757 31.243L44.757 30.927L46.638 30.927L46.638 31.243Q46.115 31.243 46.115 31.467Q46.115 31.498 46.133 31.542L46.998 33.924L47.754 31.836L47.644 31.542Q47.570 31.344 47.422 31.294Q47.275 31.243 46.990 31.243L46.990 30.927L48.778 30.927L48.778 31.243Q48.268 31.243 48.268 31.467Q48.268 31.520 48.277 31.542L49.196 34.042L50.013 31.792Q50.031 31.748 50.031 31.647Q50.031 31.454 49.879 31.349Q49.727 31.243 49.525 31.243L49.525 30.927L51.068 30.927L51.068 31.243Q50.800 31.243 50.604 31.392Q50.409 31.542 50.321 31.792L49.222 34.789Q49.191 34.908 49.059 34.908L48.998 34.908Q48.879 34.908 48.835 34.789L47.917 32.258L46.990 34.789Q46.946 34.908 46.827 34.908L46.765 34.908Q46.634 34.908 46.603 34.789\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M51.259 32.900Q51.259 32.333 51.532 31.845Q51.804 31.357 52.274 31.065Q52.745 30.773 53.312 30.773Q53.733 30.773 54.109 30.942Q54.485 31.111 54.762 31.403Q55.039 31.696 55.197 32.091Q55.355 32.487 55.355 32.900Q55.355 33.449 55.076 33.911Q54.797 34.372 54.329 34.640Q53.861 34.908 53.312 34.908Q52.758 34.908 52.288 34.640Q51.817 34.372 51.538 33.911Q51.259 33.449 51.259 32.900M53.312 34.618Q53.808 34.618 54.085 34.357Q54.362 34.095 54.454 33.691Q54.546 33.286 54.546 32.790Q54.546 32.315 54.448 31.926Q54.349 31.537 54.076 31.287Q53.804 31.036 53.312 31.036Q52.600 31.036 52.336 31.531Q52.072 32.025 52.072 32.790Q52.072 33.590 52.327 34.104Q52.582 34.618 53.312 34.618\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M61.021 34.908Q60.462 34.908 59.990 34.625Q59.518 34.341 59.243 33.864Q58.968 33.388 58.968 32.834Q58.968 32.438 59.111 32.063Q59.254 31.687 59.511 31.399Q59.768 31.111 60.126 30.942Q60.484 30.773 60.889 30.773Q61.434 30.773 61.805 31.010Q62.176 31.247 62.363 31.665Q62.550 32.082 62.550 32.619Q62.550 32.671 62.526 32.709Q62.501 32.746 62.453 32.746L59.781 32.746L59.781 32.825Q59.781 33.572 60.093 34.095Q60.405 34.618 61.104 34.618Q61.508 34.618 61.829 34.361Q62.150 34.104 62.273 33.700Q62.291 33.620 62.374 33.620L62.453 33.620Q62.493 33.620 62.521 33.651Q62.550 33.682 62.550 33.726L62.550 33.761Q62.444 34.104 62.222 34.363Q62.001 34.622 61.686 34.765Q61.372 34.908 61.021 34.908M59.790 32.495L61.904 32.495Q61.904 32.227 61.851 31.981Q61.798 31.735 61.678 31.513Q61.557 31.291 61.359 31.164Q61.161 31.036 60.889 31.036Q60.546 31.036 60.293 31.261Q60.041 31.485 59.915 31.823Q59.790 32.161 59.790 32.495M65.209 34.807L63.121 34.807L63.121 34.491Q63.429 34.491 63.620 34.438Q63.811 34.385 63.811 34.196L63.811 31.748Q63.811 31.507 63.741 31.399Q63.670 31.291 63.536 31.267Q63.402 31.243 63.121 31.243L63.121 30.927L64.461 30.830L64.461 31.665Q64.659 31.283 65.013 31.056Q65.367 30.830 65.793 30.830Q67.072 30.830 67.072 32.043L67.072 34.196Q67.072 34.385 67.263 34.438Q67.454 34.491 67.762 34.491L67.762 34.807L65.674 34.807L65.674 34.491Q65.986 34.491 66.178 34.438Q66.369 34.385 66.369 34.196L66.369 32.078Q66.369 31.819 66.325 31.597Q66.281 31.375 66.136 31.232Q65.991 31.089 65.731 31.089Q65.389 31.089 65.107 31.278Q64.826 31.467 64.670 31.779Q64.514 32.091 64.514 32.438L64.514 34.196Q64.514 34.385 64.708 34.438Q64.901 34.491 65.209 34.491L65.209 34.807M70.209 34.908Q69.665 34.908 69.221 34.625Q68.777 34.341 68.522 33.869Q68.267 33.396 68.267 32.865Q68.267 32.311 68.544 31.845Q68.821 31.379 69.293 31.105Q69.766 30.830 70.311 30.830Q70.645 30.830 70.948 30.962Q71.251 31.094 71.471 31.331L71.471 29.481Q71.471 29.239 71.400 29.131Q71.330 29.024 71.196 29Q71.062 28.975 70.776 28.975L70.776 28.659L72.143 28.562L72.143 33.990Q72.143 34.227 72.213 34.335Q72.284 34.442 72.420 34.466Q72.556 34.491 72.837 34.491L72.837 34.807L71.444 34.908L71.444 34.359Q71.194 34.622 70.875 34.765Q70.557 34.908 70.209 34.908M70.271 34.644Q70.640 34.644 70.950 34.433Q71.260 34.223 71.444 33.880L71.444 31.748Q71.273 31.445 70.992 31.267Q70.710 31.089 70.372 31.089Q69.682 31.089 69.379 31.610Q69.076 32.131 69.076 32.873Q69.076 33.594 69.346 34.119Q69.616 34.644 70.271 34.644M75.435 36.552L73.347 36.552L73.347 36.240Q73.659 36.240 73.850 36.189Q74.042 36.139 74.042 35.941L74.042 31.603Q74.042 31.362 73.868 31.302Q73.694 31.243 73.347 31.243L73.347 30.927L74.718 30.830L74.718 31.370Q74.978 31.102 75.312 30.966Q75.646 30.830 76.015 30.830Q76.415 30.830 76.771 30.997Q77.126 31.164 77.381 31.445Q77.636 31.726 77.779 32.091Q77.922 32.456 77.922 32.865Q77.922 33.427 77.645 33.893Q77.368 34.359 76.894 34.633Q76.419 34.908 75.870 34.908Q75.558 34.908 75.268 34.774Q74.978 34.640 74.745 34.394L74.745 35.941Q74.745 36.139 74.936 36.189Q75.127 36.240 75.435 36.240L75.435 36.552M74.745 31.784L74.745 33.915Q74.903 34.240 75.186 34.442Q75.470 34.644 75.813 34.644Q76.226 34.644 76.520 34.368Q76.814 34.091 76.962 33.673Q77.109 33.256 77.109 32.865Q77.109 32.487 76.975 32.078Q76.841 31.669 76.566 31.392Q76.292 31.116 75.914 31.116Q75.672 31.116 75.457 31.192Q75.241 31.269 75.050 31.430Q74.859 31.590 74.745 31.784\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M78.756 32.900Q78.756 32.333 79.029 31.845Q79.301 31.357 79.771 31.065Q80.242 30.773 80.809 30.773Q81.230 30.773 81.606 30.942Q81.982 31.111 82.259 31.403Q82.536 31.696 82.694 32.091Q82.852 32.487 82.852 32.900Q82.852 33.449 82.573 33.911Q82.294 34.372 81.826 34.640Q81.358 34.908 80.809 34.908Q80.255 34.908 79.785 34.640Q79.314 34.372 79.035 33.911Q78.756 33.449 78.756 32.900M80.809 34.618Q81.305 34.618 81.582 34.357Q81.859 34.095 81.951 33.691Q82.043 33.286 82.043 32.790Q82.043 32.315 81.945 31.926Q81.846 31.537 81.573 31.287Q81.301 31.036 80.809 31.036Q80.097 31.036 79.833 31.531Q79.569 32.025 79.569 32.790Q79.569 33.590 79.824 34.104Q80.079 34.618 80.809 34.618M85.410 34.807L83.423 34.807L83.423 34.491Q83.731 34.491 83.922 34.438Q84.113 34.385 84.113 34.196L84.113 31.748Q84.113 31.502 84.047 31.397Q83.981 31.291 83.856 31.267Q83.731 31.243 83.458 31.243L83.458 30.927L84.790 30.830L84.790 34.196Q84.790 34.390 84.955 34.440Q85.120 34.491 85.410 34.491L85.410 34.807M83.810 29.283Q83.810 29.077 83.959 28.927Q84.109 28.778 84.311 28.778Q84.443 28.778 84.559 28.848Q84.676 28.918 84.746 29.035Q84.816 29.151 84.816 29.283Q84.816 29.485 84.667 29.635Q84.518 29.784 84.311 29.784Q84.109 29.784 83.959 29.635Q83.810 29.485 83.810 29.283M88.068 34.807L85.981 34.807L85.981 34.491Q86.289 34.491 86.480 34.438Q86.671 34.385 86.671 34.196L86.671 31.748Q86.671 31.507 86.601 31.399Q86.530 31.291 86.396 31.267Q86.262 31.243 85.981 31.243L85.981 30.927L87.321 30.830L87.321 31.665Q87.519 31.283 87.873 31.056Q88.226 30.830 88.653 30.830Q89.932 30.830 89.932 32.043L89.932 34.196Q89.932 34.385 90.123 34.438Q90.314 34.491 90.622 34.491L90.622 34.807L88.534 34.807L88.534 34.491Q88.846 34.491 89.037 34.438Q89.228 34.385 89.228 34.196L89.228 32.078Q89.228 31.819 89.184 31.597Q89.141 31.375 88.996 31.232Q88.851 31.089 88.591 31.089Q88.248 31.089 87.967 31.278Q87.686 31.467 87.530 31.779Q87.374 32.091 87.374 32.438L87.374 34.196Q87.374 34.385 87.567 34.438Q87.761 34.491 88.068 34.491\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-41.921 -40.62)\">\u003Cpath d=\"M91.509 33.735L91.509 31.243L90.744 31.243L90.744 30.984Q91.149 30.984 91.415 30.718Q91.680 30.452 91.801 30.052Q91.922 29.652 91.922 29.270L92.212 29.270L92.212 30.927L93.500 30.927L93.500 31.243L92.212 31.243L92.212 33.700Q92.212 34.069 92.337 34.343Q92.463 34.618 92.788 34.618Q93.087 34.618 93.225 34.324Q93.364 34.029 93.364 33.700L93.364 33.177L93.649 33.177L93.649 33.735Q93.649 34.012 93.539 34.284Q93.429 34.557 93.216 34.732Q93.003 34.908 92.722 34.908Q92.362 34.908 92.089 34.770Q91.817 34.631 91.663 34.368Q91.509 34.104 91.509 33.735M94.471 34.825L94.471 33.383Q94.471 33.352 94.500 33.328Q94.528 33.304 94.559 33.304L94.669 33.304Q94.704 33.304 94.726 33.326Q94.748 33.348 94.757 33.383Q95.016 34.644 95.983 34.644Q96.409 34.644 96.703 34.460Q96.998 34.275 96.998 33.871Q96.998 33.577 96.767 33.381Q96.536 33.185 96.224 33.124L95.622 33.005Q95.156 32.917 94.814 32.634Q94.471 32.350 94.471 31.911Q94.471 31.318 94.908 31.045Q95.345 30.773 95.983 30.773Q96.462 30.773 96.809 31.019L97.059 30.795Q97.116 30.773 97.116 30.773L97.169 30.773Q97.196 30.773 97.229 30.799Q97.261 30.826 97.261 30.856L97.261 32.016Q97.261 32.047 97.226 32.074Q97.191 32.100 97.169 32.100L97.059 32.100Q97.037 32.100 97.004 32.071Q96.971 32.043 96.971 32.016Q96.971 31.551 96.706 31.280Q96.440 31.010 95.974 31.010Q95.570 31.010 95.266 31.155Q94.963 31.300 94.963 31.656Q94.963 31.902 95.181 32.056Q95.398 32.210 95.675 32.267L96.303 32.394Q96.620 32.456 96.890 32.623Q97.160 32.790 97.327 33.056Q97.494 33.322 97.494 33.638Q97.494 34.280 97.068 34.594Q96.642 34.908 95.983 34.908Q95.710 34.908 95.444 34.814Q95.178 34.719 94.998 34.530L94.677 34.869Q94.660 34.908 94.612 34.908L94.559 34.908Q94.537 34.908 94.504 34.880Q94.471 34.851 94.471 34.825\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-68.537 45.045H96.49V18.879H-68.537Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr9\" font-size=\"9\">\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M34.165 22.845Q34.504 23.244 34.981 23.466Q35.457 23.688 35.985 23.688Q36.306 23.688 36.631 23.583Q36.956 23.477 37.171 23.255Q37.387 23.034 37.387 22.700L37.387 21.953Q37.387 21.658 36.235 21.658L36.235 21.342L38.872 21.342L38.872 21.658Q38.578 21.658 38.406 21.711Q38.235 21.764 38.235 21.953L38.235 23.728Q38.235 23.754 38.200 23.781Q38.164 23.807 38.134 23.807Q38.077 23.807 37.967 23.710Q37.857 23.614 37.734 23.477Q37.611 23.341 37.558 23.258Q37.387 23.530 37.105 23.695Q36.824 23.860 36.481 23.932Q36.139 24.005 35.822 24.005Q34.943 24.005 34.201 23.561Q33.458 23.117 33.025 22.361Q32.592 21.605 32.592 20.731Q32.592 20.085 32.840 19.485Q33.089 18.885 33.537 18.428Q33.985 17.971 34.574 17.716Q35.163 17.461 35.822 17.461Q36.297 17.461 36.738 17.668Q37.180 17.874 37.505 18.235L38.028 17.496Q38.046 17.461 38.090 17.461L38.142 17.461Q38.178 17.461 38.206 17.490Q38.235 17.518 38.235 17.545L38.235 19.975Q38.235 19.997 38.202 20.026Q38.169 20.054 38.142 20.054L38.011 20.054Q37.984 20.054 37.951 20.026Q37.918 19.997 37.918 19.975Q37.918 19.689 37.778 19.296Q37.637 18.903 37.470 18.661Q37.193 18.257 36.796 18.017Q36.398 17.778 35.932 17.778Q35.594 17.778 35.264 17.879Q34.934 17.980 34.651 18.173Q34.368 18.367 34.157 18.621Q33.546 19.373 33.546 20.731Q33.546 21.350 33.686 21.893Q33.827 22.436 34.165 22.845M41.816 23.807L39.584 23.807L39.584 23.491Q39.896 23.491 40.087 23.438Q40.278 23.385 40.278 23.196L40.278 20.748Q40.278 20.507 40.208 20.399Q40.138 20.291 40.004 20.267Q39.870 20.243 39.584 20.243L39.584 19.927L40.898 19.830L40.898 20.691Q41.060 20.300 41.328 20.065Q41.597 19.830 41.988 19.830Q42.260 19.830 42.475 19.993Q42.691 20.155 42.691 20.414Q42.691 20.590 42.572 20.709Q42.453 20.828 42.278 20.828Q42.098 20.828 41.979 20.709Q41.860 20.590 41.860 20.414Q41.860 20.199 42.014 20.089L41.996 20.089Q41.619 20.089 41.386 20.351Q41.153 20.612 41.054 20.999Q40.955 21.386 40.955 21.746L40.955 23.196Q40.955 23.385 41.212 23.438Q41.469 23.491 41.816 23.491L41.816 23.807M45.262 23.908Q44.703 23.908 44.231 23.625Q43.759 23.341 43.484 22.864Q43.209 22.388 43.209 21.834Q43.209 21.438 43.352 21.063Q43.495 20.687 43.752 20.399Q44.009 20.111 44.367 19.942Q44.725 19.773 45.130 19.773Q45.675 19.773 46.046 20.010Q46.417 20.247 46.604 20.665Q46.791 21.082 46.791 21.619Q46.791 21.671 46.767 21.709Q46.743 21.746 46.694 21.746L44.022 21.746L44.022 21.825Q44.022 22.572 44.334 23.095Q44.646 23.618 45.345 23.618Q45.749 23.618 46.070 23.361Q46.391 23.104 46.514 22.700Q46.532 22.620 46.615 22.620L46.694 22.620Q46.734 22.620 46.762 22.651Q46.791 22.682 46.791 22.726L46.791 22.761Q46.685 23.104 46.463 23.363Q46.242 23.622 45.927 23.765Q45.613 23.908 45.262 23.908M44.031 21.495L46.145 21.495Q46.145 21.227 46.092 20.981Q46.039 20.735 45.919 20.513Q45.798 20.291 45.600 20.164Q45.402 20.036 45.130 20.036Q44.787 20.036 44.534 20.261Q44.282 20.485 44.156 20.823Q44.031 21.161 44.031 21.495M49.375 23.908Q48.817 23.908 48.344 23.625Q47.872 23.341 47.597 22.864Q47.323 22.388 47.323 21.834Q47.323 21.438 47.465 21.063Q47.608 20.687 47.865 20.399Q48.122 20.111 48.481 19.942Q48.839 19.773 49.243 19.773Q49.788 19.773 50.159 20.010Q50.531 20.247 50.717 20.665Q50.904 21.082 50.904 21.619Q50.904 21.671 50.880 21.709Q50.856 21.746 50.807 21.746L48.136 21.746L48.136 21.825Q48.136 22.572 48.448 23.095Q48.760 23.618 49.458 23.618Q49.863 23.618 50.183 23.361Q50.504 23.104 50.627 22.700Q50.645 22.620 50.728 22.620L50.807 22.620Q50.847 22.620 50.876 22.651Q50.904 22.682 50.904 22.726L50.904 22.761Q50.799 23.104 50.577 23.363Q50.355 23.622 50.041 23.765Q49.726 23.908 49.375 23.908M48.144 21.495L50.258 21.495Q50.258 21.227 50.205 20.981Q50.153 20.735 50.032 20.513Q49.911 20.291 49.713 20.164Q49.516 20.036 49.243 20.036Q48.900 20.036 48.648 20.261Q48.395 20.485 48.270 20.823Q48.144 21.161 48.144 21.495M53.563 23.807L51.475 23.807L51.475 23.491Q51.783 23.491 51.974 23.438Q52.165 23.385 52.165 23.196L52.165 20.748Q52.165 20.507 52.095 20.399Q52.025 20.291 51.891 20.267Q51.757 20.243 51.475 20.243L51.475 19.927L52.816 19.830L52.816 20.665Q53.014 20.283 53.367 20.056Q53.721 19.830 54.147 19.830Q55.426 19.830 55.426 21.043L55.426 23.196Q55.426 23.385 55.617 23.438Q55.808 23.491 56.116 23.491L56.116 23.807L54.029 23.807L54.029 23.491Q54.341 23.491 54.532 23.438Q54.723 23.385 54.723 23.196L54.723 21.078Q54.723 20.819 54.679 20.597Q54.635 20.375 54.490 20.232Q54.345 20.089 54.086 20.089Q53.743 20.089 53.462 20.278Q53.181 20.467 53.025 20.779Q52.869 21.091 52.869 21.438L52.869 23.196Q52.869 23.385 53.062 23.438Q53.255 23.491 53.563 23.491\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M59.920 25.868Q59.920 25.824 59.929 25.807L63.141 17.176Q63.185 17.057 63.322 17.057Q63.396 17.057 63.453 17.114Q63.510 17.171 63.510 17.246Q63.510 17.290 63.502 17.307L60.298 25.938Q60.241 26.057 60.118 26.057Q60.034 26.057 59.977 26Q59.920 25.943 59.920 25.868\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M67.628 23.926L67.628 21.847Q67.628 21.821 67.657 21.792Q67.685 21.764 67.716 21.764L67.826 21.764Q67.857 21.764 67.885 21.792Q67.914 21.821 67.914 21.847Q67.914 22.449 68.171 22.860Q68.428 23.271 68.889 23.480Q69.351 23.688 69.931 23.688Q70.265 23.688 70.537 23.513Q70.810 23.337 70.964 23.045Q71.117 22.752 71.117 22.432Q71.117 22.216 71.049 22.014Q70.981 21.812 70.863 21.647Q70.744 21.482 70.564 21.361Q70.384 21.241 70.181 21.197L68.986 20.911Q68.604 20.819 68.294 20.570Q67.984 20.322 67.806 19.960Q67.628 19.597 67.628 19.206Q67.628 18.736 67.872 18.331Q68.116 17.927 68.529 17.694Q68.942 17.461 69.417 17.461Q69.856 17.461 70.236 17.617Q70.616 17.773 70.893 18.081L71.262 17.496Q71.280 17.461 71.324 17.461L71.381 17.461Q71.412 17.461 71.440 17.490Q71.469 17.518 71.469 17.545L71.469 19.623Q71.469 19.645 71.436 19.674Q71.403 19.703 71.381 19.703L71.271 19.703Q71.249 19.703 71.216 19.674Q71.183 19.645 71.183 19.623Q71.183 19.439 71.142 19.250Q71.100 19.061 71.016 18.861Q70.933 18.661 70.830 18.487Q70.726 18.314 70.608 18.200Q70.366 17.962 70.069 17.857Q69.773 17.751 69.426 17.751Q69.122 17.751 68.845 17.903Q68.569 18.055 68.404 18.318Q68.239 18.582 68.239 18.903Q68.239 19.158 68.358 19.395Q68.476 19.632 68.678 19.790Q68.881 19.949 69.149 20.019L70.344 20.305Q70.753 20.401 71.069 20.676Q71.385 20.951 71.559 21.335Q71.733 21.720 71.733 22.133Q71.733 22.616 71.495 23.051Q71.258 23.486 70.845 23.745Q70.432 24.005 69.940 24.005Q69.443 24.005 68.984 23.851Q68.525 23.697 68.213 23.385L67.835 23.970Q67.817 24.005 67.773 24.005L67.716 24.005Q67.694 24.005 67.661 23.976Q67.628 23.948 67.628 23.926M73.187 22.735L73.187 20.243L72.423 20.243L72.423 19.984Q72.827 19.984 73.093 19.718Q73.359 19.452 73.479 19.052Q73.600 18.652 73.600 18.270L73.890 18.270L73.890 19.927L75.178 19.927L75.178 20.243L73.890 20.243L73.890 22.700Q73.890 23.069 74.016 23.343Q74.141 23.618 74.466 23.618Q74.765 23.618 74.903 23.324Q75.042 23.029 75.042 22.700L75.042 22.177L75.327 22.177L75.327 22.735Q75.327 23.012 75.218 23.284Q75.108 23.557 74.895 23.732Q74.681 23.908 74.400 23.908Q74.040 23.908 73.767 23.770Q73.495 23.631 73.341 23.368Q73.187 23.104 73.187 22.735M76.101 21.900Q76.101 21.333 76.373 20.845Q76.646 20.357 77.116 20.065Q77.586 19.773 78.153 19.773Q78.575 19.773 78.951 19.942Q79.326 20.111 79.603 20.403Q79.880 20.696 80.038 21.091Q80.197 21.487 80.197 21.900Q80.197 22.449 79.917 22.911Q79.638 23.372 79.170 23.640Q78.702 23.908 78.153 23.908Q77.599 23.908 77.129 23.640Q76.659 23.372 76.380 22.911Q76.101 22.449 76.101 21.900M78.153 23.618Q78.650 23.618 78.927 23.357Q79.203 23.095 79.296 22.691Q79.388 22.286 79.388 21.790Q79.388 21.315 79.289 20.926Q79.190 20.537 78.918 20.287Q78.645 20.036 78.153 20.036Q77.441 20.036 77.177 20.531Q76.914 21.025 76.914 21.790Q76.914 22.590 77.169 23.104Q77.424 23.618 78.153 23.618M82.745 23.807L80.711 23.807L80.711 23.491Q81.023 23.491 81.214 23.438Q81.405 23.385 81.405 23.196L81.405 18.481Q81.405 18.239 81.335 18.131Q81.264 18.024 81.130 18Q80.996 17.975 80.711 17.975L80.711 17.659L82.082 17.562L82.082 21.807L83.286 20.792Q83.492 20.621 83.492 20.441Q83.492 20.344 83.424 20.294Q83.356 20.243 83.260 20.243L83.260 19.927L84.969 19.927L84.969 20.243Q84.371 20.243 83.725 20.792L83.079 21.342L84.239 22.941Q84.415 23.179 84.519 23.284Q84.622 23.390 84.773 23.440Q84.925 23.491 85.176 23.491L85.176 23.807L83.347 23.807L83.347 23.491Q83.646 23.491 83.646 23.302Q83.646 23.183 83.475 22.941L82.600 21.746L82.051 22.216L82.051 23.196Q82.051 23.385 82.244 23.438Q82.438 23.491 82.745 23.491\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M87.412 23.908Q86.853 23.908 86.381 23.625Q85.909 23.341 85.634 22.864Q85.359 22.388 85.359 21.834Q85.359 21.438 85.502 21.063Q85.645 20.687 85.902 20.399Q86.159 20.111 86.517 19.942Q86.875 19.773 87.280 19.773Q87.825 19.773 88.196 20.010Q88.567 20.247 88.754 20.665Q88.941 21.082 88.941 21.619Q88.941 21.671 88.917 21.709Q88.892 21.746 88.844 21.746L86.172 21.746L86.172 21.825Q86.172 22.572 86.484 23.095Q86.796 23.618 87.495 23.618Q87.899 23.618 88.220 23.361Q88.541 23.104 88.664 22.700Q88.682 22.620 88.765 22.620L88.844 22.620Q88.884 22.620 88.912 22.651Q88.941 22.682 88.941 22.726L88.941 22.761Q88.835 23.104 88.613 23.363Q88.392 23.622 88.077 23.765Q87.763 23.908 87.412 23.908M86.181 21.495L88.295 21.495Q88.295 21.227 88.242 20.981Q88.189 20.735 88.069 20.513Q87.948 20.291 87.750 20.164Q87.552 20.036 87.280 20.036Q86.937 20.036 86.684 20.261Q86.432 20.485 86.306 20.823Q86.181 21.161 86.181 21.495M89.521 23.825L89.521 22.383Q89.521 22.352 89.549 22.328Q89.578 22.304 89.609 22.304L89.719 22.304Q89.754 22.304 89.776 22.326Q89.798 22.348 89.807 22.383Q90.066 23.644 91.033 23.644Q91.459 23.644 91.753 23.460Q92.048 23.275 92.048 22.871Q92.048 22.577 91.817 22.381Q91.586 22.185 91.274 22.124L90.672 22.005Q90.206 21.917 89.864 21.634Q89.521 21.350 89.521 20.911Q89.521 20.318 89.958 20.045Q90.395 19.773 91.033 19.773Q91.512 19.773 91.859 20.019L92.109 19.795Q92.166 19.773 92.166 19.773L92.219 19.773Q92.246 19.773 92.278 19.799Q92.311 19.826 92.311 19.856L92.311 21.016Q92.311 21.047 92.276 21.074Q92.241 21.100 92.219 21.100L92.109 21.100Q92.087 21.100 92.054 21.071Q92.021 21.043 92.021 21.016Q92.021 20.551 91.756 20.280Q91.490 20.010 91.024 20.010Q90.620 20.010 90.316 20.155Q90.013 20.300 90.013 20.656Q90.013 20.902 90.231 21.056Q90.448 21.210 90.725 21.267L91.353 21.394Q91.670 21.456 91.940 21.623Q92.210 21.790 92.377 22.056Q92.544 22.322 92.544 22.638Q92.544 23.280 92.118 23.594Q91.692 23.908 91.033 23.908Q90.760 23.908 90.494 23.814Q90.228 23.719 90.048 23.530L89.727 23.869Q89.710 23.908 89.662 23.908L89.609 23.908Q89.587 23.908 89.554 23.880Q89.521 23.851 89.521 23.825\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M14.284 34.825L14.284 33.383Q14.284 33.352 14.312 33.328Q14.341 33.304 14.372 33.304L14.481 33.304Q14.517 33.304 14.539 33.326Q14.560 33.348 14.569 33.383Q14.829 34.644 15.795 34.644Q16.222 34.644 16.516 34.460Q16.810 34.275 16.810 33.871Q16.810 33.577 16.580 33.381Q16.349 33.185 16.037 33.124L15.435 33.005Q14.969 32.917 14.626 32.634Q14.284 32.350 14.284 31.911Q14.284 31.318 14.721 31.045Q15.158 30.773 15.795 30.773Q16.274 30.773 16.622 31.019L16.872 30.795Q16.929 30.773 16.929 30.773L16.982 30.773Q17.008 30.773 17.041 30.799Q17.074 30.826 17.074 30.856L17.074 32.016Q17.074 32.047 17.039 32.074Q17.004 32.100 16.982 32.100L16.872 32.100Q16.850 32.100 16.817 32.071Q16.784 32.043 16.784 32.016Q16.784 31.551 16.518 31.280Q16.252 31.010 15.787 31.010Q15.382 31.010 15.079 31.155Q14.776 31.300 14.776 31.656Q14.776 31.902 14.993 32.056Q15.211 32.210 15.488 32.267L16.116 32.394Q16.433 32.456 16.703 32.623Q16.973 32.790 17.140 33.056Q17.307 33.322 17.307 33.638Q17.307 34.280 16.881 34.594Q16.455 34.908 15.795 34.908Q15.523 34.908 15.257 34.814Q14.991 34.719 14.811 34.530L14.490 34.869Q14.473 34.908 14.424 34.908L14.372 34.908Q14.350 34.908 14.317 34.880Q14.284 34.851 14.284 34.825M18.608 33.735L18.608 31.748Q18.608 31.507 18.538 31.399Q18.467 31.291 18.333 31.267Q18.199 31.243 17.918 31.243L17.918 30.927L19.311 30.830L19.311 33.700Q19.311 34.078 19.357 34.264Q19.403 34.451 19.575 34.548Q19.746 34.644 20.102 34.644Q20.436 34.644 20.675 34.453Q20.915 34.262 21.040 33.959Q21.165 33.656 21.165 33.339L21.165 31.748Q21.165 31.507 21.095 31.399Q21.025 31.291 20.891 31.267Q20.757 31.243 20.471 31.243L20.471 30.927L21.869 30.830L21.869 33.990Q21.869 34.227 21.939 34.335Q22.009 34.442 22.143 34.466Q22.277 34.491 22.559 34.491L22.559 34.807L21.192 34.908L21.192 34.187Q21.025 34.513 20.719 34.710Q20.414 34.908 20.058 34.908Q19.399 34.908 19.003 34.638Q18.608 34.368 18.608 33.735M25.239 34.807L23.007 34.807L23.007 34.491Q23.319 34.491 23.510 34.438Q23.701 34.385 23.701 34.196L23.701 31.748Q23.701 31.507 23.631 31.399Q23.560 31.291 23.426 31.267Q23.292 31.243 23.007 31.243L23.007 30.927L24.321 30.830L24.321 31.691Q24.483 31.300 24.751 31.065Q25.019 30.830 25.411 30.830Q25.683 30.830 25.898 30.993Q26.114 31.155 26.114 31.414Q26.114 31.590 25.995 31.709Q25.876 31.828 25.701 31.828Q25.520 31.828 25.402 31.709Q25.283 31.590 25.283 31.414Q25.283 31.199 25.437 31.089L25.419 31.089Q25.041 31.089 24.809 31.351Q24.576 31.612 24.477 31.999Q24.378 32.386 24.378 32.746L24.378 34.196Q24.378 34.385 24.635 34.438Q24.892 34.491 25.239 34.491L25.239 34.807M28.913 34.807L26.681 34.807L26.681 34.491Q26.988 34.491 27.179 34.438Q27.371 34.385 27.371 34.196L27.371 31.243L26.681 31.243L26.681 30.927L27.371 30.927L27.371 29.859Q27.371 29.476 27.584 29.153Q27.797 28.830 28.151 28.646Q28.504 28.461 28.882 28.461Q29.203 28.461 29.454 28.639Q29.704 28.817 29.704 29.129Q29.704 29.305 29.585 29.424Q29.467 29.542 29.291 29.542Q29.111 29.542 28.988 29.424Q28.865 29.305 28.865 29.129Q28.865 28.888 29.080 28.760Q28.975 28.725 28.838 28.725Q28.570 28.725 28.388 28.907Q28.205 29.090 28.113 29.360Q28.021 29.630 28.021 29.894L28.021 30.927L29.071 30.927L29.071 31.243L28.047 31.243L28.047 34.196Q28.047 34.385 28.304 34.438Q28.561 34.491 28.913 34.491L28.913 34.807M29.568 33.897Q29.568 33.357 30.001 33.023Q30.434 32.689 31.040 32.550Q31.646 32.412 32.178 32.412L32.178 32.078Q32.178 31.819 32.059 31.575Q31.941 31.331 31.732 31.184Q31.523 31.036 31.251 31.036Q30.688 31.036 30.376 31.234Q30.526 31.261 30.618 31.379Q30.710 31.498 30.710 31.656Q30.710 31.832 30.585 31.962Q30.460 32.091 30.280 32.091Q30.091 32.091 29.963 31.964Q29.836 31.836 29.836 31.656Q29.836 31.186 30.275 30.979Q30.715 30.773 31.251 30.773Q31.541 30.773 31.829 30.861Q32.117 30.949 32.350 31.109Q32.582 31.269 32.732 31.509Q32.881 31.748 32.881 32.043L32.881 34.078Q32.881 34.231 32.956 34.370Q33.031 34.508 33.176 34.508Q33.330 34.508 33.402 34.372Q33.475 34.236 33.475 34.078L33.475 33.502L33.760 33.502L33.760 34.078Q33.760 34.411 33.512 34.636Q33.264 34.860 32.934 34.860Q32.675 34.860 32.492 34.666Q32.310 34.473 32.266 34.196Q32.099 34.517 31.765 34.713Q31.431 34.908 31.062 34.908Q30.508 34.908 30.038 34.660Q29.568 34.411 29.568 33.897M30.324 33.897Q30.324 34.209 30.565 34.427Q30.807 34.644 31.123 34.644Q31.559 34.644 31.868 34.335Q32.178 34.025 32.178 33.594L32.178 32.667Q31.761 32.667 31.334 32.794Q30.908 32.922 30.616 33.199Q30.324 33.475 30.324 33.897M36.129 34.908Q35.580 34.908 35.120 34.629Q34.661 34.350 34.393 33.880Q34.125 33.410 34.125 32.865Q34.125 32.452 34.274 32.074Q34.424 31.696 34.698 31.401Q34.973 31.107 35.342 30.940Q35.711 30.773 36.129 30.773Q36.463 30.773 36.784 30.839Q37.104 30.905 37.333 31.091Q37.561 31.278 37.561 31.603Q37.561 31.779 37.434 31.907Q37.307 32.034 37.131 32.034Q36.946 32.034 36.817 31.909Q36.687 31.784 36.687 31.603Q36.687 31.467 36.762 31.355Q36.836 31.243 36.968 31.190Q36.661 31.063 36.129 31.063Q35.694 31.063 35.426 31.340Q35.158 31.617 35.046 32.032Q34.934 32.447 34.934 32.865Q34.934 33.295 35.072 33.697Q35.210 34.099 35.505 34.359Q35.799 34.618 36.239 34.618Q36.661 34.618 36.964 34.368Q37.267 34.117 37.372 33.708Q37.381 33.678 37.405 33.653Q37.430 33.629 37.460 33.629L37.570 33.629Q37.658 33.629 37.658 33.744Q37.513 34.280 37.100 34.594Q36.687 34.908 36.129 34.908M40.233 34.908Q39.675 34.908 39.203 34.625Q38.730 34.341 38.456 33.864Q38.181 33.388 38.181 32.834Q38.181 32.438 38.324 32.063Q38.467 31.687 38.724 31.399Q38.981 31.111 39.339 30.942Q39.697 30.773 40.101 30.773Q40.646 30.773 41.018 31.010Q41.389 31.247 41.576 31.665Q41.763 32.082 41.763 32.619Q41.763 32.671 41.738 32.709Q41.714 32.746 41.666 32.746L38.994 32.746L38.994 32.825Q38.994 33.572 39.306 34.095Q39.618 34.618 40.317 34.618Q40.721 34.618 41.042 34.361Q41.363 34.104 41.486 33.700Q41.503 33.620 41.587 33.620L41.666 33.620Q41.705 33.620 41.734 33.651Q41.763 33.682 41.763 33.726L41.763 33.761Q41.657 34.104 41.435 34.363Q41.213 34.622 40.899 34.765Q40.585 34.908 40.233 34.908M39.003 32.495L41.117 32.495Q41.117 32.227 41.064 31.981Q41.011 31.735 40.890 31.513Q40.769 31.291 40.572 31.164Q40.374 31.036 40.101 31.036Q39.759 31.036 39.506 31.261Q39.253 31.485 39.128 31.823Q39.003 32.161 39.003 32.495M42.936 36.411Q42.936 36.371 42.971 36.336Q43.296 36.024 43.476 35.618Q43.657 35.211 43.657 34.763L43.657 34.680Q43.516 34.807 43.314 34.807Q43.169 34.807 43.055 34.741Q42.940 34.675 42.874 34.563Q42.809 34.451 42.809 34.302Q42.809 34.082 42.949 33.941Q43.090 33.801 43.314 33.801Q43.635 33.801 43.775 34.099Q43.916 34.398 43.916 34.763Q43.916 35.273 43.712 35.728Q43.507 36.182 43.143 36.534Q43.107 36.552 43.081 36.552Q43.024 36.552 42.980 36.508Q42.936 36.464 42.936 36.411\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M48.947 34.807L48.657 34.807L48.657 29.481Q48.657 29.239 48.587 29.131Q48.516 29.024 48.382 29Q48.248 28.975 47.962 28.975L47.962 28.659L49.334 28.562L49.334 31.362Q49.580 31.111 49.914 30.971Q50.248 30.830 50.599 30.830Q50.999 30.830 51.362 30.993Q51.724 31.155 51.981 31.434Q52.238 31.713 52.388 32.091Q52.537 32.469 52.537 32.865Q52.537 33.427 52.260 33.893Q51.983 34.359 51.509 34.633Q51.034 34.908 50.485 34.908Q50.120 34.908 49.799 34.739Q49.479 34.570 49.259 34.275L48.947 34.807M49.360 31.775L49.360 33.906Q49.518 34.240 49.802 34.442Q50.085 34.644 50.428 34.644Q51.118 34.644 51.421 34.124Q51.724 33.603 51.724 32.865Q51.724 32.140 51.458 31.614Q51.192 31.089 50.529 31.089Q50.169 31.089 49.854 31.274Q49.540 31.458 49.360 31.775\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M53.366 32.900Q53.366 32.333 53.639 31.845Q53.911 31.357 54.381 31.065Q54.852 30.773 55.419 30.773Q55.840 30.773 56.216 30.942Q56.592 31.111 56.869 31.403Q57.146 31.696 57.304 32.091Q57.462 32.487 57.462 32.900Q57.462 33.449 57.183 33.911Q56.904 34.372 56.436 34.640Q55.968 34.908 55.419 34.908Q54.865 34.908 54.395 34.640Q53.924 34.372 53.645 33.911Q53.366 33.449 53.366 32.900M55.419 34.618Q55.915 34.618 56.192 34.357Q56.469 34.095 56.561 33.691Q56.653 33.286 56.653 32.790Q56.653 32.315 56.555 31.926Q56.456 31.537 56.183 31.287Q55.911 31.036 55.419 31.036Q54.707 31.036 54.443 31.531Q54.179 32.025 54.179 32.790Q54.179 33.590 54.434 34.104Q54.689 34.618 55.419 34.618M58.714 33.735L58.714 31.748Q58.714 31.507 58.644 31.399Q58.574 31.291 58.440 31.267Q58.306 31.243 58.024 31.243L58.024 30.927L59.418 30.830L59.418 33.700Q59.418 34.078 59.464 34.264Q59.510 34.451 59.681 34.548Q59.853 34.644 60.209 34.644Q60.543 34.644 60.782 34.453Q61.022 34.262 61.147 33.959Q61.272 33.656 61.272 33.339L61.272 31.748Q61.272 31.507 61.202 31.399Q61.131 31.291 60.997 31.267Q60.863 31.243 60.578 31.243L60.578 30.927L61.975 30.830L61.975 33.990Q61.975 34.227 62.045 34.335Q62.116 34.442 62.250 34.466Q62.384 34.491 62.665 34.491L62.665 34.807L61.298 34.908L61.298 34.187Q61.131 34.513 60.826 34.710Q60.521 34.908 60.165 34.908Q59.505 34.908 59.110 34.638Q58.714 34.368 58.714 33.735M65.249 34.807L63.162 34.807L63.162 34.491Q63.469 34.491 63.660 34.438Q63.852 34.385 63.852 34.196L63.852 31.748Q63.852 31.507 63.781 31.399Q63.711 31.291 63.577 31.267Q63.443 31.243 63.162 31.243L63.162 30.927L64.502 30.830L64.502 31.665Q64.700 31.283 65.054 31.056Q65.407 30.830 65.834 30.830Q67.112 30.830 67.112 32.043L67.112 34.196Q67.112 34.385 67.304 34.438Q67.495 34.491 67.802 34.491L67.802 34.807L65.715 34.807L65.715 34.491Q66.027 34.491 66.218 34.438Q66.409 34.385 66.409 34.196L66.409 32.078Q66.409 31.819 66.365 31.597Q66.321 31.375 66.176 31.232Q66.031 31.089 65.772 31.089Q65.429 31.089 65.148 31.278Q64.867 31.467 64.711 31.779Q64.555 32.091 64.555 32.438L64.555 34.196Q64.555 34.385 64.748 34.438Q64.941 34.491 65.249 34.491L65.249 34.807M70.250 34.908Q69.705 34.908 69.261 34.625Q68.817 34.341 68.563 33.869Q68.308 33.396 68.308 32.865Q68.308 32.311 68.585 31.845Q68.861 31.379 69.334 31.105Q69.806 30.830 70.351 30.830Q70.685 30.830 70.988 30.962Q71.292 31.094 71.511 31.331L71.511 29.481Q71.511 29.239 71.441 29.131Q71.371 29.024 71.237 29Q71.103 28.975 70.817 28.975L70.817 28.659L72.184 28.562L72.184 33.990Q72.184 34.227 72.254 34.335Q72.324 34.442 72.461 34.466Q72.597 34.491 72.878 34.491L72.878 34.807L71.485 34.908L71.485 34.359Q71.234 34.622 70.916 34.765Q70.597 34.908 70.250 34.908M70.312 34.644Q70.681 34.644 70.991 34.433Q71.300 34.223 71.485 33.880L71.485 31.748Q71.314 31.445 71.032 31.267Q70.751 31.089 70.413 31.089Q69.723 31.089 69.419 31.610Q69.116 32.131 69.116 32.873Q69.116 33.594 69.387 34.119Q69.657 34.644 70.312 34.644M73.506 33.897Q73.506 33.357 73.939 33.023Q74.372 32.689 74.979 32.550Q75.585 32.412 76.117 32.412L76.117 32.078Q76.117 31.819 75.998 31.575Q75.879 31.331 75.671 31.184Q75.462 31.036 75.190 31.036Q74.627 31.036 74.315 31.234Q74.464 31.261 74.557 31.379Q74.649 31.498 74.649 31.656Q74.649 31.832 74.524 31.962Q74.399 32.091 74.218 32.091Q74.029 32.091 73.902 31.964Q73.774 31.836 73.774 31.656Q73.774 31.186 74.214 30.979Q74.653 30.773 75.190 30.773Q75.480 30.773 75.767 30.861Q76.055 30.949 76.288 31.109Q76.521 31.269 76.670 31.509Q76.820 31.748 76.820 32.043L76.820 34.078Q76.820 34.231 76.895 34.370Q76.969 34.508 77.114 34.508Q77.268 34.508 77.341 34.372Q77.413 34.236 77.413 34.078L77.413 33.502L77.699 33.502L77.699 34.078Q77.699 34.411 77.451 34.636Q77.202 34.860 76.873 34.860Q76.613 34.860 76.431 34.666Q76.249 34.473 76.205 34.196Q76.038 34.517 75.704 34.713Q75.370 34.908 75.001 34.908Q74.447 34.908 73.977 34.660Q73.506 34.411 73.506 33.897M74.262 33.897Q74.262 34.209 74.504 34.427Q74.746 34.644 75.062 34.644Q75.497 34.644 75.807 34.335Q76.117 34.025 76.117 33.594L76.117 32.667Q75.699 32.667 75.273 32.794Q74.847 32.922 74.555 33.199Q74.262 33.475 74.262 33.897M80.239 34.807L78.006 34.807L78.006 34.491Q78.318 34.491 78.510 34.438Q78.701 34.385 78.701 34.196L78.701 31.748Q78.701 31.507 78.630 31.399Q78.560 31.291 78.426 31.267Q78.292 31.243 78.006 31.243L78.006 30.927L79.320 30.830L79.320 31.691Q79.483 31.300 79.751 31.065Q80.019 30.830 80.410 30.830Q80.683 30.830 80.898 30.993Q81.113 31.155 81.113 31.414Q81.113 31.590 80.995 31.709Q80.876 31.828 80.700 31.828Q80.520 31.828 80.401 31.709Q80.283 31.590 80.283 31.414Q80.283 31.199 80.437 31.089L80.419 31.089Q80.041 31.089 79.808 31.351Q79.575 31.612 79.476 31.999Q79.378 32.386 79.378 32.746L79.378 34.196Q79.378 34.385 79.635 34.438Q79.892 34.491 80.239 34.491L80.239 34.807M82.049 36.284Q82.216 36.389 82.397 36.389Q82.722 36.389 82.959 36.145Q83.196 35.901 83.346 35.554L83.649 34.807L82.282 31.542Q82.190 31.344 82.027 31.294Q81.865 31.243 81.562 31.243L81.562 30.927L83.486 30.927L83.486 31.243Q82.994 31.243 82.994 31.458Q82.994 31.480 83.012 31.542L84.018 33.932L84.919 31.792Q84.954 31.709 84.954 31.603Q84.954 31.441 84.833 31.342Q84.712 31.243 84.550 31.243L84.550 30.927L86.053 30.927L86.053 31.243Q85.767 31.243 85.554 31.386Q85.341 31.529 85.235 31.792L83.649 35.554Q83.460 36.007 83.146 36.330Q82.832 36.653 82.397 36.653Q82.071 36.653 81.812 36.433Q81.553 36.213 81.553 35.888Q81.553 35.721 81.671 35.607Q81.790 35.493 81.957 35.493Q82.071 35.493 82.161 35.543Q82.252 35.594 82.302 35.682Q82.353 35.769 82.353 35.888Q82.353 36.033 82.271 36.143Q82.190 36.253 82.049 36.284\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M91.669 34.908Q91.119 34.908 90.660 34.629Q90.201 34.350 89.933 33.880Q89.665 33.410 89.665 32.865Q89.665 32.452 89.814 32.074Q89.963 31.696 90.238 31.401Q90.513 31.107 90.882 30.940Q91.251 30.773 91.669 30.773Q92.003 30.773 92.323 30.839Q92.644 30.905 92.873 31.091Q93.101 31.278 93.101 31.603Q93.101 31.779 92.974 31.907Q92.846 32.034 92.670 32.034Q92.486 32.034 92.356 31.909Q92.227 31.784 92.227 31.603Q92.227 31.467 92.301 31.355Q92.376 31.243 92.508 31.190Q92.200 31.063 91.669 31.063Q91.233 31.063 90.965 31.340Q90.697 31.617 90.585 32.032Q90.473 32.447 90.473 32.865Q90.473 33.295 90.612 33.697Q90.750 34.099 91.044 34.359Q91.339 34.618 91.778 34.618Q92.200 34.618 92.503 34.368Q92.807 34.117 92.912 33.708Q92.921 33.678 92.945 33.653Q92.969 33.629 93 33.629L93.110 33.629Q93.198 33.629 93.198 33.744Q93.053 34.280 92.640 34.594Q92.227 34.908 91.669 34.908M94.450 33.735L94.450 31.748Q94.450 31.507 94.380 31.399Q94.310 31.291 94.176 31.267Q94.042 31.243 93.760 31.243L93.760 30.927L95.153 30.830L95.153 33.700Q95.153 34.078 95.200 34.264Q95.246 34.451 95.417 34.548Q95.588 34.644 95.944 34.644Q96.278 34.644 96.518 34.453Q96.757 34.262 96.883 33.959Q97.008 33.656 97.008 33.339L97.008 31.748Q97.008 31.507 96.938 31.399Q96.867 31.291 96.733 31.267Q96.599 31.243 96.314 31.243L96.314 30.927L97.711 30.830L97.711 33.990Q97.711 34.227 97.781 34.335Q97.852 34.442 97.986 34.466Q98.120 34.491 98.401 34.491L98.401 34.807L97.034 34.908L97.034 34.187Q96.867 34.513 96.562 34.710Q96.256 34.908 95.900 34.908Q95.241 34.908 94.846 34.638Q94.450 34.368 94.450 33.735M101.082 34.807L98.849 34.807L98.849 34.491Q99.161 34.491 99.352 34.438Q99.544 34.385 99.544 34.196L99.544 31.748Q99.544 31.507 99.473 31.399Q99.403 31.291 99.269 31.267Q99.135 31.243 98.849 31.243L98.849 30.927L100.163 30.830L100.163 31.691Q100.326 31.300 100.594 31.065Q100.862 30.830 101.253 30.830Q101.525 30.830 101.741 30.993Q101.956 31.155 101.956 31.414Q101.956 31.590 101.837 31.709Q101.719 31.828 101.543 31.828Q101.363 31.828 101.244 31.709Q101.126 31.590 101.126 31.414Q101.126 31.199 101.279 31.089L101.262 31.089Q100.884 31.089 100.651 31.351Q100.418 31.612 100.319 31.999Q100.220 32.386 100.220 32.746L100.220 34.196Q100.220 34.385 100.477 34.438Q100.734 34.491 101.082 34.491L101.082 34.807M104.448 34.789L103.116 31.542Q103.028 31.344 102.864 31.294Q102.699 31.243 102.396 31.243L102.396 30.927L104.320 30.927L104.320 31.243Q103.828 31.243 103.828 31.458Q103.828 31.480 103.846 31.542L104.861 34.016L105.771 31.792Q105.806 31.709 105.806 31.612Q105.806 31.441 105.683 31.342Q105.560 31.243 105.393 31.243L105.393 30.927L106.904 30.927L106.904 31.243Q106.619 31.243 106.406 31.386Q106.192 31.529 106.087 31.792L104.852 34.789Q104.808 34.908 104.681 34.908L104.619 34.908Q104.492 34.908 104.448 34.789\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-48.494 5.155)\">\u003Cpath d=\"M109.162 34.908Q108.603 34.908 108.131 34.625Q107.659 34.341 107.384 33.864Q107.109 33.388 107.109 32.834Q107.109 32.438 107.252 32.063Q107.395 31.687 107.652 31.399Q107.909 31.111 108.267 30.942Q108.625 30.773 109.030 30.773Q109.575 30.773 109.946 31.010Q110.317 31.247 110.504 31.665Q110.691 32.082 110.691 32.619Q110.691 32.671 110.667 32.709Q110.642 32.746 110.594 32.746L107.922 32.746L107.922 32.825Q107.922 33.572 108.234 34.095Q108.546 34.618 109.245 34.618Q109.649 34.618 109.970 34.361Q110.291 34.104 110.414 33.700Q110.432 33.620 110.515 33.620L110.594 33.620Q110.634 33.620 110.662 33.651Q110.691 33.682 110.691 33.726L110.691 33.761Q110.585 34.104 110.363 34.363Q110.142 34.622 109.827 34.765Q109.513 34.908 109.162 34.908M107.931 32.495L110.045 32.495Q110.045 32.227 109.992 31.981Q109.939 31.735 109.819 31.513Q109.698 31.291 109.500 31.164Q109.302 31.036 109.030 31.036Q108.687 31.036 108.434 31.261Q108.182 31.485 108.056 31.823Q107.931 32.161 107.931 32.495\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-68.537 90.27H96.49V64.702H-68.537Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr9\" font-size=\"9\">\u003Cg transform=\"translate(-46.966 50.38)\">\u003Cpath d=\"M42.612 23.807L39.237 23.807L39.237 23.491Q40.155 23.491 40.155 23.196L40.155 18.270Q40.155 17.975 39.237 17.975L39.237 17.659L42.612 17.659Q43.227 17.659 43.752 17.918Q44.277 18.178 44.653 18.619Q45.029 19.061 45.233 19.626Q45.437 20.190 45.437 20.792Q45.437 21.570 45.068 22.269Q44.699 22.968 44.051 23.387Q43.403 23.807 42.612 23.807M40.973 18.270L40.973 23.196Q40.973 23.390 41.078 23.440Q41.184 23.491 41.434 23.491L42.379 23.491Q42.853 23.491 43.286 23.295Q43.719 23.099 44.005 22.735Q44.299 22.370 44.405 21.889Q44.510 21.408 44.510 20.792Q44.510 20.392 44.471 20.034Q44.431 19.676 44.321 19.358Q44.211 19.039 44.005 18.766Q43.816 18.512 43.557 18.336Q43.297 18.160 42.998 18.068Q42.700 17.975 42.379 17.975L41.434 17.975Q41.184 17.975 41.078 18.024Q40.973 18.072 40.973 18.270M48.254 23.807L46.268 23.807L46.268 23.491Q46.576 23.491 46.767 23.438Q46.958 23.385 46.958 23.196L46.958 20.748Q46.958 20.502 46.892 20.397Q46.826 20.291 46.701 20.267Q46.576 20.243 46.303 20.243L46.303 19.927L47.635 19.830L47.635 23.196Q47.635 23.390 47.800 23.440Q47.964 23.491 48.254 23.491L48.254 23.807M46.655 18.283Q46.655 18.077 46.804 17.927Q46.954 17.778 47.156 17.778Q47.288 17.778 47.404 17.848Q47.520 17.918 47.591 18.035Q47.661 18.151 47.661 18.283Q47.661 18.485 47.512 18.635Q47.362 18.784 47.156 18.784Q46.954 18.784 46.804 18.635Q46.655 18.485 46.655 18.283M50.759 23.789L49.428 20.542Q49.340 20.344 49.175 20.294Q49.010 20.243 48.707 20.243L48.707 19.927L50.632 19.927L50.632 20.243Q50.140 20.243 50.140 20.458Q50.140 20.480 50.157 20.542L51.172 23.016L52.082 20.792Q52.117 20.709 52.117 20.612Q52.117 20.441 51.994 20.342Q51.871 20.243 51.704 20.243L51.704 19.927L53.216 19.927L53.216 20.243Q52.930 20.243 52.717 20.386Q52.504 20.529 52.398 20.792L51.164 23.789Q51.120 23.908 50.992 23.908L50.931 23.908Q50.803 23.908 50.759 23.789\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.966 50.38)\">\u003Cpath d=\"M55.466 23.908Q54.907 23.908 54.435 23.625Q53.963 23.341 53.688 22.864Q53.413 22.388 53.413 21.834Q53.413 21.438 53.556 21.063Q53.699 20.687 53.956 20.399Q54.213 20.111 54.571 19.942Q54.929 19.773 55.334 19.773Q55.879 19.773 56.250 20.010Q56.621 20.247 56.808 20.665Q56.995 21.082 56.995 21.619Q56.995 21.671 56.971 21.709Q56.946 21.746 56.898 21.746L54.226 21.746L54.226 21.825Q54.226 22.572 54.538 23.095Q54.850 23.618 55.549 23.618Q55.953 23.618 56.274 23.361Q56.595 23.104 56.718 22.700Q56.736 22.620 56.819 22.620L56.898 22.620Q56.938 22.620 56.966 22.651Q56.995 22.682 56.995 22.726L56.995 22.761Q56.889 23.104 56.667 23.363Q56.446 23.622 56.131 23.765Q55.817 23.908 55.466 23.908M54.235 21.495L56.349 21.495Q56.349 21.227 56.296 20.981Q56.243 20.735 56.123 20.513Q56.002 20.291 55.804 20.164Q55.606 20.036 55.334 20.036Q54.991 20.036 54.738 20.261Q54.486 20.485 54.360 20.823Q54.235 21.161 54.235 21.495M59.750 23.807L57.518 23.807L57.518 23.491Q57.830 23.491 58.021 23.438Q58.212 23.385 58.212 23.196L58.212 20.748Q58.212 20.507 58.142 20.399Q58.071 20.291 57.937 20.267Q57.803 20.243 57.518 20.243L57.518 19.927L58.832 19.830L58.832 20.691Q58.994 20.300 59.262 20.065Q59.530 19.830 59.922 19.830Q60.194 19.830 60.409 19.993Q60.625 20.155 60.625 20.414Q60.625 20.590 60.506 20.709Q60.387 20.828 60.212 20.828Q60.031 20.828 59.913 20.709Q59.794 20.590 59.794 20.414Q59.794 20.199 59.948 20.089L59.930 20.089Q59.552 20.089 59.320 20.351Q59.087 20.612 58.988 20.999Q58.889 21.386 58.889 21.746L58.889 23.196Q58.889 23.385 59.146 23.438Q59.403 23.491 59.750 23.491L59.750 23.807M61.143 24.501Q61.143 24.189 61.372 23.950Q61.600 23.710 61.921 23.609Q61.741 23.469 61.646 23.260Q61.552 23.051 61.552 22.818Q61.552 22.405 61.829 22.071Q61.416 21.667 61.416 21.153Q61.416 20.762 61.635 20.463Q61.855 20.164 62.207 19.997Q62.558 19.830 62.936 19.830Q63.490 19.830 63.907 20.142Q64.096 19.949 64.358 19.839Q64.619 19.729 64.905 19.729Q65.107 19.729 65.241 19.872Q65.375 20.015 65.375 20.208Q65.375 20.335 65.292 20.414Q65.208 20.494 65.085 20.494Q64.966 20.494 64.883 20.414Q64.800 20.335 64.800 20.208Q64.800 20.133 64.808 20.107Q64.826 20.072 64.848 20.039Q64.870 20.006 64.879 19.993Q64.435 19.993 64.088 20.296Q64.448 20.678 64.448 21.153Q64.448 21.447 64.321 21.693Q64.193 21.939 63.980 22.115Q63.767 22.291 63.488 22.388Q63.209 22.484 62.936 22.484Q62.426 22.484 62.018 22.216Q61.890 22.388 61.890 22.594Q61.890 22.836 62.049 23.007Q62.207 23.179 62.440 23.179L63.204 23.179Q63.749 23.179 64.195 23.275Q64.641 23.372 64.940 23.662Q65.239 23.952 65.239 24.501Q65.239 25.081 64.553 25.371Q63.868 25.661 63.196 25.661Q62.523 25.661 61.833 25.371Q61.143 25.081 61.143 24.501M61.684 24.501Q61.684 24.796 61.936 24.994Q62.189 25.191 62.550 25.286Q62.910 25.380 63.196 25.380Q63.696 25.380 64.197 25.154Q64.698 24.928 64.698 24.501Q64.698 24.044 64.257 23.912Q63.815 23.781 63.204 23.781L62.440 23.781Q62.246 23.781 62.068 23.875Q61.890 23.970 61.787 24.134Q61.684 24.299 61.684 24.501M62.927 22.203L62.936 22.203Q63.718 22.203 63.718 21.153Q63.718 20.107 62.936 20.107Q62.145 20.107 62.145 21.153Q62.145 22.203 62.927 22.203M67.814 23.908Q67.256 23.908 66.784 23.625Q66.311 23.341 66.037 22.864Q65.762 22.388 65.762 21.834Q65.762 21.438 65.905 21.063Q66.048 20.687 66.305 20.399Q66.562 20.111 66.920 19.942Q67.278 19.773 67.682 19.773Q68.227 19.773 68.599 20.010Q68.970 20.247 69.157 20.665Q69.343 21.082 69.343 21.619Q69.343 21.671 69.319 21.709Q69.295 21.746 69.247 21.746L66.575 21.746L66.575 21.825Q66.575 22.572 66.887 23.095Q67.199 23.618 67.898 23.618Q68.302 23.618 68.623 23.361Q68.944 23.104 69.067 22.700Q69.084 22.620 69.168 22.620L69.247 22.620Q69.286 22.620 69.315 22.651Q69.343 22.682 69.343 22.726L69.343 22.761Q69.238 23.104 69.016 23.363Q68.794 23.622 68.480 23.765Q68.166 23.908 67.814 23.908M66.584 21.495L68.697 21.495Q68.697 21.227 68.645 20.981Q68.592 20.735 68.471 20.513Q68.350 20.291 68.153 20.164Q67.955 20.036 67.682 20.036Q67.340 20.036 67.087 20.261Q66.834 20.485 66.709 20.823Q66.584 21.161 66.584 21.495M72.002 23.807L69.915 23.807L69.915 23.491Q70.222 23.491 70.414 23.438Q70.605 23.385 70.605 23.196L70.605 20.748Q70.605 20.507 70.534 20.399Q70.464 20.291 70.330 20.267Q70.196 20.243 69.915 20.243L69.915 19.927L71.255 19.830L71.255 20.665Q71.453 20.283 71.807 20.056Q72.160 19.830 72.587 19.830Q73.865 19.830 73.865 21.043L73.865 23.196Q73.865 23.385 74.057 23.438Q74.248 23.491 74.555 23.491L74.555 23.807L72.468 23.807L72.468 23.491Q72.780 23.491 72.971 23.438Q73.162 23.385 73.162 23.196L73.162 21.078Q73.162 20.819 73.118 20.597Q73.074 20.375 72.929 20.232Q72.784 20.089 72.525 20.089Q72.182 20.089 71.901 20.278Q71.620 20.467 71.464 20.779Q71.308 21.091 71.308 21.438L71.308 23.196Q71.308 23.385 71.501 23.438Q71.695 23.491 72.002 23.491L72.002 23.807M77.065 23.908Q76.515 23.908 76.056 23.629Q75.597 23.350 75.329 22.880Q75.061 22.410 75.061 21.865Q75.061 21.452 75.210 21.074Q75.360 20.696 75.634 20.401Q75.909 20.107 76.278 19.940Q76.647 19.773 77.065 19.773Q77.399 19.773 77.719 19.839Q78.040 19.905 78.269 20.091Q78.497 20.278 78.497 20.603Q78.497 20.779 78.370 20.907Q78.242 21.034 78.067 21.034Q77.882 21.034 77.752 20.909Q77.623 20.784 77.623 20.603Q77.623 20.467 77.697 20.355Q77.772 20.243 77.904 20.190Q77.596 20.063 77.065 20.063Q76.630 20.063 76.362 20.340Q76.093 20.617 75.981 21.032Q75.869 21.447 75.869 21.865Q75.869 22.295 76.008 22.697Q76.146 23.099 76.441 23.359Q76.735 23.618 77.175 23.618Q77.596 23.618 77.900 23.368Q78.203 23.117 78.308 22.708Q78.317 22.678 78.341 22.653Q78.365 22.629 78.396 22.629L78.506 22.629Q78.594 22.629 78.594 22.744Q78.449 23.280 78.036 23.594Q77.623 23.908 77.065 23.908M81.169 23.908Q80.611 23.908 80.139 23.625Q79.666 23.341 79.392 22.864Q79.117 22.388 79.117 21.834Q79.117 21.438 79.260 21.063Q79.403 20.687 79.660 20.399Q79.917 20.111 80.275 19.942Q80.633 19.773 81.037 19.773Q81.582 19.773 81.954 20.010Q82.325 20.247 82.512 20.665Q82.698 21.082 82.698 21.619Q82.698 21.671 82.674 21.709Q82.650 21.746 82.602 21.746L79.930 21.746L79.930 21.825Q79.930 22.572 80.242 23.095Q80.554 23.618 81.253 23.618Q81.657 23.618 81.978 23.361Q82.299 23.104 82.422 22.700Q82.439 22.620 82.523 22.620L82.602 22.620Q82.641 22.620 82.670 22.651Q82.698 22.682 82.698 22.726L82.698 22.761Q82.593 23.104 82.371 23.363Q82.149 23.622 81.835 23.765Q81.521 23.908 81.169 23.908M79.939 21.495L82.052 21.495Q82.052 21.227 82 20.981Q81.947 20.735 81.826 20.513Q81.705 20.291 81.508 20.164Q81.310 20.036 81.037 20.036Q80.695 20.036 80.442 20.261Q80.189 20.485 80.064 20.823Q79.939 21.161 79.939 21.495\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.966 50.38)\">\u003Cpath d=\"M14.284 34.825L14.284 33.383Q14.284 33.352 14.312 33.328Q14.341 33.304 14.372 33.304L14.481 33.304Q14.517 33.304 14.539 33.326Q14.560 33.348 14.569 33.383Q14.829 34.644 15.795 34.644Q16.222 34.644 16.516 34.460Q16.810 34.275 16.810 33.871Q16.810 33.577 16.580 33.381Q16.349 33.185 16.037 33.124L15.435 33.005Q14.969 32.917 14.626 32.634Q14.284 32.350 14.284 31.911Q14.284 31.318 14.721 31.045Q15.158 30.773 15.795 30.773Q16.274 30.773 16.622 31.019L16.872 30.795Q16.929 30.773 16.929 30.773L16.982 30.773Q17.008 30.773 17.041 30.799Q17.074 30.826 17.074 30.856L17.074 32.016Q17.074 32.047 17.039 32.074Q17.004 32.100 16.982 32.100L16.872 32.100Q16.850 32.100 16.817 32.071Q16.784 32.043 16.784 32.016Q16.784 31.551 16.518 31.280Q16.252 31.010 15.787 31.010Q15.382 31.010 15.079 31.155Q14.776 31.300 14.776 31.656Q14.776 31.902 14.993 32.056Q15.211 32.210 15.488 32.267L16.116 32.394Q16.433 32.456 16.703 32.623Q16.973 32.790 17.140 33.056Q17.307 33.322 17.307 33.638Q17.307 34.280 16.881 34.594Q16.455 34.908 15.795 34.908Q15.523 34.908 15.257 34.814Q14.991 34.719 14.811 34.530L14.490 34.869Q14.473 34.908 14.424 34.908L14.372 34.908Q14.350 34.908 14.317 34.880Q14.284 34.851 14.284 34.825M17.878 32.900Q17.878 32.333 18.151 31.845Q18.423 31.357 18.893 31.065Q19.364 30.773 19.931 30.773Q20.352 30.773 20.728 30.942Q21.104 31.111 21.381 31.403Q21.658 31.696 21.816 32.091Q21.974 32.487 21.974 32.900Q21.974 33.449 21.695 33.911Q21.416 34.372 20.948 34.640Q20.480 34.908 19.931 34.908Q19.377 34.908 18.907 34.640Q18.436 34.372 18.157 33.911Q17.878 33.449 17.878 32.900M19.931 34.618Q20.427 34.618 20.704 34.357Q20.981 34.095 21.073 33.691Q21.165 33.286 21.165 32.790Q21.165 32.315 21.067 31.926Q20.968 31.537 20.695 31.287Q20.423 31.036 19.931 31.036Q19.219 31.036 18.955 31.531Q18.691 32.025 18.691 32.790Q18.691 33.590 18.946 34.104Q19.201 34.618 19.931 34.618M24.606 34.807L22.545 34.807L22.545 34.491Q22.853 34.491 23.044 34.438Q23.235 34.385 23.235 34.196L23.235 29.481Q23.235 29.239 23.165 29.131Q23.095 29.024 22.961 29Q22.827 28.975 22.545 28.975L22.545 28.659L23.912 28.562L23.912 34.196Q23.912 34.385 24.105 34.438Q24.299 34.491 24.606 34.491L24.606 34.807M27.098 34.807L25.112 34.807L25.112 34.491Q25.419 34.491 25.611 34.438Q25.802 34.385 25.802 34.196L25.802 31.748Q25.802 31.502 25.736 31.397Q25.670 31.291 25.545 31.267Q25.419 31.243 25.147 31.243L25.147 30.927L26.478 30.830L26.478 34.196Q26.478 34.390 26.643 34.440Q26.808 34.491 27.098 34.491L27.098 34.807M25.498 29.283Q25.498 29.077 25.648 28.927Q25.797 28.778 25.999 28.778Q26.131 28.778 26.248 28.848Q26.364 28.918 26.434 29.035Q26.505 29.151 26.505 29.283Q26.505 29.485 26.355 29.635Q26.206 29.784 25.999 29.784Q25.797 29.784 25.648 29.635Q25.498 29.485 25.498 29.283M29.621 34.908Q29.076 34.908 28.632 34.625Q28.188 34.341 27.933 33.869Q27.678 33.396 27.678 32.865Q27.678 32.311 27.955 31.845Q28.232 31.379 28.704 31.105Q29.177 30.830 29.722 30.830Q30.056 30.830 30.359 30.962Q30.662 31.094 30.882 31.331L30.882 29.481Q30.882 29.239 30.811 29.131Q30.741 29.024 30.607 29Q30.473 28.975 30.187 28.975L30.187 28.659L31.554 28.562L31.554 33.990Q31.554 34.227 31.624 34.335Q31.695 34.442 31.831 34.466Q31.967 34.491 32.248 34.491L32.248 34.807L30.855 34.908L30.855 34.359Q30.605 34.622 30.286 34.765Q29.968 34.908 29.621 34.908M29.682 34.644Q30.051 34.644 30.361 34.433Q30.671 34.223 30.855 33.880L30.855 31.748Q30.684 31.445 30.403 31.267Q30.122 31.089 29.783 31.089Q29.093 31.089 28.790 31.610Q28.487 32.131 28.487 32.873Q28.487 33.594 28.757 34.119Q29.027 34.644 29.682 34.644M33.409 36.411Q33.409 36.371 33.444 36.336Q33.769 36.024 33.949 35.618Q34.129 35.211 34.129 34.763L34.129 34.680Q33.989 34.807 33.787 34.807Q33.642 34.807 33.527 34.741Q33.413 34.675 33.347 34.563Q33.281 34.451 33.281 34.302Q33.281 34.082 33.422 33.941Q33.562 33.801 33.787 33.801Q34.107 33.801 34.248 34.099Q34.389 34.398 34.389 34.763Q34.389 35.273 34.184 35.728Q33.980 36.182 33.615 36.534Q33.580 36.552 33.554 36.552Q33.497 36.552 33.453 36.508Q33.409 36.464 33.409 36.411\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.966 50.38)\">\u003Cpath d=\"M39.415 34.807L39.125 34.807L39.125 29.481Q39.125 29.239 39.055 29.131Q38.984 29.024 38.850 29Q38.716 28.975 38.430 28.975L38.430 28.659L39.802 28.562L39.802 31.362Q40.048 31.111 40.382 30.971Q40.716 30.830 41.067 30.830Q41.467 30.830 41.830 30.993Q42.192 31.155 42.449 31.434Q42.706 31.713 42.856 32.091Q43.005 32.469 43.005 32.865Q43.005 33.427 42.728 33.893Q42.451 34.359 41.977 34.633Q41.502 34.908 40.953 34.908Q40.588 34.908 40.267 34.739Q39.947 34.570 39.727 34.275L39.415 34.807M39.828 31.775L39.828 33.906Q39.986 34.240 40.270 34.442Q40.553 34.644 40.896 34.644Q41.586 34.644 41.889 34.124Q42.192 33.603 42.192 32.865Q42.192 32.140 41.926 31.614Q41.660 31.089 40.997 31.089Q40.637 31.089 40.322 31.274Q40.008 31.458 39.828 31.775\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.966 50.38)\">\u003Cpath d=\"M43.835 32.900Q43.835 32.333 44.108 31.845Q44.380 31.357 44.850 31.065Q45.321 30.773 45.888 30.773Q46.309 30.773 46.685 30.942Q47.061 31.111 47.338 31.403Q47.615 31.696 47.773 32.091Q47.931 32.487 47.931 32.900Q47.931 33.449 47.652 33.911Q47.373 34.372 46.905 34.640Q46.437 34.908 45.888 34.908Q45.334 34.908 44.864 34.640Q44.393 34.372 44.114 33.911Q43.835 33.449 43.835 32.900M45.888 34.618Q46.384 34.618 46.661 34.357Q46.938 34.095 47.030 33.691Q47.122 33.286 47.122 32.790Q47.122 32.315 47.024 31.926Q46.925 31.537 46.652 31.287Q46.380 31.036 45.888 31.036Q45.176 31.036 44.912 31.531Q44.648 32.025 44.648 32.790Q44.648 33.590 44.903 34.104Q45.158 34.618 45.888 34.618M49.183 33.735L49.183 31.748Q49.183 31.507 49.113 31.399Q49.043 31.291 48.909 31.267Q48.775 31.243 48.493 31.243L48.493 30.927L49.887 30.830L49.887 33.700Q49.887 34.078 49.933 34.264Q49.979 34.451 50.150 34.548Q50.322 34.644 50.678 34.644Q51.012 34.644 51.251 34.453Q51.491 34.262 51.616 33.959Q51.741 33.656 51.741 33.339L51.741 31.748Q51.741 31.507 51.671 31.399Q51.600 31.291 51.466 31.267Q51.332 31.243 51.047 31.243L51.047 30.927L52.444 30.830L52.444 33.990Q52.444 34.227 52.514 34.335Q52.585 34.442 52.719 34.466Q52.853 34.491 53.134 34.491L53.134 34.807L51.767 34.908L51.767 34.187Q51.600 34.513 51.295 34.710Q50.990 34.908 50.634 34.908Q49.974 34.908 49.579 34.638Q49.183 34.368 49.183 33.735M55.718 34.807L53.631 34.807L53.631 34.491Q53.938 34.491 54.129 34.438Q54.321 34.385 54.321 34.196L54.321 31.748Q54.321 31.507 54.250 31.399Q54.180 31.291 54.046 31.267Q53.912 31.243 53.631 31.243L53.631 30.927L54.971 30.830L54.971 31.665Q55.169 31.283 55.523 31.056Q55.876 30.830 56.303 30.830Q57.581 30.830 57.581 32.043L57.581 34.196Q57.581 34.385 57.773 34.438Q57.964 34.491 58.271 34.491L58.271 34.807L56.184 34.807L56.184 34.491Q56.496 34.491 56.687 34.438Q56.878 34.385 56.878 34.196L56.878 32.078Q56.878 31.819 56.834 31.597Q56.790 31.375 56.645 31.232Q56.500 31.089 56.241 31.089Q55.898 31.089 55.617 31.278Q55.336 31.467 55.180 31.779Q55.024 32.091 55.024 32.438L55.024 34.196Q55.024 34.385 55.217 34.438Q55.410 34.491 55.718 34.491L55.718 34.807M60.719 34.908Q60.174 34.908 59.730 34.625Q59.286 34.341 59.032 33.869Q58.777 33.396 58.777 32.865Q58.777 32.311 59.054 31.845Q59.330 31.379 59.803 31.105Q60.275 30.830 60.820 30.830Q61.154 30.830 61.457 30.962Q61.761 31.094 61.980 31.331L61.980 29.481Q61.980 29.239 61.910 29.131Q61.840 29.024 61.706 29Q61.572 28.975 61.286 28.975L61.286 28.659L62.653 28.562L62.653 33.990Q62.653 34.227 62.723 34.335Q62.793 34.442 62.930 34.466Q63.066 34.491 63.347 34.491L63.347 34.807L61.954 34.908L61.954 34.359Q61.703 34.622 61.385 34.765Q61.066 34.908 60.719 34.908M60.781 34.644Q61.150 34.644 61.460 34.433Q61.769 34.223 61.954 33.880L61.954 31.748Q61.783 31.445 61.501 31.267Q61.220 31.089 60.882 31.089Q60.192 31.089 59.889 31.610Q59.585 32.131 59.585 32.873Q59.585 33.594 59.856 34.119Q60.126 34.644 60.781 34.644M63.975 33.897Q63.975 33.357 64.408 33.023Q64.841 32.689 65.448 32.550Q66.054 32.412 66.586 32.412L66.586 32.078Q66.586 31.819 66.467 31.575Q66.348 31.331 66.140 31.184Q65.931 31.036 65.659 31.036Q65.096 31.036 64.784 31.234Q64.933 31.261 65.026 31.379Q65.118 31.498 65.118 31.656Q65.118 31.832 64.993 31.962Q64.868 32.091 64.687 32.091Q64.498 32.091 64.371 31.964Q64.243 31.836 64.243 31.656Q64.243 31.186 64.683 30.979Q65.122 30.773 65.659 30.773Q65.949 30.773 66.236 30.861Q66.524 30.949 66.757 31.109Q66.990 31.269 67.139 31.509Q67.289 31.748 67.289 32.043L67.289 34.078Q67.289 34.231 67.364 34.370Q67.438 34.508 67.583 34.508Q67.737 34.508 67.810 34.372Q67.882 34.236 67.882 34.078L67.882 33.502L68.168 33.502L68.168 34.078Q68.168 34.411 67.920 34.636Q67.671 34.860 67.342 34.860Q67.082 34.860 66.900 34.666Q66.718 34.473 66.674 34.196Q66.507 34.517 66.173 34.713Q65.839 34.908 65.470 34.908Q64.916 34.908 64.446 34.660Q63.975 34.411 63.975 33.897M64.731 33.897Q64.731 34.209 64.973 34.427Q65.215 34.644 65.531 34.644Q65.966 34.644 66.276 34.335Q66.586 34.025 66.586 33.594L66.586 32.667Q66.168 32.667 65.742 32.794Q65.316 32.922 65.024 33.199Q64.731 33.475 64.731 33.897M70.708 34.807L68.475 34.807L68.475 34.491Q68.787 34.491 68.979 34.438Q69.170 34.385 69.170 34.196L69.170 31.748Q69.170 31.507 69.099 31.399Q69.029 31.291 68.895 31.267Q68.761 31.243 68.475 31.243L68.475 30.927L69.789 30.830L69.789 31.691Q69.952 31.300 70.220 31.065Q70.488 30.830 70.879 30.830Q71.152 30.830 71.367 30.993Q71.582 31.155 71.582 31.414Q71.582 31.590 71.464 31.709Q71.345 31.828 71.169 31.828Q70.989 31.828 70.870 31.709Q70.752 31.590 70.752 31.414Q70.752 31.199 70.906 31.089L70.888 31.089Q70.510 31.089 70.277 31.351Q70.044 31.612 69.945 31.999Q69.847 32.386 69.847 32.746L69.847 34.196Q69.847 34.385 70.104 34.438Q70.361 34.491 70.708 34.491L70.708 34.807M72.518 36.284Q72.685 36.389 72.866 36.389Q73.191 36.389 73.428 36.145Q73.665 35.901 73.815 35.554L74.118 34.807L72.751 31.542Q72.659 31.344 72.496 31.294Q72.334 31.243 72.031 31.243L72.031 30.927L73.955 30.927L73.955 31.243Q73.463 31.243 73.463 31.458Q73.463 31.480 73.481 31.542L74.487 33.932L75.388 31.792Q75.423 31.709 75.423 31.603Q75.423 31.441 75.302 31.342Q75.181 31.243 75.019 31.243L75.019 30.927L76.522 30.927L76.522 31.243Q76.236 31.243 76.023 31.386Q75.810 31.529 75.704 31.792L74.118 35.554Q73.929 36.007 73.615 36.330Q73.301 36.653 72.866 36.653Q72.540 36.653 72.281 36.433Q72.022 36.213 72.022 35.888Q72.022 35.721 72.140 35.607Q72.259 35.493 72.426 35.493Q72.540 35.493 72.630 35.543Q72.721 35.594 72.771 35.682Q72.822 35.769 72.822 35.888Q72.822 36.033 72.740 36.143Q72.659 36.253 72.518 36.284\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-46.966 50.38)\">\u003Cpath d=\"M80.134 34.825L80.134 33.383Q80.134 33.352 80.162 33.328Q80.191 33.304 80.222 33.304L80.331 33.304Q80.367 33.304 80.388 33.326Q80.410 33.348 80.419 33.383Q80.679 34.644 81.645 34.644Q82.072 34.644 82.366 34.460Q82.660 34.275 82.660 33.871Q82.660 33.577 82.430 33.381Q82.199 33.185 81.887 33.124L81.285 33.005Q80.819 32.917 80.476 32.634Q80.134 32.350 80.134 31.911Q80.134 31.318 80.571 31.045Q81.008 30.773 81.645 30.773Q82.124 30.773 82.472 31.019L82.722 30.795Q82.779 30.773 82.779 30.773L82.832 30.773Q82.858 30.773 82.891 30.799Q82.924 30.826 82.924 30.856L82.924 32.016Q82.924 32.047 82.889 32.074Q82.854 32.100 82.832 32.100L82.722 32.100Q82.700 32.100 82.667 32.071Q82.634 32.043 82.634 32.016Q82.634 31.551 82.368 31.280Q82.102 31.010 81.637 31.010Q81.232 31.010 80.929 31.155Q80.626 31.300 80.626 31.656Q80.626 31.902 80.843 32.056Q81.061 32.210 81.338 32.267L81.966 32.394Q82.283 32.456 82.553 32.623Q82.823 32.790 82.990 33.056Q83.157 33.322 83.157 33.638Q83.157 34.280 82.731 34.594Q82.305 34.908 81.645 34.908Q81.373 34.908 81.107 34.814Q80.841 34.719 80.661 34.530L80.340 34.869Q80.323 34.908 80.274 34.908L80.222 34.908Q80.200 34.908 80.167 34.880Q80.134 34.851 80.134 34.825M84.458 33.735L84.458 31.748Q84.458 31.507 84.388 31.399Q84.317 31.291 84.183 31.267Q84.049 31.243 83.768 31.243L83.768 30.927L85.161 30.830L85.161 33.700Q85.161 34.078 85.207 34.264Q85.253 34.451 85.425 34.548Q85.596 34.644 85.952 34.644Q86.286 34.644 86.525 34.453Q86.765 34.262 86.890 33.959Q87.015 33.656 87.015 33.339L87.015 31.748Q87.015 31.507 86.945 31.399Q86.875 31.291 86.741 31.267Q86.607 31.243 86.321 31.243L86.321 30.927L87.719 30.830L87.719 33.990Q87.719 34.227 87.789 34.335Q87.859 34.442 87.993 34.466Q88.127 34.491 88.409 34.491L88.409 34.807L87.042 34.908L87.042 34.187Q86.875 34.513 86.569 34.710Q86.264 34.908 85.908 34.908Q85.249 34.908 84.853 34.638Q84.458 34.368 84.458 33.735M91.089 34.807L88.857 34.807L88.857 34.491Q89.169 34.491 89.360 34.438Q89.551 34.385 89.551 34.196L89.551 31.748Q89.551 31.507 89.481 31.399Q89.410 31.291 89.276 31.267Q89.142 31.243 88.857 31.243L88.857 30.927L90.171 30.830L90.171 31.691Q90.333 31.300 90.601 31.065Q90.869 30.830 91.261 30.830Q91.533 30.830 91.748 30.993Q91.964 31.155 91.964 31.414Q91.964 31.590 91.845 31.709Q91.726 31.828 91.551 31.828Q91.370 31.828 91.252 31.709Q91.133 31.590 91.133 31.414Q91.133 31.199 91.287 31.089L91.269 31.089Q90.891 31.089 90.659 31.351Q90.426 31.612 90.327 31.999Q90.228 32.386 90.228 32.746L90.228 34.196Q90.228 34.385 90.485 34.438Q90.742 34.491 91.089 34.491L91.089 34.807M94.763 34.807L92.531 34.807L92.531 34.491Q92.838 34.491 93.029 34.438Q93.221 34.385 93.221 34.196L93.221 31.243L92.531 31.243L92.531 30.927L93.221 30.927L93.221 29.859Q93.221 29.476 93.434 29.153Q93.647 28.830 94.001 28.646Q94.354 28.461 94.732 28.461Q95.053 28.461 95.304 28.639Q95.554 28.817 95.554 29.129Q95.554 29.305 95.435 29.424Q95.317 29.542 95.141 29.542Q94.961 29.542 94.838 29.424Q94.715 29.305 94.715 29.129Q94.715 28.888 94.930 28.760Q94.825 28.725 94.688 28.725Q94.420 28.725 94.238 28.907Q94.055 29.090 93.963 29.360Q93.871 29.630 93.871 29.894L93.871 30.927L94.921 30.927L94.921 31.243L93.897 31.243L93.897 34.196Q93.897 34.385 94.154 34.438Q94.411 34.491 94.763 34.491L94.763 34.807M95.418 33.897Q95.418 33.357 95.851 33.023Q96.284 32.689 96.890 32.550Q97.496 32.412 98.028 32.412L98.028 32.078Q98.028 31.819 97.909 31.575Q97.791 31.331 97.582 31.184Q97.373 31.036 97.101 31.036Q96.538 31.036 96.226 31.234Q96.376 31.261 96.468 31.379Q96.560 31.498 96.560 31.656Q96.560 31.832 96.435 31.962Q96.310 32.091 96.130 32.091Q95.941 32.091 95.813 31.964Q95.686 31.836 95.686 31.656Q95.686 31.186 96.125 30.979Q96.565 30.773 97.101 30.773Q97.391 30.773 97.679 30.861Q97.967 30.949 98.200 31.109Q98.432 31.269 98.582 31.509Q98.731 31.748 98.731 32.043L98.731 34.078Q98.731 34.231 98.806 34.370Q98.881 34.508 99.026 34.508Q99.180 34.508 99.252 34.372Q99.325 34.236 99.325 34.078L99.325 33.502L99.610 33.502L99.610 34.078Q99.610 34.411 99.362 34.636Q99.114 34.860 98.784 34.860Q98.525 34.860 98.342 34.666Q98.160 34.473 98.116 34.196Q97.949 34.517 97.615 34.713Q97.281 34.908 96.912 34.908Q96.358 34.908 95.888 34.660Q95.418 34.411 95.418 33.897M96.174 33.897Q96.174 34.209 96.415 34.427Q96.657 34.644 96.973 34.644Q97.409 34.644 97.718 34.335Q98.028 34.025 98.028 33.594L98.028 32.667Q97.611 32.667 97.184 32.794Q96.758 32.922 96.466 33.199Q96.174 33.475 96.174 33.897M101.979 34.908Q101.430 34.908 100.970 34.629Q100.511 34.350 100.243 33.880Q99.975 33.410 99.975 32.865Q99.975 32.452 100.124 32.074Q100.274 31.696 100.548 31.401Q100.823 31.107 101.192 30.940Q101.561 30.773 101.979 30.773Q102.313 30.773 102.634 30.839Q102.954 30.905 103.183 31.091Q103.411 31.278 103.411 31.603Q103.411 31.779 103.284 31.907Q103.157 32.034 102.981 32.034Q102.796 32.034 102.667 31.909Q102.537 31.784 102.537 31.603Q102.537 31.467 102.612 31.355Q102.686 31.243 102.818 31.190Q102.511 31.063 101.979 31.063Q101.544 31.063 101.276 31.340Q101.008 31.617 100.896 32.032Q100.784 32.447 100.784 32.865Q100.784 33.295 100.922 33.697Q101.060 34.099 101.355 34.359Q101.649 34.618 102.089 34.618Q102.511 34.618 102.814 34.368Q103.117 34.117 103.222 33.708Q103.231 33.678 103.255 33.653Q103.280 33.629 103.310 33.629L103.420 33.629Q103.508 33.629 103.508 33.744Q103.363 34.280 102.950 34.594Q102.537 34.908 101.979 34.908M106.083 34.908Q105.525 34.908 105.053 34.625Q104.580 34.341 104.306 33.864Q104.031 33.388 104.031 32.834Q104.031 32.438 104.174 32.063Q104.317 31.687 104.574 31.399Q104.831 31.111 105.189 30.942Q105.547 30.773 105.951 30.773Q106.496 30.773 106.868 31.010Q107.239 31.247 107.426 31.665Q107.613 32.082 107.613 32.619Q107.613 32.671 107.588 32.709Q107.564 32.746 107.516 32.746L104.844 32.746L104.844 32.825Q104.844 33.572 105.156 34.095Q105.468 34.618 106.167 34.618Q106.571 34.618 106.892 34.361Q107.213 34.104 107.336 33.700Q107.353 33.620 107.437 33.620L107.516 33.620Q107.555 33.620 107.584 33.651Q107.613 33.682 107.613 33.726L107.613 33.761Q107.507 34.104 107.285 34.363Q107.063 34.622 106.749 34.765Q106.435 34.908 106.083 34.908M104.853 32.495L106.967 32.495Q106.967 32.227 106.914 31.981Q106.861 31.735 106.740 31.513Q106.619 31.291 106.422 31.164Q106.224 31.036 105.951 31.036Q105.609 31.036 105.356 31.261Q105.103 31.485 104.978 31.823Q104.853 32.161 104.853 32.495\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M13.976-45.904v18.309\"\u002F>\u003Cpath fill=\"none\" d=\"M17.099-29.755c-1.874.467-2.758 1.51-3.123 2.56-.364-1.05-1.249-2.093-3.122-2.56\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M13.976-.33V17.68\"\u002F>\u003Cpath fill=\"none\" d=\"M17.099 15.519c-1.874.467-2.758 1.51-3.123 2.56-.364-1.05-1.249-2.093-3.122-2.56\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M13.976 45.445v18.058\"\u002F>\u003Cpath fill=\"none\" d=\"M17.099 61.343c-1.874.468-2.758 1.51-3.123 2.56-.364-1.05-1.249-2.092-3.122-2.56\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr9\" font-size=\"9\">\u003Cg transform=\"translate(86.046 -68.007)\">\u003Cpath d=\"M14.345 33.897Q14.345 33.357 14.778 33.023Q15.211 32.689 15.817 32.550Q16.424 32.412 16.955 32.412L16.955 32.078Q16.955 31.819 16.837 31.575Q16.718 31.331 16.509 31.184Q16.301 31.036 16.028 31.036Q15.466 31.036 15.154 31.234Q15.303 31.261 15.395 31.379Q15.488 31.498 15.488 31.656Q15.488 31.832 15.362 31.962Q15.237 32.091 15.057 32.091Q14.868 32.091 14.741 31.964Q14.613 31.836 14.613 31.656Q14.613 31.186 15.053 30.979Q15.492 30.773 16.028 30.773Q16.318 30.773 16.606 30.861Q16.894 30.949 17.127 31.109Q17.360 31.269 17.509 31.509Q17.659 31.748 17.659 32.043L17.659 34.078Q17.659 34.231 17.733 34.370Q17.808 34.508 17.953 34.508Q18.107 34.508 18.179 34.372Q18.252 34.236 18.252 34.078L18.252 33.502L18.538 33.502L18.538 34.078Q18.538 34.411 18.289 34.636Q18.041 34.860 17.711 34.860Q17.452 34.860 17.270 34.666Q17.087 34.473 17.043 34.196Q16.876 34.517 16.542 34.713Q16.208 34.908 15.839 34.908Q15.286 34.908 14.815 34.660Q14.345 34.411 14.345 33.897M15.101 33.897Q15.101 34.209 15.343 34.427Q15.584 34.644 15.901 34.644Q16.336 34.644 16.646 34.335Q16.955 34.025 16.955 33.594L16.955 32.667Q16.538 32.667 16.112 32.794Q15.685 32.922 15.393 33.199Q15.101 33.475 15.101 33.897M20.845 34.908Q20.300 34.908 19.856 34.625Q19.412 34.341 19.157 33.869Q18.902 33.396 18.902 32.865Q18.902 32.311 19.179 31.845Q19.456 31.379 19.928 31.105Q20.401 30.830 20.946 30.830Q21.280 30.830 21.583 30.962Q21.886 31.094 22.106 31.331L22.106 29.481Q22.106 29.239 22.036 29.131Q21.965 29.024 21.831 29Q21.697 28.975 21.412 28.975L21.412 28.659L22.778 28.562L22.778 33.990Q22.778 34.227 22.849 34.335Q22.919 34.442 23.055 34.466Q23.191 34.491 23.473 34.491L23.473 34.807L22.080 34.908L22.080 34.359Q21.829 34.622 21.510 34.765Q21.192 34.908 20.845 34.908M20.906 34.644Q21.275 34.644 21.585 34.433Q21.895 34.223 22.080 33.880L22.080 31.748Q21.908 31.445 21.627 31.267Q21.346 31.089 21.007 31.089Q20.317 31.089 20.014 31.610Q19.711 32.131 19.711 32.873Q19.711 33.594 19.981 34.119Q20.251 34.644 20.906 34.644M25.982 34.908Q25.437 34.908 24.993 34.625Q24.549 34.341 24.294 33.869Q24.039 33.396 24.039 32.865Q24.039 32.311 24.316 31.845Q24.593 31.379 25.066 31.105Q25.538 30.830 26.083 30.830Q26.417 30.830 26.720 30.962Q27.023 31.094 27.243 31.331L27.243 29.481Q27.243 29.239 27.173 29.131Q27.102 29.024 26.968 29Q26.834 28.975 26.549 28.975L26.549 28.659L27.915 28.562L27.915 33.990Q27.915 34.227 27.986 34.335Q28.056 34.442 28.192 34.466Q28.329 34.491 28.610 34.491L28.610 34.807L27.217 34.908L27.217 34.359Q26.966 34.622 26.648 34.765Q26.329 34.908 25.982 34.908M26.043 34.644Q26.413 34.644 26.722 34.433Q27.032 34.223 27.217 33.880L27.217 31.748Q27.045 31.445 26.764 31.267Q26.483 31.089 26.144 31.089Q25.455 31.089 25.151 31.610Q24.848 32.131 24.848 32.873Q24.848 33.594 25.118 34.119Q25.389 34.644 26.043 34.644\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(86.046 -68.007)\">\u003Cpath d=\"M32.331 33.897Q32.331 33.357 32.764 33.023Q33.197 32.689 33.803 32.550Q34.410 32.412 34.941 32.412L34.941 32.078Q34.941 31.819 34.823 31.575Q34.704 31.331 34.495 31.184Q34.287 31.036 34.014 31.036Q33.452 31.036 33.140 31.234Q33.289 31.261 33.381 31.379Q33.474 31.498 33.474 31.656Q33.474 31.832 33.348 31.962Q33.223 32.091 33.043 32.091Q32.854 32.091 32.727 31.964Q32.599 31.836 32.599 31.656Q32.599 31.186 33.039 30.979Q33.478 30.773 34.014 30.773Q34.304 30.773 34.592 30.861Q34.880 30.949 35.113 31.109Q35.346 31.269 35.495 31.509Q35.645 31.748 35.645 32.043L35.645 34.078Q35.645 34.231 35.719 34.370Q35.794 34.508 35.939 34.508Q36.093 34.508 36.165 34.372Q36.238 34.236 36.238 34.078L36.238 33.502L36.524 33.502L36.524 34.078Q36.524 34.411 36.275 34.636Q36.027 34.860 35.697 34.860Q35.438 34.860 35.256 34.666Q35.073 34.473 35.029 34.196Q34.862 34.517 34.528 34.713Q34.194 34.908 33.825 34.908Q33.272 34.908 32.801 34.660Q32.331 34.411 32.331 33.897M33.087 33.897Q33.087 34.209 33.329 34.427Q33.570 34.644 33.887 34.644Q34.322 34.644 34.632 34.335Q34.941 34.025 34.941 33.594L34.941 32.667Q34.524 32.667 34.098 32.794Q33.671 32.922 33.379 33.199Q33.087 33.475 33.087 33.897\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(86.046 -68.007)\">\u003Cpath d=\"M41.921 34.908Q41.376 34.908 40.932 34.625Q40.488 34.341 40.233 33.869Q39.979 33.396 39.979 32.865Q39.979 32.311 40.255 31.845Q40.532 31.379 41.005 31.105Q41.477 30.830 42.022 30.830Q42.356 30.830 42.659 30.962Q42.963 31.094 43.182 31.331L43.182 29.481Q43.182 29.239 43.112 29.131Q43.042 29.024 42.908 29Q42.774 28.975 42.488 28.975L42.488 28.659L43.855 28.562L43.855 33.990Q43.855 34.227 43.925 34.335Q43.995 34.442 44.131 34.466Q44.268 34.491 44.549 34.491L44.549 34.807L43.156 34.908L43.156 34.359Q42.905 34.622 42.587 34.765Q42.268 34.908 41.921 34.908M41.983 34.644Q42.352 34.644 42.661 34.433Q42.971 34.223 43.156 33.880L43.156 31.748Q42.984 31.445 42.703 31.267Q42.422 31.089 42.084 31.089Q41.394 31.089 41.090 31.610Q40.787 32.131 40.787 32.873Q40.787 33.594 41.057 34.119Q41.328 34.644 41.983 34.644M47.102 34.807L45.116 34.807L45.116 34.491Q45.423 34.491 45.615 34.438Q45.806 34.385 45.806 34.196L45.806 31.748Q45.806 31.502 45.740 31.397Q45.674 31.291 45.549 31.267Q45.423 31.243 45.151 31.243L45.151 30.927L46.483 30.830L46.483 34.196Q46.483 34.390 46.647 34.440Q46.812 34.491 47.102 34.491L47.102 34.807M45.503 29.283Q45.503 29.077 45.652 28.927Q45.801 28.778 46.004 28.778Q46.135 28.778 46.252 28.848Q46.368 28.918 46.439 29.035Q46.509 29.151 46.509 29.283Q46.509 29.485 46.359 29.635Q46.210 29.784 46.004 29.784Q45.801 29.784 45.652 29.635Q45.503 29.485 45.503 29.283M49.761 34.807L47.673 34.807L47.673 34.491Q47.981 34.491 48.172 34.438Q48.363 34.385 48.363 34.196L48.363 31.748Q48.363 31.507 48.293 31.399Q48.223 31.291 48.089 31.267Q47.955 31.243 47.673 31.243L47.673 30.927L49.014 30.830L49.014 31.665Q49.212 31.287 49.572 31.058Q49.932 30.830 50.354 30.830Q51.400 30.830 51.585 31.639Q51.787 31.269 52.145 31.050Q52.503 30.830 52.921 30.830Q53.545 30.830 53.870 31.124Q54.195 31.419 54.195 32.043L54.195 34.196Q54.195 34.385 54.388 34.438Q54.582 34.491 54.889 34.491L54.889 34.807L52.802 34.807L52.802 34.491Q53.109 34.491 53.303 34.438Q53.496 34.385 53.496 34.196L53.496 32.078Q53.496 31.647 53.369 31.368Q53.241 31.089 52.855 31.089Q52.512 31.089 52.228 31.278Q51.945 31.467 51.789 31.779Q51.633 32.091 51.633 32.438L51.633 34.196Q51.633 34.385 51.824 34.438Q52.015 34.491 52.323 34.491L52.323 34.807L50.235 34.807L50.235 34.491Q50.547 34.491 50.739 34.438Q50.930 34.385 50.930 34.196L50.930 32.078Q50.930 31.819 50.886 31.597Q50.842 31.375 50.697 31.232Q50.552 31.089 50.293 31.089Q49.756 31.089 49.411 31.496Q49.067 31.902 49.067 32.438L49.067 34.196Q49.067 34.385 49.260 34.438Q49.453 34.491 49.761 34.491L49.761 34.807M57.390 34.908Q56.832 34.908 56.359 34.625Q55.887 34.341 55.612 33.864Q55.338 33.388 55.338 32.834Q55.338 32.438 55.480 32.063Q55.623 31.687 55.880 31.399Q56.137 31.111 56.495 30.942Q56.854 30.773 57.258 30.773Q57.803 30.773 58.174 31.010Q58.546 31.247 58.732 31.665Q58.919 32.082 58.919 32.619Q58.919 32.671 58.895 32.709Q58.871 32.746 58.822 32.746L56.150 32.746L56.150 32.825Q56.150 33.572 56.463 34.095Q56.775 34.618 57.473 34.618Q57.878 34.618 58.198 34.361Q58.519 34.104 58.642 33.700Q58.660 33.620 58.743 33.620L58.822 33.620Q58.862 33.620 58.890 33.651Q58.919 33.682 58.919 33.726L58.919 33.761Q58.814 34.104 58.592 34.363Q58.370 34.622 58.056 34.765Q57.741 34.908 57.390 34.908M56.159 32.495L58.273 32.495Q58.273 32.227 58.220 31.981Q58.168 31.735 58.047 31.513Q57.926 31.291 57.728 31.164Q57.530 31.036 57.258 31.036Q56.915 31.036 56.662 31.261Q56.410 31.485 56.285 31.823Q56.159 32.161 56.159 32.495M61.578 34.807L59.490 34.807L59.490 34.491Q59.798 34.491 59.989 34.438Q60.180 34.385 60.180 34.196L60.180 31.748Q60.180 31.507 60.110 31.399Q60.040 31.291 59.906 31.267Q59.772 31.243 59.490 31.243L59.490 30.927L60.831 30.830L60.831 31.665Q61.028 31.283 61.382 31.056Q61.736 30.830 62.162 30.830Q63.441 30.830 63.441 32.043L63.441 34.196Q63.441 34.385 63.632 34.438Q63.823 34.491 64.131 34.491L64.131 34.807L62.044 34.807L62.044 34.491Q62.356 34.491 62.547 34.438Q62.738 34.385 62.738 34.196L62.738 32.078Q62.738 31.819 62.694 31.597Q62.650 31.375 62.505 31.232Q62.360 31.089 62.101 31.089Q61.758 31.089 61.477 31.278Q61.195 31.467 61.039 31.779Q60.883 32.091 60.883 32.438L60.883 34.196Q60.883 34.385 61.077 34.438Q61.270 34.491 61.578 34.491L61.578 34.807M64.636 34.825L64.636 33.383Q64.636 33.352 64.665 33.328Q64.693 33.304 64.724 33.304L64.834 33.304Q64.869 33.304 64.891 33.326Q64.913 33.348 64.922 33.383Q65.181 34.644 66.148 34.644Q66.574 34.644 66.869 34.460Q67.163 34.275 67.163 33.871Q67.163 33.577 66.932 33.381Q66.702 33.185 66.390 33.124L65.788 33.005Q65.322 32.917 64.979 32.634Q64.636 32.350 64.636 31.911Q64.636 31.318 65.074 31.045Q65.511 30.773 66.148 30.773Q66.627 30.773 66.974 31.019L67.225 30.795Q67.282 30.773 67.282 30.773L67.335 30.773Q67.361 30.773 67.394 30.799Q67.427 30.826 67.427 30.856L67.427 32.016Q67.427 32.047 67.392 32.074Q67.357 32.100 67.335 32.100L67.225 32.100Q67.203 32.100 67.170 32.071Q67.137 32.043 67.137 32.016Q67.137 31.551 66.871 31.280Q66.605 31.010 66.139 31.010Q65.735 31.010 65.432 31.155Q65.129 31.300 65.129 31.656Q65.129 31.902 65.346 32.056Q65.564 32.210 65.840 32.267L66.469 32.394Q66.785 32.456 67.056 32.623Q67.326 32.790 67.493 33.056Q67.660 33.322 67.660 33.638Q67.660 34.280 67.233 34.594Q66.807 34.908 66.148 34.908Q65.876 34.908 65.610 34.814Q65.344 34.719 65.164 34.530L64.843 34.869Q64.825 34.908 64.777 34.908L64.724 34.908Q64.702 34.908 64.669 34.880Q64.636 34.851 64.636 34.825M70.266 34.807L68.279 34.807L68.279 34.491Q68.587 34.491 68.778 34.438Q68.969 34.385 68.969 34.196L68.969 31.748Q68.969 31.502 68.903 31.397Q68.838 31.291 68.712 31.267Q68.587 31.243 68.315 31.243L68.315 30.927L69.646 30.830L69.646 34.196Q69.646 34.390 69.811 34.440Q69.976 34.491 70.266 34.491L70.266 34.807M68.666 29.283Q68.666 29.077 68.816 28.927Q68.965 28.778 69.167 28.778Q69.299 28.778 69.415 28.848Q69.532 28.918 69.602 29.035Q69.672 29.151 69.672 29.283Q69.672 29.485 69.523 29.635Q69.374 29.784 69.167 29.784Q68.965 29.784 68.816 29.635Q68.666 29.485 68.666 29.283M70.797 32.900Q70.797 32.333 71.070 31.845Q71.342 31.357 71.813 31.065Q72.283 30.773 72.850 30.773Q73.272 30.773 73.647 30.942Q74.023 31.111 74.300 31.403Q74.577 31.696 74.735 32.091Q74.893 32.487 74.893 32.900Q74.893 33.449 74.614 33.911Q74.335 34.372 73.867 34.640Q73.399 34.908 72.850 34.908Q72.296 34.908 71.826 34.640Q71.356 34.372 71.077 33.911Q70.797 33.449 70.797 32.900M72.850 34.618Q73.346 34.618 73.623 34.357Q73.900 34.095 73.992 33.691Q74.085 33.286 74.085 32.790Q74.085 32.315 73.986 31.926Q73.887 31.537 73.614 31.287Q73.342 31.036 72.850 31.036Q72.138 31.036 71.874 31.531Q71.610 32.025 71.610 32.790Q71.610 33.590 71.865 34.104Q72.120 34.618 72.850 34.618M77.543 34.807L75.456 34.807L75.456 34.491Q75.763 34.491 75.954 34.438Q76.146 34.385 76.146 34.196L76.146 31.748Q76.146 31.507 76.075 31.399Q76.005 31.291 75.871 31.267Q75.737 31.243 75.456 31.243L75.456 30.927L76.796 30.830L76.796 31.665Q76.994 31.283 77.348 31.056Q77.701 30.830 78.128 30.830Q79.406 30.830 79.406 32.043L79.406 34.196Q79.406 34.385 79.598 34.438Q79.789 34.491 80.096 34.491L80.096 34.807L78.009 34.807L78.009 34.491Q78.321 34.491 78.512 34.438Q78.703 34.385 78.703 34.196L78.703 32.078Q78.703 31.819 78.659 31.597Q78.615 31.375 78.470 31.232Q78.325 31.089 78.066 31.089Q77.723 31.089 77.442 31.278Q77.161 31.467 77.005 31.779Q76.849 32.091 76.849 32.438L76.849 34.196Q76.849 34.385 77.042 34.438Q77.235 34.491 77.543 34.491\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.270\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The four fundamental theorems nest by dimension: each integrates a derivative of the field over a region and recovers the field on the oriented boundary of that region.\u003C\u002Ffigcaption>",1786059512324]