If , the component maps are invertible and satisfy . Thus they define a quiver representation isomorphism . Conversely, any such isomorphism consists of invertible maps , and its commuting squares rearrange to . Therefore
The base change action on quiver representations consequently identifies its orbits exactly with isomorphism classes at fixed dimension vector of a quiver representation.
A representation of the one-arrow quiver is an matrix . If , changes of basis put it in the form with an identity block and all other entries zero. Since multiplication by invertible matrices preserves matrix rank,
This describes the orbit for every , including the zero orbit. Its dimension is
Indeed, choosing its -dimensional image contributes parameters in a Grassmannian, and choosing a surjective map from onto that image contributes . This is a rank orbit of a matrix under left-right multiplication.
An algebraic group is connected when its underlying Zariski topology is a connected space. An unipotent algebraic group is a linear algebraic group whose elements, in a faithful matrix realization, satisfy that is nilpotent. A reductive algebraic group, in the connected convention, is a connected linear algebraic group whose unipotent radical is trivial: it has no nontrivial connected normal unipotent algebraic subgroup.
Let . It is a finite-dimensional associative algebra, and . The latter is the nonempty open subset where the determinant on is nonzero. Since the affine space is irreducible, this open subset is irreducible and hence connected. It is a linear algebraic group: within it is cut out by the linear equations of preserving the vertex summands and commuting with the arrow maps. Thus the automorphism group is connected.
By the Krull–Schmidt theorem, write , with pairwise nonisomorphic indecomposables . The Fitting lemma makes each a local algebra. Its residue division algebra is : every element of a finite-dimensional division algebra over the algebraically closed field has an eigenvalue for left multiplication, and subtracting that scalar gives a noninvertible element, hence zero.
The standard radical description of the endomorphism algebra of a Krull-Schmidt decomposition therefore gives
Concretely, maps between nonisomorphic summands lie in the radical, while on each isotypic block one reduces all entries modulo the local radical. The off-diagonal rule follows because a composition cannot be a unit for : it would split off the indecomposable , forcing an isomorphism. The finite-dimensional radical description then identifies the kernel of this block reduction with . Put . The Jacobson radical of the finite-dimensional algebra is nilpotent, so every is a unit and is unipotent on . Also is closed, being the translate of the linear subspace , and normal, being the kernel of
This map has an explicit algebraic section: after fixing the direct-sum decomposition, a matrix acts on the copies by . These block actions give a subgroup with trivial intersection with . Every unit is uniquely a product of an element of and one of . Hence
This Levi decomposition of a quiver automorphism group holds in every characteristic; the section is constructed directly from the multiplicity spaces.
The dimension of a topological space by irreducible chains is the supremum of the integers for which there is a chain of nonempty irreducible closed subsets of the space. Closedness here is relative to the given locally closed space. For varieties this is their Krull dimension.
An algebraic group is a group whose underlying space is an algebraic variety and whose multiplication and inversion are morphisms. An algebraic group action on a variety is a morphism satisfying the identity and associativity axioms of a group action.
For the homomorphism , the kernel is , so the kernel is closed. To prove closedness of the image, use the Chevalley constructibility theorem: the image of a morphism of varieties is constructible. Thus is a constructible subset of a variety and an abstract subgroup. Its closure is also a subgroup: translation by elements of preserves , and continuity then extends multiplication and inversion to .
A dense constructible subset contains a dense open subset of its closure. For , both and are dense open subsets of , so their intersection is nonempty. If with , then . Hence , proving that the image is closed. This is the principle that a constructible subgroup is closed.
Every nonempty fiber of is a translate of and has that same dimension. The fiber dimension theorem therefore gives
This dimension formula for an algebraic group homomorphism is a dimension statement, so it does not require separability of .
For a dimension vector of a quiver representation , set
The base change action on quiver representations is
The entries are regular functions on the product of the general linear groups and the quiver representation space, because inverse entries are cofactors divided by the invertible determinant. Thus this is an algebraic group action.
For nonzero , let be the common scalar subgroup and define . Common scalars act trivially, so the formula descends to an algebraic group action of this projective base change group of a quiver. This is a quotient by one common scalar, not a product of the individual projective groups. If every , the representation space is a point and both actions are taken to be trivial.
Set , , and let be the action of the arrow on . Write , a left projective module. The standard projective resolution of a quiver representation is
The algebra acts on the first tensor factor. The augmentation is . On the summand for , the differential sends to in the -summand minus in the -summand. Here , so . These formulas specify every term and map, and .
Exactness is the standard path resolution fact: the relations identify a path acting on a vector with successively applying its arrows; uniqueness of the first traversed arrow supplies injectivity of the relation map. Each is a direct summand of because is an idempotent, and tensoring with a -vector space gives a direct sum of copies of . Both terms preceding are consequently projective modules. Thus the displayed sequence is a projective resolution of length at most one.
The same path resolution works for arbitrary left modules, with possibly infinite-dimensional and arbitrary direct sums of projective modules. Hence every left -module has projective dimension at most one. Equivalently, is a left hereditary ring: if with projective, dimension shifting gives for every , so is projective. This argument also covers quivers with oriented cycles.
For dimension vectors , define the Ringel form
Apply to the projective resolution. Evaluation at identifies with . Consequently there is an exact sequence
where
This is the extension complex of quiver representations. Taking its alternating dimension sum yields
First split off the kernel of each source-to-sink arrow. Each kernel contributes copies of the simple representation supported at that source. The remaining arrows are injective, so identify the three source spaces with subspaces of the sink space . We now give an elementary three-subspace decomposition.
Split off the common intersection : any projection onto it preserves all three subspaces. Next split off each pairwise intersection. For example, once the triple intersection has gone, is disjoint from ; a projection onto that kills preserves . This extracts blocks whose membership is exactly . Repeating for the other pairs leaves pairwise disjoint subspaces.
For each , choose a complement to in . A projection onto killing preserves the triple, so these complements split off as blocks of membership exactly . In the remaining triple, every lies in the sum of the other two and all pairwise intersections are zero. Thus the sum is , and both projections of onto are isomorphisms. Hence is the graph of an isomorphism . Choose a basis of and the basis of ; this graph decomposes into two-dimensional blocks with three distinct lines. A complement to in contributes sink-only simple blocks.
The complete list of indecomposable blocks is therefore:
  • Three source simples, with zero sink space.
  • Eight blocks with one-dimensional sink, one for each subset : the source space is for and zero otherwise, and every nonzero arrow is the identity.
  • One exceptional block, with all three source spaces , sink , and arrows , , .
Each of the first eleven blocks has endomorphism ring . For the exceptional indecomposable of the three-subspace quiver, an endomorphism of preserving the first two lines is diagonal; preserving the third makes its two diagonal entries equal. Its endomorphism ring is also , so all twelve are indecomposable. Their dimension vectors of quiver representations distinguish them. The decomposition argument proves completeness, and hence there are exactly isomorphism classes. No general classification theorem is needed.
Figure 1.
Exceptional three-subspace representation with a two-dimensional sink and three distinct image lines
. Details.
The path algebra is the -vector space with basis all directed paths, including the length-zero path at each vertex. Extend path composition bilinearly, declaring the product zero when the paths cannot be composed. We use the left-module convention: means first traverse , then ; for an arrow , .
The constant paths are mutually orthogonal idempotents. For any path ,
Consequently, for the finite vertex set used here,
It acts as an identity on every basis path, hence on the entire path algebra. Finiteness of the vertex set is what makes this a genuine element of the algebra; an infinite-vertex path algebra instead has finite vertex sums as local units.
Rows in the following matrix index the source, columns the target, in the order . Solving the arrow-square equation for a quiver representation morphism gives
In particular, the nonzero morphisms between distinct representations are and , each a one-dimensional family of scalar multiples of the vertexwise inclusion or projection. A map is forced to vanish at the source by the identity arrow of ; similarly a map is forced to vanish at the target. Maps between and are zero. Each endomorphism ring is .
The extension complex of quiver representations for the one-arrow quiver is
Its cokernel is . Substitution of the three representations gives
Here the first argument is the quotient endpoint of a short exact sequence. Thus the only possible nonsplit endpoint pair is subobject , quotient . The sequence
is nonsplit, since is indecomposable. More explicitly, all extensions with these endpoints have a middle arrow : gives the split short exact sequence, while each gives a middle representation isomorphic to . With endpoint identifications fixed the extension classes form ; up to endpoint automorphisms all nonzero classes give this same nonsplit sequence. There are no other nonsplit sequences with the listed endpoints, including equal endpoints.
Use the following Jacobson radical facts for a unital algebra: a nilpotent ideal is contained in the Jacobson radical; under a surjective algebra homomorphism the image of the Jacobson radical is contained in the radical of the quotient; and a finite product of fields has zero Jacobson radical. For completeness, if and , then for every , and is invertible with inverse . The usual unit criterion for the Jacobson radical therefore gives . The quotient assumption gives . Hence
This is the nilpotent ideal with semisimple quotient radical criterion.
For the finite quiver under consideration, let be the arrow ideal of a path algebra, spanned by paths of positive length. If has vertices and no oriented cycle, a path cannot repeat a vertex, so . Meanwhile , with the constant paths giving the coordinate idempotents. The criterion just proved yields .
The condition on cycles is necessary. A quiver with one loop has path algebra , whose arrow ideal is . But : the maximal ideals , , have intersection zero, since the algebraically closed field is infinite and a nonzero polynomial has only finitely many roots. Thus the arrow ideal need not be the Jacobson radical when oriented cycles are present.
A representation of a quiver assigns a -vector space to each vertex and a linear map to each arrow . Here and are its source and target. A quiver representation morphism is a family of linear maps such that every arrow square commutes:
Composition and identities are defined vertex by vertex. A quiver representation morphism is an isomorphism precisely when every is invertible.
First, convergence in probability at gives almost surely, since every . For any finite set of times, the corresponding vectors converge in probability: the union bound controls the probability that any coordinate differs by more than a fixed tolerance. The same holds for their increment vectors, hence also for their convergence in distribution.
For , set and . The characteristic function of a random vector factors for the independent increments of each :
Pass to the limit using convergence in distribution and bounded continuous functions. The resulting factorization of the characteristic function of a random vector, with the uniqueness theorem for characteristic functions, proves independence of the . Similarly passes to the limit, proving stationary increments for .
It remains to prove stochastic continuity. For , the triangle inequality and the union bound imply, for every fixed ,
The second term vanishes by stochastic continuity of . Now let and use the additional near-zero approximation hypothesis. We obtain in probability as . The stationary increments transfer this to every time: both and have the law of for when defined. Thus has all the intrinsic Lévy process properties, proving closure of Lévy processes under locally controlled convergence in probability.
If one requires the supplied process itself to be càdlàg, the hypotheses justify a càdlàg modification, rather than that stronger pathwise assertion. To see the distinction, take , let have uniform distribution on , and put . At each fixed time , almost surely, so both approximation hypotheses hold with zero error probability. Nevertheless every path has an isolated spike at and is not right-continuous there. Its identically zero modification of a stochastic process is a Lévy process with càdlàg paths. The conclusion is exact under the intrinsic definition, and exact up to modification under the convention requiring càdlàg paths.
Construct a rate- Poisson process, for , from independent waiting times with exponential distribution . Put , , and . The strong law of large numbers gives , so there are only finitely many arrivals on each finite interval. Consequently the counting paths are càdlàg, and almost surely.
At any deterministic time , the memorylessness of the exponential distribution says that the residual waiting time has again exponential distribution and is independent of the observed history. Subsequent waiting times are fresh independent copies. Thus the Poisson process restarts independently at , proving independent increments and stationary increments. Integrating the joint waiting-time densities over gives
so its time values have the expected Poisson distribution.
For ,
Together with stationary increments, this gives stochastic continuity at every time, from either side where applicable. All the Lévy process requirements hold, and
For , the identically zero process gives the degenerate case.
Use the intrinsic definition of a Lévy process: almost surely, its increments over disjoint time intervals are independent, their probability distributions depend only on interval length, and has stochastic continuity. In symbols,
with times restricted to the half-line. Such a stochastic process has a càdlàg modification, and is usually represented by that version. Requiring càdlàg paths in the definition is a common equivalent convention at the level of modifications; it is important to distinguish this from a claim about the paths of an arbitrary supplied version.
For the characteristic function, write
Here and is the positive-time-sign characteristic exponent of a Lévy process. The independent increments and stationary increments give ; stochastic continuity gives continuity in time and . This continuous multiplicative semigroup has the stated exponential form. Its exponent has the Lévy–Khintchine formula
where , , and the Lévy measure satisfies . The truncation convention fixes the drift coefficient ; the displayed sign convention agrees with .
Let independent Bernoulli random variables have success probabilities , for , and use their natural filtration. Define
Each increment is integrable, finite, and independent of the previous filtration, with expectation
Thus is a martingale. The increments have no common finite bound, since a success produces a jump of size .
Since , the First Borel-Cantelli lemma says that only finitely many successes occur almost surely. Consequently
for all sufficiently large , with the random sum finite almost surely. Therefore almost surely, so neither finite convergence nor two-sided oscillation occurs. This rare-jump martingale divergence example gives probability zero, rather than one, for the union in (i).
For , the first time is a stopping time. On , the bounded increments assumption controls the overshoot:
Before that time, . Allowing the possibility , the process
is a nonnegative martingale. Indeed, the stopped martingale in discrete time is a martingale, and the integrable -measurable variable is a constant-in-time martingale. If , nonnegativity follows from . Its expectations are constant and finite, so the martingale convergence theorem makes converge to a finite value almost surely.
On this proves finite convergence of . Taking the countable union over positive integer , we conclude that converges finitely on the event . Apply the same reasoning to the martingale to obtain finite convergence on .
Outside the event of finite convergence, both the infimum and the supremum of the sequence must therefore be infinite in the respective directions. Removing any finite initial segment cannot change this, because each of its values is finite. Hence
This is the bounded-increment martingale convergence-or-oscillation dichotomy. The term ensures the proof also covers an unbounded integrable initial value.
The construction is well defined. Since is contained in a ball, its Brownian exit time is finite almost surely: at successive integer times there is a fixed positive probability that the next independent unit-time Brownian motion increment has length greater than the ball's diameter, forcing an exit. The survival probability is therefore bounded by a geometric sequence. Path continuity gives . Thus the bounded Dirichlet boundary data give a bounded Borel function on .
For interior harmonicity, fix a ball with closure in , centred at , and let be its Brownian exit time. The Strong Markov property, followed by the tower property of conditional expectation, gives
The orthogonal invariance of Brownian motion makes uniform on the boundary sphere. Hence has the spherical mean value property for harmonic functions for every such ball. A locally bounded Borel function with this property is smooth and harmonic: integrating the spherical averages against any smooth radial mollifier gives locally, which first proves smoothness; the mean value property for harmonic functions then implies .
For the boundary limit at , choose the harmonic barrier for the Dirichlet problem from (i). The Itô formula, localized inside , makes a bounded martingale. Compact localization and the bounded convergence theorem, first to the exit and then as , yield
For , if is nonempty, compactness and barrier positivity give
If that boundary subset is empty, the probability is already zero. Therefore
First let and then . The continuity of the Dirichlet boundary data proves .
Finally, the difference of two continuous solutions is a harmonic function vanishing on the boundary. The maximum principle for harmonic functions on the bounded domain gives that it is zero. Thus the Kakutani solution of the Dirichlet problem exists, attains every prescribed boundary value, and is unique.

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