Password Generator Python
Already pointed out by other users

There is no need to make lists from the strings as any sequence will do
minimums - you make bad names where the existing names were better

The if clause
if args.extended :
    subset = alphaL + alphaU + numeric + special2
    for i in range(0, minimums[3]) :
        password += secrets.choice(special2)
elif minimums[3] :
    subset = alphaL + alphaU + numeric + special
    for i in range(0, minimums[3]) :
        password += secrets.choice(special)

is erroneous. The check for elif minimums[3] shall be replaced by an else:
Also - just because you already switch on args.extended you are not required to pack all variation on that argument in there.
You prepare subset for the logically next function (choice from compound set) before even performing the current one (choice from special).
That results in less readability. There is nothing wrong in switching two times if required. However in this case you should simply switch
if args.extended:
    special = &quot;&quot;&quot;~`!@#$%^&amp;*()+=_-{}[]\|:;&quot;'?/&lt;&gt;,.&quot;&quot;&quot;
else:
    special = &quot;!@#$%^&amp;*&quot;

Then the choice from special/special2 collapses to the standard pattern.
Names
It was already mentioned that the minimum list is a name worse than the args attributes (which could be even more descriptive).
Also the names for your imports are bad and camel-cased. why not simply follow the existing naming scheme?
ascii_lowercase = string.ascii_lowercase

or even more straight
from string import ascii_lowercase
from string import ascii_uppercase
from string import digits

An extra bad name is subset
subset = alphaL + alphaU + numeric + special

which is clearly a union or superset
The standard pattern
You do
for i in range(0, minimums[0]) :
    password += secrets.choice(alphaL)

the recommended way to character wise join a string is
password += &quot;&quot;.join(secrets.choice(ascii_lowercase) for _ in range (0, args.lower)

Cargo cult
You do
for i in range(0, 100) :
    random.shuffle(subset)

which is pointless. It is pointless to shuffle a 100 times. there is no extra quality in randomness compared to a single shuffle.
It is even more pointless to do that before apply secrets.choice(subset). You could safely sort subset before choice().
Final shuffle
You do
for i in range(0, 100):
    print(&quot;Password: &quot;, password)
    password = ''.join(random.sample(password, len(password)))

which I interpret as final shuffle to eliminate the order of the subsets ascii_lowercase, ascii_uppercase, ...
Again you shuffle a 100 times which will not add any value compared to a single shuffle. To be cryptographically safe you should implement a shuffle based on secrets.choice.