How to demonstrate that a game always have a subgame-perfect equilibrium in pure strategies? If I have an specific extensive game, with only a finite set of strategies, how can I demonstrate that the game always have a subgame-perfect equilibrium in pure strategies? My first intuition was to show that in every subgame a pure strategy it's a solution to the problem (maybe not unique) and then there is always a pure strategies equilibrium. But I'm not sure.
You could represent the game in simultaneous form (matrix) to see all possible equilibria. If there is only one, then that's your subgame-perfect Nash equilibrium (since there are no other equilibria). If there are multiple equilibrias in the simultaneous representation, the extensive form allows you to see if some paths would never be reached given the structure of the game.

Essentially, the extensive form "proves" which paths would never be reached through ruling them out. The one path that is reached is your SPNE. An SPNE has a more strict definition. There is really no shortcut around the arithmetic in the extensive form since the definition of SPNE forces you to check for the one viable path.