KL Blueprint
Dependency graph
▾
Topics
Kl
02 Hecke Polynomials
Coxeter
Graded Algebra
Invariance
Localization
Realizations
Reflection Combinatorics
Sheaves
Word Modules
▾
Keywords
No matches
Bruhat
Coxeter
Frobenius-duality
Hecke
Hilbert-comparison
Kazhdan-Lusztig
background
bruhat_order
coefficient-rings
combinatorial_invariance
comparison_and_freeness
correction-factors
definitions
dihedral
dihedral-counts
duality_and_characters
embedded-images
global-inclusion
graded-algebra
graded-duality
hecke_polynomials
induction
interpolation
intervals
introduction
local-comparison
local-decomposition
local-model-transport
localization
module-algebra
moment_graph_sheaves
realization
realizations_and_grading
reflection_orders
root-geometry
sheaf-operations
Combinatorial invariance of Kazhdan–Lusztig polynomials — Blueprint and Knowledge Base
540 nodes across 10 topics.
Dependency graph
Kl
A basis descends through a scalar-kernel presentation
Theorem
proved
A chamber determines the inversion signs and a least simple descent
Theorem
proved
A chamber order rotates at a least simple descent
Theorem
proved
A chronological suffix gives the strict later conditions at both endpoints
Theorem
proved
A diagonal operator with one scalar on a chosen block
Theorem
proved
A dihedral interval graph image lies in one root-plane coset
Theorem
proved
A finite coordinate presentation over an arbitrary weight set
Definition
formalized
A finite free cover splits over a local minimal cover
Theorem
proved
A finite homogeneous free cover from arbitrary generators
Theorem
proved
A free cover splits into a minimal cover and a graded free remainder
Theorem
proved
A generic ratio order in every prescribed chamber
Theorem
proved
A graded map equal to the identity modulo the positive ideal is invertible
Theorem
proved
A least simple label splits off one edge from increasing paths
Theorem
proved
A length-one successor inside every strict Bruhat interval
Theorem
proved
A linear reflection induces Frobenius data on its symmetric algebra
Theorem
proved
A localized scaled-image equality gives an original-module multiplier
Theorem
proved
A nonzero local diagonal forces a strict half-degree bound
Theorem
proved
A nonzero split summand of a primitive sheaf is the whole sheaf
Theorem
proved
A normalized boundary sheaf is a graded summand of a word sheaf
Theorem
proved
A pair lattice with a twisted second scalar action
Definition
formalized
A path involution identifies two transfer-product entries
Theorem
proved
A plane weight equals the intrinsic dihedral edge degree
Theorem
proved
A reciprocal polynomial strictly below the midpoint is zero
Theorem
proved
A reduced tensor word realizes all global sections
Theorem
proved
A reflection reverses the sign of its own label
Theorem
proved
A root represented by a reflection and a sign bit
Definition
formalized
A scalar difference annihilates a pair-projection quotient
Theorem
proved
Actual dihedral after-indicators and later-edge counts
Definition
formalized
Actual plane edge roots and the two prefix sequences
Definition
formalized
Actual root comparisons give the signed indicator tables
Theorem
proved
Adding one vertex to a partial sheaf morphism
Theorem
proved
Adding the model block at one unprocessed vertex
Theorem
proved
Adding the next center in a boundary-model decomposition
Theorem
proved
Admissible signed vertex indices
Definition
formalized
Alternating words and their endpoint conventions
Definition
formalized
Ambient later-edge selections and their coset pullbacks
Definition
formalized
Ambient root signs and intrinsic dihedral descents
Theorem
proved
Ambient root signs detect inversions of the induced system
Theorem
proved
An actual ambient edge has coordinates in a least plane coset
Theorem
proved
An equal product of two reflections determines the same root span
Theorem
proved
An extreme positive root is simple in its subspace
Theorem
proved
An injective rank-preserving dihedral map fills its target interval
Theorem
proved
Angular boundary roots of a root plane
Definition
formalized
Anti-reciprocity of the recursively constructed defect
Theorem
proved
Assembling class lifts with one prime denominator
Theorem
proved
Associated factor counts determine scalar-image submodules
Theorem
proved
Attaching a new bottom stalk by a minimal cover
Theorem
proved
Balanced perfect duality on global sections
Definition
formalized
Basic properties and local minimality of structure sheaves
Theorem
proved
Boundary and stalk images under an isomorphism above a vertex
Theorem
proved
Boundary kernel characters and their degree bound
Theorem
proved
Boundary models supported on principal lower ideals
Definition
formalized
Boundary recognition after a change of coefficient coordinates
Theorem
proved
Boundary values supplied by upper sections
Definition
formalized
Boundary-sheaf isomorphisms are detected at the normalized stalk
Theorem
proved
Boundary-sheaf pullback with complete outgoing edge lifts
Theorem
proved
Bruhat comparison by length in a dihedral system
Theorem
proved
Bruhat endpoint bounds and the selected increasing paths
Theorem
proved
Bruhat intervals, endpoints and rank differences
Definition
formalized
Bruhat support and bar reciprocity for positive Hecke words
Theorem
proved
Bruhat support and diagonal coefficients of the bar basis
Theorem
proved
Bruhat upper sets and their reflected union and intersection
Definition
formalized
Cancelling a homogeneous scalar recovers the input degree
Theorem
proved
Cancelling lower summands in character identities
Theorem
proved
Character congruence modulo a reflection root
Theorem
proved
Character reflection from a homogeneous dual equivalence
Theorem
proved
Characters under graded equivalences, sums and shifts
Theorem
proved
Chebyshev coefficients for rank-two root calculations
Definition
formalized
Chosen roots for the supported plane factors
Definition
formalized
Clearing a denominator in an embedded tensor localization
Theorem
proved
Coefficient transport of dual modules and perfect pairings
Theorem
proved
Coefficients and the strict degree bound of the lower half
Theorem
proved
Combinatorial invariance of Kazhdan–Lusztig polynomials
Theorem
proved
Compatibility and lifting of a patched tail assignment
Theorem
proved
Compatibility of the signed action with root transformation
Theorem
proved
Compatible assignments and sections on a vertex subset
Definition
formalized
Compatible tuples, upper-image projectivity and lifting
Definition
formalized
Components under homogeneous maps and scalar multiplication
Theorem
proved
Composition, balance, and grading of adjoints
Theorem
proved
Consecutive root order is determined by the middle descent
Theorem
proved
Constructing a minimal graded free cover
Theorem
proved
Construction of normalized models at every vertex
Theorem
proved
Coordinate polynomials and a polynomial family of functionals
Definition
formalized
Coset root identities and reindexing of actual later counts
Theorem
proved
Counting supported later edges by their target vertices
Theorem
proved
Coxeter relations for the signed simple permutations
Theorem
proved
Cyclicity of the right action and reduced-word independence
Theorem
proved
Decomposing a free flabby sheaf into shifted boundary models
Theorem
proved
Decomposing a stalk over an identified upper boundary
Theorem
proved
Decomposition of the sheaf after root-plane localization
Theorem
proved
Degree bounds for the recursively constructed family
Theorem
proved
Degree shift and injectivity of the edge-factor action
Theorem
proved
Degree, reduction and root nondivisibility of the polynomial lift
Theorem
proved
Degrees of coefficients and dual basis functionals
Theorem
proved
Degreewise exact sequences and word-stalk dimensions
Theorem
proved
Degreewise quotient defects of a subspace inclusion
Definition
formalized
Descending an endomorphism through projections and edge quotients
Theorem
proved
Descending decomposition into local boundary models
Theorem
proved
Descent maps and projective image splittings
Theorem
proved
Detection of coordinate images by their two tail projections
Theorem
proved
Diagonal operators preserving a coordinate submodule
Definition
formalized
Directed edge lists, path weights and selected path sets
Definition
formalized
Dominant evaluation detects right and left ascents
Theorem
proved
Edge coefficient rings in symmetric and polynomial coordinates
Definition
formalized
Edge images of selected structure-model kernels
Theorem
proved
Elementary edge transfers and ordered products
Definition
formalized
Endpoint equality forces equality at every transfer step
Theorem
proved
Equality and strict inclusion detected by Hilbert values
Theorem
proved
Every root plane has two angular boundary roots
Theorem
proved
Exact kernels for a reflection distinct from the first letter
Theorem
proved
Exact reflection kernels for a tensor word
Definition
formalized
Exact two-edge intermediate sets survive interval transport
Theorem
proved
Existence and transport of finite-support interval models
Theorem
proved
Existence and uniqueness of the canonical KL families
Theorem
proved
Existence of a generic functional ordering all positive roots
Theorem
proved
Existence of normalized boundary sheaves on finite ordered graphs
Theorem
proved
Extending a finite free dual and pairing by tensor product
Theorem
proved
Extending a partial sheaf isomorphism across one vertex
Theorem
proved
Extending a sheaf morphism from an upper set
Theorem
proved
Extending a split top stalk to a sheaf summand
Theorem
proved
Extending an interval assignment to its ambient upper closure
Definition
formalized
Extension by zero from a lower ideal
Definition
formalized
Extension from subsets closed under surviving edges
Theorem
proved
External lower vertices and their parity classes
Definition
formalized
Extracting the bottom R-tilde row from character comparison
Theorem
proved
Extremal simple labels on increasing paths
Theorem
proved
Faithfulness and the rank-one characterization of reflections
Theorem
proved
Faithfulness of the geometric, extended, and coordinate-dual actions
Theorem
proved
Finite Coxeter relations for linear reflections
Theorem
proved
Finite and infinite angular order of actual dihedral roots
Theorem
proved
Finite constructions from shifted boundary models
Definition
formalized
Finite generator support of a lower Bruhat ideal
Theorem
proved
Finite graded polynomial modules have convergent Hilbert values
Theorem
proved
Finite homogeneous bases and their degrees
Definition
formalized
Finite nonnegatively graded module data
Definition
formalized
Finite products and shifted free modules
Definition
formalized
Finite residue comparisons at incident signed edges
Theorem
proved
Finite sets in a dihedral group have a common Bruhat upper bound
Theorem
proved
Finite ungraded sums of local models
Definition
formalized
Finite-support interval models in standard parabolic systems
Definition
formalized
Finiteness and outgoing lifts of the relative coset graph
Theorem
proved
Finiteness of Bruhat intervals
Theorem
proved
Fixed stalks and the top normalization of adjoint projectors
Theorem
proved
Flabbiness and closure under directed edges
Definition
formalized
Flabbiness of the actual word sheaf
Theorem
proved
Flabbiness of the induced dihedral structure models
Theorem
proved
Flat base change of selected kernels and edge images
Theorem
proved
Flow-down sections and outgoing label products
Definition
formalized
Flow-down sections imply flabbiness
Theorem
proved
Free presentations over a scalar quotient and their kernels
Theorem
proved
Free stalks, upper quotients, and global generation
Definition
formalized
Free word stalks and exact reflection-edge kernels
Theorem
proved
Free word stalks and root quotients in polynomial coordinates
Theorem
proved
Freeness of a new stalk from the two tail stalks
Theorem
proved
Freeness of a saturated image over the edge quotient ring
Theorem
proved
Freeness of all terminal kernels in a transported schedule
Definition
formalized
Frobenius data for the simple reflections of the extended realization
Definition
formalized
Frobenius traces and trace duality
Definition
formalized
From graded projectivity to a homogeneous free basis
Theorem
proved
From one-edge bounds to the full transfer inequality
Theorem
proved
Full transport of a relative dihedral interval
Theorem
proved
Generated parabolic subgroups and minimal coset representatives
Definition
formalized
Geometric reflection orders
Definition
formalized
Graded Nakayama by induction on degree
Theorem
proved
Graded components and homogeneous projection
Definition
formalized
Graded sheaves and homogeneous restriction maps
Definition
formalized
Grading submodules and quotients through their components
Theorem
proved
Graph maps and local label comparisons transport selected paths
Theorem
proved
Graph maps, graph equivalences, and sheaf pullback
Definition
formalized
Hecke operators, the bar map, and normalized R-polynomials
Concept
formalized
Height-one membership in a free target
Theorem
proved
Heights, normalized positive roots, and geometric slopes
Definition
formalized
Hilbert additivity for homogeneous exact sequences
Theorem
proved
Hilbert additivity for the image of a homogeneous submodule
Theorem
proved
Hilbert functions, formal series and numerical values
Definition
formalized
Hilbert series and values of a homogeneous free basis
Theorem
proved
Hilbert values of a regular homogeneous scalar image and quotient
Theorem
proved
Homogeneous evaluation and homogeneous lifts to word modules
Theorem
proved
Homogeneous functionals have homogeneous pairing representatives
Theorem
proved
Homogeneous image pieces and their Hilbert degree shift
Theorem
proved
Homogeneous lifts from a finite graded free module
Theorem
proved
Homogeneous maps and grading shifts
Definition
formalized
Homogeneous submodules, quotients, and map images
Definition
formalized
Ideals generated by linear subspaces
Definition
formalized
Image sheaves and the splitting of a projector
Definition
formalized
Image, symmetry, and grading of the local intersection map
Theorem
proved
Images in sets of module coordinates
Definition
formalized
Incoming labels identify the outgoing kernel with vertex support
Theorem
proved
Indecomposability of the normalized boundary sheaf
Theorem
proved
Independence of the basis-degree polynomial
Theorem
proved
Induced ambient labels and dihedral structure models
Definition
formalized
Injectivity of the reflection block-coordinate map
Theorem
proved
Integral adjoints for a perfect pairing
Definition
formalized
Integral injectivity of full word evaluation
Theorem
proved
Integral vertex cuts and products of edge labels
Definition
formalized
Internal-rank flips of a dihedral interval and its edges
Definition
formalized
Interpolation produces the prescribed flow-down sections
Theorem
proved
Interval isomorphisms preserve endpoints and rank differences
Theorem
proved
Invariant and anti-invariant reflection coordinates
Theorem
proved
Inverse bar coefficients and the R-value kernel identity
Theorem
proved
Inverse symmetry and simple steps for the plane inversion count
Theorem
proved
Inverse-basis transforms and the Hecke bar involution
Definition
formalized
Inversion cuts in a root plane
Theorem
proved
Isometries whose displacement lies in a root line
Theorem
proved
Isomorphisms determined by maps of minimal covers
Theorem
proved
KL endpoint formulas under character identification
Theorem
proved
KL invariance for finite-generator Coxeter systems
Theorem
proved
KL polynomials in a dihedral Coxeter system
Theorem
proved
Kernel Hilbert values and normalized states
Definition
formalized
Kernel products and edge images for the actual coset models
Theorem
proved
Kernel projectivity from two presentations of one module
Theorem
proved
Kernels of upward edge conditions
Definition
formalized
Later-edge counts in transported dihedral intervals
Theorem
proved
Later-edge selections for the coset model comparison
Definition
formalized
Least coset representatives preserve the signs of plane roots
Theorem
proved
Left and right simple Hecke operators commute
Theorem
proved
Length-additive decomposition by a parabolic subgroup
Theorem
proved
Lifting a partial morphism through the boundary image
Theorem
proved
Linear membership and units at a root-plane prime
Theorem
proved
Linear reflections from a root and a normal
Definition
formalized
Local boundary models over a local coefficient ring
Definition
formalized
Local model data from structure sheaves
Theorem
proved
Localized labels and the coset sheaf
Definition
formalized
Lower and upper images in the same edge module
Definition
formalized
Lower and upper simple-reflection envelopes
Definition
formalized
Lower-character normalization and convolution on an ambient interval
Theorem
proved
Lower-interval Hecke sums and their correction vectors
Definition
formalized
Minimal free covers over a local ring
Definition
formalized
Minimal graded free covers
Definition
formalized
Minimal-boundary sheaves and their normalized stalk
Definition
formalized
Module-valued sheaves on an ordered graph
Definition
formalized
Monotone simple envelopes and the Bruhat lifting property
Theorem
proved
Monotonicity and labels of the two prefix-root sequences
Theorem
proved
Morphisms and partial morphisms of graded graph sheaves
Definition
formalized
Moving spaces, fixed spaces, and reflection faithfulness
Definition
formalized
Multiplication by the correction factor on an edge module
Definition
formalized
Nondegeneracy and independence in the extended root space
Theorem
proved
Nonvanishing and homogeneity of the edge factor
Theorem
proved
Normalized KL reciprocity in the square parameter
Theorem
proved
Normalized R-polynomials and the square parameter
Theorem
proved
Normalized empty and full kernels from the actual character
Theorem
proved
Odd length detects dihedral reflections and edges
Theorem
proved
One multiplicity family controls stalk and full-kernel characters
Theorem
proved
Orbit splines in the extended realization
Definition
formalized
Orbit-spline factors with prescribed zeros
Theorem
proved
Order preservation, injectivity and composition of transfers
Theorem
proved
Ordered graphs, reflection edges, and labels
Definition
formalized
Ordered transfer products enumerate paths
Theorem
proved
Orthogonal operators with a one-dimensional moving space
Theorem
proved
Outgoing kernels under sheaf isomorphisms, sums, and shifts
Theorem
proved
Outgoing label products send stalks and edge modules into selected images
Theorem
proved
Parameter interchange and inverse bar transforms
Theorem
proved
Parity balance in lower Bruhat intervals
Theorem
proved
Parity sums on doubled internal ranks
Theorem
proved
Patching the two tail assignments on a reflected union
Definition
formalized
Perfect graded pairings and support orthogonality
Definition
formalized
Perfect graded pairings on reduced-word sections
Theorem
proved
Perfect pairings and balanced bimodules
Definition
formalized
Periods and admissible representatives of signed words
Theorem
proved
Plane denominators force membership in a free edge-ring target
Theorem
proved
Plane weights measure the change of the plane inversion count
Theorem
proved
Polynomial R-convolution for word-stalk and kernel characters
Theorem
proved
Polynomial characters of word stalks
Definition
formalized
Polynomial coordinates on an edge coefficient ring
Theorem
proved
Polynomial interpolation on external dihedral vertices
Theorem
proved
Polynomial reflection in a fixed degree
Definition
formalized
Polynomiality, specialization and descent of ordinary R-values
Theorem
proved
Positive Hecke words and their coefficient recurrence
Definition
formalized
Positive reflection parameters precede negative parameters
Theorem
proved
Positive-ideal coordinates and strict diagonal degree
Theorem
proved
Positive-root inversion sets
Definition
formalized
Prescribed values of two independent linear forms
Theorem
proved
Prime character classes are single weights or reflection pairs
Theorem
proved
Prime denominators for compatible word-stalk tuples
Theorem
proved
Prime induced labels and relative primality at a vertex
Theorem
proved
Prime linear generators and divisibility by a root line
Theorem
proved
Prime localization and scalar-denominator membership
Definition
formalized
Prime-denominator membership in a projective target
Theorem
proved
Primitive sheaf projectors
Definition
formalized
Primitivity is preserved by the adjoint operation
Theorem
proved
Primitivity of a split summand and its image projector
Theorem
proved
Projection kernels and split exact sequences of a twisted pair lattice
Theorem
proved
Projective modules, presentations and split maps
Definition
formalized
Projective upper images and compatible lifts for every word
Theorem
proved
Projective upper images give compatible-tuple lifting
Theorem
proved
Projectivity of image modules on a reflection-stable set
Theorem
proved
Projectivity through two successive kernel sequences
Theorem
proved
Properties and local minimality of finite model sums
Theorem
proved
Quadratic identities and inverses of simple Hecke operators
Theorem
proved
Quotients, generation, and flabbiness on a localized coset
Theorem
proved
R-matrix equality makes the comparison endpoints exact
Theorem
proved
R-reciprocity for the actual boundary-sheaf character
Theorem
proved
R-values extracted from the unnormalized bar basis
Definition
formalized
Rank fibers and signed sums in a dihedral lower interval
Theorem
proved
Rank-two preservation forces every relative rank difference
Theorem
proved
Real roots, positive roots, and represented reflections
Definition
formalized
Reciprocity of the lower-half construction
Theorem
proved
Recognition of a boundary sheaf by a primitive top splitting
Theorem
proved
Recognition of the adjoint boundary image
Theorem
proved
Recovering a projective kernel from scaled image equality
Theorem
proved
Recovering every reflection edge from the interval order
Theorem
proved
Recovering linear functionals through a Frobenius trace
Theorem
proved
Recovering terminal-kernel freeness by reverse traversal
Theorem
proved
Reduced alternating words in a rank-two Coxeter system
Theorem
proved
Reduced lengths and existence of signed representatives
Theorem
proved
Reduced-word weights fill the Bruhat interval
Theorem
proved
Reduction of a plane along one direction
Theorem
proved
Reduction of a word by deleting letters
Theorem
proved
Reflected upper sets and their crossing edges
Theorem
proved
Reflection action and labels in signed coordinates
Theorem
proved
Reflection block coordinates and evaluation matrices
Definition
formalized
Reflection labels annihilate word edge quotients
Theorem
proved
Reflection roots as polynomial edge labels
Definition
formalized
Reflection-generated and displacement subgroups of a root subspace
Definition
formalized
Reflections in a subspace subgroup are detected by their roots
Theorem
proved
Reflections, length, and reflection edges of the induced plane system
Theorem
proved
Regular edge scalars and saturation of the head pair lattice
Theorem
proved
Regular scalars on a quotient of a finite free module
Theorem
proved
Relative length and Bruhat intervals in a plane-subgroup coset
Definition
formalized
Relative primality of prime labels after localization
Theorem
proved
Relative rank fibers and two-edge detection of rank two
Theorem
proved
Remaining conditions and the Hilbert-state vector
Definition
formalized
Residue congruence of coefficient characters
Definition
formalized
Restricting an order isomorphism to a subinterval
Theorem
proved
Reversal of the full path product in an induced dihedral interval
Theorem
proved
Right actions, balance and symmetry under tensor induction
Theorem
proved
Rigidity of a low-degree polynomial under reciprocal evaluation
Theorem
proved
Rigidity of a reciprocal scaled difference
Theorem
proved
Root and factor reductions in the actual coset edge ring
Theorem
proved
Root coordinates along an alternating word
Theorem
proved
Root factors and plane primes in the edge quotient
Theorem
proved
Root labels in a localized edge quotient
Theorem
proved
Root partners and geometric plane weights
Definition
formalized
Root spans and two-dimensional root planes
Definition
formalized
Root-label primality, relative primality and regularity
Theorem
proved
Rotation of a ratio order through a simple reflection
Definition
formalized
Rotation transports paths avoiding a simple label
Theorem
proved
Saturated kernels and their free reduced images
Theorem
proved
Saturation of a twisted pair lattice from quotient regularity
Theorem
proved
Scalar extension of embedded kernels and images
Theorem
proved
Scalar images over a quotient ring preserve freeness under injectivity
Theorem
proved
Scalar quotients and saturated submodules
Definition
formalized
Scaled coordinate lifts and the evaluation denominator
Theorem
proved
Scaled equality of embedded edge images
Definition
formalized
Scaled image equality at every actual root-plane localization
Theorem
proved
Scaled image equality from model products and their counts
Theorem
proved
Scaled image equality in every coset structure model
Theorem
proved
Scaled image equality in products and model sums
Theorem
proved
Scaled image equality in the localized boundary sheaf
Theorem
proved
Scaled polynomial evaluations and KL vectors
Definition
formalized
Scaled reciprocity and its restriction to an upper interval
Theorem
proved
Section and outgoing-kernel constraint maps
Definition
formalized
Sections commute with finite flat scalar extension
Theorem
proved
Sections of an image sheaf are the image of the section projector
Theorem
proved
Sections supported at a vertex and their stalk values
Definition
formalized
Selected kernels and edge images on the localized coset
Theorem
proved
Selected kernels and scaled images under sheaf isomorphisms
Theorem
proved
Selected kernels of a structure model are product submodules
Theorem
proved
Selected kernels under outgoing-complete graph pullback
Theorem
proved
Sheaf isomorphisms and their partial forms
Definition
formalized
Sheaf properties inherited by a graded split summand
Theorem
proved
Sheaf properties preserved by lower-ideal extension
Theorem
proved
Sheaf properties under pullback along surviving edges
Theorem
proved
Sheaf properties under scalar extension
Theorem
proved
Signed ambient roots for the induced plane system
Definition
formalized
Signed coordinates for the two alternating rays
Definition
formalized
Signed label comparisons and finite later counts
Definition
formalized
Signed midpoint comparison formulas
Theorem
proved
Signed parameter reciprocity and the inverse-parameter bar coefficient
Theorem
proved
Signed permutations attached to simple generators and words
Definition
formalized
Signs of simple-root images and length change
Theorem
proved
Simple multiplication and the orientation of reflection edges
Theorem
proved
Simple roots relative to a root subspace
Definition
formalized
Simple-labelled edges, avoidance, and edge rotation
Definition
formalized
Simultaneous R-tilde invariance and terminal-kernel freeness
Theorem
proved
Simultaneous decomposition of Bott–Samelson stalk and kernel characters
Theorem
proved
Single and double membership of simple-reflection strings
Theorem
proved
Slope betweenness is equivalent to a positive root combination
Theorem
proved
Solving an anti-reciprocal defect by its lower half
Theorem
proved
Split sheaf summands and their projectors
Definition
formalized
Splitting a stalk while retaining all outgoing restrictions
Theorem
proved
Stable diagonal selection of one residue class
Theorem
proved
Stalk and outgoing-kernel characters of graded sheaves
Definition
formalized
Stalk characters and selected kernels under upper-interval restriction
Theorem
proved
Stalks and kernels of the lower-supported Bruhat models
Theorem
proved
Strict paths selected by a weakly sorted schedule
Theorem
proved
Strictly monotone interval maps cannot decrease rank
Theorem
proved
Strong Bruhat order
Definition
formalized
Strong exchange and deletion from a reduced word
Theorem
proved
Structural properties and kernels of finite sheaf sums
Theorem
proved
Structural properties of a model sum and minimality away from its centers
Theorem
proved
Structure models on the finite relative coset graph
Theorem
proved
Structure models under scalar extension and graph pullback
Theorem
proved
Structure sheaves on principal lower ideals
Definition
formalized
Subexpression evaluations of tensor word modules
Definition
formalized
Support orthogonality makes integral cuts balanced
Theorem
proved
Supported sections are dual to a generated stalk
Theorem
proved
Supported selected edges and their label product
Definition
formalized
Surjectivity of a lift over a local ring
Theorem
proved
Symmetric perfect pairings on the actual boundary sheaf
Theorem
proved
Symmetric-algebra quotients by linear ideals
Theorem
proved
Symmetry of the stalk–costalk identification
Theorem
proved
Tail maps on coordinate-image modules
Definition
formalized
Tail pairs recover word-stalk projections and their divisibility
Theorem
proved
Tensor base change of a graph sheaf
Definition
formalized
Tensor extension of a principal scalar quotient
Theorem
proved
Tensor induction of a finite free paired module
Definition
formalized
The Coxeter system induced by the angular roots of a plane
Definition
formalized
The Hilbert increment from an embedded edge-image inclusion
Theorem
proved
The Hilbert value of an actual saturated image
Theorem
proved
The R-tilde induction step from smaller intervals
Theorem
proved
The Tits form, simple roots, and normal functionals
Definition
formalized
The action on positive representatives of root lines
Definition
formalized
The action on the extended root space
Definition
formalized
The actual edge module over its coefficient ring
Theorem
proved
The adjoint image is dual to a split summand
Theorem
proved
The ambient after-indicator for a root threshold
Definition
formalized
The ambient inversion count inside a root subspace
Definition
formalized
The angular endpoint reflections generate the plane subgroup
Theorem
proved
The ascent and descent recursions for word-stalk characters
Theorem
proved
The avoiding-path sum becomes a full path polynomial after rotation
Theorem
proved
The bar eigenvalue of a dihedral lower-interval sum
Theorem
proved
The basis and pairing degree of one reflection tensor step
Theorem
proved
The boundary-sheaf family obtained by upper-interval restriction
Definition
formalized
The canonical comparison with the adjoint image is an isomorphism
Theorem
proved
The common kernel is a twist of an old restriction kernel
Theorem
proved
The complete schedule comparison under upper-kernel freeness
Theorem
proved
The convergent Hilbert formula for a word-stalk character
Theorem
proved
The coordinate-dual action in arbitrary generator rank
Definition
formalized
The coset interval embedding into an ambient interval
Definition
formalized
The decreasing-path formula for a geometric reflection order
Theorem
proved
The degree of the inverse stalk–costalk duality map
Theorem
proved
The degree of the reduced-root edge factor
Theorem
proved
The descent recursion for normalized R-polynomials
Theorem
proved
The dihedral interval sum of ordinary R-polynomials
Theorem
proved
The edge degree gives a uniform positive transfer coefficient
Theorem
proved
The edge factor retains one plane exponent after local reduction
Theorem
proved
The edge-image inclusion for a chronological schedule suffix
Theorem
proved
The exact sequence for adding one outgoing condition
Theorem
proved
The exact stalk kernel across the first reflection
Theorem
proved
The finite relative coset graph inside a Bruhat interval
Definition
formalized
The first-factor reflection and first-bit exchange
Definition
formalized
The fixed subalgebra and reflection data
Definition
formalized
The form and length of a reduced two-generator tail
Theorem
proved
The full outgoing kernel is dual to the stalk
Theorem
proved
The full outgoing-kernel freeness condition
Definition
formalized
The geometric action of a Coxeter system
Definition
formalized
The geometric plane-weight sum equals the excess length
Theorem
proved
The global inclusion for actual ambient boundary-sheaf edge images
Theorem
proved
The grading shift in stalk–costalk reciprocity
Theorem
proved
The head-kernel maps raise degree by one
Theorem
proved
The image of a product of pre-reflections
Theorem
proved
The increasing Bruhat path polynomial of a ratio order
Definition
formalized
The induced reflection graph and inversion count on a plane-subgroup coset
Theorem
proved
The induced signed action agrees with the ambient root action
Theorem
proved
The integral word adjoint descends to a graded sheaf map
Theorem
proved
The intrinsic graded-rank polynomial of a free module
Definition
formalized
The inversion sequence records the sign change of a word
Theorem
proved
The length-difference bound for ordinary R-polynomials
Theorem
proved
The local intersection map and its matrix
Definition
formalized
The localized edge ring and its reduction map
Definition
formalized
The minimal dimension of a nondegenerate extension
Theorem
proved
The native dihedral later-count difference
Theorem
proved
The new word stalk is the reflected pair lattice
Theorem
proved
The normalization data for ordinary R and KL polynomials
Definition
formalized
The normalized R-family as bar coefficients
Definition
formalized
The normalized single-edge inequality and its equality criterion
Theorem
proved
The ordinary and reflected tail maps of a tensor word
Definition
formalized
The ordinary descent recurrence at every unit parameter
Theorem
proved
The ordinary integral R-polynomial family
Definition
formalized
The outgoing label product of a selected edge set
Definition
formalized
The outgoing-kernel character of a reduced word
Theorem
proved
The pair-projection sheaf of a Bott–Samelson module
Definition
formalized
The path polynomial of a chamber order equals the normalized R-polynomial
Theorem
proved
The perfect trace pairing of a reflection extension
Theorem
proved
The plane prime and its local coefficient ring
Definition
formalized
The polynomial lift before the edge quotient
Definition
formalized
The polynomial-ring Hilbert series from monomial degrees
Theorem
proved
The positive ideal and degree-zero augmentation
Definition
formalized
The positive ideal is the kernel of degree-zero projection
Theorem
proved
The product recurrence for dihedral lower-interval sums
Theorem
proved
The projectivity step for an upper-coordinate image
Theorem
proved
The quadratic relation for a Hecke generator
Definition
formalized
The quotient comparing two module projections
Definition
formalized
The radical and its dual extension
Definition
formalized
The reciprocal convolution identity for R-polynomials
Theorem
proved
The reciprocity defect on a proper upper interval
Definition
formalized
The recursive polynomial family on Bruhat intervals
Definition
formalized
The reduced-root product attached to a positive root
Definition
formalized
The reduced-subword criterion
Theorem
proved
The reflected two-stalk coordinates of a longer word
Definition
formalized
The reflection congruence of an orbit spline
Theorem
proved
The reflection trace and its normalization
Definition
formalized
The reflection trace lowers degree by one
Theorem
proved
The reversed R-kernel with its bottom term removed
Theorem
proved
The right coefficient action at a subexpression weight
Theorem
proved
The root-sign criterion and the inversion count
Theorem
proved
The scaled actual-stalk character vector
Definition
formalized
The selected R and KL polynomial interfaces
Definition
formalized
The signed later-count difference
Theorem
proved
The signed reflection action of the Coxeter group
Definition
formalized
The stalk surjects onto the boundary image
Theorem
proved
The stalk-character identification condition
Definition
formalized
The standard module and its left and right Hecke operators
Definition
formalized
The strict lower-half truncation
Definition
formalized
The strictly dominant coordinate-sum functional
Definition
formalized
The subgroup generated by two distinct involutions is a dihedral Coxeter group
Theorem
proved
The supported later-edge difference is the plane weight
Theorem
proved
The symmetric coefficient algebra and its action
Definition
formalized
The top stalk of a reduced word is the graded coefficient module
Theorem
proved
The transported comparison for actual characters
Theorem
proved
The two head-projection kernels and their graded pieces
Definition
formalized
The two-order descent recursion for increasing path polynomials
Theorem
proved
The two-stage kernel data for upper-coordinate images
Definition
formalized
The unlabelled diamond closure of cover edges
Definition
formalized
The upper edge image is free over its quotient coefficient ring
Theorem
proved
The upper-end edge quotient rule
Definition
formalized
The word pairing lowers degree by the word length
Theorem
proved
Transport of coefficients along an algebra isomorphism
Definition
formalized
Transport of perfect section pairings through coefficient and sheaf isomorphisms
Theorem
proved
Transported edge scores, schedules and remaining conditions
Definition
formalized
Transporting a perfect pairing through tensor induction
Theorem
proved
Twisting a scalar action by an automorphism
Definition
formalized
Two elements and a unique descent at each internal rank
Theorem
proved
Two-edge root planes and confinement to a plane coset
Theorem
proved
Unique positive roots representing reflections
Theorem
proved
Uniqueness and degree shifts of polynomial Hilbert numerators
Theorem
proved
Uniqueness of a normalized polynomial-family pair
Theorem
proved
Uniqueness of the minimal-boundary sheaf up to graded isomorphism
Theorem
proved
Unlabelled interval isomorphisms preserve reflection edges
Theorem
proved
Upward reflection edges
Definition
formalized
Vertex support equals the annihilator of an evaluation kernel
Theorem
proved
Weight support and the dual of a projected stalk
Theorem
proved
Weight-stalk images and supported word elements
Definition
formalized
Word objects and Bott–Samelson tensor induction
Definition
formalized
Word operators and the standard invertible action
Definition
formalized
Word-stalk characters equal positive Hecke-word coefficients
Theorem
proved
Words, length, reflections, and inversion sequences
Definition
formalized
Zero sheaves, finite sums, and grading shifts
Definition
formalized
Zero, top and empty-word character values
Theorem
proved
Kl.02 Hecke Polynomials
A reciprocal polynomial strictly below the midpoint is zero
Theorem
proved
Anti-reciprocity of the recursively constructed defect
Theorem
proved
Bruhat support and bar reciprocity for positive Hecke words
Theorem
proved
Bruhat support and diagonal coefficients of the bar basis
Theorem
proved
Coefficients and the strict degree bound of the lower half
Theorem
proved
Cyclicity of the right action and reduced-word independence
Theorem
proved
Degree bounds for the recursively constructed family
Theorem
proved
Existence and uniqueness of the canonical KL families
Theorem
proved
Hecke operators, the bar map, and normalized R-polynomials
Concept
formalized
Inverse bar coefficients and the R-value kernel identity
Theorem
proved
Inverse-basis transforms and the Hecke bar involution
Definition
formalized
KL polynomials in a dihedral Coxeter system
Theorem
proved
Left and right simple Hecke operators commute
Theorem
proved
Lower-interval Hecke sums and their correction vectors
Definition
formalized
Normalized KL reciprocity in the square parameter
Theorem
proved
Normalized R-polynomials and the square parameter
Theorem
proved
Parameter interchange and inverse bar transforms
Theorem
proved
Polynomial reflection in a fixed degree
Definition
formalized
Polynomiality, specialization and descent of ordinary R-values
Theorem
proved
Positive Hecke words and their coefficient recurrence
Definition
formalized
Quadratic identities and inverses of simple Hecke operators
Theorem
proved
R-values extracted from the unnormalized bar basis
Definition
formalized
Reciprocity of the lower-half construction
Theorem
proved
Rigidity of a low-degree polynomial under reciprocal evaluation
Theorem
proved
Rigidity of a reciprocal scaled difference
Theorem
proved
Scaled polynomial evaluations and KL vectors
Definition
formalized
Signed parameter reciprocity and the inverse-parameter bar coefficient
Theorem
proved
Single and double membership of simple-reflection strings
Theorem
proved
Solving an anti-reciprocal defect by its lower half
Theorem
proved
The bar eigenvalue of a dihedral lower-interval sum
Theorem
proved
The descent recursion for normalized R-polynomials
Theorem
proved
The dihedral interval sum of ordinary R-polynomials
Theorem
proved
The length-difference bound for ordinary R-polynomials
Theorem
proved
The normalization data for ordinary R and KL polynomials
Definition
formalized
The normalized R-family as bar coefficients
Definition
formalized
The ordinary descent recurrence at every unit parameter
Theorem
proved
The ordinary integral R-polynomial family
Definition
formalized
The product recurrence for dihedral lower-interval sums
Theorem
proved
The quadratic relation for a Hecke generator
Definition
formalized
The reciprocal convolution identity for R-polynomials
Theorem
proved
The reciprocity defect on a proper upper interval
Definition
formalized
The recursive polynomial family on Bruhat intervals
Definition
formalized
The reversed R-kernel with its bottom term removed
Theorem
proved
The selected R and KL polynomial interfaces
Definition
formalized
The standard module and its left and right Hecke operators
Definition
formalized
The strict lower-half truncation
Definition
formalized
Uniqueness of a normalized polynomial-family pair
Theorem
proved
Word operators and the standard invertible action
Definition
formalized
Kl.Coxeter
A length-one successor inside every strict Bruhat interval
Theorem
proved
A reflection reverses the sign of its own label
Theorem
proved
Alternating words and their endpoint conventions
Definition
formalized
Bruhat comparison by length in a dihedral system
Theorem
proved
Bruhat intervals, endpoints and rank differences
Definition
formalized
Coxeter relations for the signed simple permutations
Theorem
proved
Existence and transport of finite-support interval models
Theorem
proved
External lower vertices and their parity classes
Definition
formalized
Finite generator support of a lower Bruhat ideal
Theorem
proved
Finite-support interval models in standard parabolic systems
Definition
formalized
Finiteness of Bruhat intervals
Theorem
proved
Generated parabolic subgroups and minimal coset representatives
Definition
formalized
Interval isomorphisms preserve endpoints and rank differences
Theorem
proved
Length-additive decomposition by a parabolic subgroup
Theorem
proved
Lower and upper simple-reflection envelopes
Definition
formalized
Monotone simple envelopes and the Bruhat lifting property
Theorem
proved
Parity balance in lower Bruhat intervals
Theorem
proved
Reduced alternating words in a rank-two Coxeter system
Theorem
proved
Reduction of a word by deleting letters
Theorem
proved
Restricting an order isomorphism to a subinterval
Theorem
proved
Signed permutations attached to simple generators and words
Definition
formalized
Simple multiplication and the orientation of reflection edges
Theorem
proved
Strictly monotone interval maps cannot decrease rank
Theorem
proved
Strong Bruhat order
Definition
formalized
Strong exchange and deletion from a reduced word
Theorem
proved
The form and length of a reduced two-generator tail
Theorem
proved
The inversion sequence records the sign change of a word
Theorem
proved
The reduced-subword criterion
Theorem
proved
The signed reflection action of the Coxeter group
Definition
formalized
Upward reflection edges
Definition
formalized
Words, length, reflections, and inversion sequences
Definition
formalized
Kl.Graded Algebra
A basis descends through a scalar-kernel presentation
Theorem
proved
A finite homogeneous free cover from arbitrary generators
Theorem
proved
A free cover splits into a minimal cover and a graded free remainder
Theorem
proved
A graded map equal to the identity modulo the positive ideal is invertible
Theorem
proved
A scalar difference annihilates a pair-projection quotient
Theorem
proved
Cancelling a homogeneous scalar recovers the input degree
Theorem
proved
Character reflection from a homogeneous dual equivalence
Theorem
proved
Characters under graded equivalences, sums and shifts
Theorem
proved
Clearing a denominator in an embedded tensor localization
Theorem
proved
Coefficient transport of dual modules and perfect pairings
Theorem
proved
Components under homogeneous maps and scalar multiplication
Theorem
proved
Constructing a minimal graded free cover
Theorem
proved
Degrees of coefficients and dual basis functionals
Theorem
proved
Degreewise quotient defects of a subspace inclusion
Definition
formalized
Descending an endomorphism through projections and edge quotients
Theorem
proved
Descent maps and projective image splittings
Theorem
proved
Edge coefficient rings in symmetric and polynomial coordinates
Definition
formalized
Equality and strict inclusion detected by Hilbert values
Theorem
proved
Finite graded polynomial modules have convergent Hilbert values
Theorem
proved
Finite homogeneous bases and their degrees
Definition
formalized
Finite nonnegatively graded module data
Definition
formalized
Finite products and shifted free modules
Definition
formalized
Free presentations over a scalar quotient and their kernels
Theorem
proved
From graded projectivity to a homogeneous free basis
Theorem
proved
Graded Nakayama by induction on degree
Theorem
proved
Graded components and homogeneous projection
Definition
formalized
Grading submodules and quotients through their components
Theorem
proved
Hilbert additivity for homogeneous exact sequences
Theorem
proved
Hilbert additivity for the image of a homogeneous submodule
Theorem
proved
Hilbert functions, formal series and numerical values
Definition
formalized
Hilbert series and values of a homogeneous free basis
Theorem
proved
Hilbert values of a regular homogeneous scalar image and quotient
Theorem
proved
Homogeneous functionals have homogeneous pairing representatives
Theorem
proved
Homogeneous image pieces and their Hilbert degree shift
Theorem
proved
Homogeneous lifts from a finite graded free module
Theorem
proved
Homogeneous maps and grading shifts
Definition
formalized
Homogeneous submodules, quotients, and map images
Definition
formalized
Ideals generated by linear subspaces
Definition
formalized
Independence of the basis-degree polynomial
Theorem
proved
Isomorphisms determined by maps of minimal covers
Theorem
proved
Kernel projectivity from two presentations of one module
Theorem
proved
Minimal graded free covers
Definition
formalized
Polynomial coordinates on an edge coefficient ring
Theorem
proved
Positive-ideal coordinates and strict diagonal degree
Theorem
proved
Prime linear generators and divisibility by a root line
Theorem
proved
Prime localization and scalar-denominator membership
Definition
formalized
Prime-denominator membership in a projective target
Theorem
proved
Projective modules, presentations and split maps
Definition
formalized
Projectivity through two successive kernel sequences
Theorem
proved
Reduction of a plane along one direction
Theorem
proved
Reflection roots as polynomial edge labels
Definition
formalized
Regular scalars on a quotient of a finite free module
Theorem
proved
Root-label primality, relative primality and regularity
Theorem
proved
Saturated kernels and their free reduced images
Theorem
proved
Scalar extension of embedded kernels and images
Theorem
proved
Scalar images over a quotient ring preserve freeness under injectivity
Theorem
proved
Scalar quotients and saturated submodules
Definition
formalized
Symmetric-algebra quotients by linear ideals
Theorem
proved
Tensor extension of a principal scalar quotient
Theorem
proved
The Hilbert value of an actual saturated image
Theorem
proved
The intrinsic graded-rank polynomial of a free module
Definition
formalized
The polynomial-ring Hilbert series from monomial degrees
Theorem
proved
The positive ideal and degree-zero augmentation
Definition
formalized
The positive ideal is the kernel of degree-zero projection
Theorem
proved
The quotient comparing two module projections
Definition
formalized
The symmetric coefficient algebra and its action
Definition
formalized
Transport of coefficients along an algebra isomorphism
Definition
formalized
Twisting a scalar action by an automorphism
Definition
formalized
Uniqueness and degree shifts of polynomial Hilbert numerators
Theorem
proved
Kl.Invariance
Combinatorial invariance of Kazhdan–Lusztig polynomials
Theorem
proved
Endpoint equality forces equality at every transfer step
Theorem
proved
Extracting the bottom R-tilde row from character comparison
Theorem
proved
Freeness of all terminal kernels in a transported schedule
Definition
formalized
From one-edge bounds to the full transfer inequality
Theorem
proved
KL invariance for finite-generator Coxeter systems
Theorem
proved
Kernel Hilbert values and normalized states
Definition
formalized
R-matrix equality makes the comparison endpoints exact
Theorem
proved
Recovering a projective kernel from scaled image equality
Theorem
proved
Recovering terminal-kernel freeness by reverse traversal
Theorem
proved
Remaining conditions and the Hilbert-state vector
Definition
formalized
Simultaneous R-tilde invariance and terminal-kernel freeness
Theorem
proved
The Hilbert increment from an embedded edge-image inclusion
Theorem
proved
The R-tilde induction step from smaller intervals
Theorem
proved
The complete schedule comparison under upper-kernel freeness
Theorem
proved
The edge degree gives a uniform positive transfer coefficient
Theorem
proved
The exact sequence for adding one outgoing condition
Theorem
proved
The normalized single-edge inequality and its equality criterion
Theorem
proved
The transported comparison for actual characters
Theorem
proved
Kl.Localization
A finite free cover splits over a local minimal cover
Theorem
proved
A localized scaled-image equality gives an original-module multiplier
Theorem
proved
A plane weight equals the intrinsic dihedral edge degree
Theorem
proved
Adding the model block at one unprocessed vertex
Theorem
proved
Ambient later-edge selections and their coset pullbacks
Definition
formalized
An actual ambient edge has coordinates in a least plane coset
Theorem
proved
Associated factor counts determine scalar-image submodules
Theorem
proved
Basic properties and local minimality of structure sheaves
Theorem
proved
Chosen roots for the supported plane factors
Definition
formalized
Counting supported later edges by their target vertices
Theorem
proved
Decomposition of the sheaf after root-plane localization
Theorem
proved
Degree shift and injectivity of the edge-factor action
Theorem
proved
Degree, reduction and root nondivisibility of the polynomial lift
Theorem
proved
Descending decomposition into local boundary models
Theorem
proved
Edge images of selected structure-model kernels
Theorem
proved
Finite ungraded sums of local models
Definition
formalized
Finiteness and outgoing lifts of the relative coset graph
Theorem
proved
Flabbiness of the induced dihedral structure models
Theorem
proved
Flat base change of selected kernels and edge images
Theorem
proved
Flow-down sections and outgoing label products
Definition
formalized
Flow-down sections imply flabbiness
Theorem
proved
Freeness of a saturated image over the edge quotient ring
Theorem
proved
Height-one membership in a free target
Theorem
proved
Induced ambient labels and dihedral structure models
Definition
formalized
Interpolation produces the prescribed flow-down sections
Theorem
proved
Kernel products and edge images for the actual coset models
Theorem
proved
Later-edge selections for the coset model comparison
Definition
formalized
Linear membership and units at a root-plane prime
Theorem
proved
Local boundary models over a local coefficient ring
Definition
formalized
Local model data from structure sheaves
Theorem
proved
Localized labels and the coset sheaf
Definition
formalized
Lower and upper images in the same edge module
Definition
formalized
Minimal free covers over a local ring
Definition
formalized
Multiplication by the correction factor on an edge module
Definition
formalized
Nonvanishing and homogeneity of the edge factor
Theorem
proved
Orbit splines in the extended realization
Definition
formalized
Orbit-spline factors with prescribed zeros
Theorem
proved
Outgoing label products send stalks and edge modules into selected images
Theorem
proved
Plane denominators force membership in a free edge-ring target
Theorem
proved
Polynomial interpolation on external dihedral vertices
Theorem
proved
Prime induced labels and relative primality at a vertex
Theorem
proved
Properties and local minimality of finite model sums
Theorem
proved
Quotients, generation, and flabbiness on a localized coset
Theorem
proved
Relative primality of prime labels after localization
Theorem
proved
Root and factor reductions in the actual coset edge ring
Theorem
proved
Root factors and plane primes in the edge quotient
Theorem
proved
Root labels in a localized edge quotient
Theorem
proved
Scaled equality of embedded edge images
Definition
formalized
Scaled image equality at every actual root-plane localization
Theorem
proved
Scaled image equality from model products and their counts
Theorem
proved
Scaled image equality in every coset structure model
Theorem
proved
Scaled image equality in products and model sums
Theorem
proved
Scaled image equality in the localized boundary sheaf
Theorem
proved
Selected kernels and edge images on the localized coset
Theorem
proved
Selected kernels and scaled images under sheaf isomorphisms
Theorem
proved
Selected kernels of a structure model are product submodules
Theorem
proved
Splitting a stalk while retaining all outgoing restrictions
Theorem
proved
Structure models on the finite relative coset graph
Theorem
proved
Structure models under scalar extension and graph pullback
Theorem
proved
Structure sheaves on principal lower ideals
Definition
formalized
Supported selected edges and their label product
Definition
formalized
Surjectivity of a lift over a local ring
Theorem
proved
The degree of the reduced-root edge factor
Theorem
proved
The edge factor retains one plane exponent after local reduction
Theorem
proved
The edge-image inclusion for a chronological schedule suffix
Theorem
proved
The finite relative coset graph inside a Bruhat interval
Definition
formalized
The global inclusion for actual ambient boundary-sheaf edge images
Theorem
proved
The localized edge ring and its reduction map
Definition
formalized
The outgoing label product of a selected edge set
Definition
formalized
The plane prime and its local coefficient ring
Definition
formalized
The polynomial lift before the edge quotient
Definition
formalized
The reduced-root product attached to a positive root
Definition
formalized
The reflection congruence of an orbit spline
Theorem
proved
The supported later-edge difference is the plane weight
Theorem
proved
The upper edge image is free over its quotient coefficient ring
Theorem
proved
Kl.Realizations
A root represented by a reflection and a sign bit
Definition
formalized
An equal product of two reflections determines the same root span
Theorem
proved
Chebyshev coefficients for rank-two root calculations
Definition
formalized
Compatibility of the signed action with root transformation
Theorem
proved
Dominant evaluation detects right and left ascents
Theorem
proved
Faithfulness and the rank-one characterization of reflections
Theorem
proved
Faithfulness of the geometric, extended, and coordinate-dual actions
Theorem
proved
Finite Coxeter relations for linear reflections
Theorem
proved
Isometries whose displacement lies in a root line
Theorem
proved
Linear reflections from a root and a normal
Definition
formalized
Moving spaces, fixed spaces, and reflection faithfulness
Definition
formalized
Nondegeneracy and independence in the extended root space
Theorem
proved
Orthogonal operators with a one-dimensional moving space
Theorem
proved
Positive-root inversion sets
Definition
formalized
Prescribed values of two independent linear forms
Theorem
proved
Real roots, positive roots, and represented reflections
Definition
formalized
Reflection-generated and displacement subgroups of a root subspace
Definition
formalized
Reflections in a subspace subgroup are detected by their roots
Theorem
proved
Root coordinates along an alternating word
Theorem
proved
Root spans and two-dimensional root planes
Definition
formalized
Signs of simple-root images and length change
Theorem
proved
The Tits form, simple roots, and normal functionals
Definition
formalized
The action on positive representatives of root lines
Definition
formalized
The action on the extended root space
Definition
formalized
The coordinate-dual action in arbitrary generator rank
Definition
formalized
The geometric action of a Coxeter system
Definition
formalized
The image of a product of pre-reflections
Theorem
proved
The minimal dimension of a nondegenerate extension
Theorem
proved
The radical and its dual extension
Definition
formalized
The root-sign criterion and the inversion count
Theorem
proved
The strictly dominant coordinate-sum functional
Definition
formalized
Unique positive roots representing reflections
Theorem
proved
Kl.Reflection Combinatorics
A chamber determines the inversion signs and a least simple descent
Theorem
proved
A chamber order rotates at a least simple descent
Theorem
proved
A chronological suffix gives the strict later conditions at both endpoints
Theorem
proved
A dihedral interval graph image lies in one root-plane coset
Theorem
proved
A generic ratio order in every prescribed chamber
Theorem
proved
A least simple label splits off one edge from increasing paths
Theorem
proved
A path involution identifies two transfer-product entries
Theorem
proved
Actual dihedral after-indicators and later-edge counts
Definition
formalized
Actual plane edge roots and the two prefix sequences
Definition
formalized
Actual root comparisons give the signed indicator tables
Theorem
proved
Admissible signed vertex indices
Definition
formalized
Ambient root signs and intrinsic dihedral descents
Theorem
proved
Ambient root signs detect inversions of the induced system
Theorem
proved
An extreme positive root is simple in its subspace
Theorem
proved
An injective rank-preserving dihedral map fills its target interval
Theorem
proved
Angular boundary roots of a root plane
Definition
formalized
Bruhat endpoint bounds and the selected increasing paths
Theorem
proved
Consecutive root order is determined by the middle descent
Theorem
proved
Coordinate polynomials and a polynomial family of functionals
Definition
formalized
Coset root identities and reindexing of actual later counts
Theorem
proved
Directed edge lists, path weights and selected path sets
Definition
formalized
Elementary edge transfers and ordered products
Definition
formalized
Every root plane has two angular boundary roots
Theorem
proved
Exact two-edge intermediate sets survive interval transport
Theorem
proved
Existence of a generic functional ordering all positive roots
Theorem
proved
Extremal simple labels on increasing paths
Theorem
proved
Finite and infinite angular order of actual dihedral roots
Theorem
proved
Finite residue comparisons at incident signed edges
Theorem
proved
Finite sets in a dihedral group have a common Bruhat upper bound
Theorem
proved
Full transport of a relative dihedral interval
Theorem
proved
Geometric reflection orders
Definition
formalized
Graph maps and local label comparisons transport selected paths
Theorem
proved
Heights, normalized positive roots, and geometric slopes
Definition
formalized
Internal-rank flips of a dihedral interval and its edges
Definition
formalized
Inverse symmetry and simple steps for the plane inversion count
Theorem
proved
Inversion cuts in a root plane
Theorem
proved
Later-edge counts in transported dihedral intervals
Theorem
proved
Least coset representatives preserve the signs of plane roots
Theorem
proved
Monotonicity and labels of the two prefix-root sequences
Theorem
proved
Odd length detects dihedral reflections and edges
Theorem
proved
Order preservation, injectivity and composition of transfers
Theorem
proved
Ordered transfer products enumerate paths
Theorem
proved
Parity sums on doubled internal ranks
Theorem
proved
Periods and admissible representatives of signed words
Theorem
proved
Plane weights measure the change of the plane inversion count
Theorem
proved
Positive reflection parameters precede negative parameters
Theorem
proved
Rank fibers and signed sums in a dihedral lower interval
Theorem
proved
Rank-two preservation forces every relative rank difference
Theorem
proved
Recovering every reflection edge from the interval order
Theorem
proved
Reduced lengths and existence of signed representatives
Theorem
proved
Reflection action and labels in signed coordinates
Theorem
proved
Reflections, length, and reflection edges of the induced plane system
Theorem
proved
Relative length and Bruhat intervals in a plane-subgroup coset
Definition
formalized
Relative rank fibers and two-edge detection of rank two
Theorem
proved
Reversal of the full path product in an induced dihedral interval
Theorem
proved
Root partners and geometric plane weights
Definition
formalized
Rotation of a ratio order through a simple reflection
Definition
formalized
Rotation transports paths avoiding a simple label
Theorem
proved
Signed ambient roots for the induced plane system
Definition
formalized
Signed coordinates for the two alternating rays
Definition
formalized
Signed label comparisons and finite later counts
Definition
formalized
Signed midpoint comparison formulas
Theorem
proved
Simple roots relative to a root subspace
Definition
formalized
Simple-labelled edges, avoidance, and edge rotation
Definition
formalized
Slope betweenness is equivalent to a positive root combination
Theorem
proved
Strict paths selected by a weakly sorted schedule
Theorem
proved
The Coxeter system induced by the angular roots of a plane
Definition
formalized
The ambient after-indicator for a root threshold
Definition
formalized
The ambient inversion count inside a root subspace
Definition
formalized
The angular endpoint reflections generate the plane subgroup
Theorem
proved
The avoiding-path sum becomes a full path polynomial after rotation
Theorem
proved
The coset interval embedding into an ambient interval
Definition
formalized
The decreasing-path formula for a geometric reflection order
Theorem
proved
The geometric plane-weight sum equals the excess length
Theorem
proved
The increasing Bruhat path polynomial of a ratio order
Definition
formalized
The induced reflection graph and inversion count on a plane-subgroup coset
Theorem
proved
The induced signed action agrees with the ambient root action
Theorem
proved
The native dihedral later-count difference
Theorem
proved
The path polynomial of a chamber order equals the normalized R-polynomial
Theorem
proved
The signed later-count difference
Theorem
proved
The subgroup generated by two distinct involutions is a dihedral Coxeter group
Theorem
proved
The two-order descent recursion for increasing path polynomials
Theorem
proved
The unlabelled diamond closure of cover edges
Definition
formalized
Transported edge scores, schedules and remaining conditions
Definition
formalized
Two elements and a unique descent at each internal rank
Theorem
proved
Two-edge root planes and confinement to a plane coset
Theorem
proved
Unlabelled interval isomorphisms preserve reflection edges
Theorem
proved
Kl.Sheaves
A nonzero local diagonal forces a strict half-degree bound
Theorem
proved
A nonzero split summand of a primitive sheaf is the whole sheaf
Theorem
proved
A normalized boundary sheaf is a graded summand of a word sheaf
Theorem
proved
A reduced tensor word realizes all global sections
Theorem
proved
Adding one vertex to a partial sheaf morphism
Theorem
proved
Adding the next center in a boundary-model decomposition
Theorem
proved
Attaching a new bottom stalk by a minimal cover
Theorem
proved
Balanced perfect duality on global sections
Definition
formalized
Boundary and stalk images under an isomorphism above a vertex
Theorem
proved
Boundary kernel characters and their degree bound
Theorem
proved
Boundary models supported on principal lower ideals
Definition
formalized
Boundary recognition after a change of coefficient coordinates
Theorem
proved
Boundary values supplied by upper sections
Definition
formalized
Boundary-sheaf isomorphisms are detected at the normalized stalk
Theorem
proved
Boundary-sheaf pullback with complete outgoing edge lifts
Theorem
proved
Cancelling lower summands in character identities
Theorem
proved
Compatible assignments and sections on a vertex subset
Definition
formalized
Composition, balance, and grading of adjoints
Theorem
proved
Construction of normalized models at every vertex
Theorem
proved
Decomposing a free flabby sheaf into shifted boundary models
Theorem
proved
Decomposing a stalk over an identified upper boundary
Theorem
proved
Existence of normalized boundary sheaves on finite ordered graphs
Theorem
proved
Extending a partial sheaf isomorphism across one vertex
Theorem
proved
Extending a sheaf morphism from an upper set
Theorem
proved
Extending a split top stalk to a sheaf summand
Theorem
proved
Extending an interval assignment to its ambient upper closure
Definition
formalized
Extension by zero from a lower ideal
Definition
formalized
Extension from subsets closed under surviving edges
Theorem
proved
Finite constructions from shifted boundary models
Definition
formalized
Fixed stalks and the top normalization of adjoint projectors
Theorem
proved
Flabbiness and closure under directed edges
Definition
formalized
Flabbiness of the actual word sheaf
Theorem
proved
Free stalks, upper quotients, and global generation
Definition
formalized
Free word stalks and root quotients in polynomial coordinates
Theorem
proved
Graded sheaves and homogeneous restriction maps
Definition
formalized
Graph maps, graph equivalences, and sheaf pullback
Definition
formalized
Image sheaves and the splitting of a projector
Definition
formalized
Image, symmetry, and grading of the local intersection map
Theorem
proved
Incoming labels identify the outgoing kernel with vertex support
Theorem
proved
Indecomposability of the normalized boundary sheaf
Theorem
proved
Integral adjoints for a perfect pairing
Definition
formalized
Integral vertex cuts and products of edge labels
Definition
formalized
KL endpoint formulas under character identification
Theorem
proved
Kernels of upward edge conditions
Definition
formalized
Lifting a partial morphism through the boundary image
Theorem
proved
Lower-character normalization and convolution on an ambient interval
Theorem
proved
Minimal-boundary sheaves and their normalized stalk
Definition
formalized
Module-valued sheaves on an ordered graph
Definition
formalized
Morphisms and partial morphisms of graded graph sheaves
Definition
formalized
Normalized empty and full kernels from the actual character
Theorem
proved
One multiplicity family controls stalk and full-kernel characters
Theorem
proved
Ordered graphs, reflection edges, and labels
Definition
formalized
Outgoing kernels under sheaf isomorphisms, sums, and shifts
Theorem
proved
Perfect graded pairings and support orthogonality
Definition
formalized
Perfect graded pairings on reduced-word sections
Theorem
proved
Polynomial R-convolution for word-stalk and kernel characters
Theorem
proved
Primitive sheaf projectors
Definition
formalized
Primitivity is preserved by the adjoint operation
Theorem
proved
Primitivity of a split summand and its image projector
Theorem
proved
R-reciprocity for the actual boundary-sheaf character
Theorem
proved
Recognition of a boundary sheaf by a primitive top splitting
Theorem
proved
Recognition of the adjoint boundary image
Theorem
proved
Scaled reciprocity and its restriction to an upper interval
Theorem
proved
Section and outgoing-kernel constraint maps
Definition
formalized
Sections commute with finite flat scalar extension
Theorem
proved
Sections of an image sheaf are the image of the section projector
Theorem
proved
Sections supported at a vertex and their stalk values
Definition
formalized
Selected kernels under outgoing-complete graph pullback
Theorem
proved
Sheaf isomorphisms and their partial forms
Definition
formalized
Sheaf properties inherited by a graded split summand
Theorem
proved
Sheaf properties preserved by lower-ideal extension
Theorem
proved
Sheaf properties under pullback along surviving edges
Theorem
proved
Sheaf properties under scalar extension
Theorem
proved
Simultaneous decomposition of Bott–Samelson stalk and kernel characters
Theorem
proved
Split sheaf summands and their projectors
Definition
formalized
Stalk and outgoing-kernel characters of graded sheaves
Definition
formalized
Stalk characters and selected kernels under upper-interval restriction
Theorem
proved
Stalks and kernels of the lower-supported Bruhat models
Theorem
proved
Structural properties and kernels of finite sheaf sums
Theorem
proved
Structural properties of a model sum and minimality away from its centers
Theorem
proved
Support orthogonality makes integral cuts balanced
Theorem
proved
Supported sections are dual to a generated stalk
Theorem
proved
Symmetric perfect pairings on the actual boundary sheaf
Theorem
proved
Symmetry of the stalk–costalk identification
Theorem
proved
Tensor base change of a graph sheaf
Definition
formalized
The actual edge module over its coefficient ring
Theorem
proved
The adjoint image is dual to a split summand
Theorem
proved
The boundary-sheaf family obtained by upper-interval restriction
Definition
formalized
The canonical comparison with the adjoint image is an isomorphism
Theorem
proved
The degree of the inverse stalk–costalk duality map
Theorem
proved
The full outgoing kernel is dual to the stalk
Theorem
proved
The full outgoing-kernel freeness condition
Definition
formalized
The grading shift in stalk–costalk reciprocity
Theorem
proved
The integral word adjoint descends to a graded sheaf map
Theorem
proved
The local intersection map and its matrix
Definition
formalized
The outgoing-kernel character of a reduced word
Theorem
proved
The pair-projection sheaf of a Bott–Samelson module
Definition
formalized
The scaled actual-stalk character vector
Definition
formalized
The stalk surjects onto the boundary image
Theorem
proved
The stalk-character identification condition
Definition
formalized
The upper-end edge quotient rule
Definition
formalized
Transport of perfect section pairings through coefficient and sheaf isomorphisms
Theorem
proved
Uniqueness of the minimal-boundary sheaf up to graded isomorphism
Theorem
proved
Vertex support equals the annihilator of an evaluation kernel
Theorem
proved
Zero sheaves, finite sums, and grading shifts
Definition
formalized
Kl.Word Modules
A diagonal operator with one scalar on a chosen block
Theorem
proved
A finite coordinate presentation over an arbitrary weight set
Definition
formalized
A linear reflection induces Frobenius data on its symmetric algebra
Theorem
proved
A pair lattice with a twisted second scalar action
Definition
formalized
Assembling class lifts with one prime denominator
Theorem
proved
Bruhat upper sets and their reflected union and intersection
Definition
formalized
Character congruence modulo a reflection root
Theorem
proved
Compatibility and lifting of a patched tail assignment
Theorem
proved
Compatible tuples, upper-image projectivity and lifting
Definition
formalized
Degreewise exact sequences and word-stalk dimensions
Theorem
proved
Detection of coordinate images by their two tail projections
Theorem
proved
Diagonal operators preserving a coordinate submodule
Definition
formalized
Exact kernels for a reflection distinct from the first letter
Theorem
proved
Exact reflection kernels for a tensor word
Definition
formalized
Extending a finite free dual and pairing by tensor product
Theorem
proved
Free word stalks and exact reflection-edge kernels
Theorem
proved
Freeness of a new stalk from the two tail stalks
Theorem
proved
Frobenius data for the simple reflections of the extended realization
Definition
formalized
Frobenius traces and trace duality
Definition
formalized
Homogeneous evaluation and homogeneous lifts to word modules
Theorem
proved
Images in sets of module coordinates
Definition
formalized
Injectivity of the reflection block-coordinate map
Theorem
proved
Integral injectivity of full word evaluation
Theorem
proved
Invariant and anti-invariant reflection coordinates
Theorem
proved
Patching the two tail assignments on a reflected union
Definition
formalized
Perfect pairings and balanced bimodules
Definition
formalized
Polynomial characters of word stalks
Definition
formalized
Prime character classes are single weights or reflection pairs
Theorem
proved
Prime denominators for compatible word-stalk tuples
Theorem
proved
Projection kernels and split exact sequences of a twisted pair lattice
Theorem
proved
Projective upper images and compatible lifts for every word
Theorem
proved
Projective upper images give compatible-tuple lifting
Theorem
proved
Projectivity of image modules on a reflection-stable set
Theorem
proved
Recovering linear functionals through a Frobenius trace
Theorem
proved
Reduced-word weights fill the Bruhat interval
Theorem
proved
Reflected upper sets and their crossing edges
Theorem
proved
Reflection block coordinates and evaluation matrices
Definition
formalized
Reflection labels annihilate word edge quotients
Theorem
proved
Regular edge scalars and saturation of the head pair lattice
Theorem
proved
Residue congruence of coefficient characters
Definition
formalized
Right actions, balance and symmetry under tensor induction
Theorem
proved
Saturation of a twisted pair lattice from quotient regularity
Theorem
proved
Scaled coordinate lifts and the evaluation denominator
Theorem
proved
Stable diagonal selection of one residue class
Theorem
proved
Subexpression evaluations of tensor word modules
Definition
formalized
Tail maps on coordinate-image modules
Definition
formalized
Tail pairs recover word-stalk projections and their divisibility
Theorem
proved
Tensor induction of a finite free paired module
Definition
formalized
The ascent and descent recursions for word-stalk characters
Theorem
proved
The basis and pairing degree of one reflection tensor step
Theorem
proved
The common kernel is a twist of an old restriction kernel
Theorem
proved
The convergent Hilbert formula for a word-stalk character
Theorem
proved
The exact stalk kernel across the first reflection
Theorem
proved
The first-factor reflection and first-bit exchange
Definition
formalized
The fixed subalgebra and reflection data
Definition
formalized
The head-kernel maps raise degree by one
Theorem
proved
The new word stalk is the reflected pair lattice
Theorem
proved
The ordinary and reflected tail maps of a tensor word
Definition
formalized
The perfect trace pairing of a reflection extension
Theorem
proved
The projectivity step for an upper-coordinate image
Theorem
proved
The reflected two-stalk coordinates of a longer word
Definition
formalized
The reflection trace and its normalization
Definition
formalized
The reflection trace lowers degree by one
Theorem
proved
The right coefficient action at a subexpression weight
Theorem
proved
The top stalk of a reduced word is the graded coefficient module
Theorem
proved
The two head-projection kernels and their graded pieces
Definition
formalized
The two-stage kernel data for upper-coordinate images
Definition
formalized
The word pairing lowers degree by the word length
Theorem
proved
Transporting a perfect pairing through tensor induction
Theorem
proved
Weight support and the dual of a projected stalk
Theorem
proved
Weight-stalk images and supported word elements
Definition
formalized
Word objects and Bott–Samelson tensor induction
Definition
formalized
Word-stalk characters equal positive Hecke-word coefficients
Theorem
proved
Zero, top and empty-word character values
Theorem
proved