Use a common intercept and laboratory-specific slopes in the normal linear model. With denoting days and the indicator variables for laboratories B and C, the design matrix has row , and
The interaction terms change slopes, without introducing laboratory-specific intercepts. Thus the estimated daily growth rates are
in millimetres per day, with fitted common intercept mm. The residual degrees of freedom are . The usual unbiased error variance estimate is the square of the residual standard error:
The small difference from arises from rounding the standard error to two decimal places; the latter uses the more precise residual sum of squares supplied later. A maximum-likelihood estimate would instead divide that residual sum of squares by .
First obtain a polynomial critical one-arm upper bound from part (a). Fix a sufficiently large integer radius . Use rotated-coordinate boxes for this geometric construction, in the axes of part (a). Surround by a square ring inside . It can be assembled from the four strips
The first two require horizontal dual crossings; the last two require vertical dual crossings. Their corner overlaps are squares, so the adjacent long crossings intersect there and their union contains a dual graph cycle surrounding the inner box. Translate the strips by the half-lattice displacement of the planar dual graph and adjust the endpoints by one lattice unit if needed. All aspect ratios remain bounded. Part (a) and the same overlap gluing give a uniform lower bound for each dual crossing at . Applying the Harris-FKG inequality to these decreasing events in the primal configuration gives a closed dual circuit with probability at least . We may replace by a smaller number in .
Use the independent annular barriers for percolation at radii . Their supporting edge sets are disjoint, so the circuit events are independent. In the original unrotated coordinates, lies inside and the ring still separates the origin from infinity. These fixed geometric comparisons let us bound the original . An open graph path from to distance must avoid every such closed dual circuit inside . Thus, for some constants and ,
where the first bound is used only when at least one of the indicated rings fits; increasing handles smaller .
Now let and use the monotone coupling of Bernoulli percolation on edges. The event only needs edges whose endpoints lie in , because a first boundary hit gives an internal graph path. There are exactly such edges. Each changes state between parameters and with probability . The union bound therefore gives the finite-box comparison for percolation parameters
For sufficiently small , choose , so that is at least half the unrounded value. Both terms then have order . In particular,
for a finite . Increase to cover the remaining compact range of parameters by . This near-critical percolation power upper bound requires only a positive crossing constant, not the exact value of a critical exponent. It also implies through the critical one-arm probability bound.
Write and for the horizontal and vertical open-crossing increasing events of a rectangle in the rotated square lattice. At parameter , planar duality for rectangle crossings says that failure of is exactly a closed dual vertical crossing. Quarter-turn symmetry and the boundary convention of the rotated rectangles identify the two alternatives on a square. Thus its crossing probability is ; a rectangle obtained by a harmless one-step boundary adjustment has crossing probability at least . This is the finite-domain exact self-dual rectangle crossing probability, not an assumption about infinite percolation clusters.
We first prove a RSW reflection extension lemma. In coordinate units adapted to the rotated drawing, take , , and . Reveal the rightmost open vertical crossing of , when one exists, using only its edges and the region to its right. Reflect across the horizontal axis. The part of to the left of these two paths remains unexposed and has the independent parameter- law. A horizontal crossing of must reach their union. Its probability is at least . Reflection symmetry and the union bound give a probability at least of reaching the upper path through . Conditional opening of the edges on can only help. Since has probability at least , the increasing event that a vertical crossing of is connected inside to its left side has probability at least .
Reflect this construction in the vertical midline of to obtain an increasing event of the same probability, connecting a vertical crossing of to the right side of . On , the horizontal crossing of meets both vertical crossings, so all three graph paths join and give . The Harris-FKG inequality now yields
The exploration only conditions the exposed side of the extremal graph path; reflecting a drawn path does not assert that its reflected edges are open. This distinction is what makes the extension argument valid.
To pass from aspect ratio to , put four rectangles of width and height next to each other, with successive left boundaries separated by . Adjacent rectangles overlap in a square of side . Require horizontal crossings of the four rectangles and vertical crossings of the three overlap squares. Every consecutive pair of horizontal crossings meets the vertical crossing in its overlap; together they form a horizontal crossing of width . The Harris-FKG inequality gives a strictly positive bound, for these compatible scales, of
The construction works on the rotated square lattice with the boundary sites used in the source drawing. Integer roundings do not create a scale restriction: for an odd height use the largest smaller compatible even height, and use eight horizontal rectangles and seven overlap squares, whose union has auxiliary aspect ratio , so that its width exceeds the desired width for all sufficiently large . Truncate its horizontal crossing on first reaching the desired right side. The number of extra rectangles and overlap-square crossings is bounded independently of , and every factor is bounded below by the same positive constants. The finitely many smallest rectangles each have positive crossing probability, since a specified finite open graph path suffices. Therefore a constant works at every integer scale. Taking ensures the requested strict inequality:
This proves the required instance of the Russo-Seymour-Welsh theorem through reflection, exploration and gluing. The parameter in this calculation is .
Use the following general result, including its site version: independent site percolation on has almost surely at most one infinite percolation cluster at each fixed parameter; for every fixed it has exactly one almost surely. This is the uniqueness of the infinite percolation cluster, also called the Burton-Keane theorem. For , the additional general fact ensures a choice of a parameter strictly between and . In dimension one, and the asserted interval is empty.
Fix and choose . Let be the unique infinite open connected component of a graph at . Under the monotone coupling of Bernoulli percolation, it is contained in the unique infinite open connected component of a graph at . On , the origin and therefore lie in that same connected component of a graph, and a finite -open graph path connects to some graph vertex of .
For this fixed deterministic , the countable set of uniforms satisfies at every graph vertex almost surely. Thus all uniforms on that finite graph path are strictly less than , including its endpoints. If is their maximum, choose with . The graph path is then -open, and its endpoint remains connected to infinity through . Consequently occurs and . We have proved
Part (d) gives left continuity at this ; part (b) supplies right continuity when . The same finite-path proof gives left continuity at , since all uniforms are strictly less than almost surely. Thus is continuous on , without asserting continuity at . This is supercritical continuity of percolation probability.
Work on the common probability space from part (c). For a configuration of all the uniforms, the set is an upper interval, possibly with or without its lower endpoint. It is nonempty because occurs, and the coupled onset parameter for origin percolation is . For ,
Indeed, occurrence at some implies . Conversely, if , the definition of infimum yields occurrence at some , and a rational between and also satisfies . This also proves measurability of through its strict sublevel sets.
Choose a rational sequence increasing to . By continuity from below of a measure and the monotone coupling of Bernoulli percolation,
Moreover, . Hence is the disjoint union of and , giving
It is important to retain the intersection with : occurrence at the infimum is not automatic. At there is no left limit within the parameter domain, so the displayed left-limit assertion is for .
Use the probability space with the product measure of the uniform distribution on . Its coordinate random variables are independent and identically distributed random variables. Define simultaneously for every parameter
For , the indicator function inequality holds pointwise at every graph vertex. For fixed , each coordinate has the Bernoulli distribution with parameter , and the coordinates are independent because they are functions of distinct independent . Thus every marginal configuration is exactly the required site percolation model. This is a continuum-indexed family of processes, all on one probability space, and is the standard monotone coupling of Bernoulli percolation.
Let be the event that the origin has an open graph path to the boundary of . The graph path can be stopped on its first boundary visit, so depends on only finitely many sites. Its probability is a finite sum of terms , and is therefore a continuous function of . Also , and the König infinity lemma gives . By continuity from above of a measure,
The monotone coupling of Bernoulli percolation described below shows that is nondecreasing. For , its right limit of a function exists and is at least . For every fixed ,
Taking the infimum in proves . This proves right continuity of percolation probability throughout ; at right continuity is understood relative to the parameter domain. The argument does not interchange two uncontrolled limits.
The cubic lattice has graph vertices and an edge between when . In independent site percolation, every graph vertex is open with probability and closed with probability , independently. The open subgraph contains only open graph vertices and the edges between them. Let be the open connected component of a graph containing , with when is closed. The percolation probability is
Since the cubic lattice is a locally finite graph, the König infinity lemma identifies an infinite open connected component of a graph with the existence of an infinite open graph ray from the origin. In particular, the origin itself must be open. The percolation critical probability is .
Write for the deterministic set of -step self-avoiding walks from . Each uses distinct edges, so independence gives
For , the function on is a concave function. The Jensen inequality gives the root-moment bound for open self-avoiding walks
Equivalently, the Lyapunov moment inequality compares exponents and , both strictly positive. Taking the limit superior and the connective constant limit proves
This includes and . No independence between the different self-avoiding walk indicators is asserted or needed.
Let count -step self-avoiding walks on the square lattice from one fixed graph vertex. Splitting a self-avoiding walk after steps and dropping the avoidance constraint on its suffix gives . The Fekete lemma therefore gives the connective constant . The planar dual graph of the square lattice is a translated copy of it, so its connective constant is also .
Put and assume . Choose with . The definition of the connective constant provides a finite such that for every . A simple dual graph cycle of length surrounding has a graph vertex in a box of radius : its diameter is at most , and its coordinate ranges straddle the origin. Choose such a graph vertex as the starting point, orient the graph cycle, and omit its closing edge. The remaining self-avoiding walk has length . Consequently the number of these graph cycles obeys
for fixed finite constants. A specified graph cycle is open in dual bond percolation, equivalently all its crossed primal edges are closed, with probability . Hence
To make this tail argument valid for every , rather than only extremely small , use a finite modification of Bernoulli percolation. Condition all primal edges within to be open. This event has positive probability for . If the resulting percolation cluster of is finite, its outer boundary contains a simple closed dual graph cycle surrounding the whole box. Such a graph cycle has length tending to infinity with and crosses no forced-open edge. Under the conditioning its remaining edge states retain the original independent law, so its probability is still . Choose so that the above tail is less than . The conditional probability that belongs to an infinite percolation cluster is then at least , and thus .
This connective-constant Peierls bound proves that every is above or at the onset of positive percolation probability. Taking the infimum gives
The case is immediate. This proof uses the Peierls argument, without assuming the exact Harris-Kesten theorem.
Represent the doubly infinite ladder graph by , with horizontal edges between successive columns and a vertical rung at each column. An allowed self-avoiding walk is coded by a word in . Two successive steps revisit the preceding graph vertex and are forbidden. Conversely, every word without consecutive steps is a self-avoiding walk: horizontal steps strictly increase the column, and a column is visited vertically at most once. This establishes a bijection, not merely an upper bound.
For the directed ladder self-avoiding walk count, , , and for a word either ends in , or ends in . Removing that final block gives
Let be the golden ratio, and . The Binet formula for the Fibonacci number yields
Since , taking th roots gives . This use of the golden-ratio symbol is independent of the connection rate in Question 1.
An -step self-avoiding walk on a graph is a sequence of distinct graph vertices such that for . It has edges and no repeated vertex, including its starting graph vertex. The -step self-avoiding walk consists of its starting graph vertex alone.
The union bound gives . Hence some boundary graph vertex has percolation two-point connection probability at least . The rotations and reflections of the square lattice let us choose such a graph vertex as , . Reflection in the vertical line through sends to and fixes . Therefore
The Harris-FKG inequality applied to these two increasing events proves the reflection lower bound for two-point percolation:
Every graph path from to reaches , so . Taking roots gives
Both outside expressions have limit of a sequence , proving the even case. For , the Harris-FKG inequality with the last horizontal edge gives , and also . The lower bound has root
The upper bound has the same limit of a sequence. At all positive-distance connection probabilities vanish. Thus for every .
Use integer graph vertices in the boxes: , and set . Thus , , and for .
If , erase loops from an open graph path to obtain a self-avoiding walk. Let be its first graph vertex on . Split at . The prefix certifies , while a segment of the suffix certifies : the final graph vertex is at supremum norm distance at least from , so the suffix first hits that translated boundary. The two certificates use disjoint edges. Therefore the BK boundary-splitting estimate, the union bound, the Van den Berg-Kesten inequality, and translation invariance give
The cases or follow directly from , so this proves the bound including the endpoints.
Here is an explicit way to remove the polynomial boundary factor. For put , . By symmetry in , assume . Then
Consequently is a subadditive sequence. The Fekete lemma states that any real subadditive sequence satisfies , possibly . In this case the direct horizontal open graph path gives , so this limit of a sequence is bounded below by . Since , its upper bound is zero. Finally,
has the same limit of a sequence. Thus the percolation one-arm decay rate exists and
For , every with is zero and . No exponential-decay theorem or assumption that is below the percolation critical probability is needed.
Order configurations coordinatewise: means for every edge. An increasing event is a measurable set such that and imply . Opening additional edges cannot destroy an increasing event. The Harris-FKG inequality, the product measure version of the FKG inequality, states
for two increasing events. Equivalently, bounded coordinatewise increasing random variables satisfy . The event inequality also holds for two decreasing events, by taking complements.
For disjoint occurrence of increasing events, a finite open edge set witnesses in if every configuration agreeing with on belongs to . Since is an increasing event and all edges of are open, this says that the configuration with exactly open already forces . Define to consist of configurations admitting disjoint finite witnesses for . For events depending on finitely many edges, this is the usual disjoint-occurrence definition; it also applies to finite-connection events on the infinite graph. The Van den Berg-Kesten inequality states
On a countable graph, its finite-witness version follows by taking increasing unions over finite edge sets. The Harris-FKG inequality concerns simultaneous occurrence, whereas the Van den Berg-Kesten inequality requires separate certificates using disjoint coordinates.
In bond percolation on an undirected graph , a configuration is . The edge is open when and closed when . Under , the coordinates are independent and identically distributed random variables with the Bernoulli distribution of parameter . For a countable edge set, use the product sigma-algebra and the product measure
The open edges form a random subgraph with the original graph vertices. Its connected components of a graph are the percolation clusters. Write when an open graph path joins to ; a zero-length graph path is allowed, so always holds. The randomness is in the independently open bonds; all vertices remain present.
For the SLE driver , apply the Itô formula to . At a fixed spatial point, has finite variation locally in time by the derivative formula in part (c); there is no extra spatial martingale term. Consequently
This exact cancellation is the target-change locality of SLE6. For a general parameter the transformed SLE driving function would have drift .
Define the increasing clock and its inverse by
The derivative is real and strictly positive before , so this is a valid continuous time change of a continuous process. The driver is a continuous local martingale with quadratic variation and initial value zero. The Dambis-Dubins-Schwarz theorem gives a standard Brownian motion such that
If the terminal clock is finite, the Brownian motion may be extended beyond that stopping time; only its stopped part is used here. Reparameterizing the image maps gives
These are exactly the defining Chordal Loewner equation and half-plane-capacity parameterization for . The trace is . Hence the image curve is also ordinary chordal after this time change, up to the specified stopping time:
Put and . The given conformal change of half-plane capacity makes the image mapping-out equation
Indeed its capacity speed is , and the stated Loewner local growth property identifies the indicated single driver. For , differentiate the conjugacy identity
at a fixed original point. The Chordal Loewner equation then gives the conformal conjugacy derivative for the chordal Loewner equation
The change of variable covers the whole upper half-plane. The conformal automorphism of the upper half-plane is a real Möbius transformation. Its pole is the image of the still-unswallowed boundary point , so it is holomorphic in a neighbourhood of before .
To evaluate the apparent singularity, write , and . The Taylor series is
Thus the first term in the derivative is , while the second is . Their poles cancel and their constant terms differ by . Therefore
The scale is precisely the inverse conformal map:
By definition, a chordal SLE in a specified scale in is a curve whose image under is the half-plane-capacity-parameterized SLE from zero to infinity. Here
and the right-hand side is the given . Equivalently, this is Conformal invariance of SLE, with the target point transported from infinity to . Thus is in in scale , using the original parameter . This scaled parameter is distinguished from the ordinary half-plane-capacity parameterization of its image hulls used next.
A conformal automorphism of the upper half-plane is a real Möbius transformation
with coefficients determined up to a common nonzero factor. The boundary interval is the oriented real boundary arc from infinity to , namely the finite real interval . The map must take the left endpoint to infinity and the right endpoint infinity to , while fixing zero. These three boundary values determine the Möbius transformation uniquely:
Its determinant is positive, , and on its derivative is . Its endpoint limits are at and at , so it has exactly the required boundary extension.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact