You are here
Home ›admissible ideals,, bound quiver and its algebra
Primary tabs
admissible ideals,, bound quiver and its algebra
Assume, that is a quiver and is a field. Let be the associated path algebra. Denote by the two-sided ideal in generated by all paths of length , i.e. all arrows. This ideal is known as the arrow ideal.
It is easy to see, that for any we have that is a two-sided ideal generated by all paths of length . Note, that we have the following chain of ideals:
Definition. A two-sided ideal in is said to be admissible if there exists such that
If is an admissible ideal in , then the pair is said to be a bound quiver and the quotient algebra is called bound quiver algebra.
The idea behind this is to treat some paths in a quiver as equivalent. For example consider the following quiver
Then the ideal generated by is not admissible () but an ideal generated by is. We can see that this means that ,,walking” from to directly and through is not the same, but walking in the same number of steps is.
Note, that in our case there is no path of length greater then . In particular, for any we have .
Mathematics Subject Classification
14L24 Geometric invariant theory- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)
- Other useful stuff
Recent Activity
new image: sinx_approx.png by jeremyboden
new image: approximation_to_sinx by jeremyboden
new image: approximation_to_sinx by jeremyboden
new question: Solving the word problem for isomorphic groups by mairiwalker
new image: LineDiagrams.jpg by m759
new image: ProjPoints.jpg by m759
new image: AbstrExample3.jpg by m759
new image: four-diamond_figure.jpg by m759
May 16
new problem: Curve fitting using the Exchange Algorithm. by jeremyboden
new question: Undirected graphs and their Chromatic Number by Serchinnho


