Glossary
This is a summary of the type of objects you will be studying.
Sublat: a sublattice, representing a number of identical sites within the unit cell of a bounded or unbounded lattice. Each site has a position in anE-dimensional space (Eis called the embedding dimension). All sites in a givenSublatwill be able to hold the same number of orbitals, and they can be thought of as identical atoms. EachSublatin aLatticecan be given a unique name, by default:A,:B, etc.Lattice: a collection ofSublats plus a collection ofLBravais vectors that define the periodicity of the lattice. A bounded lattice hasL=0, and no Bravais vectors. ALatticewithL > 0can be understood as a periodic (unbounded) collection of unit cells, each containing a set of sites, each of which belongs to a different sublattice.SiteSelector: a rule that defines a subset of sites in aLattice(not necessarily restricted to a single unit cell)HopSelector: a rule that defines a subset of site pairs in aLattice(not necessarily restricted to the same unit cell)LatticeSlice: a finite subset of sites in aLattice, defined by their cell index (anL-dimensional integer vector, usually denoted bynorcell) and their site index within the unit cell (an integer). ALatticeSlicean be constructed by combining aLatticeand a (bounded)SiteSelector.AbstractModel: either aTightbindingModelor aParametricModelTightbindingModel: a set ofHoppingTerms andOnsiteTermsOnsiteTerm: a rule that, applied to a single site, produces a scalar or a (square) matrix that represents the intra-site Hamiltonian elements (single or multi-orbital)HoppingTerm: a rule that, applied to a pair of sites, produces a scalar or a matrix that represents the inter-site Hamiltonian elements (single or multi-orbital)
ParametricModel: a set ofParametricOnsiteTerms andParametricHoppingTermsParametricOnsiteTerm: anOnsiteTermthat depends on a set of free parameters that can be adjusted, and that may or may not have a default valueParametricHoppingTerm: aHoppingTermthat depends on parameters, likeParametricOnsiteTermabove
AbstractHamiltonian: either aHamiltonianor aParametricHamiltonianHamiltonian: aLatticecombined with aTightBindingModel.It also includes a specification of the number of orbitals in each
Sublatin theLattice. AHamiltonianrepresents a tight-binding Hamiltonian sharing the same periodicity as theLattice(it is translationally invariant under Bravais vector shifts).ParametricHamiltonian: like the above, but using aParametricModel, which makes it dependent on a set of free parameters that can be efficiently adjusted.
An
h::AbstractHamiltoniancan be used to produce a Bloch matrixh(ϕ; params...)of the same size as the number of orbitals per unit cell, whereϕ = [ϕᵢ...]are Bloch phases andparamsare values for the free parameters, if any.Spectrum: the set of eigenpairs (eigenvalues and corresponding eigenvectors) of a Bloch matrix. It can be computed with a number ofEigenSolvers.Bandstructure: a collection of spectra, evaluated over a discrete mesh (typically a discretization of the Brillouin zone), that is connected to its mesh neighbors into a linearly-interpolated approximation of theAbstractHamiltonian's bandstructure.SelfEnergy: an operatorΣ(ω)defined to act on aLatticeSliceof anAbstractHamiltonianthat depends on energyω.OpenHamiltonian: anAbstractHamiltoniancombined with a set ofSelfEnergiesGreenFunction: anOpenHamiltoniancombined with anAbstractGreenSolver, which is an algorithm that can in general compute the retarded or advanced Green function at any energy between any subset of sites of the underlying lattice.GreenSlice: aGreenFunctionevaluated on a specific set of sites, but at an unspecified energyGreenSolution: aGreenFunctionevaluated at a specific energy, but on an unspecified set of sites
OrbitalSliceArray: anAbstractArraythat can be indexed with aSiteSelector, in addition to the usual scalar indexing. Particular cases areOrbitalSliceMatrixandOrbitalSliceVector. This is the most common type obtained fromGreenFunctions and observables obtained from them.Observables: Supported observables, obtained from Green functions using various algorithms, include local density of states, density matrices, current densities, transmission probabilities, conductance and Josephson currents